Migrate WTF::Vector::prepend() to ::push_front()

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 1134 matching lines @@
   template <typename U>
   void insert(size_t position, const U*, size_t);
   template <typename U, size_t otherCapacity, typename OtherAllocator>
   void insert(size_t position, const Vector<U, otherCapacity, OtherAllocator>&);
 
   // Insertion to the front. All of these functions will take O(size())-time.
   // All of the elements in the vector will be moved to the new locations.
   // All of these functions may cause a reallocation. In any case, all the
   // iterators pointing to any element in the vector will be invalidated.
   //
-  // prepend(value)
+  // push_front(value)
   //     Insert a single element to the front.
-  // prepend(buffer, size)
+  // push_front(buffer, size)
   // prependVector(vector)
   //     Insert multiple elements represented by either |buffer| and |size| or
   //     |vector| to the front. The elements will be copied.
   template <typename U>
-  void prepend(U&&);
+  void push_front(U&&);
   template <typename U>
-  void prepend(const U*, size_t);
+  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);
 
@@ skipping 613 matching lines @@
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U, size_t otherCapacity, typename OtherAllocator>
 inline void Vector<T, inlineCapacity, Allocator>::insert(
     size_t position,
     const Vector<U, otherCapacity, OtherAllocator>& val) {
   insert(position, val.begin(), val.size());
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U>
-inline void Vector<T, inlineCapacity, Allocator>::prepend(U&& val) {
+inline void Vector<T, inlineCapacity, Allocator>::push_front(U&& val) {
   insert(0, std::forward<U>(val));
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename U>
-void Vector<T, inlineCapacity, Allocator>::prepend(const U* data,
-                                                   size_t dataSize) {
+void Vector<T, inlineCapacity, Allocator>::push_front(const U* data,
+                                                      size_t dataSize) {
   insert(0, data, dataSize);
 }
 
 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());
 }
 
@@ skipping 85 matching lines @@
           visitor, *const_cast<T*>(bufferEntry));
     checkUnusedSlots(buffer() + size(), buffer() + capacity());
   }
 }
 
 }  // namespace WTF
 
 using WTF::Vector;
 
 #endif  // WTF_Vector_h