1
0
mirror of https://github.com/vlang/v.git synced 2023-08-10 21:13:21 +03:00
v/vlib/builtin/sorting_test.v

49 lines
926 B
V
Raw Normal View History

const (
unsorted = [2, 30, 10, 20, 1]
sorted_asc = [1, 2, 10, 20, 30]
sorted_desc = [30, 20, 10, 2, 1]
)
fn test_sorting_simple() {
2020-12-20 18:08:56 +03:00
mut a := unsorted.clone()
a.sort()
eprintln(' a: $a')
assert a == sorted_asc
}
fn test_sorting_with_condition_expression() {
2020-12-20 18:08:56 +03:00
mut a := unsorted.clone()
a.sort(a > b)
eprintln(' a: $a')
assert a == sorted_desc
}
fn mysort(mut a []int) {
a.sort()
}
fn test_sorting_by_passing_a_mut_array_to_a_function() {
2020-12-20 18:08:56 +03:00
mut a := unsorted.clone()
mysort(mut a)
eprintln(' a: $a')
assert a == sorted_asc
}
/*
fn test_sorting_by_passing_an_anonymous_sorting_function() {
mut a := unsorted
a.sort(fn(a &int, b &int) int { return *b - *a })
eprintln(' a: $a')
assert a == sort_desc
}
*/
fn test_sorting_u64s() {
mut a := [u64(3), 2, 1, 9, 0, 8]
a.sort()
eprintln(' a: $a')
assert a == [u64(0), 1, 2, 3, 8, 9]
a.sort(a > b)
eprintln(' a: $a')
assert a == [u64(9), 8, 3, 2, 1, 0]
}