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 64 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
75 | 75 |
76 private: | 76 private: |
77 ElementShadow(); | 77 ElementShadow(); |
78 | 78 |
79 void removeAllShadowRoots(); | 79 void removeAllShadowRoots(); |
80 bool resolveApplyAuthorStyles() const; | 80 bool resolveApplyAuthorStyles() const; |
81 | 81 |
82 void distribute(); | 82 void distribute(); |
83 void clearDistribution(); | 83 void clearDistribution(); |
84 | 84 |
85 void collectSelectFeatureSetFrom(ShadowRoot*); | 85 void collectSelectFeatureSetFrom(ShadowRoot&); |
86 void distributeNodeChildrenTo(InsertionPoint*, ContainerNode*); | 86 void distributeNodeChildrenTo(InsertionPoint*, ContainerNode*); |
87 | 87 |
88 bool needsSelectFeatureSet() const { return m_needsSelectFeatureSet; } | 88 bool needsSelectFeatureSet() const { return m_needsSelectFeatureSet; } |
89 void setNeedsSelectFeatureSet() { m_needsSelectFeatureSet = true; } | 89 void setNeedsSelectFeatureSet() { m_needsSelectFeatureSet = true; } |
90 | 90 |
91 typedef HashMap<const Node*, DestinationInsertionPoints> NodeToDestinationIn
sertionPoints; | 91 typedef HashMap<const Node*, DestinationInsertionPoints> NodeToDestinationIn
sertionPoints; |
92 NodeToDestinationInsertionPoints m_nodeToInsertionPoints; | 92 NodeToDestinationInsertionPoints m_nodeToInsertionPoints; |
93 | 93 |
94 SelectRuleFeatureSet m_selectFeatures; | 94 SelectRuleFeatureSet m_selectFeatures; |
95 DoublyLinkedList<ShadowRoot> m_shadowRoots; | 95 DoublyLinkedList<ShadowRoot> m_shadowRoots; |
(...skipping 32 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
128 inline void ElementShadow::distributeIfNeeded() | 128 inline void ElementShadow::distributeIfNeeded() |
129 { | 129 { |
130 if (m_needsDistributionRecalc) | 130 if (m_needsDistributionRecalc) |
131 distribute(); | 131 distribute(); |
132 m_needsDistributionRecalc = false; | 132 m_needsDistributionRecalc = false; |
133 } | 133 } |
134 | 134 |
135 } // namespace | 135 } // namespace |
136 | 136 |
137 #endif | 137 #endif |
OLD | NEW |