OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2012 Google Inc. All rights reserved. | 2 * Copyright (C) 2012 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 39 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
50 ShadowRoot* oldestShadowRoot() const { return m_shadowRoots.tail(); } | 50 ShadowRoot* oldestShadowRoot() const { return m_shadowRoots.tail(); } |
51 ElementShadow* containingShadow() const; | 51 ElementShadow* containingShadow() const; |
52 | 52 |
53 ShadowRoot& addShadowRoot(Element& shadowHost, ShadowRoot::ShadowRootType); | 53 ShadowRoot& addShadowRoot(Element& shadowHost, ShadowRoot::ShadowRootType); |
54 | 54 |
55 bool hasSameStyles(const ElementShadow*) const; | 55 bool hasSameStyles(const ElementShadow*) const; |
56 | 56 |
57 void attach(const Node::AttachContext&); | 57 void attach(const Node::AttachContext&); |
58 void detach(const Node::AttachContext&); | 58 void detach(const Node::AttachContext&); |
59 | 59 |
60 void didAffectSelector(AffectedSelectorMask); | 60 void distributedNodePseudoStateChanged(CSSSelector::PseudoType); |
61 void willAffectSelector(); | 61 void willAffectSelector(); |
62 const SelectRuleFeatureSet& ensureSelectFeatureSet(); | 62 const SelectRuleFeatureSet& ensureSelectFeatureSet(); |
63 | 63 |
64 void distributeIfNeeded(); | 64 void distributeIfNeeded(); |
65 void setNeedsDistributionRecalc(); | 65 void setNeedsDistributionRecalc(); |
66 | 66 |
67 const InsertionPoint* finalDestinationInsertionPointFor(const Node*) const; | 67 const InsertionPoint* finalDestinationInsertionPointFor(const Node*) const; |
68 const DestinationInsertionPoints* destinationInsertionPointsFor(const Node*)
const; | 68 const DestinationInsertionPoints* destinationInsertionPointsFor(const Node*)
const; |
69 | 69 |
70 void didDistributeNode(const Node*, InsertionPoint*); | 70 void didDistributeNode(const Node*, InsertionPoint*); |
(...skipping 56 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
127 inline void ElementShadow::distributeIfNeeded() | 127 inline void ElementShadow::distributeIfNeeded() |
128 { | 128 { |
129 if (m_needsDistributionRecalc) | 129 if (m_needsDistributionRecalc) |
130 distribute(); | 130 distribute(); |
131 m_needsDistributionRecalc = false; | 131 m_needsDistributionRecalc = false; |
132 } | 132 } |
133 | 133 |
134 } // namespace | 134 } // namespace |
135 | 135 |
136 #endif | 136 #endif |
OLD | NEW |