| 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 49 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 60 | 60 |
| 61 Element* host() const { return toElement(parentOrShadowHostNode()); } | 61 Element* host() const { return toElement(parentOrShadowHostNode()); } |
| 62 ElementShadow* owner() const { return host() ? host()->shadow() : 0; } | 62 ElementShadow* owner() const { return host() ? host()->shadow() : 0; } |
| 63 | 63 |
| 64 ShadowRoot* youngerShadowRoot() const { return prev(); } | 64 ShadowRoot* youngerShadowRoot() const { return prev(); } |
| 65 | 65 |
| 66 bool isYoungest() const { return !youngerShadowRoot(); } | 66 bool isYoungest() const { return !youngerShadowRoot(); } |
| 67 bool isOldest() const { return !olderShadowRoot(); } | 67 bool isOldest() const { return !olderShadowRoot(); } |
| 68 bool isOldestAuthorShadowRoot() const; | 68 bool isOldestAuthorShadowRoot() const; |
| 69 | 69 |
| 70 virtual InsertionNotificationRequest insertedInto(ContainerNode*) override; | 70 virtual void insertedInto(ContainerNode*) override; |
| 71 virtual void removedFrom(ContainerNode*) override; | 71 virtual void removedFrom(ContainerNode*) override; |
| 72 | 72 |
| 73 void registerScopedHTMLStyleChild(); | 73 void registerScopedHTMLStyleChild(); |
| 74 void unregisterScopedHTMLStyleChild(); | 74 void unregisterScopedHTMLStyleChild(); |
| 75 | 75 |
| 76 bool containsContentElements() const; | 76 bool containsContentElements() const; |
| 77 bool containsInsertionPoints() const { return containsContentElements(); } | 77 bool containsInsertionPoints() const { return containsContentElements(); } |
| 78 bool containsShadowRoots() const; | 78 bool containsShadowRoots() const; |
| 79 | 79 |
| 80 // For Internals, don't use this. | 80 // For Internals, don't use this. |
| (...skipping 50 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 131 { | 131 { |
| 132 return adjustedFocusedElement(); | 132 return adjustedFocusedElement(); |
| 133 } | 133 } |
| 134 | 134 |
| 135 DEFINE_NODE_TYPE_CASTS(ShadowRoot, isShadowRoot()); | 135 DEFINE_NODE_TYPE_CASTS(ShadowRoot, isShadowRoot()); |
| 136 DEFINE_TYPE_CASTS(ShadowRoot, TreeScope, treeScope, treeScope->rootNode().isShad
owRoot(), treeScope.rootNode().isShadowRoot()); | 136 DEFINE_TYPE_CASTS(ShadowRoot, TreeScope, treeScope, treeScope->rootNode().isShad
owRoot(), treeScope.rootNode().isShadowRoot()); |
| 137 | 137 |
| 138 } // namespace blink | 138 } // namespace blink |
| 139 | 139 |
| 140 #endif // SKY_ENGINE_CORE_DOM_SHADOW_SHADOWROOT_H_ | 140 #endif // SKY_ENGINE_CORE_DOM_SHADOW_SHADOWROOT_H_ |
| OLD | NEW |