Skip to content

Commit cfe8575

Browse files
jldnikomatsakis
authored andcommitted
---
yaml --- r: 32214 b: refs/heads/dist-snap c: c552819 h: refs/heads/master v: v3
1 parent afa0f22 commit cfe8575

File tree

2 files changed

+9
-10
lines changed

2 files changed

+9
-10
lines changed

[refs]

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,6 +7,6 @@ refs/tags/release-0.1: 1f5c5126e96c79d22cb7862f75304136e204f105
77
refs/heads/ndm: f3868061cd7988080c30d6d5bf352a5a5fe2460b
88
refs/heads/try2: d0c6ce338884ee21843f4b40bf6bf18d222ce5df
99
refs/heads/incoming: d9317a174e434d4c99fc1a37fd7dc0d2f5328d37
10-
refs/heads/dist-snap: 206edf66c92e12f1d98b56ea48a340e7e86d8552
10+
refs/heads/dist-snap: c5528198abd91c19da22ccf370b84ce1d71fc3c2
1111
refs/tags/release-0.2: c870d2dffb391e14efb05aa27898f1f6333a9596
1212
refs/tags/release-0.3: b5f0d0f648d9a6153664837026ba1be43d3e2503

branches/dist-snap/src/libstd/sort.rs

Lines changed: 8 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -95,8 +95,7 @@ fn quick_sort<T: copy>(compare_func: le<T>, arr: ~[mut T]) {
9595
qsort::<T>(compare_func, arr, 0u, len::<T>(arr) - 1u);
9696
}
9797

98-
fn qsort3<T: copy>(compare_func_lt: le<T>, compare_func_eq: le<T>,
99-
arr: ~[mut T], left: int, right: int) {
98+
fn qsort3<T: copy Ord Eq>(arr: ~[mut T], left: int, right: int) {
10099
if right <= left { return; }
101100
let v: T = arr[right];
102101
let mut i: int = left - 1;
@@ -105,19 +104,19 @@ fn qsort3<T: copy>(compare_func_lt: le<T>, compare_func_eq: le<T>,
105104
let mut q: int = j;
106105
loop {
107106
i += 1;
108-
while compare_func_lt(&arr[i], &v) { i += 1; }
107+
while arr[i] < v { i += 1; }
109108
j -= 1;
110-
while compare_func_lt(&v, &arr[j]) {
109+
while v < arr[j] {
111110
if j == left { break; }
112111
j -= 1;
113112
}
114113
if i >= j { break; }
115114
arr[i] <-> arr[j];
116-
if compare_func_eq(&arr[i], &v) {
115+
if arr[i] == v {
117116
p += 1;
118117
arr[p] <-> arr[i];
119118
}
120-
if compare_func_eq(&v, &arr[j]) {
119+
if v == arr[j] {
121120
q -= 1;
122121
arr[j] <-> arr[q];
123122
}
@@ -139,8 +138,8 @@ fn qsort3<T: copy>(compare_func_lt: le<T>, compare_func_eq: le<T>,
139138
i += 1;
140139
if k == 0 { break; }
141140
}
142-
qsort3::<T>(compare_func_lt, compare_func_eq, arr, left, j);
143-
qsort3::<T>(compare_func_lt, compare_func_eq, arr, i, right);
141+
qsort3::<T>(arr, left, j);
142+
qsort3::<T>(arr, i, right);
144143
}
145144

146145
/**
@@ -155,7 +154,7 @@ fn qsort3<T: copy>(compare_func_lt: le<T>, compare_func_eq: le<T>,
155154
*/
156155
fn quick_sort3<T: copy Ord Eq>(arr: ~[mut T]) {
157156
if arr.len() <= 1 { return; }
158-
qsort3(core::cmp::lt, core::cmp::eq, arr, 0, (arr.len() - 1) as int);
157+
qsort3(arr, 0, (arr.len() - 1) as int);
159158
}
160159

161160
#[cfg(test)]

0 commit comments

Comments
 (0)