Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Documentation
find_rose_sub_tree :: forall k a. Setoid k => Nonempty List k -> (Nonempty Rose := (k :*: a)) -> Maybe a Source #
Orphan instances
Nullable Rose Source # | |
Setoid k => Morphable ('Vary ('Element :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed (Construction List) k) Source # | |
Setoid k => Morphable ('Vary ('Element :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed Rose k) Source # | |
Setoid k => Morphable ('Lookup ('Key :: a -> Morph a) :: Morph (a -> Morph a)) (Prefixed Rose k) Source # | |
Substructure ('Just :: a -> Maybe a) Rose Source # | |
Substructure ('Root :: a -> Segment a) Rose Source # | |
Substructure ('Tail :: a -> Segment a) (Construction List) Source # | |
type Substructural 'Tail (Construction List) :: Type -> Type Source # | |
Substructure ('Root :: a -> Segment a) (Construction List) Source # | |
type Substructural 'Root (Construction List) :: Type -> Type Source # |