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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
|
/*
* Copyright (C) 2023 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:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS 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 APPLE INC. OR ITS 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.
*/
#pragma once
#include "CachedHTMLCollectionInlines.h"
#include "CollectionIndexCache.h"
namespace WebCore {
template <class Collection, class Iterator>
inline unsigned CollectionIndexCache<Collection, Iterator>::nodeCount(const Collection& collection)
{
if (!m_nodeCountValid) {
if (!hasValidCache())
collection.willValidateIndexCache();
m_nodeCount = computeNodeCountUpdatingListCache(collection);
m_nodeCountValid = true;
}
return m_nodeCount;
}
template <class Collection, class Iterator>
unsigned CollectionIndexCache<Collection, Iterator>::computeNodeCountUpdatingListCache(const Collection& collection)
{
auto current = collection.collectionBegin();
if (!current)
return 0;
unsigned oldCapacity = m_cachedList.capacity();
while (current) {
m_cachedList.append(&*current);
unsigned traversed;
collection.collectionTraverseForward(current, 1, traversed);
ASSERT(traversed == (current ? 1 : 0));
}
m_listValid = true;
if (unsigned capacityDifference = m_cachedList.capacity() - oldCapacity)
reportExtraMemoryAllocatedForCollectionIndexCache(capacityDifference * sizeof(NodeType*));
return m_cachedList.size();
}
template <class Collection, class Iterator>
inline typename CollectionIndexCache<Collection, Iterator>::NodeType* CollectionIndexCache<Collection, Iterator>::traverseBackwardTo(const Collection& collection, unsigned index)
{
ASSERT(m_current);
ASSERT(index < m_currentIndex);
bool firstIsCloser = index < m_currentIndex - index;
if (firstIsCloser || !collection.collectionCanTraverseBackward()) {
m_current = collection.collectionBegin();
m_currentIndex = 0;
if (index)
collection.collectionTraverseForward(m_current, index, m_currentIndex);
ASSERT(m_current);
return &*m_current;
}
collection.collectionTraverseBackward(m_current, m_currentIndex - index);
m_currentIndex = index;
ASSERT(m_current);
return &*m_current;
}
template <class Collection, class Iterator>
inline typename CollectionIndexCache<Collection, Iterator>::NodeType* CollectionIndexCache<Collection, Iterator>::traverseForwardTo(const Collection& collection, unsigned index)
{
ASSERT(m_current);
ASSERT(index > m_currentIndex);
ASSERT(!m_nodeCountValid || index < m_nodeCount);
bool lastIsCloser = m_nodeCountValid && m_nodeCount - index < index - m_currentIndex;
if (lastIsCloser && collection.collectionCanTraverseBackward()) {
ASSERT(hasValidCache());
m_current = collection.collectionLast();
if (index < m_nodeCount - 1)
collection.collectionTraverseBackward(m_current, m_nodeCount - index - 1);
m_currentIndex = index;
ASSERT(m_current);
return &*m_current;
}
if (!hasValidCache())
collection.willValidateIndexCache();
unsigned traversedCount;
collection.collectionTraverseForward(m_current, index - m_currentIndex, traversedCount);
m_currentIndex = m_currentIndex + traversedCount;
if (!m_current) {
ASSERT(m_currentIndex < index);
// Failed to find the index but at least we now know the size.
m_nodeCount = m_currentIndex + 1;
m_nodeCountValid = true;
return nullptr;
}
ASSERT(hasValidCache());
return &*m_current;
}
template <class Collection, class Iterator>
inline typename CollectionIndexCache<Collection, Iterator>::NodeType* CollectionIndexCache<Collection, Iterator>::nodeAt(const Collection& collection, unsigned index)
{
if (m_nodeCountValid && index >= m_nodeCount)
return nullptr;
if (m_listValid)
return m_cachedList[index];
if (m_current) {
if (index > m_currentIndex)
return traverseForwardTo(collection, index);
if (index < m_currentIndex)
return traverseBackwardTo(collection, index);
return &*m_current;
}
bool lastIsCloser = m_nodeCountValid && m_nodeCount - index < index;
if (lastIsCloser && collection.collectionCanTraverseBackward()) {
ASSERT(hasValidCache());
m_current = collection.collectionLast();
if (index < m_nodeCount - 1)
collection.collectionTraverseBackward(m_current, m_nodeCount - index - 1);
m_currentIndex = index;
ASSERT(m_current);
return &*m_current;
}
if (!hasValidCache())
collection.willValidateIndexCache();
m_current = collection.collectionBegin();
m_currentIndex = 0;
bool startIsEnd = !m_current;
if (index && m_current) {
collection.collectionTraverseForward(m_current, index, m_currentIndex);
ASSERT(m_current || m_currentIndex < index);
}
if (!m_current) {
// Failed to find the index but at least we now know the size.
m_nodeCount = startIsEnd ? 0 : m_currentIndex + 1;
m_nodeCountValid = true;
return nullptr;
}
ASSERT(hasValidCache());
return &*m_current;
}
template <class Collection, class Iterator>
void CollectionIndexCache<Collection, Iterator>::invalidate()
{
m_current = { };
m_nodeCountValid = false;
m_listValid = false;
m_cachedList.shrink(0);
}
}
|
