OLD | NEW |
| (Empty) |
1 /* | |
2 * Copyright (C) 2014 Google Inc. All rights reserved. | |
3 * | |
4 * Redistribution and use in source and binary forms, with or without | |
5 * modification, are permitted provided that the following conditions are | |
6 * met: | |
7 * | |
8 * * Redistributions of source code must retain the above copyright | |
9 * notice, this list of conditions and the following disclaimer. | |
10 * * Redistributions in binary form must reproduce the above | |
11 * copyright notice, this list of conditions and the following disclaimer | |
12 * in the documentation and/or other materials provided with the | |
13 * distribution. | |
14 * * Neither the name of Google Inc. nor the names of its | |
15 * contributors may be used to endorse or promote products derived from | |
16 * this software without specific prior written permission. | |
17 * | |
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
29 */ | |
30 | |
31 #ifndef DescendantInvalidationSet_h | |
32 #define DescendantInvalidationSet_h | |
33 | |
34 #include "wtf/Forward.h" | |
35 #include "wtf/HashSet.h" | |
36 #include "wtf/RefCounted.h" | |
37 #include "wtf/RefPtr.h" | |
38 #include "wtf/text/AtomicStringHash.h" | |
39 #include "wtf/text/StringHash.h" | |
40 | |
41 namespace WebCore { | |
42 | |
43 class Element; | |
44 | |
45 // Tracks data to determine which elements of a DOM subtree need to have style | |
46 // recalculated. | |
47 class DescendantInvalidationSet FINAL : public RefCounted<DescendantInvalidation
Set> { | |
48 public: | |
49 static PassRefPtr<DescendantInvalidationSet> create() | |
50 { | |
51 return adoptRef(new DescendantInvalidationSet); | |
52 } | |
53 | |
54 void combine(const DescendantInvalidationSet& other); | |
55 | |
56 void addClass(const AtomicString& className); | |
57 void addId(const AtomicString& id); | |
58 void addTagName(const AtomicString& tagName); | |
59 void addAttribute(const AtomicString& attributeLocalName); | |
60 | |
61 // Appends the classes in this DescendantInvalidationSet to the vector. | |
62 void getClasses(Vector<AtomicString>& classes) const; | |
63 | |
64 // Appends the attributes in this DescendantInvalidationSet to the vector. | |
65 void getAttributes(Vector<AtomicString>& attributes) const; | |
66 | |
67 void setWholeSubtreeInvalid(); | |
68 bool wholeSubtreeInvalid() const { return m_allDescendantsMightBeInvalid; } | |
69 private: | |
70 DescendantInvalidationSet(); | |
71 | |
72 HashSet<AtomicString>& ensureClassSet(); | |
73 HashSet<AtomicString>& ensureIdSet(); | |
74 HashSet<AtomicString>& ensureTagNameSet(); | |
75 HashSet<AtomicString>& ensureAttributeSet(); | |
76 | |
77 // If true, all descendants might be invalidated, so a full subtree recalc i
s required. | |
78 bool m_allDescendantsMightBeInvalid; | |
79 | |
80 // FIXME: optimize this if it becomes a memory issue. | |
81 OwnPtr<HashSet<AtomicString> > m_classes; | |
82 OwnPtr<HashSet<AtomicString> > m_ids; | |
83 OwnPtr<HashSet<AtomicString> > m_tagNames; | |
84 OwnPtr<HashSet<AtomicString> > m_attributes; | |
85 }; | |
86 | |
87 } // namespace WebCore | |
88 | |
89 #endif // DescendantInvalidationSet_h | |
OLD | NEW |