| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights | 2 * Copyright (C) 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights |
| 3 * reserved. | 3 * reserved. |
| 4 * Copyright (C) 2011, Benjamin Poulain <ikipou@gmail.com> | 4 * Copyright (C) 2011, Benjamin Poulain <ikipou@gmail.com> |
| 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 * |
| (...skipping 59 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 70 template <typename ValueArg, | 70 template <typename ValueArg, |
| 71 size_t inlineCapacity = 256, | 71 size_t inlineCapacity = 256, |
| 72 typename HashArg = typename DefaultHash<ValueArg>::Hash, | 72 typename HashArg = typename DefaultHash<ValueArg>::Hash, |
| 73 typename AllocatorArg = | 73 typename AllocatorArg = |
| 74 ListHashSetAllocator<ValueArg, inlineCapacity>> | 74 ListHashSetAllocator<ValueArg, inlineCapacity>> |
| 75 class ListHashSet | 75 class ListHashSet |
| 76 : public ConditionalDestructor< | 76 : public ConditionalDestructor< |
| 77 ListHashSet<ValueArg, inlineCapacity, HashArg, AllocatorArg>, | 77 ListHashSet<ValueArg, inlineCapacity, HashArg, AllocatorArg>, |
| 78 AllocatorArg::isGarbageCollected> { | 78 AllocatorArg::isGarbageCollected> { |
| 79 typedef AllocatorArg Allocator; | 79 typedef AllocatorArg Allocator; |
| 80 WTF_USE_ALLOCATOR(ListHashSet, Allocator); | 80 USE_ALLOCATOR(ListHashSet, Allocator); |
| 81 | 81 |
| 82 typedef ListHashSetNode<ValueArg, Allocator> Node; | 82 typedef ListHashSetNode<ValueArg, Allocator> Node; |
| 83 typedef HashTraits<Node*> NodeTraits; | 83 typedef HashTraits<Node*> NodeTraits; |
| 84 typedef ListHashSetNodeHashFunctions<HashArg> NodeHash; | 84 typedef ListHashSetNodeHashFunctions<HashArg> NodeHash; |
| 85 typedef ListHashSetTranslator<HashArg> BaseTranslator; | 85 typedef ListHashSetTranslator<HashArg> BaseTranslator; |
| 86 | 86 |
| 87 typedef HashTable<Node*, | 87 typedef HashTable<Node*, |
| 88 Node*, | 88 Node*, |
| 89 IdentityExtractor, | 89 IdentityExtractor, |
| 90 NodeHash, | 90 NodeHash, |
| (...skipping 1010 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1101 // through the HashTable. That includes m_head and m_tail so we do not have | 1101 // through the HashTable. That includes m_head and m_tail so we do not have |
| 1102 // to explicitly trace them here. | 1102 // to explicitly trace them here. |
| 1103 m_impl.trace(visitor); | 1103 m_impl.trace(visitor); |
| 1104 } | 1104 } |
| 1105 | 1105 |
| 1106 } // namespace WTF | 1106 } // namespace WTF |
| 1107 | 1107 |
| 1108 using WTF::ListHashSet; | 1108 using WTF::ListHashSet; |
| 1109 | 1109 |
| 1110 #endif // WTF_ListHashSet_h | 1110 #endif // WTF_ListHashSet_h |
| OLD | NEW |