Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
- type Prefix s t = Cofree (Labeled s t)
- data Labeled s t a = Hop s (t a)
- singleton :: Alternative t => s -> a -> Prefix s t a
- seek :: (Functor t, Foldable t, Eq s) => Stack s -> Prefix s t v -> Maybe v
- insert :: (Foldable t, Alternative t, Eq s) => Stack s -> v -> Prefix s t v -> Prefix s t v
- crumbs :: (Foldable t, Alternative t, Eq s, Monoid v) => Stack s -> v -> Prefix s t v -> Prefix s t v