OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2014 Google Inc. All rights reserved. | 2 * Copyright (C) 2014 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 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 56 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
67 void setTreeBoundaryCrossing() { m_treeBoundaryCrossing = true; } | 67 void setTreeBoundaryCrossing() { m_treeBoundaryCrossing = true; } |
68 bool treeBoundaryCrossing() const { return m_treeBoundaryCrossing; } | 68 bool treeBoundaryCrossing() const { return m_treeBoundaryCrossing; } |
69 | 69 |
70 void setCustomPseudoInvalid() { m_customPseudoInvalid = true; } | 70 void setCustomPseudoInvalid() { m_customPseudoInvalid = true; } |
71 bool customPseudoInvalid() const { return m_customPseudoInvalid; } | 71 bool customPseudoInvalid() const { return m_customPseudoInvalid; } |
72 | 72 |
73 bool isEmpty() const { return !m_classes && !m_ids && !m_tagNames && !m_attr
ibutes; } | 73 bool isEmpty() const { return !m_classes && !m_ids && !m_tagNames && !m_attr
ibutes; } |
74 | 74 |
75 void trace(Visitor*); | 75 void trace(Visitor*); |
76 | 76 |
| 77 String toDebugString() const; |
| 78 |
77 #ifndef NDEBUG | 79 #ifndef NDEBUG |
78 void show() const; | 80 void show() const; |
79 #endif | 81 #endif |
80 | 82 |
81 private: | 83 private: |
82 DescendantInvalidationSet(); | 84 DescendantInvalidationSet(); |
83 | 85 |
84 WillBeHeapHashSet<AtomicString>& ensureClassSet(); | 86 WillBeHeapHashSet<AtomicString>& ensureClassSet(); |
85 WillBeHeapHashSet<AtomicString>& ensureIdSet(); | 87 WillBeHeapHashSet<AtomicString>& ensureIdSet(); |
86 WillBeHeapHashSet<AtomicString>& ensureTagNameSet(); | 88 WillBeHeapHashSet<AtomicString>& ensureTagNameSet(); |
(...skipping 11 matching lines...) Expand all Loading... |
98 // If true, all descendants which are custom pseudo elements must be invalid
ated. | 100 // If true, all descendants which are custom pseudo elements must be invalid
ated. |
99 unsigned m_customPseudoInvalid : 1; | 101 unsigned m_customPseudoInvalid : 1; |
100 | 102 |
101 // If true, the invalidation must traverse into ShadowRoots with this set. | 103 // If true, the invalidation must traverse into ShadowRoots with this set. |
102 unsigned m_treeBoundaryCrossing : 1; | 104 unsigned m_treeBoundaryCrossing : 1; |
103 }; | 105 }; |
104 | 106 |
105 } // namespace blink | 107 } // namespace blink |
106 | 108 |
107 #endif // DescendantInvalidationSet_h | 109 #endif // DescendantInvalidationSet_h |
OLD | NEW |