| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2011 Google Inc. All rights reserved. | 2 * Copyright (C) 2011 Google Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * * Neither the name of Google Inc. nor the names of its | 10 * * Neither the name of Google Inc. nor the names of its |
| (...skipping 68 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 79 | 79 |
| 80 ShadowRoot* olderShadowRootForBindings() const; | 80 ShadowRoot* olderShadowRootForBindings() const; |
| 81 bool isOpen() const { return type() == ShadowRootType::V0 || type() == Shado
wRootType::Open; } | 81 bool isOpen() const { return type() == ShadowRootType::V0 || type() == Shado
wRootType::Open; } |
| 82 | 82 |
| 83 bool isYoungest() const { return !youngerShadowRoot(); } | 83 bool isYoungest() const { return !youngerShadowRoot(); } |
| 84 bool isOldest() const { return !olderShadowRoot(); } | 84 bool isOldest() const { return !olderShadowRoot(); } |
| 85 | 85 |
| 86 void attach(const AttachContext& = AttachContext()) override; | 86 void attach(const AttachContext& = AttachContext()) override; |
| 87 | 87 |
| 88 InsertionNotificationRequest insertedInto(ContainerNode*) override; | 88 InsertionNotificationRequest insertedInto(ContainerNode*) override; |
| 89 void removedFrom(ContainerNode*) override; | 89 void removedFrom(ContainerNode* insertionPoint, Node* next) override; |
| 90 | 90 |
| 91 void registerScopedHTMLStyleChild(); | 91 void registerScopedHTMLStyleChild(); |
| 92 void unregisterScopedHTMLStyleChild(); | 92 void unregisterScopedHTMLStyleChild(); |
| 93 | 93 |
| 94 bool containsShadowElements() const; | 94 bool containsShadowElements() const; |
| 95 bool containsContentElements() const; | 95 bool containsContentElements() const; |
| 96 bool containsInsertionPoints() const { return containsShadowElements() || co
ntainsContentElements(); } | 96 bool containsInsertionPoints() const { return containsShadowElements() || co
ntainsContentElements(); } |
| 97 bool containsShadowRoots() const; | 97 bool containsShadowRoots() const; |
| 98 | 98 |
| 99 unsigned descendantShadowElementCount() const; | 99 unsigned descendantShadowElementCount() const; |
| (...skipping 69 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 169 return adjustedFocusedElement(); | 169 return adjustedFocusedElement(); |
| 170 } | 170 } |
| 171 | 171 |
| 172 DEFINE_NODE_TYPE_CASTS(ShadowRoot, isShadowRoot()); | 172 DEFINE_NODE_TYPE_CASTS(ShadowRoot, isShadowRoot()); |
| 173 DEFINE_TYPE_CASTS(ShadowRoot, TreeScope, treeScope, treeScope->rootNode().isShad
owRoot(), treeScope.rootNode().isShadowRoot()); | 173 DEFINE_TYPE_CASTS(ShadowRoot, TreeScope, treeScope, treeScope->rootNode().isShad
owRoot(), treeScope.rootNode().isShadowRoot()); |
| 174 DEFINE_TYPE_CASTS(TreeScope, ShadowRoot, shadowRoot, true, true); | 174 DEFINE_TYPE_CASTS(TreeScope, ShadowRoot, shadowRoot, true, true); |
| 175 | 175 |
| 176 } // namespace blink | 176 } // namespace blink |
| 177 | 177 |
| 178 #endif // ShadowRoot_h | 178 #endif // ShadowRoot_h |
| OLD | NEW |