| 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 65 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
| 76     ShadowRoot* youngerShadowRoot() const { return prev(); } | 76     ShadowRoot* youngerShadowRoot() const { return prev(); } | 
| 77     ShadowRoot* olderShadowRoot() const { return next(); } | 77     ShadowRoot* olderShadowRoot() const { return next(); } | 
| 78 | 78 | 
| 79     ShadowRoot* bindingsOlderShadowRoot() const; | 79     ShadowRoot* bindingsOlderShadowRoot() const; | 
| 80     bool shouldExposeToBindings() const { return type() == AuthorShadowRoot; } | 80     bool shouldExposeToBindings() const { return type() == AuthorShadowRoot; } | 
| 81 | 81 | 
| 82     bool isYoungest() const { return !youngerShadowRoot(); } | 82     bool isYoungest() const { return !youngerShadowRoot(); } | 
| 83     bool isOldest() const { return !olderShadowRoot(); } | 83     bool isOldest() const { return !olderShadowRoot(); } | 
| 84     bool isOldestAuthorShadowRoot() const; | 84     bool isOldestAuthorShadowRoot() const; | 
| 85 | 85 | 
| 86     virtual void attach(const AttachContext& = AttachContext()) OVERRIDE; | 86     virtual void createRenderTree(const AttachContext& = AttachContext()) OVERRI
     DE; | 
| 87 | 87 | 
| 88     virtual InsertionNotificationRequest insertedInto(ContainerNode*) OVERRIDE; | 88     virtual InsertionNotificationRequest insertedInto(ContainerNode*) OVERRIDE; | 
| 89     virtual void removedFrom(ContainerNode*) OVERRIDE; | 89     virtual void removedFrom(ContainerNode*) OVERRIDE; | 
| 90 | 90 | 
| 91     virtual void registerScopedHTMLStyleChild() OVERRIDE; | 91     virtual void registerScopedHTMLStyleChild() OVERRIDE; | 
| 92     virtual void unregisterScopedHTMLStyleChild() OVERRIDE; | 92     virtual void unregisterScopedHTMLStyleChild() OVERRIDE; | 
| 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(); } | 
| (...skipping 83 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
| 180 | 180 | 
| 181 inline ShadowRoot& toShadowRoot(TreeScope& treeScope) | 181 inline ShadowRoot& toShadowRoot(TreeScope& treeScope) | 
| 182 { | 182 { | 
| 183     ASSERT_WITH_SECURITY_IMPLICATION(treeScope.rootNode() && treeScope.rootNode(
     )->isShadowRoot()); | 183     ASSERT_WITH_SECURITY_IMPLICATION(treeScope.rootNode() && treeScope.rootNode(
     )->isShadowRoot()); | 
| 184     return static_cast<ShadowRoot&>(treeScope); | 184     return static_cast<ShadowRoot&>(treeScope); | 
| 185 } | 185 } | 
| 186 | 186 | 
| 187 } // namespace | 187 } // namespace | 
| 188 | 188 | 
| 189 #endif | 189 #endif | 
| OLD | NEW | 
|---|