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
|
/*
* 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.
*
* 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 "Node.h"
#include "CollectionType.h"
#include <wtf/Forward.h>
#include <wtf/HashMap.h>
#include <wtf/PassOwnPtr.h>
#include <wtf/Vector.h>
namespace WebCore {
class Document;
class Element;
class NodeList;
class HTMLCollection {
public:
static PassOwnPtr<HTMLCollection> create(Node* base, CollectionType);
virtual ~HTMLCollection();
void ref() { m_base->ref(); }
void deref() { m_base->deref(); }
unsigned length() const;
virtual Node* item(unsigned index) const;
virtual Node* nextItem() const;
virtual Node* namedItem(const AtomicString& name) const;
Node* firstItem() const;
bool hasNamedItem(const AtomicString& name) const;
void namedItems(const AtomicString& name, Vector<RefPtr<Node> >&) const;
PassRefPtr<NodeList> tags(const String&);
Node* base() const { return m_base; }
CollectionType type() const { return static_cast<CollectionType>(m_type); }
protected:
HTMLCollection(Node* base, CollectionType);
void invalidateCacheIfNeeded() const;
virtual void updateNameCache() const;
virtual Element* itemAfter(Element*) const;
typedef HashMap<AtomicStringImpl*, OwnPtr<Vector<Element*> > > NodeCacheMap;
static void append(NodeCacheMap&, const AtomicString&, Element*);
mutable struct {
NodeCacheMap idCache;
NodeCacheMap nameCache;
uint64_t version;
Element* current;
unsigned position;
unsigned length;
int elementsArrayPosition;
bool hasLength;
bool hasNameCache;
void clear()
{
idCache.clear();
nameCache.clear();
version = 0;
current = 0;
position = 0;
length = 0;
elementsArrayPosition = 0;
hasLength = false;
hasNameCache = false;
}
} m_cache;
private:
static bool shouldIncludeChildren(CollectionType);
bool checkForNameMatch(Element*, bool checkName, const AtomicString& name) const;
virtual unsigned calcLength() const;
bool isAcceptableElement(Element*) const;
bool m_includeChildren : 1;
unsigned m_type : 5; // CollectionType
Node* m_base;
};
} // namespace
#endif
|
