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 67 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
78 | 78 |
79 void setTreeBoundaryCrossing() { m_treeBoundaryCrossing = true; } | 79 void setTreeBoundaryCrossing() { m_treeBoundaryCrossing = true; } |
80 bool treeBoundaryCrossing() const { return m_treeBoundaryCrossing; } | 80 bool treeBoundaryCrossing() const { return m_treeBoundaryCrossing; } |
81 | 81 |
82 void setInsertionPointCrossing() { m_insertionPointCrossing = true; } | 82 void setInsertionPointCrossing() { m_insertionPointCrossing = true; } |
83 bool insertionPointCrossing() const { return m_insertionPointCrossing; } | 83 bool insertionPointCrossing() const { return m_insertionPointCrossing; } |
84 | 84 |
85 void setCustomPseudoInvalid() { m_customPseudoInvalid = true; } | 85 void setCustomPseudoInvalid() { m_customPseudoInvalid = true; } |
86 bool customPseudoInvalid() const { return m_customPseudoInvalid; } | 86 bool customPseudoInvalid() const { return m_customPseudoInvalid; } |
87 | 87 |
88 bool isEmpty() const { return !m_classes && !m_ids && !m_tagNames && !m_attr
ibutes && !m_customPseudoInvalid; } | 88 bool isEmpty() const { return !m_classes && !m_ids && !m_tagNames && !m_attr
ibutes && !m_customPseudoInvalid && !m_insertionPointCrossing; } |
89 | 89 |
90 void toTracedValue(TracedValue*) const; | 90 void toTracedValue(TracedValue*) const; |
91 | 91 |
92 #ifndef NDEBUG | 92 #ifndef NDEBUG |
93 void show() const; | 93 void show() const; |
94 #endif | 94 #endif |
95 | 95 |
96 const HashSet<AtomicString>& classSetForTesting() const { ASSERT(m_classes);
return *m_classes; } | 96 const HashSet<AtomicString>& classSetForTesting() const { ASSERT(m_classes);
return *m_classes; } |
97 const HashSet<AtomicString>& idSetForTesting() const { ASSERT(m_ids); return
*m_ids; } | 97 const HashSet<AtomicString>& idSetForTesting() const { ASSERT(m_ids); return
*m_ids; } |
98 const HashSet<AtomicString>& tagNameSetForTesting() const { ASSERT(m_tagName
s); return *m_tagNames; } | 98 const HashSet<AtomicString>& tagNameSetForTesting() const { ASSERT(m_tagName
s); return *m_tagNames; } |
(...skipping 91 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
190 InvalidationSetVector descendants; | 190 InvalidationSetVector descendants; |
191 InvalidationSetVector siblings; | 191 InvalidationSetVector siblings; |
192 }; | 192 }; |
193 | 193 |
194 DEFINE_TYPE_CASTS(DescendantInvalidationSet, InvalidationSet, value, value->isDe
scendantInvalidationSet(), value.isDescendantInvalidationSet()); | 194 DEFINE_TYPE_CASTS(DescendantInvalidationSet, InvalidationSet, value, value->isDe
scendantInvalidationSet(), value.isDescendantInvalidationSet()); |
195 DEFINE_TYPE_CASTS(SiblingInvalidationSet, InvalidationSet, value, value->isSibli
ngInvalidationSet(), value.isSiblingInvalidationSet()); | 195 DEFINE_TYPE_CASTS(SiblingInvalidationSet, InvalidationSet, value, value->isSibli
ngInvalidationSet(), value.isSiblingInvalidationSet()); |
196 | 196 |
197 } // namespace blink | 197 } // namespace blink |
198 | 198 |
199 #endif // InvalidationSet_h | 199 #endif // InvalidationSet_h |
OLD | NEW |