| 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 61 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 72 InsertionPoint* findInsertionPointFor(const Node*) const; | 72 InsertionPoint* findInsertionPointFor(const Node*) const; |
| 73 | 73 |
| 74 private: | 74 private: |
| 75 ElementShadow(); | 75 ElementShadow(); |
| 76 | 76 |
| 77 void removeAllShadowRoots(); | 77 void removeAllShadowRoots(); |
| 78 bool resolveApplyAuthorStyles() const; | 78 bool resolveApplyAuthorStyles() const; |
| 79 | 79 |
| 80 void distribute(); | 80 void distribute(); |
| 81 void clearDistribution(); | 81 void clearDistribution(); |
| 82 void populate(Node*, Vector<Node*>&); | 82 void populate(Node*, Vector<Node*, 32>&); |
| 83 void collectSelectFeatureSetFrom(ShadowRoot*); | 83 void collectSelectFeatureSetFrom(ShadowRoot*); |
| 84 void distributeSelectionsTo(InsertionPoint*, const Vector<Node*>& pool, Vect
or<bool>& distributed); | 84 void distributeSelectionsTo(InsertionPoint*, const Vector<Node*, 32>& pool,
Vector<bool>& distributed); |
| 85 void distributeNodeChildrenTo(InsertionPoint*, ContainerNode*); | 85 void distributeNodeChildrenTo(InsertionPoint*, ContainerNode*); |
| 86 | 86 |
| 87 bool needsSelectFeatureSet() const { return m_needsSelectFeatureSet; } | 87 bool needsSelectFeatureSet() const { return m_needsSelectFeatureSet; } |
| 88 void setNeedsSelectFeatureSet() { m_needsSelectFeatureSet = true; } | 88 void setNeedsSelectFeatureSet() { m_needsSelectFeatureSet = true; } |
| 89 | 89 |
| 90 HashMap<const Node*, RefPtr<InsertionPoint> > m_nodeToInsertionPoint; | 90 HashMap<const Node*, RefPtr<InsertionPoint> > m_nodeToInsertionPoint; |
| 91 SelectRuleFeatureSet m_selectFeatures; | 91 SelectRuleFeatureSet m_selectFeatures; |
| 92 DoublyLinkedList<ShadowRoot> m_shadowRoots; | 92 DoublyLinkedList<ShadowRoot> m_shadowRoots; |
| 93 bool m_needsDistributionRecalc; | 93 bool m_needsDistributionRecalc; |
| 94 bool m_applyAuthorStyles; | 94 bool m_applyAuthorStyles; |
| (...skipping 35 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 130 return 0; | 130 return 0; |
| 131 if (Node* parent = node->parentNode()) | 131 if (Node* parent = node->parentNode()) |
| 132 if (parent->isElementNode()) | 132 if (parent->isElementNode()) |
| 133 return toElement(parent)->shadow(); | 133 return toElement(parent)->shadow(); |
| 134 return 0; | 134 return 0; |
| 135 } | 135 } |
| 136 | 136 |
| 137 } // namespace | 137 } // namespace |
| 138 | 138 |
| 139 #endif | 139 #endif |
| OLD | NEW |