Lines Matching defs:from
29 * Original Code is Bill Foote, with contributions from others
83 // Sorts v between from and to, inclusive. This is a quick, off-the-top-
90 static private void quickSort(Vector<Object> v, Comparer c, int from, int to) {
91 if (to <= from)
93 int mid = (from + to) / 2;
94 if (mid != from)
95 swap(v, mid, from);
96 Object pivot = v.elementAt(from);
98 int highestBelowPivot = from - 1;
99 int low = from+1;
139 // Now we just need to sort from from..highestBelowPivot
140 // and from high+1..to
141 if (highestBelowPivot > from) {
143 swap(v, from, highestBelowPivot);
144 quickSort(v, c, from, highestBelowPivot-1);