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
|
/*
Copyright (C) 1998 Lars Knoll (knoll@mpi-hd.mpg.de)
Copyright (C) 2001 Dirk Mueller <mueller@kde.org>
Copyright (C) 2004, 2005, 2006, 2007 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.
This class provides all functionality needed for loading images, style
sheets and html pages from the web. It has a memory cache for these objects.
*/
#ifndef ResourceClientWalker_h
#define ResourceClientWalker_h
#include "core/fetch/ResourceClient.h"
#include "platform/heap/Handle.h"
#include "wtf/Allocator.h"
namespace blink {
// Call this "walker" instead of iterator so people won't expect Qt or STL-style
// iterator interface. Just keep calling next() on this. It's safe from
// deletions of items.
template <typename T>
class ResourceClientWalker {
STACK_ALLOCATED();
public:
explicit ResourceClientWalker(
const HeapHashCountedSet<WeakMember<ResourceClient>>& set)
: m_clientSet(set) {
copyToVector(m_clientSet, m_clientVector);
}
T* next() {
size_t size = m_clientVector.size();
while (m_index < size) {
ResourceClient* next = m_clientVector[m_index++];
DCHECK(next);
if (m_clientSet.contains(next)) {
DCHECK(T::isExpectedType(next));
return static_cast<T*>(next);
}
}
return nullptr;
}
private:
const HeapHashCountedSet<WeakMember<ResourceClient>>& m_clientSet;
HeapVector<Member<ResourceClient>> m_clientVector;
size_t m_index = 0;
};
} // namespace blink
#endif
|
