1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
/*
* Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010 Apple Inc. All rights
* reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef DocumentOrderedMap_h
#define DocumentOrderedMap_h
#include "platform/heap/Handle.h"
#include "wtf/Allocator.h"
#include "wtf/Forward.h"
#include "wtf/HashMap.h"
#include "wtf/text/AtomicString.h"
#include "wtf/text/AtomicStringHash.h"
#include "wtf/text/StringImpl.h"
namespace blink {
class Element;
class HTMLSlotElement;
class TreeScope;
class DocumentOrderedMap : public GarbageCollected<DocumentOrderedMap> {
public:
static DocumentOrderedMap* create();
void add(const AtomicString&, Element*);
void remove(const AtomicString&, Element*);
bool contains(const AtomicString&) const;
bool containsMultiple(const AtomicString&) const;
// concrete instantiations of the get<>() method template
Element* getElementById(const AtomicString&, const TreeScope*) const;
const HeapVector<Member<Element>>& getAllElementsById(const AtomicString&,
const TreeScope*) const;
Element* getElementByMapName(const AtomicString&, const TreeScope*) const;
HTMLSlotElement* getSlotByName(const AtomicString&, const TreeScope*) const;
Element* getElementByLowercasedMapName(const AtomicString&,
const TreeScope*) const;
DECLARE_TRACE();
#if DCHECK_IS_ON()
// While removing a ContainerNode, ID lookups won't be precise should the tree
// have elements with duplicate IDs contained in the element being removed.
// Rare trees, but ID lookups may legitimately fail across such removals;
// this scope object informs DocumentOrderedMaps about the transitory
// state of the underlying tree.
class RemoveScope {
STACK_ALLOCATED();
public:
RemoveScope();
~RemoveScope();
};
#else
class RemoveScope {
STACK_ALLOCATED();
public:
RemoveScope() {}
~RemoveScope() {}
};
#endif
private:
DocumentOrderedMap();
template <bool keyMatches(const AtomicString&, const Element&)>
Element* get(const AtomicString&, const TreeScope*) const;
class MapEntry : public GarbageCollected<MapEntry> {
public:
explicit MapEntry(Element* firstElement)
: element(firstElement), count(1) {}
DECLARE_TRACE();
Member<Element> element;
unsigned count;
HeapVector<Member<Element>> orderedList;
};
using Map = HeapHashMap<AtomicString, Member<MapEntry>>;
mutable Map m_map;
};
inline bool DocumentOrderedMap::contains(const AtomicString& id) const {
return m_map.contains(id);
}
inline bool DocumentOrderedMap::containsMultiple(const AtomicString& id) const {
Map::const_iterator it = m_map.find(id);
return it != m_map.end() && it->value->count > 1;
}
} // namespace blink
#endif // DocumentOrderedMap_h
|
