Migrate WTF::Vector::remove() to ::erase()

third_party/WebKit/Source/platform/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 1151 matching lines @@
   void push_front(U&&);
   template <typename U>
   void push_front(const U*, size_t);
   template <typename U, size_t otherCapacity, typename OtherAllocator>
   void prependVector(const Vector<U, otherCapacity, OtherAllocator>&);
 
   // Remove an element or elements at the specified position. These functions
   // take O(size())-time. All of the elements after the removed ones will be
   // moved to the new locations. All the iterators pointing to any element
   // after |position| will be invalidated.
-  void remove(size_t position);
-  void remove(size_t position, size_t length);
+  void erase(size_t position);
+  void erase(size_t position, size_t length);
 
   // Remove the last element. Unlike remove(), (1) this function is fast, and
   // (2) only iterators pointing to the last element will be invalidated. Other
   // references will remain valid.
   void pop_back() {
     DCHECK(!isEmpty());
     shrink(size() - 1);
   }
 
   // Filling the vector with the same value. If the vector has shrinked or
@@ skipping 623 matching lines @@
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U, size_t otherCapacity, typename OtherAllocator>
 inline void Vector<T, inlineCapacity, Allocator>::prependVector(
     const Vector<U, otherCapacity, OtherAllocator>& 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) {
+inline void Vector<T, inlineCapacity, Allocator>::erase(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) {
+inline void Vector<T, inlineCapacity, Allocator>::erase(size_t position,
+                                                        size_t length) {
   SECURITY_DCHECK(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);
@@ skipping 61 matching lines @@
           visitor, *const_cast<T*>(bufferEntry));
     checkUnusedSlots(buffer() + size(), buffer() + capacity());
   }
 }
 
 }  // namespace WTF
 
 using WTF::Vector;
 
 #endif  // WTF_Vector_h