array: more eq functions

vlib/builtin/array.v

@@ -242,7 +242,6 @@ pub fn (a array) clone() array {
 	return arr
 }
 
-
 fn (a array) slice_clone(start, _end int) array {
 	mut end := _end
 	if start > end {
@@ -304,13 +303,11 @@ pub fn (a array) reverse() array {
 		data: calloc(a.cap * a.element_size)
 	}
 	for i := 0; i < a.len; i++ {
-		C.memcpy(arr.data + i * arr.element_size,
+		C.memcpy(arr.data + i * arr.element_size, &a[a.len - 1 - i], arr.element_size)
-			&a[a.len - 1 - i], arr.element_size)
 	}
 	return arr
 }
 
-
 // pub fn (a []int) free() {
 [unsafe_fn]
 pub fn (a array) free() {
@@ -489,3 +486,44 @@ pub fn (a []f32) eq(a2 []f32) bool {
 	return array_eq(a, a2)
 }
 
+// compare_i64 for []f64 sort_with_compare()
+// sort []i64 with quicksort
+// usage :
+// mut x := [i64(100),10,70,28,92]
+// x.sort_with_compare(compare_i64)
+// println(x)     // Sorted i64 Array
+// output:
+// [10, 28, 70, 92, 100]
+pub fn compare_i64(a, b &i64) int {
+	if *a < *b {
+		return -1
+	}
+	if *a > *b {
+		return 1
+	}
+	return 0
+}
+
+// compare_f64 for []f64 sort_with_compare()
+// ref. compare_i64(...)
+pub fn compare_f64(a, b &f64) int {
+	if *a < *b {
+		return -1
+	}
+	if *a > *b {
+		return 1
+	}
+	return 0
+}
+
+// compare_f32 for []f32 sort_with_compare()
+// ref. compare_i64(...)
+pub fn compare_f32(a, b &f32) int {
+	if *a < *b {
+		return -1
+	}
+	if *a > *b {
+		return 1
+	}
+	return 0
+}

vlib/builtin/array_test.v

@@ -30,7 +30,6 @@ fn test_ints() {
 	assert a.len == 5
 	assert a[4] == 4
 	assert a.last() == 4
-
 	s := a.str()
 	assert s == '[1, 5, 2, 3, 4]'
 	assert a[1] == 5
@@ -41,15 +40,12 @@ fn test_deleting() {
 	mut a := [1, 5, 2, 3, 4]
 	assert a.len == 5
 	assert a.str() == '[1, 5, 2, 3, 4]'
-
 	a.delete(0)
 	assert a.str() == '[5, 2, 3, 4]'
 	assert a.len == 4
-
 	a.delete(1)
 	assert a.str() == '[5, 3, 4]'
 	assert a.len == 3
-
 	a.delete(a.len - 1)
 	assert a.str() == '[5, 3]'
 	assert a.len == 2
@@ -107,36 +103,33 @@ fn test_push() {
 // i := 3
 // a.insert(0, &i)
 // ----------------------------
+/*
 fn test_insert() {
-//     mut a := [1, 2]
+	mut a := [1, 2]
-//     a.insert(0, 3)
+	a.insert(0, 3)
-//    println(a)
+	println(a)
 }
+*/
 // fn test_insert() {
 // mut a := [1, 2]
-
 // a.insert(0, 3)
 // assert a[0] == 3
 // assert a[2] == 2
 // assert a.len == 3
-
 // a.insert(1, 4)
 // assert a[1] == 4
 // assert a[2] == 1
 // assert a.len == 4
-
 // a.insert(4, 5)
 // assert a[4] == 5
 // assert a[3] == 2
 // assert a.len == 5
-
 // mut b := []f64
 // assert b.len == 0
 // b.insert(0, f64(1.1))
 // assert b.len == 1
 // assert b[0] == f64(1.1)
 // }
-
 // TODO array.prepend is broken
 // It depends on array.insert
 // -----------------------------
@@ -146,21 +139,19 @@ fn test_insert() {
 // a.prepend(1)
 // assert a.len == 1
 // assert a[0] == 1
-
 // mut b := []f64
 // assert b.len == 0
 // b.prepend(f64(1.1))
 // assert b.len == 1
 // assert b[0] == f64(1.1)
 // }
-
 fn test_strings() {
 	a := ['a', 'b', 'c']
 	assert a.str() == '["a", "b", "c"]'
 }
 
-fn test_compare_ints() {
 /*
+fn test_compare_ints() {
     assert compare_ints(1, 2) == -1
     assert compare_ints(2, 1) == 1
     assert compare_ints(0, 0) == 0
@@ -170,8 +161,9 @@ fn test_compare_ints() {
     assert compare_ints(a, b) == -1
     assert compare_ints(b, a) == 1
     assert compare_ints(a, a) == 0
-   */
 }
+*/
+
 
 fn test_repeat() {
 	{
@@ -181,16 +173,21 @@ fn test_repeat() {
 	}
 	{
 		a := [1.1].repeat(10)
-		// FIXME: assert aa[0] == 1.1 will fail, need fix
+		assert a[0] == 1.1
-		assert a[0] == f32(1.1)
+		assert a[5] == 1.1
-		assert a[5] == f32(1.1)
+		assert a[9] == 1.1
-		assert a[9] == f32(1.1)
 	}
 	{
-		a := [f32(1.1)].repeat(10)
+		a := [i64(-123)].repeat(10)
-		assert a[0] == f32(1.1)
+		assert a[0] == -123
-		assert a[5] == f32(1.1)
+		assert a[5] == -123
-		assert a[9] == f32(1.1)
+		assert a[9] == -123
+	}
+	{
+		a := [u64(123)].repeat(10)
+		assert a[0] == 123
+		assert a[5] == 123
+		assert a[9] == 123
 	}
 	{
 		a := [f64(1.1)].repeat(10)
@@ -341,11 +338,11 @@ pub  fn (t Test) str() string {
 
 fn test_struct_print() {
 	mut a := Test{
-		a: 'Test',
+		a: 'Test'
 		b: []
 	}
 	b := Test2{
-		one: 1,
+		one: 1
 		two: 2
 	}
 	a.b << b
@@ -370,19 +367,16 @@ fn test_find_index() {
 	assert a.index('v') == 0
 	assert a.index('is') == 1
 	assert a.index('gre') == -1
-
 	// int
 	b := [1, 2, 3, 4]
 	assert b.index(1) == 0
 	assert b.index(4) == 3
 	assert b.index(5) == -1
-
 	// byte
 	c := [0x22, 0x33, 0x55]
 	assert c.index(0x22) == 0
 	assert c.index(0x55) == 2
 	assert c.index(0x99) == -1
-
 	// char
 	d := [`a`, `b`, `c`]
 	assert d.index(`b`) == 1
@@ -427,7 +421,6 @@ fn test_reduce() {
 	assert b == 15
 	assert c == 20
 	assert d == 14
-
 	e := [1, 2, 3]
 	f := e.reduce(sub, 0)
 	g := e.reduce(sub, -1)
@@ -465,7 +458,6 @@ fn test_map() {
 	assert bools[0] == true
 	assert bools[1] == false
 	assert bools[2] == false
-
 }
 
 fn test_array_str() {
@@ -498,7 +490,29 @@ fn test_sort() {
 	assert nums[4] == 108
 }
 
+fn test_f32_sort() {
+	mut f := [50.0, 15, 1, 79, 38, 0, 27]
+	f.sort_with_compare(compare_f32)
+	assert f[0] == 0.0
+	assert f[1] == 1.0
+	assert f[6] == 79.0
+}
 
+fn test_f64_sort() {
+	mut f := [f64(50.0), 15, 1, 79, 38, 0, 27]
+	f.sort_with_compare(compare_f64)
+	assert f[0] == 0.0
+	assert f[1] == 1.0
+	assert f[6] == 79.0
+}
+
+fn test_i64_sort() {
+	mut f := [i64(50), 15, 1, 79, 38, 0, 27]
+	f.sort_with_compare(compare_i64)
+	assert f[0] == 0
+	assert f[1] == 1
+	assert f[6] == 79
+}
 
 /*
 fn test_for_last() {
@@ -516,6 +530,7 @@ fn test_for_last() {
 }
 */
 
+
 struct Foo {
 mut:
 	bar []int