github.com/zhongdalu/gf@v1.0.0/g/container/gset/gset_z_unit_int_test.go

// Copyright 2018 gf Author(https://github.com/zhongdalu/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/zhongdalu/gf.

// go test *.go

package gset_test

import (
	"github.com/zhongdalu/gf/g/container/garray"
	"github.com/zhongdalu/gf/g/container/gset"
	"github.com/zhongdalu/gf/g/test/gtest"
	"strings"
	"testing"
)

func TestIntSet_Basic(t *testing.T) {
	gtest.Case(t, func() {
		s := gset.NewIntSet()
		s.Add(1).Add(1).Add(2)
		s.Add([]int{3, 4}...)
		gtest.Assert(s.Size(), 4)
		gtest.AssertIN(1, s.Slice())
		gtest.AssertIN(2, s.Slice())
		gtest.AssertIN(3, s.Slice())
		gtest.AssertIN(4, s.Slice())
		gtest.AssertNI(0, s.Slice())
		gtest.Assert(s.Contains(4), true)
		gtest.Assert(s.Contains(5), false)
		s.Remove(1)
		gtest.Assert(s.Size(), 3)
		s.Clear()
		gtest.Assert(s.Size(), 0)
	})
}

func TestIntSet_Iterator(t *testing.T) {
	gtest.Case(t, func() {
		s := gset.NewIntSet()
		s.Add(1).Add(2).Add(3)
		gtest.Assert(s.Size(), 3)

		a1 := garray.New()
		a2 := garray.New()
		s.Iterator(func(v int) bool {
			a1.Append(1)
			return false
		})
		s.Iterator(func(v int) bool {
			a2.Append(1)
			return true
		})
		gtest.Assert(a1.Len(), 1)
		gtest.Assert(a2.Len(), 3)
	})
}

func TestIntSet_LockFunc(t *testing.T) {
	gtest.Case(t, func() {
		s := gset.NewIntSet()
		s.Add(1).Add(2).Add(3)
		gtest.Assert(s.Size(), 3)
		s.LockFunc(func(m map[int]struct{}) {
			delete(m, 1)
		})
		gtest.Assert(s.Size(), 2)
		s.RLockFunc(func(m map[int]struct{}) {
			gtest.Assert(m, map[int]struct{}{
				3: struct{}{},
				2: struct{}{},
			})
		})
	})
}

func TestIntSet_Equal(t *testing.T) {
	gtest.Case(t, func() {
		s1 := gset.NewIntSet()
		s2 := gset.NewIntSet()
		s3 := gset.NewIntSet()
		s1.Add(1).Add(2).Add(3)
		s2.Add(1).Add(2).Add(3)
		s3.Add(1).Add(2).Add(3).Add(4)
		gtest.Assert(s1.Equal(s2), true)
		gtest.Assert(s1.Equal(s3), false)
	})
}

func TestIntSet_IsSubsetOf(t *testing.T) {
	gtest.Case(t, func() {
		s1 := gset.NewIntSet()
		s2 := gset.NewIntSet()
		s3 := gset.NewIntSet()
		s1.Add(1).Add(2)
		s2.Add(1).Add(2).Add(3)
		s3.Add(1).Add(2).Add(3).Add(4)
		gtest.Assert(s1.IsSubsetOf(s2), true)
		gtest.Assert(s2.IsSubsetOf(s3), true)
		gtest.Assert(s1.IsSubsetOf(s3), true)
		gtest.Assert(s2.IsSubsetOf(s1), false)
		gtest.Assert(s3.IsSubsetOf(s2), false)
	})
}

func TestIntSet_Union(t *testing.T) {
	gtest.Case(t, func() {
		s1 := gset.NewIntSet()
		s2 := gset.NewIntSet()
		s1.Add(1).Add(2)
		s2.Add(3).Add(4)
		s3 := s1.Union(s2)
		gtest.Assert(s3.Contains(1), true)
		gtest.Assert(s3.Contains(2), true)
		gtest.Assert(s3.Contains(3), true)
		gtest.Assert(s3.Contains(4), true)
	})
}

func TestIntSet_Diff(t *testing.T) {
	gtest.Case(t, func() {
		s1 := gset.NewIntSet()
		s2 := gset.NewIntSet()
		s1.Add(1).Add(2).Add(3)
		s2.Add(3).Add(4).Add(5)
		s3 := s1.Diff(s2)
		gtest.Assert(s3.Contains(1), true)
		gtest.Assert(s3.Contains(2), true)
		gtest.Assert(s3.Contains(3), false)
		gtest.Assert(s3.Contains(4), false)
	})
}

func TestIntSet_Intersect(t *testing.T) {
	gtest.Case(t, func() {
		s1 := gset.NewIntSet()
		s2 := gset.NewIntSet()
		s1.Add(1).Add(2).Add(3)
		s2.Add(3).Add(4).Add(5)
		s3 := s1.Intersect(s2)
		gtest.Assert(s3.Contains(1), false)
		gtest.Assert(s3.Contains(2), false)
		gtest.Assert(s3.Contains(3), true)
		gtest.Assert(s3.Contains(4), false)
	})
}

func TestIntSet_Complement(t *testing.T) {
	gtest.Case(t, func() {
		s1 := gset.NewIntSet()
		s2 := gset.NewIntSet()
		s1.Add(1).Add(2).Add(3)
		s2.Add(3).Add(4).Add(5)
		s3 := s1.Complement(s2)
		gtest.Assert(s3.Contains(1), false)
		gtest.Assert(s3.Contains(2), false)
		gtest.Assert(s3.Contains(4), true)
		gtest.Assert(s3.Contains(5), true)
	})
}

func TestIntSet_Size(t *testing.T) {
	gtest.Case(t, func() {
		s1 := gset.NewIntSet(true)
		s1.Add(1).Add(2).Add(3)
		gtest.Assert(s1.Size(), 3)

	})

}

func TestIntSet_Merge(t *testing.T) {
	gtest.Case(t, func() {
		s1 := gset.NewIntSet()
		s2 := gset.NewIntSet()
		s1.Add(1).Add(2).Add(3)
		s2.Add(3).Add(4).Add(5)
		s3 := s1.Merge(s2)
		gtest.Assert(s3.Contains(1), true)
		gtest.Assert(s3.Contains(5), true)
		gtest.Assert(s3.Contains(6), false)
	})
}

func TestIntSet_Join(t *testing.T) {
	gtest.Case(t, func() {
		s1 := gset.NewIntSet()
		s1.Add(1).Add(2).Add(3)
		s3 := s1.Join(",")
		gtest.Assert(strings.Contains(s3, "3"), true)

	})
}

func TestIntSet_Sum(t *testing.T) {
	gtest.Case(t, func() {
		s1 := gset.NewIntSet()
		s1.Add(1).Add(2).Add(3)
		s2 := gset.NewIntSet()
		s2.Add(5).Add(6).Add(7)
		gtest.Assert(s2.Sum(), 18)

	})

}

func TestIntSet_Pop(t *testing.T) {
	gtest.Case(t, func() {
		s1 := gset.NewIntSet()
		s1.Add(4).Add(2).Add(3)
		gtest.AssertIN(s1.Pop(1), []int{4, 2, 3})
		gtest.AssertIN(s1.Pop(5), []int{4, 2, 3})
		gtest.Assert(s1.Size(), 3)
	})
}