Data.Replicator.Linear.Internal

Replicator is a stream-like data structure used to linearly duplicate values.

Extracts the next item from the "infinite stream" Replicator a.

Extracts the next item from the "infinite stream" Replicator a. Same function as next, but returning an unboxed tuple.

take n as is a list of size n, containing n replicas from as.

Returns the next item from Replicator a and efficiently consumes the replicator at the same time.

Comonadic extend function.

extend f = map f . duplicate

Elim n a b is used to implement elim without recursion so that we can guarantee that elim will be inlined and unrolled.

Elim is solely used in the signature of elim.

Takes a function of type a %1 -> a %1 -> ... %1 -> a %1 -> b, and returns a b . The replicator is used to supply all the items of type a required by the function.

For instance:

elim @1 :: (a %1 -> b) %1 -> Replicator a %1 -> b
elim @2 :: (a %1 -> a %1 -> b) %1 -> Replicator a %1 -> b
elim @3 :: (a %1 -> a %1 -> a %1 -> b) %1 -> Replicator a %1 -> b

It is not always necessary to give the arity argument. It can be inferred from the function argument.

elim (,) :: Replicator a %1 -> (a, a)
elim (,,) :: Replicator a %1 -> (a, a, a)

About the constraints of this function (they won't get in your way):

• Elim (NatToPeano n) a b provides the actual implementation of elim; there is an instance of this class for any (n, a, b)

• IsFunN a b f, f ~ FunN (NatToPeano n) a b, n ~ Arity b f indicate the shape of f to the typechecker (see documentation of IsFunN).