Ref implemented

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=

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)

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()