Rename DefaultAllocator to PartitionAllocator

third_party/WebKit/Source/wtf/ListHashSet.h

 /*
  * Copyright (C) 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights reserved.
  * Copyright (C) 2011, Benjamin Poulain <ikipou@gmail.com>
  *
  * 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.
  *
  */
 
 #ifndef WTF_ListHashSet_h
 #define WTF_ListHashSet_h
 
-#include "wtf/DefaultAllocator.h"
 #include "wtf/HashSet.h"
 #include "wtf/OwnPtr.h"
+#include "wtf/PartitionAllocator.h"
 #include "wtf/PassOwnPtr.h"
 
 namespace WTF {
 
 // ListHashSet: Just like HashSet, this class provides a Set interface - a
 // collection of unique objects with O(1) insertion, removal and test for
 // containership. However, it also has an order - iterating it will always give
 // back values in the order in which they are added.
 
 // Unlike iteration of most WTF Hash data structures, iteration is guaranteed
@@ skipping 181 matching lines @@
     ValueArg m_value;
     ListHashSetNodeBase* m_prev;
     ListHashSetNodeBase* m_next;
 #if ENABLE(ASSERT)
     bool m_isAllocated;
 #endif
 };
 
 // This allocator is only used for non-Heap ListHashSets.
 template <typename ValueArg, size_t inlineCapacity>
-struct ListHashSetAllocator : public DefaultAllocator {
-    typedef DefaultAllocator TableAllocator;
+struct ListHashSetAllocator : public PartitionAllocator {
+    typedef PartitionAllocator TableAllocator;
     typedef ListHashSetNode<ValueArg, ListHashSetAllocator> Node;
     typedef ListHashSetNodeBase<ValueArg> NodeBase;
 
     class AllocatorProvider {
     public:
         AllocatorProvider() : m_allocator(nullptr) {}
         void createAllocatorIfNeeded()
         {
             if (!m_allocator)
                 m_allocator = new ListHashSetAllocator;
@@ skipping 73 matching lines @@
         }
 
         WTF::Partitions::fastFree(node);
     }
 
     bool inPool(Node* node)
     {
         return node >= pool() && node < pastPool();
     }
 
-    static void traceValue(typename DefaultAllocator::Visitor* visitor, Node* node) {}
+    static void traceValue(typename PartitionAllocator::Visitor* visitor, Node* node) {}
 
 private:
     Node* pool() { return reinterpret_cast_ptr<Node*>(m_pool.buffer); }
     Node* pastPool() { return pool() + m_poolSize; }
 
     Node* m_freeList;
     bool m_isDoneWithInitialFreeList;
 #if defined(MEMORY_SANITIZER_INITIAL_SIZE)
     // The allocation pool for nodes is one big chunk that ASAN has no insight
     // into, so it can cloak errors. Make it as small as possible to force nodes
@@ skipping 671 matching lines @@
 struct NeedsTracing<ListHashSet<T, U, V>> {
     static const bool value = false;
 };
 #endif
 
 } // namespace WTF
 
 using WTF::ListHashSet;
 
 #endif // WTF_ListHashSet_h