| 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 77 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 88 | 88 |
| 89 private: | 89 private: |
| 90 DescendantInvalidationSet(); | 90 DescendantInvalidationSet(); |
| 91 | 91 |
| 92 WillBeHeapHashSet<AtomicString>& ensureClassSet(); | 92 WillBeHeapHashSet<AtomicString>& ensureClassSet(); |
| 93 WillBeHeapHashSet<AtomicString>& ensureIdSet(); | 93 WillBeHeapHashSet<AtomicString>& ensureIdSet(); |
| 94 WillBeHeapHashSet<AtomicString>& ensureTagNameSet(); | 94 WillBeHeapHashSet<AtomicString>& ensureTagNameSet(); |
| 95 WillBeHeapHashSet<AtomicString>& ensureAttributeSet(); | 95 WillBeHeapHashSet<AtomicString>& ensureAttributeSet(); |
| 96 | 96 |
| 97 // FIXME: optimize this if it becomes a memory issue. | 97 // FIXME: optimize this if it becomes a memory issue. |
| 98 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString> > m_classes; | 98 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString>> m_classes; |
| 99 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString> > m_ids; | 99 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString>> m_ids; |
| 100 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString> > m_tagNames; | 100 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString>> m_tagNames; |
| 101 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString> > m_attributes; | 101 OwnPtrWillBeMember<WillBeHeapHashSet<AtomicString>> m_attributes; |
| 102 | 102 |
| 103 // If true, all descendants might be invalidated, so a full subtree recalc i
s required. | 103 // If true, all descendants might be invalidated, so a full subtree recalc i
s required. |
| 104 unsigned m_allDescendantsMightBeInvalid : 1; | 104 unsigned m_allDescendantsMightBeInvalid : 1; |
| 105 | 105 |
| 106 // If true, all descendants which are custom pseudo elements must be invalid
ated. | 106 // If true, all descendants which are custom pseudo elements must be invalid
ated. |
| 107 unsigned m_customPseudoInvalid : 1; | 107 unsigned m_customPseudoInvalid : 1; |
| 108 | 108 |
| 109 // If true, the invalidation must traverse into ShadowRoots with this set. | 109 // If true, the invalidation must traverse into ShadowRoots with this set. |
| 110 unsigned m_treeBoundaryCrossing : 1; | 110 unsigned m_treeBoundaryCrossing : 1; |
| 111 | 111 |
| 112 // If true, insertion point descendants must be invalidated. | 112 // If true, insertion point descendants must be invalidated. |
| 113 unsigned m_insertionPointCrossing : 1; | 113 unsigned m_insertionPointCrossing : 1; |
| 114 }; | 114 }; |
| 115 | 115 |
| 116 } // namespace blink | 116 } // namespace blink |
| 117 | 117 |
| 118 #endif // DescendantInvalidationSet_h | 118 #endif // DescendantInvalidationSet_h |
| OLD | NEW |