Safe Haskell | Safe-Inferred |
---|---|

Language | Haskell2010 |

## Synopsis

- type Stack = Maybe <:.> Construction Maybe
- pop :: Stack ~> Stack
- delete :: Setoid a => a -> Stack a -> Stack a
- filter :: forall a. Predicate a -> Stack a -> Stack a
- linearize :: forall t a. Traversable t => t a -> Stack a
- forward :: Zipper Stack a -> Maybe (Zipper Stack a)
- backward :: Zipper Stack a -> Maybe (Zipper Stack a)
- forward' :: Zipper (Nonempty Stack) a -> Maybe (Zipper (Nonempty Stack) a)
- backward' :: Zipper (Nonempty Stack) a -> Maybe (Zipper (Nonempty Stack) a)

# Documentation

type Stack = Maybe <:.> Construction Maybe Source #

Linear data structure that serves as a collection of elements

linearize :: forall t a. Traversable t => t a -> Stack a Source #

Transform any traversable structure into a stack

# Orphan instances

Insertable Stack Source # | |

Insertable (Construction Maybe) Source # | |

insert :: a -> Construction Maybe a -> Construction Maybe a Source # | |

Semigroup (Stack a) Source # | |

Monoid (Stack a) Source # | |

Setoid a => Setoid (Stack a) Source # | |

Focusable ('Head :: Type -> Location Type) Stack Source # | |

Focusable ('Head :: Type -> Location Type) (Construction Maybe) Source # | |

Monotonic (Construction Maybe a) a Source # | |

bypass :: (a -> r -> r) -> r -> Construction Maybe a -> r Source # | |

Monotonic ((Maybe :. Construction Maybe) := a) a Source # | |

Monotonic ((Maybe <:.> Construction Maybe) := a) a Source # | |