OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010 Apple Inc. All rights
reserved. | 2 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010 Apple 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 15 matching lines...) Expand all Loading... |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 */ | 29 */ |
30 | 30 |
31 #ifndef DocumentOrderedMap_h | 31 #ifndef DocumentOrderedMap_h |
32 #define DocumentOrderedMap_h | 32 #define DocumentOrderedMap_h |
33 | 33 |
34 #include "wtf/HashCountedSet.h" | 34 #include "wtf/HashCountedSet.h" |
35 #include "wtf/HashMap.h" | 35 #include "wtf/HashMap.h" |
36 #include "wtf/text/AtomicStringImpl.h" | 36 #include "wtf/text/StringImpl.h" |
37 | 37 |
38 namespace WebCore { | 38 namespace WebCore { |
39 | 39 |
40 class Element; | 40 class Element; |
41 class TreeScope; | 41 class TreeScope; |
42 | 42 |
43 class DocumentOrderedMap { | 43 class DocumentOrderedMap { |
44 public: | 44 public: |
45 void add(AtomicStringImpl*, Element*); | 45 void add(StringImpl*, Element*); |
46 void remove(AtomicStringImpl*, Element*); | 46 void remove(StringImpl*, Element*); |
47 void clear(); | 47 void clear(); |
48 | 48 |
49 bool contains(AtomicStringImpl*) const; | 49 bool contains(StringImpl*) const; |
50 bool containsMultiple(AtomicStringImpl*) const; | 50 bool containsMultiple(StringImpl*) const; |
51 // concrete instantiations of the get<>() method template | 51 // concrete instantiations of the get<>() method template |
52 Element* getElementById(AtomicStringImpl*, const TreeScope*) const; | 52 Element* getElementById(StringImpl*, const TreeScope*) const; |
53 Element* getElementByMapName(AtomicStringImpl*, const TreeScope*) const; | 53 Element* getElementByMapName(StringImpl*, const TreeScope*) const; |
54 Element* getElementByLowercasedMapName(AtomicStringImpl*, const TreeScope*)
const; | 54 Element* getElementByLowercasedMapName(StringImpl*, const TreeScope*) const; |
55 Element* getElementByLabelForAttribute(AtomicStringImpl*, const TreeScope*)
const; | 55 Element* getElementByLabelForAttribute(StringImpl*, const TreeScope*) const; |
56 | 56 |
57 void checkConsistency() const; | 57 void checkConsistency() const; |
58 | 58 |
59 private: | 59 private: |
60 template<bool keyMatches(AtomicStringImpl*, Element*)> Element* get(AtomicSt
ringImpl*, const TreeScope*) const; | 60 template<bool keyMatches(StringImpl*, Element*)> Element* get(StringImpl*, c
onst TreeScope*) const; |
61 | 61 |
62 typedef HashMap<AtomicStringImpl*, Element*> Map; | 62 typedef HashMap<StringImpl*, Element*> Map; |
63 | 63 |
64 // We maintain the invariant that m_duplicateCounts is the count of all elem
ents with a given key | 64 // We maintain the invariant that m_duplicateCounts is the count of all elem
ents with a given key |
65 // excluding the one referenced in m_map, if any. This means it one less tha
n the total count | 65 // excluding the one referenced in m_map, if any. This means it one less tha
n the total count |
66 // when the first node with a given key is cached, otherwise the same as the
total count. | 66 // when the first node with a given key is cached, otherwise the same as the
total count. |
67 mutable Map m_map; | 67 mutable Map m_map; |
68 mutable HashCountedSet<AtomicStringImpl*> m_duplicateCounts; | 68 mutable HashCountedSet<StringImpl*> m_duplicateCounts; |
69 }; | 69 }; |
70 | 70 |
71 inline bool DocumentOrderedMap::contains(AtomicStringImpl* id) const | 71 inline bool DocumentOrderedMap::contains(StringImpl* id) const |
72 { | 72 { |
73 return m_map.contains(id) || m_duplicateCounts.contains(id); | 73 return m_map.contains(id) || m_duplicateCounts.contains(id); |
74 } | 74 } |
75 | 75 |
76 inline bool DocumentOrderedMap::containsMultiple(AtomicStringImpl* id) const | 76 inline bool DocumentOrderedMap::containsMultiple(StringImpl* id) const |
77 { | 77 { |
78 return m_duplicateCounts.contains(id); | 78 return m_duplicateCounts.contains(id); |
79 } | 79 } |
80 | 80 |
81 } // namespace WebCore | 81 } // namespace WebCore |
82 | 82 |
83 #endif // DocumentOrderedMap_h | 83 #endif // DocumentOrderedMap_h |
OLD | NEW |