Function Intersect

arrayOperations.go:122–154

Intersect returns a slice of values that are present in all of the input slices example #1 a := []int{1, 1, 3, 4, 5, 6} b := []int{2, 3, 6} fmt.Println(Intersect[int](a, b)) output: []int{3, 6} example #2 fmt.Println(Intersect[int]([]int{1, 1, 3, 4, 5, 6})) output: []int{1, 3, 4, 5, 6}

(arrs ...[]T)

//  fmt.Println(Intersect[int]([]int{1, 1, 3, 4, 5, 6}))
//  // output: []int{1, 3, 4, 5, 6}
func Intersect[T comparable](arrs ...[]T) []T {
	m := make(map[T]int)

	var (
		tmpArr []T
		count  int
		ok     bool
	)
	for idx1 := range arrs {
		tmpArr = Distinct(arrs[idx1])

		for idx2 := range tmpArr {
			count, ok = m[tmpArr[idx2]]
			if !ok {
				m[tmpArr[idx2]] = 1
			} else {
				m[tmpArr[idx2]] = count + 1
			}
		}
	}

	var (
		ret     []T
		lenArrs int = len(arrs)
	)
	for k, v := range m {
		if v == lenArrs {
			ret = append(ret, k)
		}
	}

	return ret
}

// Union returns a slice that contains the unique values of all the input slices
//