Rename DefaultAllocator to PartitionAllocator

third_party/WebKit/Source/wtf/Deque.h

 /*
  * Copyright (C) 2007, 2008 Apple Inc. All rights reserved.
  * Copyright (C) 2009 Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  *
  * 1.  Redistributions of source code must retain the above copyright
  *     notice, this list of conditions and the following disclaimer.
@@ skipping 25 matching lines @@
 #include "wtf/PassTraits.h"
 #include "wtf/Vector.h"
 #include <iterator>
 
 namespace WTF {
 
 template <typename T, size_t inlineCapacity, typename Allocator> class DequeIteratorBase;
 template <typename T, size_t inlineCapacity, typename Allocator> class DequeIterator;
 template <typename T, size_t inlineCapacity, typename Allocator> class DequeConstIterator;
 
-template <typename T, size_t inlineCapacity = 0, typename Allocator = DefaultAllocator>
+template <typename T, size_t inlineCapacity = 0, typename Allocator = PartitionAllocator>
 class Deque : public ConditionalDestructor<Deque<T, INLINE_CAPACITY, Allocator>, (INLINE_CAPACITY == 0) && Allocator::isGarbageCollected> {
     WTF_USE_ALLOCATOR(Deque, Allocator);
 public:
     typedef DequeIterator<T, inlineCapacity, Allocator> iterator;
     typedef DequeConstIterator<T, inlineCapacity, Allocator> const_iterator;
     typedef std::reverse_iterator<iterator> reverse_iterator;
     typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
     typedef PassTraits<T> Pass;
     typedef typename PassTraits<T>::PassType PassType;
 
@@ skipping 94 matching lines @@
 
     bool isEqual(const DequeIteratorBase&) const;
 
 private:
     Deque<T, inlineCapacity, Allocator>* m_deque;
     unsigned m_index;
 
     friend class Deque<T, inlineCapacity, Allocator>;
 };
 
-template <typename T, size_t inlineCapacity = 0, typename Allocator = DefaultAllocator>
+template <typename T, size_t inlineCapacity = 0, typename Allocator = PartitionAllocator>
 class DequeIterator : public DequeIteratorBase<T, inlineCapacity, Allocator> {
 private:
     typedef DequeIteratorBase<T, inlineCapacity, Allocator> Base;
     typedef DequeIterator<T, inlineCapacity, Allocator> Iterator;
 
 public:
     typedef ptrdiff_t difference_type;
     typedef T value_type;
     typedef T* pointer;
     typedef T& reference;
     typedef std::bidirectional_iterator_tag iterator_category;
 
     DequeIterator(Deque<T, inlineCapacity, Allocator>* deque, size_t index) : Base(deque, index) {}
 
     DequeIterator(const Iterator& other) : Base(other) {}
     DequeIterator& operator=(const Iterator& other) { Base::assign(other); return *this; }
 
     T& operator*() const { return *Base::after(); }
     T* operator->() const { return Base::after(); }
 
     bool operator==(const Iterator& other) const { return Base::isEqual(other); }
     bool operator!=(const Iterator& other) const { return !Base::isEqual(other); }
 
     Iterator& operator++() { Base::increment(); return *this; }
     // postfix ++ intentionally omitted
     Iterator& operator--() { Base::decrement(); return *this; }
     // postfix -- intentionally omitted
 };
 
-template <typename T, size_t inlineCapacity = 0, typename Allocator = DefaultAllocator>
+template <typename T, size_t inlineCapacity = 0, typename Allocator = PartitionAllocator>
 class DequeConstIterator : public DequeIteratorBase<T, inlineCapacity, Allocator> {
 private:
     typedef DequeIteratorBase<T, inlineCapacity, Allocator> Base;
     typedef DequeConstIterator<T, inlineCapacity, Allocator> Iterator;
     typedef DequeIterator<T, inlineCapacity, Allocator> NonConstIterator;
 
 public:
     typedef ptrdiff_t difference_type;
     typedef T value_type;
     typedef const T* pointer;
@@ skipping 372 matching lines @@
 struct NeedsTracing<Deque<T, N>> {
     static const bool value = false;
 };
 #endif
 
 } // namespace WTF
 
 using WTF::Deque;
 
 #endif // WTF_Deque_h