2016-11-02 15:10:44 -07:00
|
|
|
const assert = @import("debug.zig").assert;
|
|
|
|
const str = @import("str.zig");
|
2016-11-02 15:52:00 -07:00
|
|
|
const math = @import("math.zig");
|
|
|
|
|
|
|
|
pub const Cmp = math.Cmp;
|
2016-11-02 15:10:44 -07:00
|
|
|
|
|
|
|
pub fn sort(inline T: type, array: []T) {
|
|
|
|
if (array.len > 0) {
|
|
|
|
quicksort(T, array, 0, array.len - 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn quicksort(inline T: type, array: []T, left: usize, right: usize) {
|
|
|
|
var i = left;
|
|
|
|
var j = right;
|
|
|
|
var p = (i + j) / 2;
|
|
|
|
|
|
|
|
while (i <= j) {
|
|
|
|
while (array[i] < array[p]) {
|
|
|
|
i += 1;
|
|
|
|
}
|
|
|
|
while (array[j] > array[p]) {
|
|
|
|
j -= 1;
|
|
|
|
}
|
|
|
|
if (i <= j) {
|
|
|
|
const tmp = array[i];
|
|
|
|
array[i] = array[j];
|
|
|
|
array[j] = tmp;
|
|
|
|
i += 1;
|
|
|
|
if (j > 0) j -= 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (left < j) quicksort(T, array, left, j);
|
|
|
|
if (i < right) quicksort(T, array, i, right);
|
|
|
|
}
|
|
|
|
|
2016-11-02 15:52:00 -07:00
|
|
|
// ---------------------------------------
|
|
|
|
// sortCmp
|
|
|
|
|
|
|
|
pub fn sortCmp(inline T: type, array: []T, inline cmp: fn(a: T, b: T)->Cmp) {
|
|
|
|
if (array.len > 0) {
|
|
|
|
quicksortCmp(T, array, 0, array.len - 1, cmp);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn quicksortCmp(inline T: type, array: []T, left: usize, right: usize, inline cmp: fn(a: T, b: T)->Cmp) {
|
|
|
|
var i = left;
|
|
|
|
var j = right;
|
|
|
|
var p = (i + j) / 2;
|
|
|
|
|
|
|
|
while (i <= j) {
|
|
|
|
while (cmp(array[i], array[p]) == Cmp.Less) {
|
|
|
|
i += 1;
|
|
|
|
}
|
|
|
|
while (cmp(array[j], array[p]) == Cmp.Greater) {
|
|
|
|
j -= 1;
|
|
|
|
}
|
|
|
|
if (i <= j) {
|
|
|
|
const tmp = array[i];
|
|
|
|
array[i] = array[j];
|
|
|
|
array[j] = tmp;
|
|
|
|
i += 1;
|
|
|
|
if (j > 0) j -= 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (left < j) quicksortCmp(T, array, left, j, cmp);
|
|
|
|
if (i < right) quicksortCmp(T, array, i, right, cmp);
|
|
|
|
}
|
|
|
|
|
|
|
|
// ---------------------------------------
|
|
|
|
// tests
|
|
|
|
|
2016-11-02 15:10:44 -07:00
|
|
|
fn testSort() {
|
|
|
|
@setFnTest(this, true);
|
|
|
|
|
|
|
|
const u8cases = [][][]u8 {
|
|
|
|
[][]u8{"", ""},
|
|
|
|
[][]u8{"a", "a"},
|
|
|
|
[][]u8{"az", "az"},
|
|
|
|
[][]u8{"za", "az"},
|
|
|
|
[][]u8{"asdf", "adfs"},
|
|
|
|
[][]u8{"one", "eno"},
|
|
|
|
};
|
|
|
|
|
|
|
|
for (u8cases) |case| {
|
|
|
|
sort(u8, case[0]);
|
|
|
|
assert(str.eql(case[0], case[1]));
|
|
|
|
}
|
|
|
|
|
|
|
|
const i32cases = [][][]i32 {
|
|
|
|
[][]i32{[]i32{}, []i32{}},
|
|
|
|
[][]i32{[]i32{1}, []i32{1}},
|
|
|
|
[][]i32{[]i32{0, 1}, []i32{0, 1}},
|
|
|
|
[][]i32{[]i32{1, 0}, []i32{0, 1}},
|
|
|
|
[][]i32{[]i32{1, -1, 0}, []i32{-1, 0, 1}},
|
|
|
|
[][]i32{[]i32{2, 1, 3}, []i32{1, 2, 3}},
|
|
|
|
};
|
|
|
|
|
|
|
|
for (i32cases) |case| {
|
|
|
|
sort(i32, case[0]);
|
|
|
|
assert(str.sliceEql(i32, case[0], case[1]));
|
|
|
|
}
|
|
|
|
}
|
2016-11-02 15:52:00 -07:00
|
|
|
|
|
|
|
fn testSortCmp() {
|
|
|
|
@setFnTest(this, true);
|
|
|
|
|
|
|
|
const i32cases = [][][]i32 {
|
|
|
|
[][]i32{[]i32{}, []i32{}},
|
|
|
|
[][]i32{[]i32{1}, []i32{1}},
|
|
|
|
[][]i32{[]i32{0, 1}, []i32{0, 1}},
|
|
|
|
[][]i32{[]i32{1, 0}, []i32{0, 1}},
|
|
|
|
[][]i32{[]i32{1, -1, 0}, []i32{-1, 0, 1}},
|
|
|
|
[][]i32{[]i32{2, 1, 3}, []i32{1, 2, 3}},
|
|
|
|
};
|
|
|
|
|
|
|
|
for (i32cases) |case| {
|
|
|
|
sortCmp(i32, case[0], normalCmp);
|
|
|
|
assert(str.sliceEql(i32, case[0], case[1]));
|
|
|
|
}
|
|
|
|
|
|
|
|
const revCases = [][][]i32 {
|
|
|
|
[][]i32{[]i32{}, []i32{}},
|
|
|
|
[][]i32{[]i32{1}, []i32{1}},
|
|
|
|
[][]i32{[]i32{0, 1}, []i32{1, 0}},
|
|
|
|
[][]i32{[]i32{1, 0}, []i32{1, 0}},
|
|
|
|
[][]i32{[]i32{1, -1, 0}, []i32{1, 0, -1}},
|
|
|
|
[][]i32{[]i32{2, 1, 3}, []i32{3, 2, 1}},
|
|
|
|
};
|
|
|
|
|
|
|
|
for (revCases) |case| {
|
|
|
|
sortCmp(i32, case[0], revCmp);
|
|
|
|
assert(str.sliceEql(i32, case[0], case[1]));
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
fn normalCmp(a: i32, b: i32) -> Cmp {
|
|
|
|
return if (a > b) Cmp.Greater else if (a < b) Cmp.Less else Cmp.Equal;
|
|
|
|
}
|
|
|
|
|
|
|
|
fn revCmp(a: i32, b: i32) -> Cmp {
|
|
|
|
return if (a < b) Cmp.Greater else if (a > b) Cmp.Less else Cmp.Equal;
|
|
|
|
}
|