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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
|
/*
* Copyright (C) 1999 Lars Knoll (knoll@kde.org)
* (C) 1999 Antti Koivisto (koivisto@kde.org)
* Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights reserved.
* Copyright (C) 2014 Samsung Electronics. All rights reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#ifndef HTMLCollection_h
#define HTMLCollection_h
#include "core/dom/LiveNodeListBase.h"
#include "core/html/CollectionIndexCache.h"
#include "core/html/CollectionType.h"
#include "wtf/Forward.h"
#include "wtf/HashMap.h"
#include "wtf/Vector.h"
namespace WebCore {
class HTMLCollection : public RefCountedWillBeGarbageCollectedFinalized<HTMLCollection>, public ScriptWrappable, public LiveNodeListBase {
WILL_BE_USING_GARBAGE_COLLECTED_MIXIN(HTMLCollection);
public:
enum ItemAfterOverrideType {
OverridesItemAfter,
DoesNotOverrideItemAfter,
};
static PassRefPtrWillBeRawPtr<HTMLCollection> create(ContainerNode& base, CollectionType);
virtual ~HTMLCollection();
virtual void invalidateCache(Document* oldDocument = 0) const OVERRIDE;
void invalidateCacheForAttribute(const QualifiedName*) const;
// DOM API
unsigned length() const { return m_collectionIndexCache.nodeCount(*this); }
Element* item(unsigned offset) const { return m_collectionIndexCache.nodeAt(*this, offset); }
virtual Element* namedItem(const AtomicString& name) const;
bool namedPropertyQuery(const AtomicString&, ExceptionState&);
void namedPropertyEnumerator(Vector<String>& names, ExceptionState&);
// Non-DOM API
void namedItems(const AtomicString& name, WillBeHeapVector<RefPtrWillBeMember<Element> >&) const;
bool isEmpty() const { return m_collectionIndexCache.isEmpty(*this); }
bool hasExactlyOneItem() const { return m_collectionIndexCache.hasExactlyOneNode(*this); }
// CollectionIndexCache API.
bool canTraverseBackward() const { return !overridesItemAfter(); }
Element* traverseToFirstElement() const;
Element* traverseToLastElement() const;
Element* traverseForwardToOffset(unsigned offset, Element& currentElement, unsigned& currentOffset) const;
Element* traverseBackwardToOffset(unsigned offset, Element& currentElement, unsigned& currentOffset) const;
virtual void trace(Visitor*);
protected:
HTMLCollection(ContainerNode& base, CollectionType, ItemAfterOverrideType);
class NamedItemCache FINAL : public NoBaseWillBeGarbageCollected<NamedItemCache> {
public:
static PassOwnPtrWillBeRawPtr<NamedItemCache> create()
{
return adoptPtrWillBeNoop(new NamedItemCache);
}
WillBeHeapVector<RawPtrWillBeMember<Element> >* getElementsById(const AtomicString& id) const { return m_idCache.get(id.impl()); }
WillBeHeapVector<RawPtrWillBeMember<Element> >* getElementsByName(const AtomicString& name) const { return m_nameCache.get(name.impl()); }
void addElementWithId(const AtomicString& id, Element* element) { addElementToMap(m_idCache, id, element); }
void addElementWithName(const AtomicString& name, Element* element) { addElementToMap(m_nameCache, name, element); }
void trace(Visitor* visitor)
{
visitor->trace(m_idCache);
visitor->trace(m_nameCache);
}
private:
NamedItemCache();
typedef WillBeHeapHashMap<StringImpl*, OwnPtrWillBeMember<WillBeHeapVector<RawPtrWillBeMember<Element> > > > StringToElementsMap;
static void addElementToMap(StringToElementsMap& map, const AtomicString& key, Element* element)
{
OwnPtrWillBeMember<WillBeHeapVector<RawPtrWillBeMember<Element> > >& vector = map.add(key.impl(), nullptr).storedValue->value;
if (!vector)
vector = adoptPtrWillBeNoop(new WillBeHeapVector<RawPtrWillBeMember<Element> >);
vector->append(element);
}
StringToElementsMap m_idCache;
StringToElementsMap m_nameCache;
};
bool overridesItemAfter() const { return m_overridesItemAfter; }
virtual Element* virtualItemAfter(Element*) const;
bool shouldOnlyIncludeDirectChildren() const { return m_shouldOnlyIncludeDirectChildren; }
virtual void supportedPropertyNames(Vector<String>& names);
virtual void updateIdNameCache() const;
bool hasValidIdNameCache() const { return m_namedItemCache; }
void setNamedItemCache(PassOwnPtrWillBeRawPtr<NamedItemCache> cache) const
{
ASSERT(!m_namedItemCache);
document().registerNodeListWithIdNameCache(this);
m_namedItemCache = cache;
}
NamedItemCache& namedItemCache() const
{
ASSERT(m_namedItemCache);
return *m_namedItemCache;
}
private:
void invalidateIdNameCacheMaps(Document* oldDocument = 0) const
{
if (!hasValidIdNameCache())
return;
// Make sure we decrement the NodeListWithIdNameCache count from
// the old document instead of the new one in the case the collection
// is moved to a new document.
unregisterIdNameCacheFromDocument(oldDocument ? *oldDocument : document());
m_namedItemCache.clear();
}
void unregisterIdNameCacheFromDocument(Document& document) const
{
ASSERT(hasValidIdNameCache());
document.unregisterNodeListWithIdNameCache(this);
}
const unsigned m_overridesItemAfter : 1;
const unsigned m_shouldOnlyIncludeDirectChildren : 1;
mutable OwnPtrWillBeMember<NamedItemCache> m_namedItemCache;
mutable CollectionIndexCache<HTMLCollection, Element> m_collectionIndexCache;
};
DEFINE_TYPE_CASTS(HTMLCollection, LiveNodeListBase, collection, isHTMLCollectionType(collection->type()), isHTMLCollectionType(collection.type()));
inline void HTMLCollection::invalidateCacheForAttribute(const QualifiedName* attrName) const
{
if (!attrName || shouldInvalidateTypeOnAttributeChange(invalidationType(), *attrName))
invalidateCache();
else if (*attrName == HTMLNames::idAttr || *attrName == HTMLNames::nameAttr)
invalidateIdNameCacheMaps();
}
} // namespace
#endif
|
