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