CloneSet652

plugins/org.eclipse.jdt.core/model/org/eclipse/jdt/internal/core/util/Util.java

plugins/org.eclipse.jdt.core/model/org/eclipse/jdt/internal/core/util/Util.java

        /**
         * Sort the comparable objects in the given collection.
         */
        private static void quickSort(Comparable[] sortedCollection, int left, int right) {
                int original_left = left;
                int original_right = right;
                Comparable mid = sortedCollection[ (left + right) / 2];
                do {
                        while (sortedCollection[left].compareTo(mid) < 0) {
                                left++;
                        }
                        while (mid.compareTo(sortedCollection[right]) < 0) {
                                right--;
                        }
                        if (left <= right) {
                                Comparable tmp = sortedCollection[left];
                                sortedCollection[left] = sortedCollection[right];
                                sortedCollection[right] = tmp;
                                left++;
                                right--;
                        }
                }
                while (  left <= right);
                if (original_left < right) {
                        quickSort(sortedCollection, original_left, right);
                }
                if (left < original_right) {
                        quickSort(sortedCollection, left, original_right);
                }
        }

        /**
         * Sort the strings in the given collection.
         */
        private static void quickSort(String[] sortedCollection, int left, int right) {
                int original_left = left;
                int original_right = right;
                String mid = sortedCollection[ (left + right) / 2];
                do {
                        while (sortedCollection[left].compareTo(mid) < 0) {
                                left++;
                        }
                        while (mid.compareTo(sortedCollection[right]) < 0) {
                                right--;
                        }
                        if (left <= right) {
                                String tmp = sortedCollection[left];
                                sortedCollection[left] = sortedCollection[right];
                                sortedCollection[right] = tmp;
                                left++;
                                right--;
                        }
                }
                while (  left <= right);
                if (original_left < right) {
                        quickSort(sortedCollection, original_left, right);
                }
                if (left < original_right) {
                        quickSort(sortedCollection, left, original_right);
                }
        }

/**
         * Sort the comparable objects in the given collection.
         */
/**
         * Sort the strings in the given collection.
         */
private static void quickSort( [[#variablebd3fa280]][] sortedCollection, int left, int right) {
  int original_left = left;
  int original_right = right;
   [[#variablebd3fa280]] mid = sortedCollection[(left + right) / 2];
  do {
    while (sortedCollection[left].compareTo(mid) < 0) {
      left++;
    }
    while (mid.compareTo(sortedCollection[right]) < 0) {
      right--;
    }
    if (left <= right) {
       [[#variablebd3fa280]] tmp = sortedCollection[left];
      sortedCollection[left] = sortedCollection[right];
      sortedCollection[right] = tmp;
      left++;
      right--;
    }
  }
  while (left <= right);
  if (original_left < right) {
    quickSort(sortedCollection, original_left, right);
  }
  if (left < original_right) {
    quickSort(sortedCollection, left, original_right);
  }
}
 

Comparable 

String