bugfix: SliceContainsAll should pass cmp.Option to SliceContainsSubset (

#137)

* SliceContainsAll should pass cmp.Option
to SliceContainsSubset

* remove unnecessary newline

internal/assertions/assertions.go

@@ -414,22 +414,22 @@ func SliceNotContainsFunc[A, B any](slice []A, item B, eq func(a A, b B) bool) (
 	return
 }
 
-func SliceContainsAll[A any](slice, items []A) (s string) {
+func SliceContainsAll[A any](slice, items []A, opts ...cmp.Option) (s string) {
 	if len(slice) != len(items) {
 		s = "expected slice and items to contain same number of elements\n"
 		s += bullet("len(slice): %d\n", len(slice))
 		s += bullet("len(items): %d\n", len(items))
 		return s
 	}
-	return SliceContainsSubset(slice, items)
+	return SliceContainsSubset(slice, items, opts...)
 }
 
-func SliceContainsSubset[A any](slice, items []A) (s string) {
+func SliceContainsSubset[A any](slice, items []A, opts ...cmp.Option) (s string) {
 OUTER:
 	for _, target := range items {
 		var item A
 		for _, item = range slice {
-			if cmp.Equal(target, item) {
+			if cmp.Equal(target, item, opts...) {
 				continue OUTER
 			}
 		}

test.go

@@ -229,14 +229,14 @@ func SliceNotContainsFunc[A, B any](t T, slice []A, item B, eq func(a A, b B) bo
 // same.
 func SliceContainsAll[A any](t T, slice, items []A, settings ...Setting) {
 	t.Helper()
-	invoke(t, assertions.SliceContainsAll(slice, items), settings...)
+	invoke(t, assertions.SliceContainsAll(slice, items, options(settings...)...), settings...)
 }
 
 // SliceContainsSubset asserts slice contains each item in items, in no particular
 // order. There could be additional elements in slice not in items.
 func SliceContainsSubset[A any](t T, slice, items []A, settings ...Setting) {
 	t.Helper()
-	invoke(t, assertions.SliceContainsSubset(slice, items), settings...)
+	invoke(t, assertions.SliceContainsSubset(slice, items, options(settings...)...), settings...)
 }
 
 // Positive asserts n > 0.