Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
Synopsis
- 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
Documentation
Hop s (t a) |
Instances
Functor t => Functor (Labeled s t) Source # | |
Foldable t => Foldable (Labeled s t) Source # | |
Defined in Data.Apart.Structures.Tree.Prefix fold :: Monoid m => Labeled s t m -> m # foldMap :: Monoid m => (a -> m) -> Labeled s t a -> m # foldr :: (a -> b -> b) -> b -> Labeled s t a -> b # foldr' :: (a -> b -> b) -> b -> Labeled s t a -> b # foldl :: (b -> a -> b) -> b -> Labeled s t a -> b # foldl' :: (b -> a -> b) -> b -> Labeled s t a -> b # foldr1 :: (a -> a -> a) -> Labeled s t a -> a # foldl1 :: (a -> a -> a) -> Labeled s t a -> a # toList :: Labeled s t a -> [a] # null :: Labeled s t a -> Bool # length :: Labeled s t a -> Int # elem :: Eq a => a -> Labeled s t a -> Bool # maximum :: Ord a => Labeled s t a -> a # minimum :: Ord a => Labeled s t a -> a # | |
Traversable t => Traversable (Labeled s t) Source # | |
Defined in Data.Apart.Structures.Tree.Prefix | |
(Show s, Show (t a)) => Show (Labeled s t a) Source # | |
singleton :: Alternative t => s -> a -> Prefix s t a Source #