Add a performance test showing that List is not as efficient as std::vector.

src/list-inl.h

 // Copyright 2006-2009 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 195 matching lines @@
 
 template<typename T, class P>
 void List<T, P>::Sort(int (*cmp)(const T* x, const T* y)) {
   ToVector().Sort(cmp);
 #ifdef DEBUG
   for (int i = 1; i < length_; i++)
     ASSERT(cmp(&data_[i - 1], &data_[i]) <= 0);
 #endif
 }
 
+template<typename T, class P>
+void List<T, P>::SortBetter() {
+  ToVector().SortBetter();
+}
+
 
 template<typename T, class P>
 void List<T, P>::Sort() {
   Sort(PointerValueCompare<T>);
 }
 
 
 template<typename T, class P>
 void List<T, P>::Initialize(int capacity, P allocator) {
   ASSERT(capacity >= 0);
@@ skipping 40 matching lines @@
 
 template <typename T>
 int SortedListBSearch(const List<T>& list, T elem) {
   return SortedListBSearch<T, ElementCmp<T> > (list, ElementCmp<T>(elem));
 }
 
 
 } }  // namespace v8::internal
 
 #endif  // V8_LIST_INL_H_