OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2005, 2006, 2007, 2008, 2011 Apple Inc. All rights reserved. | 2 * Copyright (C) 2005, 2006, 2007, 2008, 2011 Apple Inc. All rights reserved. |
3 * | 3 * |
4 * This library is free software; you can redistribute it and/or | 4 * This library is free software; you can redistribute it and/or |
5 * modify it under the terms of the GNU Library General Public | 5 * modify it under the terms of the GNU Library General Public |
6 * License as published by the Free Software Foundation; either | 6 * License as published by the Free Software Foundation; either |
7 * version 2 of the License, or (at your option) any later version. | 7 * version 2 of the License, or (at your option) any later version. |
8 * | 8 * |
9 * This library is distributed in the hope that it will be useful, | 9 * This library is distributed in the hope that it will be useful, |
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 10 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
(...skipping 158 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
169 inline bool HashSet<Value, HashFunctions, Traits, Allocator>::contains(Value
PeekInType value) const | 169 inline bool HashSet<Value, HashFunctions, Traits, Allocator>::contains(Value
PeekInType value) const |
170 { | 170 { |
171 return m_impl.contains(value); | 171 return m_impl.contains(value); |
172 } | 172 } |
173 | 173 |
174 template<typename Value, typename HashFunctions, typename Traits, typename A
llocator> | 174 template<typename Value, typename HashFunctions, typename Traits, typename A
llocator> |
175 template<typename HashTranslator, typename T> | 175 template<typename HashTranslator, typename T> |
176 typename HashSet<Value, HashFunctions, Traits, Allocator>::iterator | 176 typename HashSet<Value, HashFunctions, Traits, Allocator>::iterator |
177 inline HashSet<Value, HashFunctions, Traits, Allocator>::find(const T& value
) const | 177 inline HashSet<Value, HashFunctions, Traits, Allocator>::find(const T& value
) const |
178 { | 178 { |
179 return m_impl.template find<HashSetTranslatorAdapter<HashTranslator> >(v
alue); | 179 return m_impl.template find<HashSetTranslatorAdapter<HashTranslator>>(va
lue); |
180 } | 180 } |
181 | 181 |
182 template<typename Value, typename HashFunctions, typename Traits, typename A
llocator> | 182 template<typename Value, typename HashFunctions, typename Traits, typename A
llocator> |
183 template<typename HashTranslator, typename T> | 183 template<typename HashTranslator, typename T> |
184 inline bool HashSet<Value, HashFunctions, Traits, Allocator>::contains(const
T& value) const | 184 inline bool HashSet<Value, HashFunctions, Traits, Allocator>::contains(const
T& value) const |
185 { | 185 { |
186 return m_impl.template contains<HashSetTranslatorAdapter<HashTranslator>
>(value); | 186 return m_impl.template contains<HashSetTranslatorAdapter<HashTranslator>
>(value); |
187 } | 187 } |
188 | 188 |
189 template<typename T, typename U, typename V, typename W> | 189 template<typename T, typename U, typename V, typename W> |
190 inline typename HashSet<T, U, V, W>::AddResult HashSet<T, U, V, W>::add(Valu
ePassInType value) | 190 inline typename HashSet<T, U, V, W>::AddResult HashSet<T, U, V, W>::add(Valu
ePassInType value) |
191 { | 191 { |
192 return m_impl.add(value); | 192 return m_impl.add(value); |
193 } | 193 } |
194 | 194 |
195 template<typename Value, typename HashFunctions, typename Traits, typename A
llocator> | 195 template<typename Value, typename HashFunctions, typename Traits, typename A
llocator> |
196 template<typename HashTranslator, typename T> | 196 template<typename HashTranslator, typename T> |
197 inline typename HashSet<Value, HashFunctions, Traits, Allocator>::AddResult | 197 inline typename HashSet<Value, HashFunctions, Traits, Allocator>::AddResult |
198 HashSet<Value, HashFunctions, Traits, Allocator>::add(const T& value) | 198 HashSet<Value, HashFunctions, Traits, Allocator>::add(const T& value) |
199 { | 199 { |
200 return m_impl.template addPassingHashCode<HashSetTranslatorAdapter<HashT
ranslator> >(value, value); | 200 return m_impl.template addPassingHashCode<HashSetTranslatorAdapter<HashT
ranslator>>(value, value); |
201 } | 201 } |
202 | 202 |
203 template<typename T, typename U, typename V, typename W> | 203 template<typename T, typename U, typename V, typename W> |
204 inline void HashSet<T, U, V, W>::remove(iterator it) | 204 inline void HashSet<T, U, V, W>::remove(iterator it) |
205 { | 205 { |
206 m_impl.remove(it.m_impl); | 206 m_impl.remove(it.m_impl); |
207 } | 207 } |
208 | 208 |
209 template<typename T, typename U, typename V, typename W> | 209 template<typename T, typename U, typename V, typename W> |
210 inline void HashSet<T, U, V, W>::remove(ValuePeekInType value) | 210 inline void HashSet<T, U, V, W>::remove(ValuePeekInType value) |
(...skipping 56 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
267 vector.resize(collection.size()); | 267 vector.resize(collection.size()); |
268 | 268 |
269 iterator it = collection.begin(); | 269 iterator it = collection.begin(); |
270 iterator end = collection.end(); | 270 iterator end = collection.end(); |
271 for (unsigned i = 0; it != end; ++it, ++i) | 271 for (unsigned i = 0; it != end; ++it, ++i) |
272 vector[i] = *it; | 272 vector[i] = *it; |
273 } | 273 } |
274 | 274 |
275 #if !ENABLE(OILPAN) | 275 #if !ENABLE(OILPAN) |
276 template<typename T, typename U, typename V> | 276 template<typename T, typename U, typename V> |
277 struct NeedsTracing<HashSet<T, U, V> > { | 277 struct NeedsTracing<HashSet<T, U, V>> { |
278 static const bool value = false; | 278 static const bool value = false; |
279 }; | 279 }; |
280 #endif | 280 #endif |
281 | 281 |
282 } // namespace WTF | 282 } // namespace WTF |
283 | 283 |
284 using WTF::HashSet; | 284 using WTF::HashSet; |
285 | 285 |
286 #endif /* WTF_HashSet_h */ | 286 #endif /* WTF_HashSet_h */ |
OLD | NEW |