Lines Matching defs:lt
37 void selectionSort(T* array, int size, LessThan lt)
45 if (lt(array[j], array[best_i]))
56 void sort(T* array, int size, LessThan lt, double& seed)
59 selectionSort(array, size, lt);
68 do i++; while(lt(array[i], pivot));
69 do j--; while(lt(pivot, array[j]));
76 sort(array , i , lt, seed);
77 sort(&array[i], size-i, lt, seed);
80 template <class T, class LessThan> void sort(T* array, int size, LessThan lt) {
81 double seed = 91648253; sort(array, size, lt, seed); }
87 void sortUnique(T* array, int& size, LessThan lt)
94 sort(array, size, lt);
99 if (lt(last, array[j])){
114 template <class T, class LessThan> void sort(vec<T>& v, LessThan lt) {
115 sort((T*)v, v.size(), lt); }
120 template <class T, class LessThan> void sortUnique(vec<T>& v, LessThan lt) {
123 sortUnique(data, size, lt);