Revert of Extend big-disjunction optimization to case-independent regexps

src/list-inl.h

Index: src/list-inl.h
diff --git a/src/list-inl.h b/src/list-inl.h
index 98f0343fa57f0b84aff9254bf6c1bed7b482e56a..c09788e9ae0e466e5639673c909215b4e52e8d8f 100644
--- a/src/list-inl.h
+++ b/src/list-inl.h
@@ -193,16 +193,14 @@
 }
 
 
-template <typename T, class P>
-template <typename CompareFunction>
-void List<T, P>::Sort(CompareFunction cmp) {
+template<typename T, class P>
+void List<T, P>::Sort(int (*cmp)(const T* x, const T* y)) {
   Sort(cmp, 0, length_);
 }
 
 
 template <typename T, class P>
-template <typename CompareFunction>
-void List<T, P>::Sort(CompareFunction cmp, size_t s, size_t l) {
+void List<T, P>::Sort(int (*cmp)(const T* x, const T* y), size_t s, size_t l) {
   ToVector().Sort(cmp, s, l);
 #ifdef DEBUG
   for (size_t i = s + 1; i < l; i++) DCHECK(cmp(&data_[i - 1], &data_[i]) <= 0);
@@ -217,15 +215,14 @@
 
 
 template <typename T, class P>
-template <typename CompareFunction>
-void List<T, P>::StableSort(CompareFunction cmp) {
+void List<T, P>::StableSort(int (*cmp)(const T* x, const T* y)) {
   StableSort(cmp, 0, length_);
 }
 
 
 template <typename T, class P>
-template <typename CompareFunction>
-void List<T, P>::StableSort(CompareFunction cmp, size_t s, size_t l) {
+void List<T, P>::StableSort(int (*cmp)(const T* x, const T* y), size_t s,
+                            size_t l) {
   ToVector().StableSort(cmp, s, l);
 #ifdef DEBUG
   for (size_t i = s + 1; i < l; i++) DCHECK(cmp(&data_[i - 1], &data_[i]) <= 0);