Documentation
¶
Index ¶
- func Ap[GUV ~func() O.Option[T.Tuple2[GUV, func(U) V]], ...](ma GU) func(fab GUV) GV
- func Chain[GV ~func() O.Option[T.Tuple2[GV, V]], GU ~func() O.Option[T.Tuple2[GU, U]], ...](f func(U) GV) func(GU) GV
- func Empty[GU ~func() O.Option[T.Tuple2[GU, U]], U any]() GU
- func Filter[GU ~func() O.Option[T.Tuple2[GU, U]], FCT ~func(U) bool, U any](f FCT) func(ma GU) GU
- func FilterMap[GV ~func() O.Option[T.Tuple2[GV, V]], GU ~func() O.Option[T.Tuple2[GU, U]], ...](f FCT) func(ma GU) GV
- func Flatten[GV ~func() O.Option[T.Tuple2[GV, GU]], GU ~func() O.Option[T.Tuple2[GU, U]], ...](ma GV) GU
- func From[GU ~func() O.Option[T.Tuple2[GU, U]], U any](data ...U) GU
- func FromArray[GU ~func() O.Option[T.Tuple2[GU, U]], US ~[]U, U any](as US) GU
- func MakeBy[GU ~func() O.Option[T.Tuple2[GU, U]], FCT ~func(int) U, U any](n int, f FCT) GU
- func Map[GV ~func() O.Option[T.Tuple2[GV, V]], GU ~func() O.Option[T.Tuple2[GU, U]], ...](f FCT) func(ma GU) GV
- func MonadAp[GUV ~func() O.Option[T.Tuple2[GUV, func(U) V]], ...](fab GUV, ma GU) GV
- func MonadChain[GV ~func() O.Option[T.Tuple2[GV, V]], GU ~func() O.Option[T.Tuple2[GU, U]], ...](ma GU, f func(U) GV) GV
- func MonadMap[GV ~func() O.Option[T.Tuple2[GV, V]], GU ~func() O.Option[T.Tuple2[GU, U]], ...](ma GU, f func(U) V) GV
- func Monoid[GU ~func() O.Option[T.Tuple2[GU, U]], U any]() M.Monoid[GU]
- func Of[GU ~func() O.Option[T.Tuple2[GU, U]], U any](a U) GU
- func Reduce[GU ~func() O.Option[T.Tuple2[GU, U]], U, V any](f func(V, U) V, initial V) func(GU) V
- func Replicate[GU ~func() O.Option[T.Tuple2[GU, U]], U any](n int, a U) GU
- func Scan[GV ~func() O.Option[T.Tuple2[GV, V]], GU ~func() O.Option[T.Tuple2[GU, U]], ...](f FCT, initial V) func(ma GU) GV
- func StrictUniq[AS ~func() O.Option[T.Tuple2[AS, A]], A comparable](as AS) AS
- func Take[GU ~func() O.Option[T.Tuple2[GU, U]], U any](n int) func(ma GU) GU
- func ToArray[GU ~func() O.Option[T.Tuple2[GU, U]], US ~[]U, U any](u GU) US
- func Uniq[AS ~func() O.Option[T.Tuple2[AS, A]], K comparable, A any](f func(A) K) func(as AS) AS
- func Zip[AS ~func() O.Option[T.Tuple2[AS, A]], BS ~func() O.Option[T.Tuple2[BS, B]], ...](fb BS) func(AS) CS
- func ZipWith[AS ~func() O.Option[T.Tuple2[AS, A]], BS ~func() O.Option[T.Tuple2[BS, B]], ...](fa AS, fb BS, f FCT) CS
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func MonadChain ¶
func Replicate ¶
Replicate creates an [Iterator] containing a value repeated the specified number of times.
func StrictUniq ¶ added in v1.0.11
func StrictUniq[AS ~func() O.Option[T.Tuple2[AS, A]], A comparable](as AS) AS
func Zip ¶ added in v1.0.11
func Zip[AS ~func() O.Option[T.Tuple2[AS, A]], BS ~func() O.Option[T.Tuple2[BS, B]], CS ~func() O.Option[T.Tuple2[CS, T.Tuple2[A, B]]], A, B any](fb BS) func(AS) CS
Zip takes two iterators and returns an iterators of corresponding pairs. If one input iterators is short, excess elements of the longer iterator are discarded
func ZipWith ¶ added in v1.0.11
func ZipWith[AS ~func() O.Option[T.Tuple2[AS, A]], BS ~func() O.Option[T.Tuple2[BS, B]], CS ~func() O.Option[T.Tuple2[CS, C]], FCT ~func(A, B) C, A, B, C any](fa AS, fb BS, f FCT) CS
ZipWith applies a function to pairs of elements at the same index in two iterators, collecting the results in a new iterator. If one input iterator is short, excess elements of the longer iterator are discarded.
Types ¶
This section is empty.
Source Files
Click to show internal directories.
Click to hide internal directories.