Merge pull request #8 from IBM/cleue-auto-generate-traversal-for-read…

…eroieither

fix: auto generate SequenceT for ReaderIOEither

array/array.go

@@ -15,22 +15,13 @@ func From[A any](data ...A) []A {
 }
 
 // MakeBy returns a `Array` of length `n` with element `i` initialized with `f(i)`.
-func MakeBy[A any](n int, f func(int) A) []A {
-	// sanity check
-	if n <= 0 {
-		return Empty[A]()
-	}
-	// run the generator function across the input
-	as := make([]A, n)
-	for i := n - 1; i >= 0; i-- {
-		as[i] = f(i)
-	}
-	return as
+func MakeBy[F ~func(int) A, A any](n int, f F) []A {
+	return G.MakeBy[[]A](n, f)
 }
 
 // Replicate creates a `Array` containing a value repeated the specified number of times.
 func Replicate[A any](n int, a A) []A {
-	return MakeBy(n, F.Constant1[int](a))
+	return G.Replicate[[]A](n, a)
 }
 
 func MonadMap[A, B any](as []A, f func(a A) B) []B {
@@ -159,21 +150,19 @@ func Of[A any](a A) []A {
 }
 
 func MonadChain[A, B any](fa []A, f func(a A) []B) []B {
-	return array.Reduce(fa, func(bs []B, a A) []B {
-		return append(bs, f(a)...)
-	}, Zero[B]())
+	return G.MonadChain[[]A, []B](fa, f)
 }
 
-func Chain[A, B any](f func(a A) []B) func([]A) []B {
-	return F.Bind2nd(MonadChain[A, B], f)
+func Chain[A, B any](f func(A) []B) func([]A) []B {
+	return G.Chain[[]A, []B](f)
 }
 
 func MonadAp[B, A any](fab []func(A) B, fa []A) []B {
-	return MonadChain(fab, F.Bind1st(MonadMap[A, B], fa))
+	return G.MonadAp[[]B](fab, fa)
 }
 
 func Ap[B, A any](fa []A) func([]func(A) B) []B {
-	return F.Bind2nd(MonadAp[B, A], fa)
+	return G.Ap[[]B, []func(A) B](fa)
 }
 
 func Match[A, B any](onEmpty func() B, onNonEmpty func([]A) B) func([]A) B {

array/generic/array.go

@@ -17,6 +17,24 @@ func From[GA ~[]A, A any](data ...A) GA {
 	return data
 }
 
+// MakeBy returns a `Array` of length `n` with element `i` initialized with `f(i)`.
+func MakeBy[AS ~[]A, F ~func(int) A, A any](n int, f F) AS {
+	// sanity check
+	if n <= 0 {
+		return Empty[AS]()
+	}
+	// run the generator function across the input
+	as := make(AS, n)
+	for i := n - 1; i >= 0; i-- {
+		as[i] = f(i)
+	}
+	return as
+}
+
+func Replicate[AS ~[]A, A any](n int, a A) AS {
+	return MakeBy[AS](n, F.Constant1[int](a))
+}
+
 func Lookup[GA ~[]A, A any](idx int) func(GA) O.Option[A] {
 	none := O.None[A]()
 	if idx < 0 {
@@ -107,3 +125,21 @@ func MonadPartition[GA ~[]A, A any](as GA, pred func(A) bool) tuple.Tuple2[GA, G
 func Partition[GA ~[]A, A any](pred func(A) bool) func(GA) tuple.Tuple2[GA, GA] {
 	return F.Bind2nd(MonadPartition[GA, A], pred)
 }
+
+func MonadChain[AS ~[]A, BS ~[]B, A, B any](fa AS, f func(a A) BS) BS {
+	return array.Reduce(fa, func(bs BS, a A) BS {
+		return append(bs, f(a)...)
+	}, Empty[BS]())
+}
+
+func Chain[AS ~[]A, BS ~[]B, A, B any](f func(A) BS) func(AS) BS {
+	return F.Bind2nd(MonadChain[AS, BS, A, B], f)
+}
+
+func MonadAp[BS ~[]B, ABS ~[]func(A) B, AS ~[]A, B, A any](fab ABS, fa AS) BS {
+	return MonadChain(fab, F.Bind1st(MonadMap[AS, BS, A, B], fa))
+}
+
+func Ap[BS ~[]B, ABS ~[]func(A) B, AS ~[]A, B, A any](fa AS) func(ABS) BS {
+	return F.Bind2nd(MonadAp[BS, ABS, AS], fa)
+}