mathieu/os-rust
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

libstd: Implement a Sort trait.

Browse source 
This depends on the previous fix to not assert.
This commit is contained in:
Patrick Walton 2012-09-03 15:58:01 -07:00
parent 5573ad723f
commit 8f840f9ea0
1 changed files with 9 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

9
src/libstd/sort.rs
View file

@ -9,6 +9,7 @@ export le;
export merge_sort; export merge_sort;
export quick_sort; export quick_sort;
export quick_sort3; export quick_sort3;
export Sort;
type le<T> = pure fn(v1: &T, v2: &T) -> bool; type le<T> = pure fn(v1: &T, v2: &T) -> bool;
@ -160,6 +161,14 @@ fn quick_sort3<T: copy Ord Eq>(arr: &[mut T]) {
qsort3(arr, 0, (arr.len() - 1) as int); qsort3(arr, 0, (arr.len() - 1) as int);
} }
trait Sort {
fn qsort(self);
}
impl<T: copy Ord Eq> &[mut T] : Sort {
fn qsort(self) { quick_sort3(self); }
}
#[cfg(test)] #[cfg(test)]
mod test_qsort3 { mod test_qsort3 {
fn check_sort(v1: &[mut int], v2: &[mut int]) { fn check_sort(v1: &[mut int], v2: &[mut int]) {