Foreign.List

Documentation

data List a

Constructors

Nil

Cons !a !(Box (List a))

Instances

Representable a => Representable (List a)

Defined in Foreign.List

Associated Types

type AsKnown (List a)

Methods

toKnown :: List a %1 -> AsKnown (List a)

ofKnown :: AsKnown (List a) %1 -> List a

Representable a => MkRepresentable (List a) (Maybe (a, Box (List a)))

Defined in Foreign.List

Methods

toRepr :: List a %1 -> Maybe (a, Box (List a))

ofRepr :: Maybe (a, Box (List a)) %1 -> List a

(Representable k, Representable a) => MkRepresentable (NEHeap k a) (k, a, Box (List (NEHeap k a)))

Defined in Foreign.Heap

Methods

toRepr :: NEHeap k a %1 -> (k, a, Box (List (NEHeap k a)))

ofRepr :: (k, a, Box (List (NEHeap k a))) %1 -> NEHeap k a

type AsKnown (List a)

Defined in Foreign.List

type AsKnown (List a) = AsKnown (Maybe (a, Box (List a)))

map :: forall a b. (Representable a, Representable b) => (a %1 -> b) -> List a %1 -> Pool %1 -> List b

foldr :: forall a b. Representable a => (a %1 -> b %1 -> b) -> b %1 -> List a %1 -> b

foldl :: forall a b. Representable a => (b %1 -> a %1 -> b) -> b %1 -> List a %1 -> b

unfold :: forall a s. Representable a => (s -> Maybe (a, s)) -> s -> Pool %1 -> List a

Make a List from a stream. List is a type of strict lists, therefore the stream must terminate otherwise unfold will loop. Not tail-recursive.

unfoldL :: forall a s. Representable a => (s %1 -> Maybe (a, s)) -> s %1 -> Pool %1 -> List a

Linear variant of unfold. Note how they are implemented exactly identically. They could be merged if multiplicity polymorphism was supported.

ofList :: Representable a => [a] -> Pool %1 -> List a

toList :: Representable a => List a %1 -> [a]

runfold :: forall a s. Representable a => (s -> Maybe (a, s)) -> s -> Pool %1 -> List a

Like unfold but builds the list in reverse, and tail recursive

ofRList :: Representable a => [a] -> Pool %1 -> List a