| 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 236 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 247 inline bool HashSet<Value, HashFunctions, Traits, Allocator>::contains( | 247 inline bool HashSet<Value, HashFunctions, Traits, Allocator>::contains( |
| 248 const T& value) const { | 248 const T& value) const { |
| 249 return m_impl.template contains<HashSetTranslatorAdapter<HashTranslator>>( | 249 return m_impl.template contains<HashSetTranslatorAdapter<HashTranslator>>( |
| 250 value); | 250 value); |
| 251 } | 251 } |
| 252 | 252 |
| 253 template <typename T, typename U, typename V, typename W> | 253 template <typename T, typename U, typename V, typename W> |
| 254 template <typename IncomingValueType> | 254 template <typename IncomingValueType> |
| 255 inline typename HashSet<T, U, V, W>::AddResult HashSet<T, U, V, W>::insert( | 255 inline typename HashSet<T, U, V, W>::AddResult HashSet<T, U, V, W>::insert( |
| 256 IncomingValueType&& value) { | 256 IncomingValueType&& value) { |
| 257 return m_impl.add(std::forward<IncomingValueType>(value)); | 257 return m_impl.insert(std::forward<IncomingValueType>(value)); |
| 258 } | 258 } |
| 259 | 259 |
| 260 template <typename Value, | 260 template <typename Value, |
| 261 typename HashFunctions, | 261 typename HashFunctions, |
| 262 typename Traits, | 262 typename Traits, |
| 263 typename Allocator> | 263 typename Allocator> |
| 264 template <typename HashTranslator, typename T> | 264 template <typename HashTranslator, typename T> |
| 265 inline typename HashSet<Value, HashFunctions, Traits, Allocator>::AddResult | 265 inline typename HashSet<Value, HashFunctions, Traits, Allocator>::AddResult |
| 266 HashSet<Value, HashFunctions, Traits, Allocator>::addWithTranslator(T&& value) { | 266 HashSet<Value, HashFunctions, Traits, Allocator>::addWithTranslator(T&& value) { |
| 267 // Forward only the first argument, because the second argument isn't actually | 267 // Forward only the first argument, because the second argument isn't actually |
| 268 // used in HashSetTranslatorAdapter. | 268 // used in HashSetTranslatorAdapter. |
| 269 return m_impl | 269 return m_impl |
| 270 .template addPassingHashCode<HashSetTranslatorAdapter<HashTranslator>>( | 270 .template insertPassingHashCode<HashSetTranslatorAdapter<HashTranslator>>( |
| 271 std::forward<T>(value), value); | 271 std::forward<T>(value), value); |
| 272 } | 272 } |
| 273 | 273 |
| 274 template <typename T, typename U, typename V, typename W> | 274 template <typename T, typename U, typename V, typename W> |
| 275 inline void HashSet<T, U, V, W>::erase(iterator it) { | 275 inline void HashSet<T, U, V, W>::erase(iterator it) { |
| 276 m_impl.erase(it.m_impl); | 276 m_impl.erase(it.m_impl); |
| 277 } | 277 } |
| 278 | 278 |
| 279 template <typename T, typename U, typename V, typename W> | 279 template <typename T, typename U, typename V, typename W> |
| 280 inline void HashSet<T, U, V, W>::erase(ValuePeekInType value) { | 280 inline void HashSet<T, U, V, W>::erase(ValuePeekInType value) { |
| (...skipping 40 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 321 iterator end = collection.end(); | 321 iterator end = collection.end(); |
| 322 for (unsigned i = 0; it != end; ++it, ++i) | 322 for (unsigned i = 0; it != end; ++it, ++i) |
| 323 vector[i] = *it; | 323 vector[i] = *it; |
| 324 } | 324 } |
| 325 | 325 |
| 326 } // namespace WTF | 326 } // namespace WTF |
| 327 | 327 |
| 328 using WTF::HashSet; | 328 using WTF::HashSet; |
| 329 | 329 |
| 330 #endif // WTF_HashSet_h | 330 #endif // WTF_HashSet_h |
| OLD | NEW |