Ref implemented

- removed Search

filter.go

@@ -9,3 +9,30 @@ func Filter[T any](slice []T, f func(T) bool) []T {
 	}
 	return ret
 }
+
+func FindFirst[T any](slice []T, f func(T) bool) (T, bool) {
+	for _, v := range slice {
+		if f(v) {
+			return v, true
+		}
+	}
+	return *new(T), false
+}
+
+func FindFirstIndex[T any](slice []T, f func(T) bool) (int, bool) {
+	for i, v := range slice {
+		if f(v) {
+			return i, true
+		}
+	}
+	return -1, false
+}
+
+func FindLastIndex[T any](slice []T, f func(T) bool) (int, bool) {
+	for i := len(slice); i >= 0; i-- {
+		if f(slice[i]) {
+			return i, true
+		}
+	}
+	return -1, false
+}

go.mod

@@ -1,5 +1,5 @@
-module git.milar.in/milarin/slices
+module git.tordarus.net/tordarus/slices
 
 go 1.19
 
-require git.milar.in/milarin/gmath v0.0.3
+require git.tordarus.net/tordarus/gmath v0.0.7

go.sum

@@ -1,2 +1,2 @@
-git.milar.in/milarin/gmath v0.0.3 h1:ii6rKNItS55O/wtIFhD1cTN2BMwDZjTBmiOocKURvxM=
-git.milar.in/milarin/gmath v0.0.3/go.mod h1:HDLftG5RLpiNGKiIWh+O2G1PYkNzyLDADO8Cd/1abiE=
+git.tordarus.net/tordarus/gmath v0.0.7 h1:tR48idt9AUL0r556ww3ZxByTKJEr6NWCTlhl2ihzYxQ=
+git.tordarus.net/tordarus/gmath v0.0.7/go.mod h1:mO7aPlvNrGVE9UFXEuuACjZgMDsM63l3OcQy6xSQnoE=

of.go

@@ -14,3 +14,15 @@ func OfMap[K comparable, V, T any](m map[K]V, unmapper func(K, V) T) []T {
 	}
 	return out
 }
+
+// UnmapKey is an unmapper function which returns the map key only
+// and discards its value. It is supposed to be used with OfMap
+func UnmapKey[K comparable, V any](key K, _ V) K {
+	return key
+}
+
+// UnmapValue is an unmapper function which returns the map value only
+// and discards its key. It is supposed to be used with OfMap
+func UnmapValue[K comparable, V any](_ K, value V) V {
+	return value
+}

reduce.go

@@ -1,6 +1,6 @@
 package slices
 
-import "git.milar.in/milarin/gmath"
+import "git.tordarus.net/tordarus/gmath"
 
 func Reduce[T, R any](slice []T, reducer func(current R, v T) R) R {
 	res := new(R)

search.go

@@ -1,11 +0,0 @@
-package slices
-
-func Search[T any](slice []T, f func(a, b T) T) T {
-	if len(slice) == 0 {
-		return *new(T)
-	}
-
-	value := slice[0]
-	Each(slice, func(v T) { value = f(value, v) })
-	return value
-}

to.go

@@ -17,6 +17,16 @@ func Deref[T any](s []*T) []T {
 	return out
 }
 
+// Ref returns a slice containing pointers to all values of s.
+// The order in s is preserved.
+func Ref[T any](s []T) []*T {
+	out := make([]*T, 0, len(s))
+	Each(s, func(v T) {
+		out = append(out, &v)
+	})
+	return out
+}
+
 // ToList returns a list.List containing all values of s
 func ToList[T any](s []T) *list.List {
 	l := list.New()