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
|
/*
* Copyright (C) 2012,2013 Google Inc. All rights reserved.
* Copyright (C) 2014 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 CollectionItemsCache_h
#define CollectionItemsCache_h
#include "core/dom/CollectionIndexCache.h"
#include "wtf/Vector.h"
namespace blink {
template <typename Collection, typename NodeType>
class CollectionItemsCache : public CollectionIndexCache<Collection, NodeType> {
DISALLOW_NEW();
typedef CollectionIndexCache<Collection, NodeType> Base;
public:
CollectionItemsCache();
~CollectionItemsCache();
DEFINE_INLINE_VIRTUAL_TRACE() {
visitor->trace(m_cachedList);
Base::trace(visitor);
}
unsigned nodeCount(const Collection&);
NodeType* nodeAt(const Collection&, unsigned index);
void invalidate();
private:
bool m_listValid;
HeapVector<Member<NodeType>> m_cachedList;
};
template <typename Collection, typename NodeType>
CollectionItemsCache<Collection, NodeType>::CollectionItemsCache()
: m_listValid(false) {}
template <typename Collection, typename NodeType>
CollectionItemsCache<Collection, NodeType>::~CollectionItemsCache() {}
template <typename Collection, typename NodeType>
void CollectionItemsCache<Collection, NodeType>::invalidate() {
Base::invalidate();
if (m_listValid) {
m_cachedList.shrink(0);
m_listValid = false;
}
}
template <class Collection, class NodeType>
unsigned CollectionItemsCache<Collection, NodeType>::nodeCount(
const Collection& collection) {
if (this->isCachedNodeCountValid())
return this->cachedNodeCount();
NodeType* currentNode = collection.traverseToFirst();
unsigned currentIndex = 0;
while (currentNode) {
m_cachedList.push_back(currentNode);
currentNode = collection.traverseForwardToOffset(
currentIndex + 1, *currentNode, currentIndex);
}
this->setCachedNodeCount(m_cachedList.size());
m_listValid = true;
return this->cachedNodeCount();
}
template <typename Collection, typename NodeType>
inline NodeType* CollectionItemsCache<Collection, NodeType>::nodeAt(
const Collection& collection,
unsigned index) {
if (m_listValid) {
DCHECK(this->isCachedNodeCountValid());
return index < this->cachedNodeCount() ? m_cachedList[index] : nullptr;
}
return Base::nodeAt(collection, index);
}
} // namespace blink
#endif // CollectionItemsCache_h
|
