git/lancet
1
0
Fork 0
mirror of https://github.com/duke-git/lancet.git synced 2026-03-01 00:35:28 +08:00
Code Issues Projects Releases Wiki Activity

feat: replace constraints comparable into any in some funcs

Browse Source
This commit is contained in:
dudaodong
2022-01-24 15:47:47 +08:00
parent 4eaa0a39d5
commit 5937183af0
2 changed files with 20 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
slice/slice.go
View File

@@ -24,18 +24,24 @@ func Contain[T any](slice []T, value T) bool {
} }
// ContainSubSlice check if the slice contain subslice or not // ContainSubSlice check if the slice contain subslice or not
func ContainSubSlice[T comparable](slice, subslice []T) bool { func ContainSubSlice[T any](slice, subslice []T) bool {
unique := make(map[T]bool)
for _, v := range slice {
unique[v] = true
}
for _, v := range subslice { for _, v := range subslice {
if !unique[v] { if !Contain(slice, v) {
return false return false
} }
} }
return true return true
// unique := make(map[T]bool)
// for _, v := range slice {
// unique[v] = true
// }
// for _, v := range subslice {
// if !unique[v] {
// return false
// }
// }
// return true
} }
// Chunk creates an slice of elements split into groups the length of size. // Chunk creates an slice of elements split into groups the length of size.
@@ -512,7 +518,7 @@ func UpdateByIndex[T any](slice []T, index int, value T) []T {
} }
// Unique remove duplicate elements in slice. // Unique remove duplicate elements in slice.
func Unique[T comparable](slice []T) []T { func Unique[T any](slice []T) []T {
if len(slice) == 0 { if len(slice) == 0 {
return []T{} return []T{}
} }
@@ -523,7 +529,7 @@ func Unique[T comparable](slice []T) []T {
v := slice[i] v := slice[i]
skip := true skip := true
for j := range res { for j := range res {
if v == res[j] { if reflect.DeepEqual(v, res[j]) {
skip = false skip = false
break break
} }
@@ -537,7 +543,7 @@ func Unique[T comparable](slice []T) []T {
} }
// Union creates a slice of unique values, in order, from all given slices. using == for equality comparisons. // Union creates a slice of unique values, in order, from all given slices. using == for equality comparisons.
func Union[T comparable](slices ...[]T) []T { func Union[T any](slices ...[]T) []T {
if len(slices) == 0 { if len(slices) == 0 {
return []T{} return []T{}
} }
@@ -555,7 +561,7 @@ func Union[T comparable](slices ...[]T) []T {
} }
// Intersection creates a slice of unique values that included by all slices. // Intersection creates a slice of unique values that included by all slices.
func Intersection[T comparable](slices ...[]T) []T { func Intersection[T any](slices ...[]T) []T {
var res []T var res []T
if len(slices) == 0 { if len(slices) == 0 {
return []T{} return []T{}
@@ -682,7 +688,7 @@ func SortByField(slice interface{}, field string, sortType ...string) error {
} }
// Without creates a slice excluding all given values // Without creates a slice excluding all given values
func Without[T comparable](slice []T, values ...T) []T { func Without[T any](slice []T, values ...T) []T {
if len(values) == 0 || len(slice) == 0 { if len(values) == 0 || len(slice) == 0 {
return slice return slice
} }

4
slice/slice_test.go
View File

@@ -21,8 +21,8 @@ func TestContainSubSlice(t *testing.T) {
assert := internal.NewAssert(t, "TestContainSubSlice") assert := internal.NewAssert(t, "TestContainSubSlice")
assert.Equal(true, ContainSubSlice([]string{"a", "a", "b", "c"}, []string{"a", "a"})) assert.Equal(true, ContainSubSlice([]string{"a", "a", "b", "c"}, []string{"a", "a"}))
assert.Equal(false, ContainSubSlice([]string{"a", "a", "b", "c"}, []string{"a", "d"})) assert.Equal(false, ContainSubSlice([]string{"a", "a", "b", "c"}, []string{"a", "d"}))
assert.Equal(true, ContainSubSlice([]int{1, 2, 3}, []int{1})) assert.Equal(true, ContainSubSlice([]int{1, 2, 3}, []int{1, 2}))
assert.Equal(false, ContainSubSlice([]int{1, 2, 3}, []int{0})) assert.Equal(false, ContainSubSlice([]int{1, 2, 3}, []int{0, 1}))
} }
func TestChunk(t *testing.T) { func TestChunk(t *testing.T) {