|
| 1 | + |
| 2 | +pub trait Ord<T> { |
| 3 | + fn cmp(other: T) i64; |
| 4 | +} |
| 5 | + |
| 6 | +impl Ord<i64> for i64 { |
| 7 | + fn cmp(other: i64) i64 { |
| 8 | + if *self < other { |
| 9 | + return -1; |
| 10 | + } else if *self > other { |
| 11 | + return 1; |
| 12 | + } else { |
| 13 | + return 0; |
| 14 | + } |
| 15 | + } |
| 16 | +} |
| 17 | + |
| 18 | +impl Ord<i32> for i32 { |
| 19 | + fn cmp(other: i32) i64 { |
| 20 | + if *self < other { |
| 21 | + return -1; |
| 22 | + } else if *self > other { |
| 23 | + return 1; |
| 24 | + } else { |
| 25 | + return 0; |
| 26 | + } |
| 27 | + } |
| 28 | +} |
| 29 | + |
| 30 | +impl Ord<i16> for i16 { |
| 31 | + fn cmp(other: i16) i64 { |
| 32 | + if *self < other { |
| 33 | + return -1; |
| 34 | + } else if *self > other { |
| 35 | + return 1; |
| 36 | + } else { |
| 37 | + return 0; |
| 38 | + } |
| 39 | + } |
| 40 | +} |
| 41 | + |
| 42 | +impl Ord<i8> for i8 { |
| 43 | + fn cmp(other: i8) i64 { |
| 44 | + if *self < other { |
| 45 | + return -1; |
| 46 | + } else if *self > other { |
| 47 | + return 1; |
| 48 | + } else { |
| 49 | + return 0; |
| 50 | + } |
| 51 | + } |
| 52 | +} |
| 53 | + |
| 54 | +impl Ord<u64> for u64 { |
| 55 | + fn cmp(other: u64) i64 { |
| 56 | + if *self < other { |
| 57 | + return -1; |
| 58 | + } else if *self > other { |
| 59 | + return 1; |
| 60 | + } else { |
| 61 | + return 0; |
| 62 | + } |
| 63 | + } |
| 64 | +} |
| 65 | + |
| 66 | +impl Ord<u32> for u32 { |
| 67 | + fn cmp(other: u32) i64 { |
| 68 | + if *self < other { |
| 69 | + return -1; |
| 70 | + } else if *self > other { |
| 71 | + return 1; |
| 72 | + } else { |
| 73 | + return 0; |
| 74 | + } |
| 75 | + } |
| 76 | +} |
| 77 | + |
| 78 | +impl Ord<u16> for u16 { |
| 79 | + fn cmp(other: u16) i64 { |
| 80 | + if *self < other { |
| 81 | + return -1; |
| 82 | + } else if *self > other { |
| 83 | + return 1; |
| 84 | + } else { |
| 85 | + return 0; |
| 86 | + } |
| 87 | + } |
| 88 | +} |
| 89 | + |
| 90 | +impl Ord<u8> for u8 { |
| 91 | + fn cmp(other: u8) i64 { |
| 92 | + if *self < other { |
| 93 | + return -1; |
| 94 | + } else if *self > other { |
| 95 | + return 1; |
| 96 | + } else { |
| 97 | + return 0; |
| 98 | + } |
| 99 | + } |
| 100 | +} |
| 101 | + |
| 102 | +impl Ord<f64> for f64 { |
| 103 | + fn cmp(other: f64) i64 { |
| 104 | + if *self < other { |
| 105 | + return -1; |
| 106 | + } else if *self > other { |
| 107 | + return 1; |
| 108 | + } else { |
| 109 | + return 0; |
| 110 | + } |
| 111 | + } |
| 112 | +} |
| 113 | + |
| 114 | +impl Ord<f32> for f32 { |
| 115 | + fn cmp(other: f32) i64 { |
| 116 | + if *self < other { |
| 117 | + return -1; |
| 118 | + } else if *self > other { |
| 119 | + return 1; |
| 120 | + } else { |
| 121 | + return 0; |
| 122 | + } |
| 123 | + } |
| 124 | +} |
| 125 | + |
| 126 | +impl Ord<bool> for bool { |
| 127 | + fn cmp(other: bool) i64 { |
| 128 | + if *self == other { |
| 129 | + return 0; |
| 130 | + } else if *self { |
| 131 | + return 1; |
| 132 | + } else { |
| 133 | + return -1; |
| 134 | + } |
| 135 | + } |
| 136 | +} |
| 137 | + |
| 138 | +impl Ord<i128> for i128 { |
| 139 | + fn cmp(other: i128) i64 { |
| 140 | + if *self < other { |
| 141 | + return -1; |
| 142 | + } else if *self > other { |
| 143 | + return 1; |
| 144 | + } else { |
| 145 | + return 0; |
| 146 | + } |
| 147 | + } |
| 148 | +} |
| 149 | + |
| 150 | +impl Ord<u128> for u128 { |
| 151 | + fn cmp(other: u128) i64 { |
| 152 | + if *self < other { |
| 153 | + return -1; |
| 154 | + } else if *self > other { |
| 155 | + return 1; |
| 156 | + } else { |
| 157 | + return 0; |
| 158 | + } |
| 159 | + } |
| 160 | +} |
| 161 | + |
| 162 | +pub trait Sort { |
| 163 | + fn sort() void; |
| 164 | +} |
| 165 | + |
| 166 | +impl <T:Ord<T>> Sort for [T] { |
| 167 | + fn sort() void { |
| 168 | + // quick sort |
| 169 | + let arr = *self; |
| 170 | + let n = arr_len(arr); |
| 171 | + if n <= 1 { |
| 172 | + return; |
| 173 | + } |
| 174 | + let pivot = arr[n / 2]; |
| 175 | + let i = 0; |
| 176 | + let j = n - 1; |
| 177 | + while i <= j { |
| 178 | + while arr[i].cmp(pivot) < 0 { |
| 179 | + i = i + 1; |
| 180 | + } |
| 181 | + while arr[j].cmp(pivot) > 0 { |
| 182 | + j = j - 1; |
| 183 | + } |
| 184 | + if i <= j { |
| 185 | + let tmp = arr[i]; |
| 186 | + arr[i] = arr[j]; |
| 187 | + arr[j] = tmp; |
| 188 | + i = i + 1; |
| 189 | + j = j - 1; |
| 190 | + } |
| 191 | + } |
| 192 | + if j > 0 { |
| 193 | + arr_slice(arr, 0, j + 1).sort(); |
| 194 | + } |
| 195 | + if i < n { |
| 196 | + arr_slice(arr, i, n-i).sort(); |
| 197 | + } |
| 198 | + return; |
| 199 | + } |
| 200 | +} |
| 201 | + |
0 commit comments