Data.Generics.Fixplate.Open

"Open" functions, working on functors instead of trees.

Documentation

toList :: Foldable t => t a -> [a]

List of elements of a structure.

Accumulating maps

mapAccumL :: Traversable t => (a -> b -> (a, c)) -> a -> t b -> (a, t c)

The mapAccumL function behaves like a combination of fmap and foldl; it applies a function to each element of a structure, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new structure.

mapAccumR :: Traversable t => (a -> b -> (a, c)) -> a -> t b -> (a, t c)

The mapAccumR function behaves like a combination of fmap and foldr; it applies a function to each element of a structure, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new structure.

mapAccumL_ :: Traversable f => (a -> b -> (a, c)) -> a -> f b -> f c

mapAccumR_ :: Traversable f => (a -> b -> (a, c)) -> a -> f b -> f c

Open functions

holes :: Traversable f => f a -> f (a, a -> f a)

The children together with functions replacing that particular child.

holesList :: Traversable f => f a -> [(a, a -> f a)]

apply :: Traversable f => (a -> a) -> f a -> f (f a)

Apply the given function to each child in turn.

builder :: Traversable f => f a -> [b] -> f b

Builds up a structure from a list of the children.

Enumerations

enumerate :: Traversable f => f a -> (Int, f (Int, a))

Enumerates children from the left to the right, starting with zero. Also returns the number of children. This is just a simple application of mapAccumL.

enumerateWith :: Traversable f => (Int -> a -> b) -> f a -> (Int, f b)

enumerateWith_ :: Traversable f => (Int -> a -> b) -> f a -> f b