1 /*
2 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010 Apple 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 DocumentOrderedMap_h
32 #define DocumentOrderedMap_h
33
34 #include "platform/heap/Handle.h"
35 #include "wtf/Forward.h"
36 #include "wtf/HashMap.h"
37 #include "wtf/text/AtomicString.h"
38 #include "wtf/text/AtomicStringHash.h"
39 #include "wtf/text/StringImpl.h"
40
41 namespace blink {
42
43 class Element;
44 class TreeScope;
45
46 class DocumentOrderedMap : public NoBaseWillBeGarbageCollected<DocumentOrderedMap> {
47 public:
48 static PassOwnPtrWillBeRawPtr<DocumentOrderedMap> create();
49 void add(const AtomicString&, Element*);
50 void remove(const AtomicString&, Element*);
51
52 bool contains(const AtomicString&) const;
53 bool containsMultiple(const AtomicString&) const;
54 // concrete instantiations of the get<>() method template
55 Element* getElementById(const AtomicString&, const TreeScope*) const;
56 const WillBeHeapVector<RawPtrWillBeMember<Element> >& getAllElementsById(const AtomicString&, const TreeScope*) const;
57 Element* getElementByMapName(const AtomicString&, const TreeScope*) const;
58 Element* getElementByLowercasedMapName(const AtomicString&, const TreeScope*) const;
59 Element* getElementByLabelForAttribute(const AtomicString&, const TreeScope*) const;
60
61 void trace(Visitor*);
62
63 private:
64 template<bool keyMatches(const AtomicString&, const Element&)>
65 Element* get(const AtomicString&, const TreeScope*) const;
66
67 class MapEntry : public NoBaseWillBeGarbageCollected<MapEntry> {
68 public:
MapEntry(Element * firstElement)69 explicit MapEntry(Element* firstElement)
70 : element(firstElement)
71 , count(1)
72 {
73 }
74
75 void trace(Visitor*);
76
77 RawPtrWillBeMember<Element> element;
78 unsigned count;
79 WillBeHeapVector<RawPtrWillBeMember<Element> > orderedList;
80 };
81
82 typedef WillBeHeapHashMap<AtomicString, OwnPtrWillBeMember<MapEntry> > Map;
83
84 mutable Map m_map;
85 };
86
contains(const AtomicString & id)87 inline bool DocumentOrderedMap::contains(const AtomicString& id) const
88 {
89 return m_map.contains(id);
90 }
91
containsMultiple(const AtomicString & id)92 inline bool DocumentOrderedMap::containsMultiple(const AtomicString& id) const
93 {
94 Map::const_iterator it = m_map.find(id);
95 return it != m_map.end() && it->value->count > 1;
96 }
97
98 } // namespace blink
99
100 #endif // DocumentOrderedMap_h
101