Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
Data.Unfoldable.Restricted
Contents
- class UnfoldableR pred t | t -> pred where
- unfoldRestrict_ :: (UnfoldableR Unit t, Unfolder f) => f (t ())
- unfoldRestrictBF :: (UnfoldableR p t, Unfolder f, p a) => f a -> f (t a)
- unfoldRestrictBF_ :: (UnfoldableR Unit t, Unfolder f) => f (t ())
- unfoldrRestrict :: (UnfoldableR p t, p a) => (b -> Maybe (a, b)) -> b -> Maybe (t a)
- fromList :: (UnfoldableR p t, p a) => [a] -> Maybe (t a)
- leftMost :: UnfoldableR Unit t => Maybe (t ())
- rightMost :: UnfoldableR Unit t => Maybe (t ())
- allDepthFirst :: UnfoldableR Unit t => [t ()]
- allToDepth :: UnfoldableR Unit t => Int -> [t ()]
- allBreadthFirst :: UnfoldableR Unit t => [t ()]
- class BiunfoldableR predA predB t | t -> predA predB where
- biunfoldRestrict_ :: (BiunfoldableR Unit Unit t, Unfolder f) => f (t () ())
- biunfoldRestrictBF :: (BiunfoldableR p q t, Unfolder f, p a, q b) => f a -> f b -> f (t a b)
- biunfoldRestrictBF_ :: (BiunfoldableR Unit Unit t, Unfolder f) => f (t () ())
- biunfoldrRestrict :: (BiunfoldableR p q t, p a, q b) => (c -> Maybe (a, c)) -> (c -> Maybe (b, c)) -> c -> Maybe (t a b)
- fromLists :: (BiunfoldableR p q t, p a, q b) => [a] -> [b] -> Maybe (t a b)
- class (Hashable a, Eq a) => Hashable' a
Unfoldable
class UnfoldableR pred t | t -> pred where #
Minimal complete definition
Methods
unfoldRestrict :: (pred a, Unfolder f) => f a -> f (t a) #
Instances
UnfoldableR Ord Set # | |
UnfoldableR Unit [] # | |
UnfoldableR Unit Maybe # | |
UnfoldableR Unit Identity # | |
UnfoldableR Hashable' HashSet # | |
(Bounded a, Enum a) => UnfoldableR Unit (Either a) # | |
(Bounded a, Enum a) => UnfoldableR Unit ((,) a) # | |
UnfoldableR p f => UnfoldableR p (Reverse * f) # | |
(Bounded a, Enum a) => UnfoldableR Unit (Constant * a) # | |
(UnfoldableR p f, UnfoldableR p g) => UnfoldableR p (Sum * f g) # | |
(UnfoldableR p f, UnfoldableR p g) => UnfoldableR p (Product * f g) # | |
unfoldRestrict_ :: (UnfoldableR Unit t, Unfolder f) => f (t ()) #
unfoldRestrictBF :: (UnfoldableR p t, Unfolder f, p a) => f a -> f (t a) #
unfoldRestrictBF_ :: (UnfoldableR Unit t, Unfolder f) => f (t ()) #
unfoldrRestrict :: (UnfoldableR p t, p a) => (b -> Maybe (a, b)) -> b -> Maybe (t a) #
fromList :: (UnfoldableR p t, p a) => [a] -> Maybe (t a) #
leftMost :: UnfoldableR Unit t => Maybe (t ()) #
rightMost :: UnfoldableR Unit t => Maybe (t ()) #
allDepthFirst :: UnfoldableR Unit t => [t ()] #
allToDepth :: UnfoldableR Unit t => Int -> [t ()] #
allBreadthFirst :: UnfoldableR Unit t => [t ()] #
Biunfoldable
class BiunfoldableR predA predB t | t -> predA predB where #
Minimal complete definition
Methods
biunfoldRestrict :: (predA a, predB b, Unfolder f) => f a -> f b -> f (t a b) #
biunfoldRestrict_ :: (BiunfoldableR Unit Unit t, Unfolder f) => f (t () ()) #
biunfoldRestrictBF :: (BiunfoldableR p q t, Unfolder f, p a, q b) => f a -> f b -> f (t a b) #
biunfoldRestrictBF_ :: (BiunfoldableR Unit Unit t, Unfolder f) => f (t () ()) #
biunfoldrRestrict :: (BiunfoldableR p q t, p a, q b) => (c -> Maybe (a, c)) -> (c -> Maybe (b, c)) -> c -> Maybe (t a b) #
fromLists :: (BiunfoldableR p q t, p a, q b) => [a] -> [b] -> Maybe (t a b) #