Apply clang-format with Chromium-style without column limit.

third_party/WebKit/Source/wtf/Vector.h

 /*
  *  Copyright (C) 2005, 2006, 2007, 2008 Apple Inc. All rights reserved.
  *
  *  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
@@ skipping 42 matching lines @@
 #endif
 
 template <typename T, size_t inlineBuffer, typename Allocator>
 class Deque;
 
 template <bool needsDestruction, typename T>
 struct VectorDestructor;
 
 template <typename T>
 struct VectorDestructor<false, T> {
-    static void destruct(T*, T*) {}
+  static void destruct(T*, T*) {}
 };
 
 template <typename T>
 struct VectorDestructor<true, T> {
-    static void destruct(T* begin, T* end)
-    {
-        for (T* cur = begin; cur != end; ++cur)
-            cur->~T();
-    }
+  static void destruct(T* begin, T* end) {
+    for (T* cur = begin; cur != end; ++cur)
+      cur->~T();
+  }
 };
 
 template <bool unusedSlotsMustBeZeroed, typename T>
 struct VectorUnusedSlotClearer;
 
 template <typename T>
 struct VectorUnusedSlotClearer<false, T> {
-    static void clear(T*, T*) {}
+  static void clear(T*, T*) {}
 #if ENABLE(ASSERT)
-    static void checkCleared(const T*, const T*) {}
+  static void checkCleared(const T*, const T*) {}
 #endif
 };
 
 template <typename T>
 struct VectorUnusedSlotClearer<true, T> {
-    static void clear(T* begin, T* end)
-    {
-        memset(reinterpret_cast<void*>(begin), 0, sizeof(T) * (end - begin));
-    }
+  static void clear(T* begin, T* end) {
+    memset(reinterpret_cast<void*>(begin), 0, sizeof(T) * (end - begin));
+  }
 
 #if ENABLE(ASSERT)
-    static void checkCleared(const T* begin, const T* end)
-    {
-        const unsigned char* unusedArea = reinterpret_cast<const unsigned char*>(begin);
-        const unsigned char* endAddress = reinterpret_cast<const unsigned char*>(end);
-        ASSERT(endAddress >= unusedArea);
-        for (int i = 0; i < endAddress - unusedArea; ++i)
-            ASSERT(!unusedArea[i]);
-    }
+  static void checkCleared(const T* begin, const T* end) {
+    const unsigned char* unusedArea = reinterpret_cast<const unsigned char*>(begin);
+    const unsigned char* endAddress = reinterpret_cast<const unsigned char*>(end);
+    ASSERT(endAddress >= unusedArea);
+    for (int i = 0; i < endAddress - unusedArea; ++i)
+      ASSERT(!unusedArea[i]);
+  }
 #endif
 };
 
 template <bool canInitializeWithMemset, typename T>
 struct VectorInitializer;
 
 template <typename T>
 struct VectorInitializer<false, T> {
-    static void initialize(T* begin, T* end)
-    {
-        for (T* cur = begin; cur != end; ++cur)
-            new (NotNull, cur) T;
-    }
+  static void initialize(T* begin, T* end) {
+    for (T* cur = begin; cur != end; ++cur)
+      new (NotNull, cur) T;
+  }
 };
 
 template <typename T>
 struct VectorInitializer<true, T> {
-    static void initialize(T* begin, T* end)
-    {
-        memset(begin, 0, reinterpret_cast<char*>(end) - reinterpret_cast<char*>(begin));
-    }
+  static void initialize(T* begin, T* end) {
+    memset(begin, 0, reinterpret_cast<char*>(end) - reinterpret_cast<char*>(begin));
+  }
 };
 
 template <bool canMoveWithMemcpy, typename T>
 struct VectorMover;
 
 template <typename T>
 struct VectorMover<false, T> {
-    static void move(const T* src, const T* srcEnd, T* dst)
-    {
-        while (src != srcEnd) {
-            new (NotNull, dst) T(*src);
-            src->~T();
-            ++dst;
-            ++src;
-        }
+  static void move(const T* src, const T* srcEnd, T* dst) {
+    while (src != srcEnd) {
+      new (NotNull, dst) T(*src);
+      src->~T();
+      ++dst;
+      ++src;
     }
-    static void moveOverlapping(const T* src, const T* srcEnd, T* dst)
-    {
-        if (src > dst) {
-            move(src, srcEnd, dst);
-        } else {
-            T* dstEnd = dst + (srcEnd - src);
-            while (src != srcEnd) {
-                --srcEnd;
-                --dstEnd;
-                new (NotNull, dstEnd) T(*srcEnd);
-                srcEnd->~T();
-            }
-        }
+  }
+  static void moveOverlapping(const T* src, const T* srcEnd, T* dst) {
+    if (src > dst) {
+      move(src, srcEnd, dst);
+    } else {
+      T* dstEnd = dst + (srcEnd - src);
+      while (src != srcEnd) {
+        --srcEnd;
+        --dstEnd;
+        new (NotNull, dstEnd) T(*srcEnd);
+        srcEnd->~T();
+      }
     }
-    static void swap(T* src, T* srcEnd, T* dst)
-    {
-        std::swap_ranges(src, srcEnd, dst);
-    }
+  }
+  static void swap(T* src, T* srcEnd, T* dst) {
+    std::swap_ranges(src, srcEnd, dst);
+  }
 };
 
 template <typename T>
 struct VectorMover<true, T> {
-    static void move(const T* src, const T* srcEnd, T* dst)
-    {
-        if (LIKELY(dst && src))
-            memcpy(dst, src, reinterpret_cast<const char*>(srcEnd) - reinterpret_cast<const char*>(src));
-    }
-    static void moveOverlapping(const T* src, const T* srcEnd, T* dst)
-    {
-        if (LIKELY(dst && src))
-            memmove(dst, src, reinterpret_cast<const char*>(srcEnd) - reinterpret_cast<const char*>(src));
-    }
-    static void swap(T* src, T* srcEnd, T* dst)
-    {
-        std::swap_ranges(reinterpret_cast<char*>(src), reinterpret_cast<char*>(srcEnd), reinterpret_cast<char*>(dst));
-    }
+  static void move(const T* src, const T* srcEnd, T* dst) {
+    if (LIKELY(dst && src))
+      memcpy(dst, src, reinterpret_cast<const char*>(srcEnd) - reinterpret_cast<const char*>(src));
+  }
+  static void moveOverlapping(const T* src, const T* srcEnd, T* dst) {
+    if (LIKELY(dst && src))
+      memmove(dst, src, reinterpret_cast<const char*>(srcEnd) - reinterpret_cast<const char*>(src));
+  }
+  static void swap(T* src, T* srcEnd, T* dst) {
+    std::swap_ranges(reinterpret_cast<char*>(src), reinterpret_cast<char*>(srcEnd), reinterpret_cast<char*>(dst));
+  }
 };
 
 template <bool canCopyWithMemcpy, typename T>
 struct VectorCopier;
 
 template <typename T>
 struct VectorCopier<false, T> {
-    template <typename U>
-    static void uninitializedCopy(const U* src, const U* srcEnd, T* dst)
-    {
-        while (src != srcEnd) {
-            new (NotNull, dst) T(*src);
-            ++dst;
-            ++src;
-        }
+  template <typename U>
+  static void uninitializedCopy(const U* src, const U* srcEnd, T* dst) {
+    while (src != srcEnd) {
+      new (NotNull, dst) T(*src);
+      ++dst;
+      ++src;
     }
+  }
 };
 
 template <typename T>
 struct VectorCopier<true, T> {
-    static void uninitializedCopy(const T* src, const T* srcEnd, T* dst)
-    {
-        if (LIKELY(dst && src))
-            memcpy(dst, src, reinterpret_cast<const char*>(srcEnd) - reinterpret_cast<const char*>(src));
-    }
-    template <typename U>
-    static void uninitializedCopy(const U* src, const U* srcEnd, T* dst)
-    {
-        VectorCopier<false, T>::uninitializedCopy(src, srcEnd, dst);
-    }
+  static void uninitializedCopy(const T* src, const T* srcEnd, T* dst) {
+    if (LIKELY(dst && src))
+      memcpy(dst, src, reinterpret_cast<const char*>(srcEnd) - reinterpret_cast<const char*>(src));
+  }
+  template <typename U>
+  static void uninitializedCopy(const U* src, const U* srcEnd, T* dst) {
+    VectorCopier<false, T>::uninitializedCopy(src, srcEnd, dst);
+  }
 };
 
 template <bool canFillWithMemset, typename T>
 struct VectorFiller;
 
 template <typename T>
 struct VectorFiller<false, T> {
-    static void uninitializedFill(T* dst, T* dstEnd, const T& val)
-    {
-        while (dst != dstEnd) {
-            new (NotNull, dst) T(val);
-            ++dst;
-        }
+  static void uninitializedFill(T* dst, T* dstEnd, const T& val) {
+    while (dst != dstEnd) {
+      new (NotNull, dst) T(val);
+      ++dst;
     }
+  }
 };
 
 template <typename T>
 struct VectorFiller<true, T> {
-    static void uninitializedFill(T* dst, T* dstEnd, const T& val)
-    {
-        static_assert(sizeof(T) == sizeof(char), "size of type should be one");
+  static void uninitializedFill(T* dst, T* dstEnd, const T& val) {
+    static_assert(sizeof(T) == sizeof(char), "size of type should be one");
 #if COMPILER(GCC) && defined(_FORTIFY_SOURCE)
-        if (!__builtin_constant_p(dstEnd - dst) || (!(dstEnd - dst)))
-            memset(dst, val, dstEnd - dst);
+    if (!__builtin_constant_p(dstEnd - dst) || (!(dstEnd - dst)))
+      memset(dst, val, dstEnd - dst);
 #else
-        memset(dst, val, dstEnd - dst);
+    memset(dst, val, dstEnd - dst);
 #endif
-    }
+  }
 };
 
 template <bool canCompareWithMemcmp, typename T>
 struct VectorComparer;
 
 template <typename T>
 struct VectorComparer<false, T> {
-    static bool compare(const T* a, const T* b, size_t size)
-    {
-        ASSERT(a);
-        ASSERT(b);
-        return std::equal(a, a + size, b);
-    }
+  static bool compare(const T* a, const T* b, size_t size) {
+    ASSERT(a);
+    ASSERT(b);
+    return std::equal(a, a + size, b);
+  }
 };
 
 template <typename T>
 struct VectorComparer<true, T> {
-    static bool compare(const T* a, const T* b, size_t size)
-    {
-        ASSERT(a);
-        ASSERT(b);
-        return memcmp(a, b, sizeof(T) * size) == 0;
-    }
+  static bool compare(const T* a, const T* b, size_t size) {
+    ASSERT(a);
+    ASSERT(b);
+    return memcmp(a, b, sizeof(T) * size) == 0;
+  }
 };
 
 template <typename T>
 struct VectorTypeOperations {
-    static void destruct(T* begin, T* end)
-    {
-        VectorDestructor<VectorTraits<T>::needsDestruction, T>::destruct(begin, end);
-    }
+  static void destruct(T* begin, T* end) {
+    VectorDestructor<VectorTraits<T>::needsDestruction, T>::destruct(begin, end);
+  }
 
-    static void initialize(T* begin, T* end)
-    {
-        VectorInitializer<VectorTraits<T>::canInitializeWithMemset, T>::initialize(begin, end);
-    }
+  static void initialize(T* begin, T* end) {
+    VectorInitializer<VectorTraits<T>::canInitializeWithMemset, T>::initialize(begin, end);
+  }
 
-    static void move(const T* src, const T* srcEnd, T* dst)
-    {
-        VectorMover<VectorTraits<T>::canMoveWithMemcpy, T>::move(src, srcEnd, dst);
-    }
+  static void move(const T* src, const T* srcEnd, T* dst) {
+    VectorMover<VectorTraits<T>::canMoveWithMemcpy, T>::move(src, srcEnd, dst);
+  }
 
-    static void moveOverlapping(const T* src, const T* srcEnd, T* dst)
-    {
-        VectorMover<VectorTraits<T>::canMoveWithMemcpy, T>::moveOverlapping(src, srcEnd, dst);
-    }
+  static void moveOverlapping(const T* src, const T* srcEnd, T* dst) {
+    VectorMover<VectorTraits<T>::canMoveWithMemcpy, T>::moveOverlapping(src, srcEnd, dst);
+  }
 
-    static void swap(T* src, T* srcEnd, T* dst)
-    {
-        VectorMover<VectorTraits<T>::canMoveWithMemcpy, T>::swap(src, srcEnd, dst);
-    }
+  static void swap(T* src, T* srcEnd, T* dst) {
+    VectorMover<VectorTraits<T>::canMoveWithMemcpy, T>::swap(src, srcEnd, dst);
+  }
 
-    static void uninitializedCopy(const T* src, const T* srcEnd, T* dst)
-    {
-        VectorCopier<VectorTraits<T>::canCopyWithMemcpy, T>::uninitializedCopy(src, srcEnd, dst);
-    }
+  static void uninitializedCopy(const T* src, const T* srcEnd, T* dst) {
+    VectorCopier<VectorTraits<T>::canCopyWithMemcpy, T>::uninitializedCopy(src, srcEnd, dst);
+  }
 
-    static void uninitializedFill(T* dst, T* dstEnd, const T& val)
-    {
-        VectorFiller<VectorTraits<T>::canFillWithMemset, T>::uninitializedFill(dst, dstEnd, val);
-    }
+  static void uninitializedFill(T* dst, T* dstEnd, const T& val) {
+    VectorFiller<VectorTraits<T>::canFillWithMemset, T>::uninitializedFill(dst, dstEnd, val);
+  }
 
-    static bool compare(const T* a, const T* b, size_t size)
-    {
-        return VectorComparer<VectorTraits<T>::canCompareWithMemcmp, T>::compare(a, b, size);
-    }
+  static bool compare(const T* a, const T* b, size_t size) {
+    return VectorComparer<VectorTraits<T>::canCompareWithMemcmp, T>::compare(a, b, size);
+  }
 };
 
 template <typename T, bool hasInlineCapacity, typename Allocator>
 class VectorBufferBase {
-    WTF_MAKE_NONCOPYABLE(VectorBufferBase);
-public:
-    void allocateBuffer(size_t newCapacity)
-    {
-        ASSERT(newCapacity);
-        size_t sizeToAllocate = allocationSize(newCapacity);
-        if (hasInlineCapacity)
-            m_buffer = Allocator::template allocateInlineVectorBacking<T>(sizeToAllocate);
-        else
-            m_buffer = Allocator::template allocateVectorBacking<T>(sizeToAllocate);
-        m_capacity = sizeToAllocate / sizeof(T);
-    }
+  WTF_MAKE_NONCOPYABLE(VectorBufferBase);
 
-    void allocateExpandedBuffer(size_t newCapacity)
-    {
-        ASSERT(newCapacity);
-        size_t sizeToAllocate = allocationSize(newCapacity);
-        if (hasInlineCapacity)
-            m_buffer = Allocator::template allocateInlineVectorBacking<T>(sizeToAllocate);
-        else
-            m_buffer = Allocator::template allocateExpandedVectorBacking<T>(sizeToAllocate);
-        m_capacity = sizeToAllocate / sizeof(T);
-    }
+ public:
+  void allocateBuffer(size_t newCapacity) {
+    ASSERT(newCapacity);
+    size_t sizeToAllocate = allocationSize(newCapacity);
+    if (hasInlineCapacity)
+      m_buffer = Allocator::template allocateInlineVectorBacking<T>(sizeToAllocate);
+    else
+      m_buffer = Allocator::template allocateVectorBacking<T>(sizeToAllocate);
+    m_capacity = sizeToAllocate / sizeof(T);
+  }
 
-    size_t allocationSize(size_t capacity) const
-    {
-        return Allocator::template quantizedSize<T>(capacity);
-    }
+  void allocateExpandedBuffer(size_t newCapacity) {
+    ASSERT(newCapacity);
+    size_t sizeToAllocate = allocationSize(newCapacity);
+    if (hasInlineCapacity)
+      m_buffer = Allocator::template allocateInlineVectorBacking<T>(sizeToAllocate);
+    else
+      m_buffer = Allocator::template allocateExpandedVectorBacking<T>(sizeToAllocate);
+    m_capacity = sizeToAllocate / sizeof(T);
+  }
 
-    T* buffer() { return m_buffer; }
-    const T* buffer() const { return m_buffer; }
-    size_t capacity() const { return m_capacity; }
+  size_t allocationSize(size_t capacity) const {
+    return Allocator::template quantizedSize<T>(capacity);
+  }
 
-    void clearUnusedSlots(T* from, T* to)
-    {
-        // If the vector backing is garbage-collected and needs tracing or
-        // finalizing, we clear out the unused slots so that the visitor or the
-        // finalizer does not cause a problem when visiting the unused slots.
-        VectorUnusedSlotClearer<Allocator::isGarbageCollected && (VectorTraits<T>::needsDestruction || NeedsTracingTrait<VectorTraits<T>>::value), T>::clear(from, to);
-    }
+  T* buffer() { return m_buffer; }
+  const T* buffer() const { return m_buffer; }
+  size_t capacity() const { return m_capacity; }
 
-    void checkUnusedSlots(const T* from, const T* to)
-    {
+  void clearUnusedSlots(T* from, T* to) {
+    // If the vector backing is garbage-collected and needs tracing or
+    // finalizing, we clear out the unused slots so that the visitor or the
+    // finalizer does not cause a problem when visiting the unused slots.
+    VectorUnusedSlotClearer<Allocator::isGarbageCollected && (VectorTraits<T>::needsDestruction || NeedsTracingTrait<VectorTraits<T>>::value), T>::clear(from, to);
+  }
+
+  void checkUnusedSlots(const T* from, const T* to) {
 #if ENABLE(ASSERT) && !defined(ANNOTATE_CONTIGUOUS_CONTAINER)
-        VectorUnusedSlotClearer<Allocator::isGarbageCollected && (VectorTraits<T>::needsDestruction || NeedsTracingTrait<VectorTraits<T>>::value), T>::checkCleared(from, to);
+    VectorUnusedSlotClearer<Allocator::isGarbageCollected && (VectorTraits<T>::needsDestruction || NeedsTracingTrait<VectorTraits<T>>::value), T>::checkCleared(from, to);
 #endif
-    }
+  }
 
-protected:
-    VectorBufferBase()
-        : m_buffer(nullptr)
-        , m_capacity(0)
-    {
-    }
+ protected:
+  VectorBufferBase()
+      : m_buffer(nullptr), m_capacity(0) {
+  }
 
-    VectorBufferBase(T* buffer, size_t capacity)
-        : m_buffer(buffer)
-        , m_capacity(capacity)
-    {
-    }
+  VectorBufferBase(T* buffer, size_t capacity)
+      : m_buffer(buffer), m_capacity(capacity) {
+  }
 
-    T* m_buffer;
-    unsigned m_capacity;
-    unsigned m_size;
+  T* m_buffer;
+  unsigned m_capacity;
+  unsigned m_size;
 };
 
 template <typename T, size_t inlineCapacity, typename Allocator = PartitionAllocator>
 class VectorBuffer;
 
 template <typename T, typename Allocator>
 class VectorBuffer<T, 0, Allocator> : protected VectorBufferBase<T, false, Allocator> {
-private:
-    typedef VectorBufferBase<T, false, Allocator> Base;
-public:
-    VectorBuffer()
-    {
-    }
-
-    VectorBuffer(size_t capacity)
-    {
-        // Calling malloc(0) might take a lock and may actually do an allocation
-        // on some systems.
-        if (capacity)
-            allocateBuffer(capacity);
-    }
-
-    void destruct()
-    {
-        deallocateBuffer(m_buffer);
-        m_buffer = nullptr;
-    }
-
-    void deallocateBuffer(T* bufferToDeallocate)
-    {
-        Allocator::freeVectorBacking(bufferToDeallocate);
-    }
-
-    bool expandBuffer(size_t newCapacity)
-    {
-        size_t sizeToAllocate = allocationSize(newCapacity);
-        if (Allocator::expandVectorBacking(m_buffer, sizeToAllocate)) {
-            m_capacity = sizeToAllocate / sizeof(T);
-            return true;
-        }
-        return false;
-    }
-
-    inline bool shrinkBuffer(size_t newCapacity)
-    {
-        ASSERT(newCapacity < capacity());
-        size_t sizeToAllocate = allocationSize(newCapacity);
-        if (Allocator::shrinkVectorBacking(m_buffer, allocationSize(capacity()), sizeToAllocate)) {
-            m_capacity = sizeToAllocate / sizeof(T);
-            return true;
-        }
-        return false;
-    }
-
-    void resetBufferPointer()
-    {
-        m_buffer = nullptr;
-        m_capacity = 0;
-    }
-
-    void swapVectorBuffer(VectorBuffer<T, 0, Allocator>& other)
-    {
-        std::swap(m_buffer, other.m_buffer);
-        std::swap(m_capacity, other.m_capacity);
-    }
-
-    using Base::allocateBuffer;
-    using Base::allocationSize;
-
-    using Base::buffer;
-    using Base::capacity;
-
-    using Base::clearUnusedSlots;
-    using Base::checkUnusedSlots;
-
-    bool hasOutOfLineBuffer() const
-    {
-        // When inlineCapacity is 0 we have an out of line buffer if we have a
-        // buffer.
-        return buffer();
-    }
-
-protected:
-    using Base::m_size;
-
-private:
-    using Base::m_buffer;
-    using Base::m_capacity;
+ private:
+  typedef VectorBufferBase<T, false, Allocator> Base;
+
+ public:
+  VectorBuffer() {
+  }
+
+  VectorBuffer(size_t capacity) {
+    // Calling malloc(0) might take a lock and may actually do an allocation
+    // on some systems.
+    if (capacity)
+      allocateBuffer(capacity);
+  }
+
+  void destruct() {
+    deallocateBuffer(m_buffer);
+    m_buffer = nullptr;
+  }
+
+  void deallocateBuffer(T* bufferToDeallocate) {
+    Allocator::freeVectorBacking(bufferToDeallocate);
+  }
+
+  bool expandBuffer(size_t newCapacity) {
+    size_t sizeToAllocate = allocationSize(newCapacity);
+    if (Allocator::expandVectorBacking(m_buffer, sizeToAllocate)) {
+      m_capacity = sizeToAllocate / sizeof(T);
+      return true;
+    }
+    return false;
+  }
+
+  inline bool shrinkBuffer(size_t newCapacity) {
+    ASSERT(newCapacity < capacity());
+    size_t sizeToAllocate = allocationSize(newCapacity);
+    if (Allocator::shrinkVectorBacking(m_buffer, allocationSize(capacity()), sizeToAllocate)) {
+      m_capacity = sizeToAllocate / sizeof(T);
+      return true;
+    }
+    return false;
+  }
+
+  void resetBufferPointer() {
+    m_buffer = nullptr;
+    m_capacity = 0;
+  }
+
+  void swapVectorBuffer(VectorBuffer<T, 0, Allocator>& other) {
+    std::swap(m_buffer, other.m_buffer);
+    std::swap(m_capacity, other.m_capacity);
+  }
+
+  using Base::allocateBuffer;
+  using Base::allocationSize;
+
+  using Base::buffer;
+  using Base::capacity;
+
+  using Base::clearUnusedSlots;
+  using Base::checkUnusedSlots;
+
+  bool hasOutOfLineBuffer() const {
+    // When inlineCapacity is 0 we have an out of line buffer if we have a
+    // buffer.
+    return buffer();
+  }
+
+ protected:
+  using Base::m_size;
+
+ private:
+  using Base::m_buffer;
+  using Base::m_capacity;
 };
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 class VectorBuffer : protected VectorBufferBase<T, true, Allocator> {
-    WTF_MAKE_NONCOPYABLE(VectorBuffer);
-    typedef VectorBufferBase<T, true, Allocator> Base;
-
-public:
-    VectorBuffer()
-        : Base(inlineBuffer(), inlineCapacity)
-    {
-    }
-
-    VectorBuffer(size_t capacity)
-        : Base(inlineBuffer(), inlineCapacity)
-    {
-        if (capacity > inlineCapacity)
-            Base::allocateBuffer(capacity);
-    }
-
-    void destruct()
-    {
-        deallocateBuffer(m_buffer);
-        m_buffer = nullptr;
-    }
-
-    NEVER_INLINE void reallyDeallocateBuffer(T* bufferToDeallocate)
-    {
-        Allocator::freeInlineVectorBacking(bufferToDeallocate);
-    }
-
-    void deallocateBuffer(T* bufferToDeallocate)
-    {
-        if (UNLIKELY(bufferToDeallocate != inlineBuffer()))
-            reallyDeallocateBuffer(bufferToDeallocate);
-    }
-
-    bool expandBuffer(size_t newCapacity)
-    {
-        ASSERT(newCapacity > inlineCapacity);
-        if (m_buffer == inlineBuffer())
-            return false;
-
-        size_t sizeToAllocate = allocationSize(newCapacity);
-        if (Allocator::expandInlineVectorBacking(m_buffer, sizeToAllocate)) {
-            m_capacity = sizeToAllocate / sizeof(T);
-            return true;
-        }
-        return false;
-    }
-
-    inline bool shrinkBuffer(size_t newCapacity)
-    {
-        ASSERT(newCapacity < capacity());
-        if (newCapacity <= inlineCapacity) {
-            // We need to switch to inlineBuffer.  Vector::shrinkCapacity will
-            // handle it.
-            return false;
-        }
-        ASSERT(m_buffer != inlineBuffer());
-        size_t newSize = allocationSize(newCapacity);
-        if (!Allocator::shrinkInlineVectorBacking(m_buffer, allocationSize(capacity()), newSize))
-            return false;
-        m_capacity = newSize / sizeof(T);
-        return true;
-    }
-
-    void resetBufferPointer()
-    {
-        m_buffer = inlineBuffer();
-        m_capacity = inlineCapacity;
-    }
-
-    void allocateBuffer(size_t newCapacity)
-    {
-        // FIXME: This should ASSERT(!m_buffer) to catch misuse/leaks.
-        if (newCapacity > inlineCapacity)
-            Base::allocateBuffer(newCapacity);
-        else
-            resetBufferPointer();
-    }
-
-    void allocateExpandedBuffer(size_t newCapacity)
-    {
-        if (newCapacity > inlineCapacity)
-            Base::allocateExpandedBuffer(newCapacity);
-        else
-            resetBufferPointer();
-    }
-
-    size_t allocationSize(size_t capacity) const
-    {
-        if (capacity <= inlineCapacity)
-            return m_inlineBufferSize;
-        return Base::allocationSize(capacity);
-    }
-
-    void swapVectorBuffer(VectorBuffer<T, inlineCapacity, Allocator>& other)
-    {
-        typedef VectorTypeOperations<T> TypeOperations;
-
-        if (buffer() == inlineBuffer() && other.buffer() == other.inlineBuffer()) {
-            ASSERT(m_capacity == other.m_capacity);
-            if (m_size > other.m_size) {
-                ANNOTATE_CHANGE_SIZE(other.inlineBuffer(), inlineCapacity, other.m_size, m_size);
-                TypeOperations::swap(inlineBuffer(), inlineBuffer() + other.m_size, other.inlineBuffer());
-                TypeOperations::move(inlineBuffer() + other.m_size, inlineBuffer() + m_size, other.inlineBuffer() + other.m_size);
-                Base::clearUnusedSlots(inlineBuffer() + other.m_size, inlineBuffer() + m_size);
-                ANNOTATE_CHANGE_SIZE(inlineBuffer(), inlineCapacity, m_size, other.m_size);
-            } else {
-                ANNOTATE_CHANGE_SIZE(inlineBuffer(), inlineCapacity, m_size, other.m_size);
-                TypeOperations::swap(inlineBuffer(), inlineBuffer() + m_size, other.inlineBuffer());
-                TypeOperations::move(other.inlineBuffer() + m_size, other.inlineBuffer() + other.m_size, inlineBuffer() + m_size);
-                Base::clearUnusedSlots(other.inlineBuffer() + m_size, other.inlineBuffer() + other.m_size);
-                ANNOTATE_CHANGE_SIZE(other.inlineBuffer(), inlineCapacity, other.m_size, m_size);
-            }
-        } else if (buffer() == inlineBuffer()) {
-            ANNOTATE_DELETE_BUFFER(m_buffer, inlineCapacity, m_size);
-            m_buffer = other.m_buffer;
-            other.m_buffer = other.inlineBuffer();
-            ANNOTATE_NEW_BUFFER(other.m_buffer, inlineCapacity, m_size);
-            TypeOperations::move(inlineBuffer(), inlineBuffer() + m_size, other.inlineBuffer());
-            Base::clearUnusedSlots(inlineBuffer(), inlineBuffer() + m_size);
-            std::swap(m_capacity, other.m_capacity);
-        } else if (other.buffer() == other.inlineBuffer()) {
-            ANNOTATE_DELETE_BUFFER(other.m_buffer, inlineCapacity, other.m_size);
-            other.m_buffer = m_buffer;
-            m_buffer = inlineBuffer();
-            ANNOTATE_NEW_BUFFER(m_buffer, inlineCapacity, other.m_size);
-            TypeOperations::move(other.inlineBuffer(), other.inlineBuffer() + other.m_size, inlineBuffer());
-            Base::clearUnusedSlots(other.inlineBuffer(), other.inlineBuffer() + other.m_size);
-            std::swap(m_capacity, other.m_capacity);
-        } else {
-            std::swap(m_buffer, other.m_buffer);
-            std::swap(m_capacity, other.m_capacity);
-        }
-    }
-
-    using Base::buffer;
-    using Base::capacity;
-
-    bool hasOutOfLineBuffer() const
-    {
-        return buffer() && buffer() != inlineBuffer();
-    }
-
-protected:
-    using Base::m_size;
-
-private:
-    using Base::m_buffer;
-    using Base::m_capacity;
-
-    static const size_t m_inlineBufferSize = inlineCapacity * sizeof(T);
-    T* inlineBuffer() { return reinterpret_cast_ptr<T*>(m_inlineBuffer.buffer); }
-    const T* inlineBuffer() const { return reinterpret_cast_ptr<const T*>(m_inlineBuffer.buffer); }
-
-    AlignedBuffer<m_inlineBufferSize, WTF_ALIGN_OF(T)> m_inlineBuffer;
-    template <typename U, size_t inlineBuffer, typename V>
-    friend class Deque;
+  WTF_MAKE_NONCOPYABLE(VectorBuffer);
+  typedef VectorBufferBase<T, true, Allocator> Base;
+
+ public:
+  VectorBuffer()
+      : Base(inlineBuffer(), inlineCapacity) {
+  }
+
+  VectorBuffer(size_t capacity)
+      : Base(inlineBuffer(), inlineCapacity) {
+    if (capacity > inlineCapacity)
+      Base::allocateBuffer(capacity);
+  }
+
+  void destruct() {
+    deallocateBuffer(m_buffer);
+    m_buffer = nullptr;
+  }
+
+  NEVER_INLINE void reallyDeallocateBuffer(T* bufferToDeallocate) {
+    Allocator::freeInlineVectorBacking(bufferToDeallocate);
+  }
+
+  void deallocateBuffer(T* bufferToDeallocate) {
+    if (UNLIKELY(bufferToDeallocate != inlineBuffer()))
+      reallyDeallocateBuffer(bufferToDeallocate);
+  }
+
+  bool expandBuffer(size_t newCapacity) {
+    ASSERT(newCapacity > inlineCapacity);
+    if (m_buffer == inlineBuffer())
+      return false;
+
+    size_t sizeToAllocate = allocationSize(newCapacity);
+    if (Allocator::expandInlineVectorBacking(m_buffer, sizeToAllocate)) {
+      m_capacity = sizeToAllocate / sizeof(T);
+      return true;
+    }
+    return false;
+  }
+
+  inline bool shrinkBuffer(size_t newCapacity) {
+    ASSERT(newCapacity < capacity());
+    if (newCapacity <= inlineCapacity) {
+      // We need to switch to inlineBuffer.  Vector::shrinkCapacity will
+      // handle it.
+      return false;
+    }
+    ASSERT(m_buffer != inlineBuffer());
+    size_t newSize = allocationSize(newCapacity);
+    if (!Allocator::shrinkInlineVectorBacking(m_buffer, allocationSize(capacity()), newSize))
+      return false;
+    m_capacity = newSize / sizeof(T);
+    return true;
+  }
+
+  void resetBufferPointer() {
+    m_buffer = inlineBuffer();
+    m_capacity = inlineCapacity;
+  }
+
+  void allocateBuffer(size_t newCapacity) {
+    // FIXME: This should ASSERT(!m_buffer) to catch misuse/leaks.
+    if (newCapacity > inlineCapacity)
+      Base::allocateBuffer(newCapacity);
+    else
+      resetBufferPointer();
+  }
+
+  void allocateExpandedBuffer(size_t newCapacity) {
+    if (newCapacity > inlineCapacity)
+      Base::allocateExpandedBuffer(newCapacity);
+    else
+      resetBufferPointer();
+  }
+
+  size_t allocationSize(size_t capacity) const {
+    if (capacity <= inlineCapacity)
+      return m_inlineBufferSize;
+    return Base::allocationSize(capacity);
+  }
+
+  void swapVectorBuffer(VectorBuffer<T, inlineCapacity, Allocator>& other) {
+    typedef VectorTypeOperations<T> TypeOperations;
+
+    if (buffer() == inlineBuffer() && other.buffer() == other.inlineBuffer()) {
+      ASSERT(m_capacity == other.m_capacity);
+      if (m_size > other.m_size) {
+        ANNOTATE_CHANGE_SIZE(other.inlineBuffer(), inlineCapacity, other.m_size, m_size);
+        TypeOperations::swap(inlineBuffer(), inlineBuffer() + other.m_size, other.inlineBuffer());
+        TypeOperations::move(inlineBuffer() + other.m_size, inlineBuffer() + m_size, other.inlineBuffer() + other.m_size);
+        Base::clearUnusedSlots(inlineBuffer() + other.m_size, inlineBuffer() + m_size);
+        ANNOTATE_CHANGE_SIZE(inlineBuffer(), inlineCapacity, m_size, other.m_size);
+      } else {
+        ANNOTATE_CHANGE_SIZE(inlineBuffer(), inlineCapacity, m_size, other.m_size);
+        TypeOperations::swap(inlineBuffer(), inlineBuffer() + m_size, other.inlineBuffer());
+        TypeOperations::move(other.inlineBuffer() + m_size, other.inlineBuffer() + other.m_size, inlineBuffer() + m_size);
+        Base::clearUnusedSlots(other.inlineBuffer() + m_size, other.inlineBuffer() + other.m_size);
+        ANNOTATE_CHANGE_SIZE(other.inlineBuffer(), inlineCapacity, other.m_size, m_size);
+      }
+    } else if (buffer() == inlineBuffer()) {
+      ANNOTATE_DELETE_BUFFER(m_buffer, inlineCapacity, m_size);
+      m_buffer = other.m_buffer;
+      other.m_buffer = other.inlineBuffer();
+      ANNOTATE_NEW_BUFFER(other.m_buffer, inlineCapacity, m_size);
+      TypeOperations::move(inlineBuffer(), inlineBuffer() + m_size, other.inlineBuffer());
+      Base::clearUnusedSlots(inlineBuffer(), inlineBuffer() + m_size);
+      std::swap(m_capacity, other.m_capacity);
+    } else if (other.buffer() == other.inlineBuffer()) {
+      ANNOTATE_DELETE_BUFFER(other.m_buffer, inlineCapacity, other.m_size);
+      other.m_buffer = m_buffer;
+      m_buffer = inlineBuffer();
+      ANNOTATE_NEW_BUFFER(m_buffer, inlineCapacity, other.m_size);
+      TypeOperations::move(other.inlineBuffer(), other.inlineBuffer() + other.m_size, inlineBuffer());
+      Base::clearUnusedSlots(other.inlineBuffer(), other.inlineBuffer() + other.m_size);
+      std::swap(m_capacity, other.m_capacity);
+    } else {
+      std::swap(m_buffer, other.m_buffer);
+      std::swap(m_capacity, other.m_capacity);
+    }
+  }
+
+  using Base::buffer;
+  using Base::capacity;
+
+  bool hasOutOfLineBuffer() const {
+    return buffer() && buffer() != inlineBuffer();
+  }
+
+ protected:
+  using Base::m_size;
+
+ private:
+  using Base::m_buffer;
+  using Base::m_capacity;
+
+  static const size_t m_inlineBufferSize = inlineCapacity * sizeof(T);
+  T* inlineBuffer() { return reinterpret_cast_ptr<T*>(m_inlineBuffer.buffer); }
+  const T* inlineBuffer() const { return reinterpret_cast_ptr<const T*>(m_inlineBuffer.buffer); }
+
+  AlignedBuffer<m_inlineBufferSize, WTF_ALIGN_OF(T)> m_inlineBuffer;
+  template <typename U, size_t inlineBuffer, typename V>
+  friend class Deque;
 };
 
-template <typename T, size_t inlineCapacity = 0, typename Allocator = PartitionAllocator> // Heap-allocated vectors with no inlineCapacity never need a destructor.
+template <typename T, size_t inlineCapacity = 0, typename Allocator = PartitionAllocator>  // Heap-allocated vectors with no inlineCapacity never need a destructor.
 class Vector : private VectorBuffer<T, INLINE_CAPACITY, Allocator>, public ConditionalDestructor<Vector<T, INLINE_CAPACITY, Allocator>, (INLINE_CAPACITY == 0) && Allocator::isGarbageCollected> {
-    WTF_USE_ALLOCATOR(Vector, Allocator);
-    typedef VectorBuffer<T, INLINE_CAPACITY, Allocator> Base;
-    typedef VectorTypeOperations<T> TypeOperations;
-
-public:
-    typedef T ValueType;
-    typedef T value_type;
-
-    typedef T* iterator;
-    typedef const T* const_iterator;
-    typedef std::reverse_iterator<iterator> reverse_iterator;
-    typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
-
-    Vector()
-    {
-        static_assert(!IsPolymorphic<T>::value || !VectorTraits<T>::canInitializeWithMemset, "Cannot initialize with memset if there is a vtable");
+  WTF_USE_ALLOCATOR(Vector, Allocator);
+  typedef VectorBuffer<T, INLINE_CAPACITY, Allocator> Base;
+  typedef VectorTypeOperations<T> TypeOperations;
+
+ public:
+  typedef T ValueType;
+  typedef T value_type;
+
+  typedef T* iterator;
+  typedef const T* const_iterator;
+  typedef std::reverse_iterator<iterator> reverse_iterator;
+  typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+
+  Vector() {
+    static_assert(!IsPolymorphic<T>::value || !VectorTraits<T>::canInitializeWithMemset, "Cannot initialize with memset if there is a vtable");
 #if ENABLE(OILPAN)
-        static_assert(Allocator::isGarbageCollected || !AllowsOnlyPlacementNew<T>::value || !NeedsTracing<T>::value, "Cannot put DISALLOW_NEW_EXCEPT_PLACEMENT_NEW objects that have trace methods into an off-heap Vector");
+    static_assert(Allocator::isGarbageCollected || !AllowsOnlyPlacementNew<T>::value || !NeedsTracing<T>::value, "Cannot put DISALLOW_NEW_EXCEPT_PLACEMENT_NEW objects that have trace methods into an off-heap Vector");
 #endif
-        static_assert(Allocator::isGarbageCollected || !IsPointerToGarbageCollectedType<T>::value, "Cannot put raw pointers to garbage-collected classes into an off-heap Vector.  Use HeapVector<Member<T>> instead.");
-
-        ANNOTATE_NEW_BUFFER(begin(), capacity(), 0);
-        m_size = 0;
-    }
-
-    explicit Vector(size_t size)
-        : Base(size)
-    {
-        static_assert(!IsPolymorphic<T>::value || !VectorTraits<T>::canInitializeWithMemset, "Cannot initialize with memset if there is a vtable");
+    static_assert(Allocator::isGarbageCollected || !IsPointerToGarbageCollectedType<T>::value, "Cannot put raw pointers to garbage-collected classes into an off-heap Vector.  Use HeapVector<Member<T>> instead.");
+
+    ANNOTATE_NEW_BUFFER(begin(), capacity(), 0);
+    m_size = 0;
+  }
+
+  explicit Vector(size_t size)
+      : Base(size) {
+    static_assert(!IsPolymorphic<T>::value || !VectorTraits<T>::canInitializeWithMemset, "Cannot initialize with memset if there is a vtable");
 #if ENABLE(OILPAN)
-        static_assert(Allocator::isGarbageCollected || !AllowsOnlyPlacementNew<T>::value || !NeedsTracing<T>::value, "Cannot put DISALLOW_NEW_EXCEPT_PLACEMENT_NEW objects that have trace methods into an off-heap Vector");
+    static_assert(Allocator::isGarbageCollected || !AllowsOnlyPlacementNew<T>::value || !NeedsTracing<T>::value, "Cannot put DISALLOW_NEW_EXCEPT_PLACEMENT_NEW objects that have trace methods into an off-heap Vector");
 #endif
-        static_assert(Allocator::isGarbageCollected || !IsPointerToGarbageCollectedType<T>::value, "Cannot put raw pointers to garbage-collected classes into an off-heap Vector.  Use HeapVector<Member<T>> instead.");
-
-        ANNOTATE_NEW_BUFFER(begin(), capacity(), size);
-        m_size = size;
-        TypeOperations::initialize(begin(), end());
-    }
-
-    // Off-GC-heap vectors: Destructor should be called.
-    // On-GC-heap vectors: Destructor should be called for inline buffers (if
-    // any) but destructor shouldn't be called for vector backing since it is
-    // managed by the traced GC heap.
-    void finalize()
-    {
-        if (!INLINE_CAPACITY) {
-            if (LIKELY(!Base::buffer()))
-                return;
-        }
-        ANNOTATE_DELETE_BUFFER(begin(), capacity(), m_size);
-        if (LIKELY(m_size) && !(Allocator::isGarbageCollected && this->hasOutOfLineBuffer())) {
-            TypeOperations::destruct(begin(), end());
-            m_size = 0; // Partial protection against use-after-free.
-        }
-
-        Base::destruct();
-    }
-
-    void finalizeGarbageCollectedObject()
-    {
-        finalize();
-    }
-
-    Vector(const Vector&);
-    template <size_t otherCapacity>
-    explicit Vector(const Vector<T, otherCapacity, Allocator>&);
-
-    Vector& operator=(const Vector&);
-    template <size_t otherCapacity>
-    Vector& operator=(const Vector<T, otherCapacity, Allocator>&);
-
-    Vector(Vector&&);
-    Vector& operator=(Vector&&);
-
-    size_t size() const { return m_size; }
-    size_t capacity() const { return Base::capacity(); }
-    bool isEmpty() const { return !size(); }
-
-    T& at(size_t i)
-    {
-        RELEASE_ASSERT(i < size());
-        return Base::buffer()[i];
-    }
-    const T& at(size_t i) const
-    {
-        RELEASE_ASSERT(i < size());
-        return Base::buffer()[i];
-    }
-
-    T& operator[](size_t i) { return at(i); }
-    const T& operator[](size_t i) const { return at(i); }
-
-    T* data() { return Base::buffer(); }
-    const T* data() const { return Base::buffer(); }
-
-    iterator begin() { return data(); }
-    iterator end() { return begin() + m_size; }
-    const_iterator begin() const { return data(); }
-    const_iterator end() const { return begin() + m_size; }
-
-    reverse_iterator rbegin() { return reverse_iterator(end()); }
-    reverse_iterator rend() { return reverse_iterator(begin()); }
-    const_reverse_iterator rbegin() const { return const_reverse_iterator(end()); }
-    const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
-
-    T& first() { return at(0); }
-    const T& first() const { return at(0); }
-    T& last() { return at(size() - 1); }
-    const T& last() const { return at(size() - 1); }
-
-    template <typename U> bool contains(const U&) const;
-    template <typename U> size_t find(const U&) const;
-    template <typename U> size_t reverseFind(const U&) const;
-
-    void shrink(size_t);
-    void grow(size_t);
-    void resize(size_t);
-    void reserveCapacity(size_t newCapacity);
-    void reserveInitialCapacity(size_t initialCapacity);
-    void shrinkToFit() { shrinkCapacity(size()); }
-    void shrinkToReasonableCapacity()
-    {
-        if (size() * 2 < capacity())
-            shrinkCapacity(size() + size() / 4 + 1);
-    }
-
-    void clear() { shrinkCapacity(0); }
-
-    template <typename U> void append(const U*, size_t);
-    template <typename U> void append(const U&);
-    template <typename U> void uncheckedAppend(const U& val);
-    template <typename U, size_t otherCapacity, typename V> void appendVector(const Vector<U, otherCapacity, V>&);
-
-    template <typename U> void insert(size_t position, const U*, size_t);
-    template <typename U> void insert(size_t position, const U&);
-    template <typename U, size_t c, typename V> void insert(size_t position, const Vector<U, c, V>&);
-
-    template <typename U> void prepend(const U*, size_t);
-    template <typename U> void prepend(const U&);
-    template <typename U, size_t c, typename V> void prepend(const Vector<U, c, V>&);
-
-    void remove(size_t position);
-    void remove(size_t position, size_t length);
-
-    void removeLast()
-    {
-        ASSERT(!isEmpty());
-        shrink(size() - 1);
-    }
-
-    Vector(size_t size, const T& val)
-        : Base(size)
-    {
-        ANNOTATE_NEW_BUFFER(begin(), capacity(), size);
-        m_size = size;
-        TypeOperations::uninitializedFill(begin(), end(), val);
-    }
-
-    void fill(const T&, size_t);
-    void fill(const T& val) { fill(val, size()); }
-
-    template <typename Iterator> void appendRange(Iterator start, Iterator end);
-
-    void swap(Vector& other)
-    {
-        Base::swapVectorBuffer(other);
-        std::swap(m_size, other.m_size);
-    }
-
-    void reverse();
-
-    template <typename VisitorDispatcher> void trace(VisitorDispatcher);
-
-protected:
-    using Base::checkUnusedSlots;
-    using Base::clearUnusedSlots;
-
-private:
-    void expandCapacity(size_t newMinCapacity);
-    const T* expandCapacity(size_t newMinCapacity, const T*);
-    template <typename U> U* expandCapacity(size_t newMinCapacity, U*);
-    void shrinkCapacity(size_t newCapacity);
-    template <typename U> void appendSlowCase(const U&);
-
-    using Base::m_size;
-    using Base::buffer;
-    using Base::capacity;
-    using Base::swapVectorBuffer;
-    using Base::allocateBuffer;
-    using Base::allocationSize;
+    static_assert(Allocator::isGarbageCollected || !IsPointerToGarbageCollectedType<T>::value, "Cannot put raw pointers to garbage-collected classes into an off-heap Vector.  Use HeapVector<Member<T>> instead.");
+
+    ANNOTATE_NEW_BUFFER(begin(), capacity(), size);
+    m_size = size;
+    TypeOperations::initialize(begin(), end());
+  }
+
+  // Off-GC-heap vectors: Destructor should be called.
+  // On-GC-heap vectors: Destructor should be called for inline buffers (if
+  // any) but destructor shouldn't be called for vector backing since it is
+  // managed by the traced GC heap.
+  void finalize() {
+    if (!INLINE_CAPACITY) {
+      if (LIKELY(!Base::buffer()))
+        return;
+    }
+    ANNOTATE_DELETE_BUFFER(begin(), capacity(), m_size);
+    if (LIKELY(m_size) && !(Allocator::isGarbageCollected && this->hasOutOfLineBuffer())) {
+      TypeOperations::destruct(begin(), end());
+      m_size = 0;  // Partial protection against use-after-free.
+    }
+
+    Base::destruct();
+  }
+
+  void finalizeGarbageCollectedObject() {
+    finalize();
+  }
+
+  Vector(const Vector&);
+  template <size_t otherCapacity>
+  explicit Vector(const Vector<T, otherCapacity, Allocator>&);
+
+  Vector& operator=(const Vector&);
+  template <size_t otherCapacity>
+  Vector& operator=(const Vector<T, otherCapacity, Allocator>&);
+
+  Vector(Vector&&);
+  Vector& operator=(Vector&&);
+
+  size_t size() const { return m_size; }
+  size_t capacity() const { return Base::capacity(); }
+  bool isEmpty() const { return !size(); }
+
+  T& at(size_t i) {
+    RELEASE_ASSERT(i < size());
+    return Base::buffer()[i];
+  }
+  const T& at(size_t i) const {
+    RELEASE_ASSERT(i < size());
+    return Base::buffer()[i];
+  }
+
+  T& operator[](size_t i) { return at(i); }
+  const T& operator[](size_t i) const { return at(i); }
+
+  T* data() { return Base::buffer(); }
+  const T* data() const { return Base::buffer(); }
+
+  iterator begin() { return data(); }
+  iterator end() { return begin() + m_size; }
+  const_iterator begin() const { return data(); }
+  const_iterator end() const { return begin() + m_size; }
+
+  reverse_iterator rbegin() { return reverse_iterator(end()); }
+  reverse_iterator rend() { return reverse_iterator(begin()); }
+  const_reverse_iterator rbegin() const { return const_reverse_iterator(end()); }
+  const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
+
+  T& first() { return at(0); }
+  const T& first() const { return at(0); }
+  T& last() { return at(size() - 1); }
+  const T& last() const { return at(size() - 1); }
+
+  template <typename U>
+  bool contains(const U&) const;
+  template <typename U>
+  size_t find(const U&) const;
+  template <typename U>
+  size_t reverseFind(const U&) const;
+
+  void shrink(size_t);
+  void grow(size_t);
+  void resize(size_t);
+  void reserveCapacity(size_t newCapacity);
+  void reserveInitialCapacity(size_t initialCapacity);
+  void shrinkToFit() { shrinkCapacity(size()); }
+  void shrinkToReasonableCapacity() {
+    if (size() * 2 < capacity())
+      shrinkCapacity(size() + size() / 4 + 1);
+  }
+
+  void clear() { shrinkCapacity(0); }
+
+  template <typename U>
+  void append(const U*, size_t);
+  template <typename U>
+  void append(const U&);
+  template <typename U>
+  void uncheckedAppend(const U& val);
+  template <typename U, size_t otherCapacity, typename V>
+  void appendVector(const Vector<U, otherCapacity, V>&);
+
+  template <typename U>
+  void insert(size_t position, const U*, size_t);
+  template <typename U>
+  void insert(size_t position, const U&);
+  template <typename U, size_t c, typename V>
+  void insert(size_t position, const Vector<U, c, V>&);
+
+  template <typename U>
+  void prepend(const U*, size_t);
+  template <typename U>
+  void prepend(const U&);
+  template <typename U, size_t c, typename V>
+  void prepend(const Vector<U, c, V>&);
+
+  void remove(size_t position);
+  void remove(size_t position, size_t length);
+
+  void removeLast() {
+    ASSERT(!isEmpty());
+    shrink(size() - 1);
+  }
+
+  Vector(size_t size, const T& val)
+      : Base(size) {
+    ANNOTATE_NEW_BUFFER(begin(), capacity(), size);
+    m_size = size;
+    TypeOperations::uninitializedFill(begin(), end(), val);
+  }
+
+  void fill(const T&, size_t);
+  void fill(const T& val) { fill(val, size()); }
+
+  template <typename Iterator>
+  void appendRange(Iterator start, Iterator end);
+
+  void swap(Vector& other) {
+    Base::swapVectorBuffer(other);
+    std::swap(m_size, other.m_size);
+  }
+
+  void reverse();
+
+  template <typename VisitorDispatcher>
+  void trace(VisitorDispatcher);
+
+ protected:
+  using Base::checkUnusedSlots;
+  using Base::clearUnusedSlots;
+
+ private:
+  void expandCapacity(size_t newMinCapacity);
+  const T* expandCapacity(size_t newMinCapacity, const T*);
+  template <typename U>
+  U* expandCapacity(size_t newMinCapacity, U*);
+  void shrinkCapacity(size_t newCapacity);
+  template <typename U>
+  void appendSlowCase(const U&);
+
+  using Base::m_size;
+  using Base::buffer;
+  using Base::capacity;
+  using Base::swapVectorBuffer;
+  using Base::allocateBuffer;
+  using Base::allocationSize;
 };
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 Vector<T, inlineCapacity, Allocator>::Vector(const Vector& other)
-    : Base(other.capacity())
-{
-    ANNOTATE_NEW_BUFFER(begin(), capacity(), other.size());
-    m_size = other.size();
-    TypeOperations::uninitializedCopy(other.begin(), other.end(), begin());
+    : Base(other.capacity()) {
+  ANNOTATE_NEW_BUFFER(begin(), capacity(), other.size());
+  m_size = other.size();
+  TypeOperations::uninitializedCopy(other.begin(), other.end(), begin());
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <size_t otherCapacity>
 Vector<T, inlineCapacity, Allocator>::Vector(const Vector<T, otherCapacity, Allocator>& other)
-    : Base(other.capacity())
-{
-    ANNOTATE_NEW_BUFFER(begin(), capacity(), other.size());
-    m_size = other.size();
-    TypeOperations::uninitializedCopy(other.begin(), other.end(), begin());
-}
-
-template <typename T, size_t inlineCapacity, typename Allocator>
-Vector<T, inlineCapacity, Allocator>& Vector<T, inlineCapacity, Allocator>::operator=(const Vector<T, inlineCapacity, Allocator>& other)
-{
-    if (UNLIKELY(&other == this))
-        return *this;
-
-    if (size() > other.size()) {
-        shrink(other.size());
-    } else if (other.size() > capacity()) {
-        clear();
-        reserveCapacity(other.size());
-        ASSERT(begin());
-    }
-
-    ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, other.size());
-    std::copy(other.begin(), other.begin() + size(), begin());
-    TypeOperations::uninitializedCopy(other.begin() + size(), other.end(), end());
-    m_size = other.size();
-
+    : Base(other.capacity()) {
+  ANNOTATE_NEW_BUFFER(begin(), capacity(), other.size());
+  m_size = other.size();
+  TypeOperations::uninitializedCopy(other.begin(), other.end(), begin());
+}
+
+template <typename T, size_t inlineCapacity, typename Allocator>
+Vector<T, inlineCapacity, Allocator>& Vector<T, inlineCapacity, Allocator>::operator=(const Vector<T, inlineCapacity, Allocator>& other) {
+  if (UNLIKELY(&other == this))
     return *this;
-}
-
-inline bool typelessPointersAreEqual(const void* a, const void* b) { return a == b; }
+
+  if (size() > other.size()) {
+    shrink(other.size());
+  } else if (other.size() > capacity()) {
+    clear();
+    reserveCapacity(other.size());
+    ASSERT(begin());
+  }
+
+  ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, other.size());
+  std::copy(other.begin(), other.begin() + size(), begin());
+  TypeOperations::uninitializedCopy(other.begin() + size(), other.end(), end());
+  m_size = other.size();
+
+  return *this;
+}
+
+inline bool typelessPointersAreEqual(const void* a, const void* b) {
+  return a == b;
+}
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <size_t otherCapacity>
-Vector<T, inlineCapacity, Allocator>& Vector<T, inlineCapacity, Allocator>::operator=(const Vector<T, otherCapacity, Allocator>& other)
-{
-    // If the inline capacities match, we should call the more specific
-    // template.  If the inline capacities don't match, the two objects
-    // shouldn't be allocated the same address.
-    ASSERT(!typelessPointersAreEqual(&other, this));
-
-    if (size() > other.size()) {
-        shrink(other.size());
-    } else if (other.size() > capacity()) {
-        clear();
-        reserveCapacity(other.size());
-        ASSERT(begin());
-    }
-
-    ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, other.size());
-    std::copy(other.begin(), other.begin() + size(), begin());
-    TypeOperations::uninitializedCopy(other.begin() + size(), other.end(), end());
-    m_size = other.size();
-
-    return *this;
-}
-
-template <typename T, size_t inlineCapacity, typename Allocator>
-Vector<T, inlineCapacity, Allocator>::Vector(Vector<T, inlineCapacity, Allocator>&& other)
-{
-    m_size = 0;
-    // It's a little weird to implement a move constructor using swap but this
-    // way we don't have to add a move constructor to VectorBuffer.
-    swap(other);
-}
-
-template <typename T, size_t inlineCapacity, typename Allocator>
-Vector<T, inlineCapacity, Allocator>& Vector<T, inlineCapacity, Allocator>::operator=(Vector<T, inlineCapacity, Allocator>&& other)
-{
-    swap(other);
-    return *this;
+Vector<T, inlineCapacity, Allocator>& Vector<T, inlineCapacity, Allocator>::operator=(const Vector<T, otherCapacity, Allocator>& other) {
+  // If the inline capacities match, we should call the more specific
+  // template.  If the inline capacities don't match, the two objects
+  // shouldn't be allocated the same address.
+  ASSERT(!typelessPointersAreEqual(&other, this));
+
+  if (size() > other.size()) {
+    shrink(other.size());
+  } else if (other.size() > capacity()) {
+    clear();
+    reserveCapacity(other.size());
+    ASSERT(begin());
+  }
+
+  ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, other.size());
+  std::copy(other.begin(), other.begin() + size(), begin());
+  TypeOperations::uninitializedCopy(other.begin() + size(), other.end(), end());
+  m_size = other.size();
+
+  return *this;
+}
+
+template <typename T, size_t inlineCapacity, typename Allocator>
+Vector<T, inlineCapacity, Allocator>::Vector(Vector<T, inlineCapacity, Allocator>&& other) {
+  m_size = 0;
+  // It's a little weird to implement a move constructor using swap but this
+  // way we don't have to add a move constructor to VectorBuffer.
+  swap(other);
+}
+
+template <typename T, size_t inlineCapacity, typename Allocator>
+Vector<T, inlineCapacity, Allocator>& Vector<T, inlineCapacity, Allocator>::operator=(Vector<T, inlineCapacity, Allocator>&& other) {
+  swap(other);
+  return *this;
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U>
-bool Vector<T, inlineCapacity, Allocator>::contains(const U& value) const
-{
-    return find(value) != kNotFound;
+bool Vector<T, inlineCapacity, Allocator>::contains(const U& value) const {
+  return find(value) != kNotFound;
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U>
-size_t Vector<T, inlineCapacity, Allocator>::find(const U& value) const
-{
-    const T* b = begin();
-    const T* e = end();
-    for (const T* iter = b; iter < e; ++iter) {
-        if (*iter == value)
-            return iter - b;
-    }
-    return kNotFound;
+size_t Vector<T, inlineCapacity, Allocator>::find(const U& value) const {
+  const T* b = begin();
+  const T* e = end();
+  for (const T* iter = b; iter < e; ++iter) {
+    if (*iter == value)
+      return iter - b;
+  }
+  return kNotFound;
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U>
-size_t Vector<T, inlineCapacity, Allocator>::reverseFind(const U& value) const
-{
-    const T* b = begin();
-    const T* iter = end();
-    while (iter > b) {
-        --iter;
-        if (*iter == value)
-            return iter - b;
-    }
-    return kNotFound;
-}
-
-template <typename T, size_t inlineCapacity, typename Allocator>
-void Vector<T, inlineCapacity, Allocator>::fill(const T& val, size_t newSize)
-{
-    if (size() > newSize) {
-        shrink(newSize);
-    } else if (newSize > capacity()) {
-        clear();
-        reserveCapacity(newSize);
-        ASSERT(begin());
-    }
-
-    ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, newSize);
-    std::fill(begin(), end(), val);
-    TypeOperations::uninitializedFill(end(), begin() + newSize, val);
-    m_size = newSize;
+size_t Vector<T, inlineCapacity, Allocator>::reverseFind(const U& value) const {
+  const T* b = begin();
+  const T* iter = end();
+  while (iter > b) {
+    --iter;
+    if (*iter == value)
+      return iter - b;
+  }
+  return kNotFound;
+}
+
+template <typename T, size_t inlineCapacity, typename Allocator>
+void Vector<T, inlineCapacity, Allocator>::fill(const T& val, size_t newSize) {
+  if (size() > newSize) {
+    shrink(newSize);
+  } else if (newSize > capacity()) {
+    clear();
+    reserveCapacity(newSize);
+    ASSERT(begin());
+  }
+
+  ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, newSize);
+  std::fill(begin(), end(), val);
+  TypeOperations::uninitializedFill(end(), begin() + newSize, val);
+  m_size = newSize;
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename Iterator>
-void Vector<T, inlineCapacity, Allocator>::appendRange(Iterator start, Iterator end)
-{
-    for (Iterator it = start; it != end; ++it)
-        append(*it);
-}
-
-template <typename T, size_t inlineCapacity, typename Allocator>
-void Vector<T, inlineCapacity, Allocator>::expandCapacity(size_t newMinCapacity)
-{
-    size_t oldCapacity = capacity();
-    size_t expandedCapacity = oldCapacity;
-    // We use a more aggressive expansion strategy for Vectors with inline
-    // storage.  This is because they are more likely to be on the stack, so the
-    // risk of heap bloat is minimized.  Furthermore, exceeding the inline
-    // capacity limit is not supposed to happen in the common case and may
-    // indicate a pathological condition or microbenchmark.
-    if (INLINE_CAPACITY) {
-        expandedCapacity *= 2;
-        // Check for integer overflow, which could happen in the 32-bit build.
-        RELEASE_ASSERT(expandedCapacity > oldCapacity);
-    } else {
-        // This cannot integer overflow.
-        // On 64-bit, the "expanded" integer is 32-bit, and any encroachment
-        // above 2^32 will fail allocation in allocateBuffer().  On 32-bit,
-        // there's not enough address space to hold the old and new buffers.  In
-        // addition, our underlying allocator is supposed to always fail on >
-        // (2^31 - 1) allocations.
-        expandedCapacity += (expandedCapacity / 4) + 1;
-    }
-    reserveCapacity(std::max(newMinCapacity, std::max(static_cast<size_t>(kInitialVectorSize), expandedCapacity)));
-}
-
-template <typename T, size_t inlineCapacity, typename Allocator>
-const T* Vector<T, inlineCapacity, Allocator>::expandCapacity(size_t newMinCapacity, const T* ptr)
-{
-    if (ptr < begin() || ptr >= end()) {
-        expandCapacity(newMinCapacity);
-        return ptr;
-    }
-    size_t index = ptr - begin();
-    expandCapacity(newMinCapacity);
-    return begin() + index;
-}
-
-template <typename T, size_t inlineCapacity, typename Allocator>
-template <typename U>
-inline U* Vector<T, inlineCapacity, Allocator>::expandCapacity(size_t newMinCapacity, U* ptr)
-{
+void Vector<T, inlineCapacity, Allocator>::appendRange(Iterator start, Iterator end) {
+  for (Iterator it = start; it != end; ++it)
+    append(*it);
+}
+
+template <typename T, size_t inlineCapacity, typename Allocator>
+void Vector<T, inlineCapacity, Allocator>::expandCapacity(size_t newMinCapacity) {
+  size_t oldCapacity = capacity();
+  size_t expandedCapacity = oldCapacity;
+  // We use a more aggressive expansion strategy for Vectors with inline
+  // storage.  This is because they are more likely to be on the stack, so the
+  // risk of heap bloat is minimized.  Furthermore, exceeding the inline
+  // capacity limit is not supposed to happen in the common case and may
+  // indicate a pathological condition or microbenchmark.
+  if (INLINE_CAPACITY) {
+    expandedCapacity *= 2;
+    // Check for integer overflow, which could happen in the 32-bit build.
+    RELEASE_ASSERT(expandedCapacity > oldCapacity);
+  } else {
+    // This cannot integer overflow.
+    // On 64-bit, the "expanded" integer is 32-bit, and any encroachment
+    // above 2^32 will fail allocation in allocateBuffer().  On 32-bit,
+    // there's not enough address space to hold the old and new buffers.  In
+    // addition, our underlying allocator is supposed to always fail on >
+    // (2^31 - 1) allocations.
+    expandedCapacity += (expandedCapacity / 4) + 1;
+  }
+  reserveCapacity(std::max(newMinCapacity, std::max(static_cast<size_t>(kInitialVectorSize), expandedCapacity)));
+}
+
+template <typename T, size_t inlineCapacity, typename Allocator>
+const T* Vector<T, inlineCapacity, Allocator>::expandCapacity(size_t newMinCapacity, const T* ptr) {
+  if (ptr < begin() || ptr >= end()) {
     expandCapacity(newMinCapacity);
     return ptr;
-}
-
-template <typename T, size_t inlineCapacity, typename Allocator>
-inline void Vector<T, inlineCapacity, Allocator>::resize(size_t size)
-{
-    if (size <= m_size) {
-        TypeOperations::destruct(begin() + size, end());
-        clearUnusedSlots(begin() + size, end());
-        ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, size);
-    } else {
-        if (size > capacity())
-            expandCapacity(size);
-        ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, size);
-        TypeOperations::initialize(end(), begin() + size);
-    }
-
-    m_size = size;
-}
-
-template <typename T, size_t inlineCapacity, typename Allocator>
-void Vector<T, inlineCapacity, Allocator>::shrink(size_t size)
-{
-    ASSERT(size <= m_size);
+  }
+  size_t index = ptr - begin();
+  expandCapacity(newMinCapacity);
+  return begin() + index;
+}
+
+template <typename T, size_t inlineCapacity, typename Allocator>
+template <typename U>
+inline U* Vector<T, inlineCapacity, Allocator>::expandCapacity(size_t newMinCapacity, U* ptr) {
+  expandCapacity(newMinCapacity);
+  return ptr;
+}
+
+template <typename T, size_t inlineCapacity, typename Allocator>
+inline void Vector<T, inlineCapacity, Allocator>::resize(size_t size) {
+  if (size <= m_size) {
     TypeOperations::destruct(begin() + size, end());
     clearUnusedSlots(begin() + size, end());
     ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, size);
-    m_size = size;
-}
-
-template <typename T, size_t inlineCapacity, typename Allocator>
-void Vector<T, inlineCapacity, Allocator>::grow(size_t size)
-{
-    ASSERT(size >= m_size);
+  } else {
     if (size > capacity())
-        expandCapacity(size);
+      expandCapacity(size);
     ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, size);
     TypeOperations::initialize(end(), begin() + size);
-    m_size = size;
-}
-
-template <typename T, size_t inlineCapacity, typename Allocator>
-void Vector<T, inlineCapacity, Allocator>::reserveCapacity(size_t newCapacity)
-{
-    if (UNLIKELY(newCapacity <= capacity()))
-        return;
-    T* oldBuffer = begin();
-    if (!oldBuffer) {
-        Base::allocateBuffer(newCapacity);
-        return;
-    }
+  }
+
+  m_size = size;
+}
+
+template <typename T, size_t inlineCapacity, typename Allocator>
+void Vector<T, inlineCapacity, Allocator>::shrink(size_t size) {
+  ASSERT(size <= m_size);
+  TypeOperations::destruct(begin() + size, end());
+  clearUnusedSlots(begin() + size, end());
+  ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, size);
+  m_size = size;
+}
+
+template <typename T, size_t inlineCapacity, typename Allocator>
+void Vector<T, inlineCapacity, Allocator>::grow(size_t size) {
+  ASSERT(size >= m_size);
+  if (size > capacity())
+    expandCapacity(size);
+  ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, size);
+  TypeOperations::initialize(end(), begin() + size);
+  m_size = size;
+}
+
+template <typename T, size_t inlineCapacity, typename Allocator>
+void Vector<T, inlineCapacity, Allocator>::reserveCapacity(size_t newCapacity) {
+  if (UNLIKELY(newCapacity <= capacity()))
+    return;
+  T* oldBuffer = begin();
+  if (!oldBuffer) {
+    Base::allocateBuffer(newCapacity);
+    return;
+  }
 #ifdef ANNOTATE_CONTIGUOUS_CONTAINER
-    size_t oldCapacity = capacity();
+  size_t oldCapacity = capacity();
 #endif
-    // The Allocator::isGarbageCollected check is not needed.  The check is just
-    // a static hint for a compiler to indicate that Base::expandBuffer returns
-    // false if Allocator is a PartitionAllocator.
-    if (Allocator::isGarbageCollected && Base::expandBuffer(newCapacity)) {
-        ANNOTATE_CHANGE_CAPACITY(begin(), oldCapacity, m_size, capacity());
-        return;
-    }
+  // The Allocator::isGarbageCollected check is not needed.  The check is just
+  // a static hint for a compiler to indicate that Base::expandBuffer returns
+  // false if Allocator is a PartitionAllocator.
+  if (Allocator::isGarbageCollected && Base::expandBuffer(newCapacity)) {
+    ANNOTATE_CHANGE_CAPACITY(begin(), oldCapacity, m_size, capacity());
+    return;
+  }
+  T* oldEnd = end();
+  Base::allocateExpandedBuffer(newCapacity);
+  ANNOTATE_NEW_BUFFER(begin(), capacity(), m_size);
+  TypeOperations::move(oldBuffer, oldEnd, begin());
+  clearUnusedSlots(oldBuffer, oldEnd);
+  ANNOTATE_DELETE_BUFFER(oldBuffer, oldCapacity, m_size);
+  Base::deallocateBuffer(oldBuffer);
+}
+
+template <typename T, size_t inlineCapacity, typename Allocator>
+inline void Vector<T, inlineCapacity, Allocator>::reserveInitialCapacity(size_t initialCapacity) {
+  ASSERT(!m_size);
+  ASSERT(capacity() == INLINE_CAPACITY);
+  if (initialCapacity > INLINE_CAPACITY) {
+    ANNOTATE_DELETE_BUFFER(begin(), capacity(), m_size);
+    Base::allocateBuffer(initialCapacity);
+    ANNOTATE_NEW_BUFFER(begin(), capacity(), m_size);
+  }
+}
+
+template <typename T, size_t inlineCapacity, typename Allocator>
+void Vector<T, inlineCapacity, Allocator>::shrinkCapacity(size_t newCapacity) {
+  if (newCapacity >= capacity())
+    return;
+
+  if (newCapacity < size())
+    shrink(newCapacity);
+
+  T* oldBuffer = begin();
+#ifdef ANNOTATE_CONTIGUOUS_CONTAINER
+  size_t oldCapacity = capacity();
+#endif
+  if (newCapacity > 0) {
+    if (Base::shrinkBuffer(newCapacity)) {
+      ANNOTATE_CHANGE_CAPACITY(begin(), oldCapacity, m_size, capacity());
+      return;
+    }
+
     T* oldEnd = end();
-    Base::allocateExpandedBuffer(newCapacity);
-    ANNOTATE_NEW_BUFFER(begin(), capacity(), m_size);
-    TypeOperations::move(oldBuffer, oldEnd, begin());
-    clearUnusedSlots(oldBuffer, oldEnd);
-    ANNOTATE_DELETE_BUFFER(oldBuffer, oldCapacity, m_size);
-    Base::deallocateBuffer(oldBuffer);
-}
-
-template <typename T, size_t inlineCapacity, typename Allocator>
-inline void Vector<T, inlineCapacity, Allocator>::reserveInitialCapacity(size_t initialCapacity)
-{
-    ASSERT(!m_size);
-    ASSERT(capacity() == INLINE_CAPACITY);
-    if (initialCapacity > INLINE_CAPACITY) {
-        ANNOTATE_DELETE_BUFFER(begin(), capacity(), m_size);
-        Base::allocateBuffer(initialCapacity);
-        ANNOTATE_NEW_BUFFER(begin(), capacity(), m_size);
-    }
-}
-
-template <typename T, size_t inlineCapacity, typename Allocator>
-void Vector<T, inlineCapacity, Allocator>::shrinkCapacity(size_t newCapacity)
-{
-    if (newCapacity >= capacity())
-        return;
-
-    if (newCapacity < size())
-        shrink(newCapacity);
-
-    T* oldBuffer = begin();
+    Base::allocateBuffer(newCapacity);
+    if (begin() != oldBuffer) {
+      ANNOTATE_NEW_BUFFER(begin(), capacity(), m_size);
+      TypeOperations::move(oldBuffer, oldEnd, begin());
+      clearUnusedSlots(oldBuffer, oldEnd);
+      ANNOTATE_DELETE_BUFFER(oldBuffer, oldCapacity, m_size);
+    }
+  } else {
+    Base::resetBufferPointer();
 #ifdef ANNOTATE_CONTIGUOUS_CONTAINER
-    size_t oldCapacity = capacity();
+    if (oldBuffer != begin()) {
+      ANNOTATE_NEW_BUFFER(begin(), capacity(), m_size);
+      ANNOTATE_DELETE_BUFFER(oldBuffer, oldCapacity, m_size);
+    }
 #endif
-    if (newCapacity > 0) {
-        if (Base::shrinkBuffer(newCapacity)) {
-            ANNOTATE_CHANGE_CAPACITY(begin(), oldCapacity, m_size, capacity());
-            return;
-        }
-
-        T* oldEnd = end();
-        Base::allocateBuffer(newCapacity);
-        if (begin() != oldBuffer) {
-            ANNOTATE_NEW_BUFFER(begin(), capacity(), m_size);
-            TypeOperations::move(oldBuffer, oldEnd, begin());
-            clearUnusedSlots(oldBuffer, oldEnd);
-            ANNOTATE_DELETE_BUFFER(oldBuffer, oldCapacity, m_size);
-        }
-    } else {
-        Base::resetBufferPointer();
-#ifdef ANNOTATE_CONTIGUOUS_CONTAINER
-        if (oldBuffer != begin()) {
-            ANNOTATE_NEW_BUFFER(begin(), capacity(), m_size);
-            ANNOTATE_DELETE_BUFFER(oldBuffer, oldCapacity, m_size);
-        }
-#endif
-    }
-
-    Base::deallocateBuffer(oldBuffer);
+  }
+
+  Base::deallocateBuffer(oldBuffer);
 }
 
 // Templatizing these is better than just letting the conversion happen
 // implicitly, because for instance it allows a PassRefPtr to be appended to a
 // RefPtr vector without refcount thrash.
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U>
-void Vector<T, inlineCapacity, Allocator>::append(const U* data, size_t dataSize)
-{
-    ASSERT(Allocator::isAllocationAllowed());
-    size_t newSize = m_size + dataSize;
-    if (newSize > capacity()) {
-        data = expandCapacity(newSize, data);
-        ASSERT(begin());
-    }
-    RELEASE_ASSERT(newSize >= m_size);
-    T* dest = end();
-    ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, newSize);
-    VectorCopier<VectorTraits<T>::canCopyWithMemcpy, T>::uninitializedCopy(data, &data[dataSize], dest);
-    m_size = newSize;
+void Vector<T, inlineCapacity, Allocator>::append(const U* data, size_t dataSize) {
+  ASSERT(Allocator::isAllocationAllowed());
+  size_t newSize = m_size + dataSize;
+  if (newSize > capacity()) {
+    data = expandCapacity(newSize, data);
+    ASSERT(begin());
+  }
+  RELEASE_ASSERT(newSize >= m_size);
+  T* dest = end();
+  ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, newSize);
+  VectorCopier<VectorTraits<T>::canCopyWithMemcpy, T>::uninitializedCopy(data, &data[dataSize], dest);
+  m_size = newSize;
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U>
-ALWAYS_INLINE void Vector<T, inlineCapacity, Allocator>::append(const U& val)
-{
-    ASSERT(Allocator::isAllocationAllowed());
-    if (LIKELY(size() != capacity())) {
-        ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, m_size + 1);
-        new (NotNull, end()) T(val);
-        ++m_size;
-        return;
-    }
+ALWAYS_INLINE void Vector<T, inlineCapacity, Allocator>::append(const U& val) {
+  ASSERT(Allocator::isAllocationAllowed());
+  if (LIKELY(size() != capacity())) {
+    ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, m_size + 1);
+    new (NotNull, end()) T(val);
+    ++m_size;
+    return;
+  }
 
-    appendSlowCase(val);
+  appendSlowCase(val);
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U>
-NEVER_INLINE void Vector<T, inlineCapacity, Allocator>::appendSlowCase(const U& val)
-{
-    ASSERT(size() == capacity());
+NEVER_INLINE void Vector<T, inlineCapacity, Allocator>::appendSlowCase(const U& val) {
+  ASSERT(size() == capacity());
 
-    const U* ptr = &val;
-    ptr = expandCapacity(size() + 1, ptr);
-    ASSERT(begin());
+  const U* ptr = &val;
+  ptr = expandCapacity(size() + 1, ptr);
+  ASSERT(begin());
 
-    ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, m_size + 1);
-    new (NotNull, end()) T(*ptr);
-    ++m_size;
+  ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, m_size + 1);
+  new (NotNull, end()) T(*ptr);
+  ++m_size;
 }
 
 // This version of append saves a branch in the case where you know that the
 // vector's capacity is large enough for the append to succeed.
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U>
-ALWAYS_INLINE void Vector<T, inlineCapacity, Allocator>::uncheckedAppend(const U& val)
-{
+ALWAYS_INLINE void Vector<T, inlineCapacity, Allocator>::uncheckedAppend(const U& val) {
 #ifdef ANNOTATE_CONTIGUOUS_CONTAINER
-    // Vectors in ASAN builds don't have inlineCapacity.
-    append(val);
+  // Vectors in ASAN builds don't have inlineCapacity.
+  append(val);
 #else
-    ASSERT(size() < capacity());
-    ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, m_size + 1);
-    const U* ptr = &val;
-    new (NotNull, end()) T(*ptr);
-    ++m_size;
+  ASSERT(size() < capacity());
+  ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, m_size + 1);
+  const U* ptr = &val;
+  new (NotNull, end()) T(*ptr);
+  ++m_size;
 #endif
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U, size_t otherCapacity, typename OtherAllocator>
-inline void Vector<T, inlineCapacity, Allocator>::appendVector(const Vector<U, otherCapacity, OtherAllocator>& val)
-{
-    append(val.begin(), val.size());
+inline void Vector<T, inlineCapacity, Allocator>::appendVector(const Vector<U, otherCapacity, OtherAllocator>& val) {
+  append(val.begin(), val.size());
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U>
-void Vector<T, inlineCapacity, Allocator>::insert(size_t position, const U* data, size_t dataSize)
-{
-    ASSERT(Allocator::isAllocationAllowed());
-    RELEASE_ASSERT(position <= size());
-    size_t newSize = m_size + dataSize;
-    if (newSize > capacity()) {
-        data = expandCapacity(newSize, data);
-        ASSERT(begin());
-    }
-    RELEASE_ASSERT(newSize >= m_size);
-    ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, newSize);
-    T* spot = begin() + position;
-    TypeOperations::moveOverlapping(spot, end(), spot + dataSize);
-    VectorCopier<VectorTraits<T>::canCopyWithMemcpy, T>::uninitializedCopy(data, &data[dataSize], spot);
-    m_size = newSize;
+void Vector<T, inlineCapacity, Allocator>::insert(size_t position, const U* data, size_t dataSize) {
+  ASSERT(Allocator::isAllocationAllowed());
+  RELEASE_ASSERT(position <= size());
+  size_t newSize = m_size + dataSize;
+  if (newSize > capacity()) {
+    data = expandCapacity(newSize, data);
+    ASSERT(begin());
+  }
+  RELEASE_ASSERT(newSize >= m_size);
+  ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, newSize);
+  T* spot = begin() + position;
+  TypeOperations::moveOverlapping(spot, end(), spot + dataSize);
+  VectorCopier<VectorTraits<T>::canCopyWithMemcpy, T>::uninitializedCopy(data, &data[dataSize], spot);
+  m_size = newSize;
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U>
-inline void Vector<T, inlineCapacity, Allocator>::insert(size_t position, const U& val)
-{
-    ASSERT(Allocator::isAllocationAllowed());
-    RELEASE_ASSERT(position <= size());
-    const U* data = &val;
-    if (size() == capacity()) {
-        data = expandCapacity(size() + 1, data);
-        ASSERT(begin());
-    }
-    ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, m_size + 1);
-    T* spot = begin() + position;
-    TypeOperations::moveOverlapping(spot, end(), spot + 1);
-    new (NotNull, spot) T(*data);
-    ++m_size;
+inline void Vector<T, inlineCapacity, Allocator>::insert(size_t position, const U& val) {
+  ASSERT(Allocator::isAllocationAllowed());
+  RELEASE_ASSERT(position <= size());
+  const U* data = &val;
+  if (size() == capacity()) {
+    data = expandCapacity(size() + 1, data);
+    ASSERT(begin());
+  }
+  ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, m_size + 1);
+  T* spot = begin() + position;
+  TypeOperations::moveOverlapping(spot, end(), spot + 1);
+  new (NotNull, spot) T(*data);
+  ++m_size;
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U, size_t c, typename OtherAllocator>
-inline void Vector<T, inlineCapacity, Allocator>::insert(size_t position, const Vector<U, c, OtherAllocator>& val)
-{
-    insert(position, val.begin(), val.size());
+inline void Vector<T, inlineCapacity, Allocator>::insert(size_t position, const Vector<U, c, OtherAllocator>& val) {
+  insert(position, val.begin(), val.size());
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U>
-void Vector<T, inlineCapacity, Allocator>::prepend(const U* data, size_t dataSize)
-{
-    insert(0, data, dataSize);
+void Vector<T, inlineCapacity, Allocator>::prepend(const U* data, size_t dataSize) {
+  insert(0, data, dataSize);
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U>
-inline void Vector<T, inlineCapacity, Allocator>::prepend(const U& val)
-{
-    insert(0, val);
+inline void Vector<T, inlineCapacity, Allocator>::prepend(const U& val) {
+  insert(0, val);
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U, size_t c, typename V>
-inline void Vector<T, inlineCapacity, Allocator>::prepend(const Vector<U, c, V>& val)
-{
-    insert(0, val.begin(), val.size());
+inline void Vector<T, inlineCapacity, Allocator>::prepend(const Vector<U, c, V>& val) {
+  insert(0, val.begin(), val.size());
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
-inline void Vector<T, inlineCapacity, Allocator>::remove(size_t position)
-{
-    RELEASE_ASSERT(position < size());
-    T* spot = begin() + position;
-    spot->~T();
-    TypeOperations::moveOverlapping(spot + 1, end(), spot);
-    clearUnusedSlots(end() - 1, end());
-    ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, m_size - 1);
-    --m_size;
+inline void Vector<T, inlineCapacity, Allocator>::remove(size_t position) {
+  RELEASE_ASSERT(position < size());
+  T* spot = begin() + position;
+  spot->~T();
+  TypeOperations::moveOverlapping(spot + 1, end(), spot);
+  clearUnusedSlots(end() - 1, end());
+  ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, m_size - 1);
+  --m_size;
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
-inline void Vector<T, inlineCapacity, Allocator>::remove(size_t position, size_t length)
-{
-    ASSERT_WITH_SECURITY_IMPLICATION(position <= size());
-    if (!length)
-        return;
-    RELEASE_ASSERT(position + length <= size());
-    T* beginSpot = begin() + position;
-    T* endSpot = beginSpot + length;
-    TypeOperations::destruct(beginSpot, endSpot);
-    TypeOperations::moveOverlapping(endSpot, end(), beginSpot);
-    clearUnusedSlots(end() - length, end());
-    ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, m_size - length);
-    m_size -= length;
+inline void Vector<T, inlineCapacity, Allocator>::remove(size_t position, size_t length) {
+  ASSERT_WITH_SECURITY_IMPLICATION(position <= size());
+  if (!length)
+    return;
+  RELEASE_ASSERT(position + length <= size());
+  T* beginSpot = begin() + position;
+  T* endSpot = beginSpot + length;
+  TypeOperations::destruct(beginSpot, endSpot);
+  TypeOperations::moveOverlapping(endSpot, end(), beginSpot);
+  clearUnusedSlots(end() - length, end());
+  ANNOTATE_CHANGE_SIZE(begin(), capacity(), m_size, m_size - length);
+  m_size -= length;
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
-inline void Vector<T, inlineCapacity, Allocator>::reverse()
-{
-    for (size_t i = 0; i < m_size / 2; ++i)
-        std::swap(at(i), at(m_size - 1 - i));
+inline void Vector<T, inlineCapacity, Allocator>::reverse() {
+  for (size_t i = 0; i < m_size / 2; ++i)
+    std::swap(at(i), at(m_size - 1 - i));
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
-inline void swap(Vector<T, inlineCapacity, Allocator>& a, Vector<T, inlineCapacity, Allocator>& b)
-{
-    a.swap(b);
+inline void swap(Vector<T, inlineCapacity, Allocator>& a, Vector<T, inlineCapacity, Allocator>& b) {
+  a.swap(b);
 }
 
 template <typename T, size_t inlineCapacityA, size_t inlineCapacityB, typename Allocator>
-bool operator==(const Vector<T, inlineCapacityA, Allocator>& a, const Vector<T, inlineCapacityB, Allocator>& b)
-{
-    if (a.size() != b.size())
-        return false;
-    if (a.isEmpty())
-        return true;
-    return VectorTypeOperations<T>::compare(a.data(), b.data(), a.size());
+bool operator==(const Vector<T, inlineCapacityA, Allocator>& a, const Vector<T, inlineCapacityB, Allocator>& b) {
+  if (a.size() != b.size())
+    return false;
+  if (a.isEmpty())
+    return true;
+  return VectorTypeOperations<T>::compare(a.data(), b.data(), a.size());
 }
 
 template <typename T, size_t inlineCapacityA, size_t inlineCapacityB, typename Allocator>
-inline bool operator!=(const Vector<T, inlineCapacityA, Allocator>& a, const Vector<T, inlineCapacityB, Allocator>& b)
-{
-    return !(a == b);
+inline bool operator!=(const Vector<T, inlineCapacityA, Allocator>& a, const Vector<T, inlineCapacityB, Allocator>& b) {
+  return !(a == b);
 }
 
 // This is only called if the allocator is a HeapAllocator. It is used when
 // visiting during a tracing GC.
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename VisitorDispatcher>
-void Vector<T, inlineCapacity, Allocator>::trace(VisitorDispatcher visitor)
-{
-    ASSERT(Allocator::isGarbageCollected); // Garbage collector must be enabled.
-    if (!buffer())
-        return;
-    if (this->hasOutOfLineBuffer()) {
-        // This is a performance optimization for a case where the buffer has
-        // been already traced by somewhere. This can happen if the conservative
-        // scanning traced an on-stack (false-positive or real) pointer to the
-        // HeapVector, and then visitor->trace() traces the HeapVector.
-        if (Allocator::isHeapObjectAlive(buffer()))
-            return;
-        Allocator::markNoTracing(visitor, buffer());
-    }
-    const T* bufferBegin = buffer();
-    const T* bufferEnd = buffer() + size();
-    if (NeedsTracingTrait<VectorTraits<T>>::value) {
-        for (const T* bufferEntry = bufferBegin; bufferEntry != bufferEnd; bufferEntry++)
-            Allocator::template trace<VisitorDispatcher, T, VectorTraits<T>>(visitor, *const_cast<T*>(bufferEntry));
-        checkUnusedSlots(buffer() + size(), buffer() + capacity());
-    }
+void Vector<T, inlineCapacity, Allocator>::trace(VisitorDispatcher visitor) {
+  ASSERT(Allocator::isGarbageCollected);  // Garbage collector must be enabled.
+  if (!buffer())
+    return;
+  if (this->hasOutOfLineBuffer()) {
+    // This is a performance optimization for a case where the buffer has
+    // been already traced by somewhere. This can happen if the conservative
+    // scanning traced an on-stack (false-positive or real) pointer to the
+    // HeapVector, and then visitor->trace() traces the HeapVector.
+    if (Allocator::isHeapObjectAlive(buffer()))
+      return;
+    Allocator::markNoTracing(visitor, buffer());
+  }
+  const T* bufferBegin = buffer();
+  const T* bufferEnd = buffer() + size();
+  if (NeedsTracingTrait<VectorTraits<T>>::value) {
+    for (const T* bufferEntry = bufferBegin; bufferEntry != bufferEnd; bufferEntry++)
+      Allocator::template trace<VisitorDispatcher, T, VectorTraits<T>>(visitor, *const_cast<T*>(bufferEntry));
+    checkUnusedSlots(buffer() + size(), buffer() + capacity());
+  }
 }
 
 #if !ENABLE(OILPAN)
 template <typename T, size_t N>
 struct NeedsTracing<Vector<T, N>> {
-    static const bool value = false;
+  static const bool value = false;
 };
 #endif
 
-} // namespace WTF
+}  // namespace WTF
 
 using WTF::Vector;
 
-#endif // WTF_Vector_h
+#endif  // WTF_Vector_h