Feat: Adding the equivalent of checking if two slices are the same

intersect.go

@@ -44,6 +44,28 @@ func EveryBy[T any](collection []T, predicate func(item T) bool) bool {
 	return true
 }
 
+// Equivalent Returns true if the subset has the same elements and the same number of each element as the collection.
+func Equivalent[T comparable](collection, subset []T) bool {
+	l := len(collection)
+	if l != len(subset) {
+		return false
+	}
+
+	var m = make(map[T]int, l)
+	for i := range collection {
+		m[collection[i]] += 1
+	}
+	for i := range subset {
+		m[subset[i]] -= 1
+	}
+	for _, v := range m {
+		if v != 0 {
+			return false
+		}
+	}
+	return true
+}
+
 // Some returns true if at least 1 element of a subset is contained into a collection.
 // If the subset is empty Some returns false.
 func Some[T comparable](collection []T, subset []T) bool {

intersect_test.go

@@ -84,6 +84,29 @@ func TestEveryBy(t *testing.T) {
 	is.True(result4)
 }
 
+func TestEquivalent(t *testing.T) {
+	t.Parallel()
+	is := assert.New(t)
+
+	result1 := Equivalent([]int{0, 1, 2, 3, 4, 5}, []int{0, 1, 2, 3, 4, 5})
+	is.True(result1)
+
+	result2 := Equivalent([]int{2, 3, 4, 5, 0, 1}, []int{0, 1, 2, 3, 4, 5})
+	is.True(result2)
+
+	result3 := Equivalent([]int{0, 1, 1, 3, 0, 0}, []int{0, 1, 3, 0, 1, 0})
+	is.True(result3)
+
+	result4 := Equivalent([]int{0, 1, 2, 3, 4}, []int{0, 1, 2, 3, 4, 5})
+	is.False(result4)
+
+	result5 := Equivalent([]int{0, 1, 2, 3, 4, 6}, []int{0, 1, 2, 3, 4, 5})
+	is.False(result5)
+
+	result6 := Equivalent([]int{0, 1, 1, 1, 1, 1}, []int{0, 0, 1, 1, 1, 1})
+	is.False(result6)
+}
+
 func TestSome(t *testing.T) {
 	t.Parallel()
 	is := assert.New(t)