mirror of
https://gitee.com/johng/gf.git
synced 2024-12-05 05:37:55 +08:00
624 lines
16 KiB
Go
624 lines
16 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 (
|
|
"testing"
|
|
|
|
"github.com/gogf/gf/g/container/garray"
|
|
"github.com/gogf/gf/g/test/gtest"
|
|
)
|
|
|
|
func Test_IntArray_Basic(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
expect := []int{0, 1, 2, 3}
|
|
array := garray.NewIntArrayFrom(expect)
|
|
gtest.Assert(array.Slice(), expect)
|
|
array.Set(0, 100)
|
|
gtest.Assert(array.Get(0), 100)
|
|
gtest.Assert(array.Get(1), 1)
|
|
gtest.Assert(array.Search(100), 0)
|
|
gtest.Assert(array.Contains(100), true)
|
|
gtest.Assert(array.Remove(0), 100)
|
|
gtest.Assert(array.Contains(100), false)
|
|
array.Append(4)
|
|
gtest.Assert(array.Len(), 4)
|
|
array.InsertBefore(0, 100)
|
|
array.InsertAfter(0, 200)
|
|
gtest.Assert(array.Slice(), []int{100, 200, 1, 2, 3, 4})
|
|
array.InsertBefore(5, 300)
|
|
array.InsertAfter(6, 400)
|
|
gtest.Assert(array.Slice(), []int{100, 200, 1, 2, 3, 300, 4, 400})
|
|
gtest.Assert(array.Clear().Len(), 0)
|
|
})
|
|
}
|
|
|
|
func TestIntArray_Sort(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
expect1 := []int{0, 1, 2, 3}
|
|
expect2 := []int{3, 2, 1, 0}
|
|
array := garray.NewIntArray()
|
|
for i := 3; i >= 0; i-- {
|
|
array.Append(i)
|
|
}
|
|
array.Sort()
|
|
gtest.Assert(array.Slice(), expect1)
|
|
array.Sort(true)
|
|
gtest.Assert(array.Slice(), expect2)
|
|
})
|
|
}
|
|
|
|
func TestIntArray_Unique(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
expect := []int{1, 1, 2, 3}
|
|
array := garray.NewIntArrayFrom(expect)
|
|
gtest.Assert(array.Unique().Slice(), []int{1, 2, 3})
|
|
})
|
|
}
|
|
|
|
func TestIntArray_PushAndPop(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
expect := []int{0, 1, 2, 3}
|
|
array := garray.NewIntArrayFrom(expect)
|
|
gtest.Assert(array.Slice(), expect)
|
|
gtest.Assert(array.PopLeft(), 0)
|
|
gtest.Assert(array.PopRight(), 3)
|
|
gtest.AssertIN(array.PopRand(), []int{1, 2})
|
|
gtest.AssertIN(array.PopRand(), []int{1, 2})
|
|
gtest.Assert(array.Len(), 0)
|
|
array.PushLeft(1).PushRight(2)
|
|
gtest.Assert(array.Slice(), []int{1, 2})
|
|
})
|
|
}
|
|
|
|
func TestIntArray_PopLeftsAndPopRights(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
value1 := []int{0, 1, 2, 3, 4, 5, 6}
|
|
value2 := []int{0, 1, 2, 3, 4, 5, 6}
|
|
array1 := garray.NewIntArrayFrom(value1)
|
|
array2 := garray.NewIntArrayFrom(value2)
|
|
gtest.Assert(array1.PopLefts(2), []int{0, 1})
|
|
gtest.Assert(array1.Slice(), []int{2, 3, 4, 5, 6})
|
|
gtest.Assert(array1.PopRights(2), []int{5, 6})
|
|
gtest.Assert(array1.Slice(), []int{2, 3, 4})
|
|
gtest.Assert(array1.PopRights(20), []int{2, 3, 4})
|
|
gtest.Assert(array1.Slice(), []int{})
|
|
gtest.Assert(array2.PopLefts(20), []int{0, 1, 2, 3, 4, 5, 6})
|
|
gtest.Assert(array2.Slice(), []int{})
|
|
})
|
|
}
|
|
|
|
func TestIntArray_Range(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
value1 := []int{0, 1, 2, 3, 4, 5, 6}
|
|
array1 := garray.NewIntArrayFrom(value1)
|
|
gtest.Assert(array1.Range(0, 1), []int{0})
|
|
gtest.Assert(array1.Range(1, 2), []int{1})
|
|
gtest.Assert(array1.Range(0, 2), []int{0, 1})
|
|
gtest.Assert(array1.Range(10, 2), nil)
|
|
gtest.Assert(array1.Range(-1, 10), value1)
|
|
})
|
|
}
|
|
|
|
func TestIntArray_Merge(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{0, 1, 2, 3}
|
|
a2 := []int{4, 5, 6, 7}
|
|
array1 := garray.NewIntArrayFrom(a1)
|
|
array2 := garray.NewIntArrayFrom(a2)
|
|
gtest.Assert(array1.Merge(array2).Slice(), []int{0, 1, 2, 3, 4, 5, 6, 7})
|
|
})
|
|
}
|
|
|
|
func TestIntArray_Fill(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{0}
|
|
a2 := []int{0}
|
|
array1 := garray.NewIntArrayFrom(a1)
|
|
array2 := garray.NewIntArrayFrom(a2)
|
|
gtest.Assert(array1.Fill(1, 2, 100).Slice(), []int{0, 100, 100})
|
|
gtest.Assert(array2.Fill(0, 2, 100).Slice(), []int{100, 100})
|
|
})
|
|
}
|
|
|
|
func TestIntArray_Chunk(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 2, 3, 4, 5}
|
|
array1 := garray.NewIntArrayFrom(a1)
|
|
chunks := array1.Chunk(2)
|
|
gtest.Assert(len(chunks), 3)
|
|
gtest.Assert(chunks[0], []int{1, 2})
|
|
gtest.Assert(chunks[1], []int{3, 4})
|
|
gtest.Assert(chunks[2], []int{5})
|
|
})
|
|
}
|
|
|
|
func TestIntArray_Pad(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{0}
|
|
array1 := garray.NewIntArrayFrom(a1)
|
|
gtest.Assert(array1.Pad(3, 1).Slice(), []int{0, 1, 1})
|
|
gtest.Assert(array1.Pad(-4, 1).Slice(), []int{1, 0, 1, 1})
|
|
gtest.Assert(array1.Pad(3, 1).Slice(), []int{1, 0, 1, 1})
|
|
})
|
|
}
|
|
|
|
func TestIntArray_SubSlice(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{0, 1, 2, 3, 4, 5, 6}
|
|
array1 := garray.NewIntArrayFrom(a1)
|
|
gtest.Assert(array1.SubSlice(6), []int{6})
|
|
gtest.Assert(array1.SubSlice(5), []int{5, 6})
|
|
gtest.Assert(array1.SubSlice(8), nil)
|
|
gtest.Assert(array1.SubSlice(0, 2), []int{0, 1})
|
|
gtest.Assert(array1.SubSlice(2, 2), []int{2, 3})
|
|
gtest.Assert(array1.SubSlice(5, 8), []int{5, 6})
|
|
gtest.Assert(array1.SubSlice(-1, 1), []int{6})
|
|
gtest.Assert(array1.SubSlice(-1, 9), []int{6})
|
|
gtest.Assert(array1.SubSlice(-2, 3), []int{5, 6})
|
|
gtest.Assert(array1.SubSlice(-7, 3), []int{0, 1, 2})
|
|
gtest.Assert(array1.SubSlice(-8, 3), nil)
|
|
gtest.Assert(array1.SubSlice(-1, -3), []int{3, 4, 5})
|
|
gtest.Assert(array1.SubSlice(-9, 3), nil)
|
|
gtest.Assert(array1.SubSlice(1, -1), []int{0})
|
|
gtest.Assert(array1.SubSlice(1, -3), nil)
|
|
})
|
|
}
|
|
|
|
func TestIntArray_Rand(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{0, 1, 2, 3, 4, 5, 6}
|
|
array1 := garray.NewIntArrayFrom(a1)
|
|
gtest.Assert(len(array1.Rands(2)), 2)
|
|
gtest.Assert(len(array1.Rands(10)), 7)
|
|
gtest.AssertIN(array1.Rands(1)[0], a1)
|
|
gtest.AssertIN(array1.Rand(), a1)
|
|
})
|
|
}
|
|
|
|
func TestIntArray_PopRands(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{100, 200, 300, 400, 500, 600}
|
|
array := garray.NewIntArrayFrom(a1)
|
|
ns1 := array.PopRands(2)
|
|
gtest.AssertIN(ns1, []int{100, 200, 300, 400, 500, 600})
|
|
gtest.AssertIN(len(ns1), 2)
|
|
|
|
ns2 := array.PopRands(7)
|
|
gtest.AssertIN(len(ns2), 6)
|
|
gtest.AssertIN(ns2, []int{100, 200, 300, 400, 500, 600})
|
|
|
|
})
|
|
}
|
|
|
|
func TestIntArray_Shuffle(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{0, 1, 2, 3, 4, 5, 6}
|
|
array1 := garray.NewIntArrayFrom(a1)
|
|
gtest.Assert(array1.Shuffle().Len(), 7)
|
|
})
|
|
}
|
|
|
|
func TestIntArray_Reverse(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{0, 1, 2, 3, 4, 5, 6}
|
|
array1 := garray.NewIntArrayFrom(a1)
|
|
gtest.Assert(array1.Reverse().Slice(), []int{6, 5, 4, 3, 2, 1, 0})
|
|
})
|
|
}
|
|
|
|
func TestIntArray_Join(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{0, 1, 2, 3, 4, 5, 6}
|
|
array1 := garray.NewIntArrayFrom(a1)
|
|
gtest.Assert(array1.Join("."), "0.1.2.3.4.5.6")
|
|
})
|
|
}
|
|
|
|
func TestNewSortedIntArrayFrom(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{0, 3, 2, 1, 4, 5, 6}
|
|
array1 := garray.NewSortedIntArrayFrom(a1, true)
|
|
gtest.Assert(array1.Join("."), "0.1.2.3.4.5.6")
|
|
})
|
|
}
|
|
|
|
func TestNewSortedIntArrayFromCopy(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{0, 5, 2, 1, 4, 3, 6}
|
|
array1 := garray.NewSortedIntArrayFromCopy(a1, false)
|
|
gtest.Assert(array1.Join("."), "0.1.2.3.4.5.6")
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_SetArray(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{0, 1, 2, 3}
|
|
a2 := []int{4, 5, 6}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
array2 := array1.SetArray(a2)
|
|
|
|
gtest.Assert(array2.Len(), 3)
|
|
gtest.Assert(array2.Search(3), -1)
|
|
gtest.Assert(array2.Search(5), 1)
|
|
gtest.Assert(array2.Search(6), 2)
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_Sort(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{0, 3, 2, 1}
|
|
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
array2 := array1.Sort()
|
|
|
|
gtest.Assert(array2.Len(), 4)
|
|
gtest.Assert(array2, []int{0, 1, 2, 3})
|
|
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_Get(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 3, 5, 0}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
gtest.Assert(array1.Get(0), 0)
|
|
gtest.Assert(array1.Get(1), 1)
|
|
gtest.Assert(array1.Get(3), 5)
|
|
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_Remove(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 3, 5, 0}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
i1 := array1.Remove(2)
|
|
gtest.Assert(i1, 3)
|
|
gtest.Assert(array1.Search(5), 2)
|
|
|
|
// 再次删除剩下的数组中的第一个
|
|
i2 := array1.Remove(0)
|
|
gtest.Assert(i2, 0)
|
|
gtest.Assert(array1.Search(5), 1)
|
|
|
|
a2 := []int{1, 3, 4}
|
|
array2 := garray.NewSortedIntArrayFrom(a2)
|
|
i3 := array2.Remove(1)
|
|
gtest.Assert(array2.Search(1), 0)
|
|
gtest.Assert(i3, 3)
|
|
i3 = array2.Remove(1)
|
|
gtest.Assert(array2.Search(4), -1)
|
|
gtest.Assert(i3, 4)
|
|
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_PopLeft(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 3, 5, 2}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
i1 := array1.PopLeft()
|
|
gtest.Assert(i1, 1)
|
|
gtest.Assert(array1.Len(), 3)
|
|
gtest.Assert(array1.Search(1), -1)
|
|
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_PopRight(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 3, 5, 2}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
i1 := array1.PopRight()
|
|
gtest.Assert(i1, 5)
|
|
gtest.Assert(array1.Len(), 3)
|
|
gtest.Assert(array1.Search(5), -1)
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_PopRand(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 3, 5, 2}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
i1 := array1.PopRand()
|
|
gtest.Assert(array1.Len(), 3)
|
|
gtest.Assert(array1.Search(i1), -1)
|
|
gtest.AssertIN(i1, []int{1, 3, 5, 2})
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_PopRands(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 3, 5, 2}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
ns1 := array1.PopRands(2)
|
|
gtest.Assert(array1.Len(), 2)
|
|
gtest.AssertIN(ns1, []int{1, 3, 5, 2})
|
|
|
|
a2 := []int{1, 3, 5, 2}
|
|
array2 := garray.NewSortedIntArrayFrom(a2)
|
|
ns2 := array2.PopRands(5)
|
|
gtest.Assert(array2.Len(), 0)
|
|
gtest.Assert(len(ns2), 4)
|
|
gtest.AssertIN(ns2, []int{1, 3, 5, 2})
|
|
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_PopLefts(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 3, 5, 2}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
ns1 := array1.PopLefts(2)
|
|
gtest.Assert(array1.Len(), 2)
|
|
gtest.Assert(ns1, []int{1, 2})
|
|
|
|
a2 := []int{1, 3, 5, 2}
|
|
array2 := garray.NewSortedIntArrayFrom(a2)
|
|
ns2 := array2.PopLefts(5)
|
|
gtest.Assert(array2.Len(), 0)
|
|
gtest.AssertIN(ns2, []int{1, 3, 5, 2})
|
|
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_PopRights(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 3, 5, 2}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
ns1 := array1.PopRights(2)
|
|
gtest.Assert(array1.Len(), 2)
|
|
gtest.Assert(ns1, []int{3, 5})
|
|
|
|
a2 := []int{1, 3, 5, 2}
|
|
array2 := garray.NewSortedIntArrayFrom(a2)
|
|
ns2 := array2.PopRights(5)
|
|
gtest.Assert(array2.Len(), 0)
|
|
gtest.AssertIN(ns2, []int{1, 3, 5, 2})
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_Range(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 3, 5, 2, 6, 7}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
ns1 := array1.Range(1, 4)
|
|
gtest.Assert(len(ns1), 3)
|
|
gtest.Assert(ns1, []int{2, 3, 5})
|
|
|
|
ns2 := array1.Range(5, 4)
|
|
gtest.Assert(len(ns2), 0)
|
|
|
|
ns3 := array1.Range(-1, 4)
|
|
gtest.Assert(len(ns3), 4)
|
|
|
|
nsl := array1.Range(5, 8)
|
|
gtest.Assert(len(nsl), 1)
|
|
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_Sum(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 3, 5}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
n1 := array1.Sum()
|
|
gtest.Assert(n1, 9)
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_Contains(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 3, 5}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
//gtest.Assert(array1.Contains(3),true) //todo 这一行应该返回true
|
|
gtest.Assert(array1.Contains(4), false)
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_Clone(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 3, 5}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
array2 := array1.Clone()
|
|
gtest.Assert(array2.Len(), 3)
|
|
gtest.Assert(array2, array1)
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_Clear(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 3, 5}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
array1.Clear()
|
|
gtest.Assert(array1.Len(), 0)
|
|
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_Chunk(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 2, 3, 4, 5}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
ns1 := array1.Chunk(2) //按每几个元素切成一个数组
|
|
ns2 := array1.Chunk(-1)
|
|
gtest.Assert(len(ns1), 3)
|
|
gtest.Assert(ns1[0], []int{1, 2})
|
|
gtest.Assert(ns1[2], []int{5})
|
|
gtest.Assert(len(ns2), 0)
|
|
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_SubSlice(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 2, 3, 4, 5}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
ns1 := array1.SubSlice(1, 2)
|
|
gtest.Assert(len(ns1), 2)
|
|
gtest.Assert(ns1, []int{2, 3})
|
|
|
|
ns2 := array1.SubSlice(7, 2)
|
|
gtest.Assert(len(ns2), 0)
|
|
|
|
ns3 := array1.SubSlice(3, 5)
|
|
gtest.Assert(len(ns3), 2)
|
|
gtest.Assert(ns3, []int{4, 5})
|
|
|
|
ns4 := array1.SubSlice(3, 1)
|
|
gtest.Assert(len(ns4), 1)
|
|
gtest.Assert(ns4, []int{4})
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_Rand(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 2, 3, 4, 5}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
ns1 := array1.Rand() //按每几个元素切成一个数组
|
|
gtest.AssertIN(ns1, a1)
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_Rands(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 2, 3, 4, 5}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
ns1 := array1.Rands(2) //按每几个元素切成一个数组
|
|
gtest.AssertIN(ns1, a1)
|
|
gtest.Assert(len(ns1), 2)
|
|
|
|
ns2 := array1.Rands(6) //按每几个元素切成一个数组
|
|
gtest.AssertIN(ns2, a1)
|
|
gtest.Assert(len(ns2), 5)
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_CountValues(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 2, 3, 4, 5, 3}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
ns1 := array1.CountValues() //按每几个元素切成一个数组
|
|
gtest.Assert(len(ns1), 5)
|
|
gtest.Assert(ns1[2], 1)
|
|
gtest.Assert(ns1[3], 2)
|
|
})
|
|
}
|
|
|
|
func TestSortedIntArray_SetUnique(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 2, 3, 4, 5, 3}
|
|
array1 := garray.NewSortedIntArrayFrom(a1)
|
|
array1.SetUnique(true)
|
|
gtest.Assert(array1.Len(), 5)
|
|
gtest.Assert(array1, []int{1, 2, 3, 4, 5})
|
|
|
|
})
|
|
}
|
|
|
|
func TestIntArray_SetArray(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 2, 3, 5}
|
|
a2 := []int{6, 7}
|
|
array1 := garray.NewIntArrayFrom(a1)
|
|
array1.SetArray(a2)
|
|
gtest.Assert(array1.Len(), 2)
|
|
gtest.Assert(array1, []int{6, 7})
|
|
|
|
})
|
|
}
|
|
|
|
func TestIntArray_Replace(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 2, 3, 5}
|
|
a2 := []int{6, 7}
|
|
a3 := []int{9, 10, 11, 12, 13}
|
|
array1 := garray.NewIntArrayFrom(a1)
|
|
array1.Replace(a2)
|
|
gtest.Assert(array1, []int{6, 7, 3, 5})
|
|
|
|
array1.Replace(a3)
|
|
gtest.Assert(array1, []int{9, 10, 11, 12})
|
|
})
|
|
}
|
|
|
|
func TestIntArray_Clear(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 2, 3, 5}
|
|
array1 := garray.NewIntArrayFrom(a1)
|
|
array1.Clear()
|
|
gtest.Assert(array1.Len(), 0)
|
|
})
|
|
}
|
|
|
|
func TestIntArray_Clone(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 2, 3, 5}
|
|
array1 := garray.NewIntArrayFrom(a1)
|
|
array2 := array1.Clone()
|
|
gtest.Assert(array1, array2)
|
|
})
|
|
}
|
|
|
|
func TestArray_Get(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 2, 3, 5}
|
|
array1 := garray.NewIntArrayFrom(a1)
|
|
gtest.Assert(array1.Get(2), 3)
|
|
gtest.Assert(array1.Len(), 4)
|
|
})
|
|
}
|
|
|
|
func TestIntArray_Sum(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 2, 3, 5}
|
|
array1 := garray.NewIntArrayFrom(a1)
|
|
gtest.Assert(array1.Sum(), 11)
|
|
})
|
|
}
|
|
|
|
func TestIntArray_CountValues(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 2, 3, 5, 3}
|
|
array1 := garray.NewIntArrayFrom(a1)
|
|
m1 := array1.CountValues()
|
|
gtest.Assert(len(m1), 4)
|
|
gtest.Assert(m1[1], 1)
|
|
gtest.Assert(m1[3], 2)
|
|
})
|
|
}
|
|
|
|
func TestNewIntArrayFromCopy(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 2, 3, 5, 3}
|
|
array1 := garray.NewIntArrayFromCopy(a1)
|
|
gtest.Assert(array1.Len(), 5)
|
|
gtest.Assert(array1, a1)
|
|
})
|
|
}
|
|
|
|
func TestIntArray_Remove(t *testing.T) {
|
|
gtest.Case(t, func() {
|
|
a1 := []int{1, 2, 3, 5, 4}
|
|
array1 := garray.NewIntArrayFrom(a1)
|
|
n1 := array1.Remove(1)
|
|
gtest.Assert(n1, 2)
|
|
gtest.Assert(array1.Len(), 4)
|
|
|
|
n1 = array1.Remove(0)
|
|
gtest.Assert(n1, 1)
|
|
gtest.Assert(array1.Len(), 3)
|
|
|
|
n1 = array1.Remove(2)
|
|
gtest.Assert(n1, 4)
|
|
gtest.Assert(array1.Len(), 2)
|
|
})
|
|
}
|