Inverted character classes

src/utils.h

 // Copyright 2006-2008 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 65 matching lines @@
 }
 
 
 // Return the smallest multiple of m which is >= x.
 template <typename T>
 static inline T RoundUp(T x, int m) {
   return RoundDown(x + m - 1, m);
 }
 
 
+template <typename T>
+static int Spaceship(const T& a, const T& b) {

[Erik Corry, 2008/11/13 11:45:43]

The reasoning behind this name is a little opaque to me.  Also it seems a pity
that it is only ever used for uc16s where 'return a - b' would be faster.

[Christian Plesner Hansen, 2008/11/13 11:58:37]

http://en.wikipedia.org/wiki/Spaceship_operator

We can make a custom comparator function if it turns out to be a performance
issue.

+  if (a == b)
+    return 0;
+  else if (a < b)
+    return -1;
+  else
+    return 1;
+}
+
+
+template <typename T>
+static int PointerSpaceship(const T* a, const T* b) {
+  return Spaceship<T>(*a, *b);
+}
+
+
 // Returns the smallest power of two which is >= x. If you pass in a
 // number that is already a power of two, it is returned as is.
 uint32_t RoundUpToPowerOf2(uint32_t x);
 
 
 template <typename T>
 static inline bool IsAligned(T value, T alignment) {
   ASSERT(IsPowerOf2(alignment));
   return (value & (alignment - 1)) == 0;
 }
@@ skipping 215 matching lines @@
 
   T& last() { return start_[length_ - 1]; }
 
   // Returns a clone of this vector with a new backing store.
   Vector<T> Clone() const {
     T* result = NewArray<T>(length_);
     for (int i = 0; i < length_; i++) result[i] = start_[i];
     return Vector<T>(result, length_);
   }
 
+  void Sort(int (*cmp)(const T*, const T*)) {
+    typedef int (*RawComparer)(const void*, const void*);
+    qsort(start(),
+          length(),
+          sizeof(T),
+          reinterpret_cast<RawComparer>(cmp));
+  }
+
+  void Sort() {
+    Sort(PointerSpaceship<T>);
+  }
+
   // Releases the array underlying this vector. Once disposed the
   // vector is empty.
   void Dispose() {
     if (is_empty()) return;
     DeleteArray(start_);
     start_ = NULL;
     length_ = 0;
   }
 
   inline Vector<T> operator+(int offset) {
@@ skipping 198 matching lines @@
 #endif
 }
 
 
 
 
 
 } }  // namespace v8::internal
 
 #endif  // V8_UTILS_H_