mirror of
https://gitee.com/johng/gf.git
synced 2024-12-04 13:18:01 +08:00
95 lines
2.5 KiB
Go
95 lines
2.5 KiB
Go
// Copyright 2018 gf Author(https://github.com/gogf/gf). All Rights Reserved.
|
|
//
|
|
// This Source Code Form is subject to the terms of the MIT License.
|
|
// If a copy of the MIT was not distributed with this file,
|
|
// You can obtain one at https://github.com/gogf/gf.
|
|
|
|
// go test *.go
|
|
|
|
package garray_test
|
|
|
|
import (
|
|
"github.com/gogf/gf/g/container/garray"
|
|
"github.com/gogf/gf/g/test/gtest"
|
|
"github.com/gogf/gf/g/util/gconv"
|
|
"strings"
|
|
"testing"
|
|
)
|
|
|
|
func Test_IntArray_Unique(t *testing.T) {
|
|
expect := []int{1, 2, 3, 4, 5, 6}
|
|
array := garray.NewIntArray()
|
|
array.Append(1, 1, 2, 3, 3, 4, 4, 5, 5, 6, 6)
|
|
array.Unique()
|
|
gtest.Assert(array.Slice(), expect)
|
|
}
|
|
|
|
func Test_SortedIntArray1(t *testing.T) {
|
|
expect := []int{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
|
|
array := garray.NewSortedIntArray()
|
|
for i := 10; i > -1; i-- {
|
|
array.Add(i)
|
|
}
|
|
gtest.Assert(array.Slice(), expect)
|
|
}
|
|
|
|
func Test_SortedIntArray2(t *testing.T) {
|
|
expect := []int{0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10}
|
|
array := garray.NewSortedIntArray()
|
|
for i := 0; i <= 10; i++ {
|
|
array.Add(i)
|
|
}
|
|
gtest.Assert(array.Slice(), expect)
|
|
}
|
|
|
|
func Test_SortedStringArray1(t *testing.T) {
|
|
expect := []string{"0", "1", "10", "2", "3", "4", "5", "6", "7", "8", "9"}
|
|
array := garray.NewSortedStringArray()
|
|
for i := 10; i > -1; i-- {
|
|
array.Add(gconv.String(i))
|
|
}
|
|
gtest.Assert(array.Slice(), expect)
|
|
}
|
|
|
|
func Test_SortedStringArray2(t *testing.T) {
|
|
expect := []string{"0", "1", "10", "2", "3", "4", "5", "6", "7", "8", "9"}
|
|
array := garray.NewSortedStringArray()
|
|
for i := 0; i <= 10; i++ {
|
|
array.Add(gconv.String(i))
|
|
}
|
|
gtest.Assert(array.Slice(), expect)
|
|
}
|
|
|
|
func Test_SortedArray1(t *testing.T) {
|
|
expect := []string{"0", "1", "10", "2", "3", "4", "5", "6", "7", "8", "9"}
|
|
array := garray.NewSortedArray(func(v1, v2 interface{}) int {
|
|
return strings.Compare(gconv.String(v1), gconv.String(v2))
|
|
})
|
|
for i := 10; i > -1; i-- {
|
|
array.Add(gconv.String(i))
|
|
}
|
|
gtest.Assert(array.Slice(), expect)
|
|
}
|
|
|
|
func Test_SortedArray2(t *testing.T) {
|
|
expect := []string{"0", "1", "10", "2", "3", "4", "5", "6", "7", "8", "9"}
|
|
array := garray.NewSortedArray(func(v1, v2 interface{}) int {
|
|
return strings.Compare(gconv.String(v1), gconv.String(v2))
|
|
})
|
|
for i := 0; i <= 10; i++ {
|
|
array.Add(gconv.String(i))
|
|
}
|
|
gtest.Assert(array.Slice(), expect)
|
|
}
|
|
|
|
func TestNewFromCopy(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []interface{}{"100", "200", "300", "400", "500", "600"}
|
|
array1 := garray.NewFromCopy(a1)
|
|
gtest.AssertIN(array1.PopRands(2), a1)
|
|
gtest.Assert(len(array1.PopRands(1)), 1)
|
|
gtest.Assert(len(array1.PopRands(9)), 3)
|
|
|
|
})
|
|
}
|