OLD | NEW |
1 /* | 1 /* |
2 Copyright (C) 1998 Lars Knoll (knoll@mpi-hd.mpg.de) | 2 Copyright (C) 1998 Lars Knoll (knoll@mpi-hd.mpg.de) |
3 Copyright (C) 2001 Dirk Mueller <mueller@kde.org> | 3 Copyright (C) 2001 Dirk Mueller <mueller@kde.org> |
4 Copyright (C) 2004, 2005, 2006, 2007 Apple Inc. All rights reserved. | 4 Copyright (C) 2004, 2005, 2006, 2007 Apple Inc. All rights reserved. |
5 | 5 |
6 This library is free software; you can redistribute it and/or | 6 This library is free software; you can redistribute it and/or |
7 modify it under the terms of the GNU Library General Public | 7 modify it under the terms of the GNU Library General Public |
8 License as published by the Free Software Foundation; either | 8 License as published by the Free Software Foundation; either |
9 version 2 of the License, or (at your option) any later version. | 9 version 2 of the License, or (at your option) any later version. |
10 | 10 |
11 This library is distributed in the hope that it will be useful, | 11 This library is distributed in the hope that it will be useful, |
12 but WITHOUT ANY WARRANTY; without even the implied warranty of | 12 but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | 13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
14 Library General Public License for more details. | 14 Library General Public License for more details. |
15 | 15 |
16 You should have received a copy of the GNU Library General Public License | 16 You should have received a copy of the GNU Library General Public License |
17 along with this library; see the file COPYING.LIB. If not, write to | 17 along with this library; see the file COPYING.LIB. If not, write to |
18 the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, | 18 the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
19 Boston, MA 02110-1301, USA. | 19 Boston, MA 02110-1301, USA. |
20 | 20 |
21 This class provides all functionality needed for loading images, style sheet
s and html | 21 This class provides all functionality needed for loading images, style sheet
s and html |
22 pages from the web. It has a memory cache for these objects. | 22 pages from the web. It has a memory cache for these objects. |
23 */ | 23 */ |
24 | 24 |
25 #ifndef ResourceClientWalker_h | 25 #ifndef ResourceClientOrObserverWalker_h |
26 #define ResourceClientWalker_h | 26 #define ResourceClientOrObserverWalker_h |
27 | 27 |
28 #include "core/fetch/ResourceClient.h" | 28 #include "core/fetch/ResourceClient.h" |
29 #include "wtf/Allocator.h" | 29 #include "wtf/Allocator.h" |
30 #include "wtf/HashCountedSet.h" | 30 #include "wtf/HashCountedSet.h" |
31 #include "wtf/Vector.h" | 31 #include "wtf/Vector.h" |
32 | 32 |
33 namespace blink { | 33 namespace blink { |
34 | 34 |
35 // Call this "walker" instead of iterator so people won't expect Qt or STL-style
iterator interface. | 35 // Call this "walker" instead of iterator so people won't expect Qt or STL-style
iterator interface. |
36 // Just keep calling next() on this. It's safe from deletions of items. | 36 // Just keep calling next() on this. It's safe from deletions of items. |
37 template<typename T> class ResourceClientWalker { | 37 // ClientOrObserver is either ResourceClient or ImageResourceObserver, so that |
| 38 // this walker can be used both for ResourceClient and ImageResourceObserver. |
| 39 template<typename ClientOrObserver, typename T> |
| 40 class ResourceClientOrObserverWalker { |
38 STACK_ALLOCATED(); | 41 STACK_ALLOCATED(); |
39 public: | 42 public: |
40 ResourceClientWalker(const HashCountedSet<ResourceClient*>& set) | 43 explicit ResourceClientOrObserverWalker(const HashCountedSet<ClientOrObserve
r*>& set) |
41 : m_clientSet(set), m_clientVector(set.size()), m_index(0) | 44 : m_clientSet(set), m_clientVector(set.size()), m_index(0) |
42 { | 45 { |
43 size_t clientIndex = 0; | 46 size_t clientIndex = 0; |
44 for (const auto& resourceClient : set) | 47 for (const auto& resourceClient : set) |
45 m_clientVector[clientIndex++] = resourceClient.key; | 48 m_clientVector[clientIndex++] = resourceClient.key; |
46 } | 49 } |
47 | 50 |
48 T* next() | 51 T* next() |
49 { | 52 { |
50 size_t size = m_clientVector.size(); | 53 size_t size = m_clientVector.size(); |
51 while (m_index < size) { | 54 while (m_index < size) { |
52 ResourceClient* next = m_clientVector[m_index++]; | 55 ClientOrObserver* next = m_clientVector[m_index++]; |
53 if (m_clientSet.contains(next)) { | 56 if (m_clientSet.contains(next)) { |
54 ASSERT(T::isExpectedType(next)); | 57 ASSERT(T::isExpectedType(next)); |
55 return static_cast<T*>(next); | 58 return static_cast<T*>(next); |
56 } | 59 } |
57 } | 60 } |
58 | 61 |
59 return 0; | 62 return 0; |
60 } | 63 } |
61 private: | 64 private: |
62 const HashCountedSet<ResourceClient*>& m_clientSet; | 65 const HashCountedSet<ClientOrObserver*>& m_clientSet; |
63 Vector<ResourceClient*> m_clientVector; | 66 Vector<ClientOrObserver*> m_clientVector; |
64 size_t m_index; | 67 size_t m_index; |
65 }; | 68 }; |
66 | 69 |
| 70 template<typename T> |
| 71 struct ResourceClientWalker : public ResourceClientOrObserverWalker<ResourceClie
nt, T> { |
| 72 public: |
| 73 explicit ResourceClientWalker(const HashCountedSet<ResourceClient*>& set) |
| 74 : ResourceClientOrObserverWalker<ResourceClient, T>(set) { } |
| 75 }; |
| 76 |
67 } // namespace blink | 77 } // namespace blink |
68 | 78 |
69 #endif | 79 #endif |
OLD | NEW |