Safe Haskell | Safe |
---|---|
Language | Haskell98 |
- data Zipper k a = Zipper {
- zipper_path :: [Zipper_Step k a]
- zipper_curr :: TreeMap k a
- zipper :: TreeMap k a -> Zipper k a
- zipper_root :: Ord k => Zipper k a -> TreeMap k a
- path_of_zipper :: Zipper k x -> [k]
- data Zipper_Step k a = Zipper_Step {
- zipper_step_prec :: TreeMap k a
- zipper_step_self :: (k, Node k a)
- zipper_step_foll :: TreeMap k a
- zipper_collect :: (z -> Maybe z) -> z -> [z]
- zipper_collect_without_self :: (z -> Maybe z) -> z -> [z]
- zipper_self :: Zipper k a -> Node k a
- zipper_child :: Ord k => Zipper k a -> [Zipper k a]
- zipper_child_lookup :: (Ord k, Alternative f) => k -> Zipper k a -> f (Zipper k a)
- zipper_child_first :: Alternative f => Zipper k a -> f (Zipper k a)
- zipper_child_last :: Alternative f => Zipper k a -> f (Zipper k a)
- zipper_ancestor :: Ord k => Zipper k a -> [Zipper k a]
- zipper_ancestor_or_self :: Ord k => Zipper k a -> [Zipper k a]
- zipper_descendant_or_self :: Ord k => Zipper k a -> [Zipper k a]
- zipper_descendant_or_self_reverse :: Ord k => Zipper k a -> [Zipper k a]
- zipper_descendant :: Ord k => Zipper k a -> [Zipper k a]
- zipper_descendant_lookup :: (Ord k, Alternative f, Monad f) => Path k -> Zipper k a -> f (Zipper k a)
- zipper_prec :: (Ord k, Alternative f) => Zipper k a -> f (Zipper k a)
- zipper_preceding :: Ord k => Zipper k a -> [Zipper k a]
- zipper_preceding_sibling :: Ord k => Zipper k a -> [Zipper k a]
- zipper_foll :: (Ord k, Alternative f) => Zipper k a -> f (Zipper k a)
- zipper_following :: Ord k => Zipper k a -> [Zipper k a]
- zipper_following_sibling :: Ord k => Zipper k a -> [Zipper k a]
- zipper_parent :: (Ord k, Alternative f) => Zipper k a -> f (Zipper k a)
- zipper_filter :: (Zipper k a -> [Zipper k a]) -> (Zipper k a -> Bool) -> Zipper k a -> [Zipper k a]
- zipper_at :: Alternative f => (Zipper k a -> [Zipper k a]) -> Int -> Zipper k a -> f (Zipper k a)
- zipper_null :: (Zipper k a -> [Zipper k a]) -> Zipper k a -> Bool
Type Zipper
Zipper | |
|
path_of_zipper :: Zipper k x -> [k] Source #
Type Zipper_Step
data Zipper_Step k a Source #
Zipper_Step | |
|
Axis
zipper_collect :: (z -> Maybe z) -> z -> [z] Source #
zipper_collect_without_self :: (z -> Maybe z) -> z -> [z] Source #
Axis self
zipper_self :: Zipper k a -> Node k a Source #
Axis child
zipper_child_lookup :: (Ord k, Alternative f) => k -> Zipper k a -> f (Zipper k a) Source #
zipper_child_first :: Alternative f => Zipper k a -> f (Zipper k a) Source #
zipper_child_last :: Alternative f => Zipper k a -> f (Zipper k a) Source #
Axis ancestor
Axis descendant
zipper_descendant_lookup :: (Ord k, Alternative f, Monad f) => Path k -> Zipper k a -> f (Zipper k a) Source #
Axis preceding
zipper_prec :: (Ord k, Alternative f) => Zipper k a -> f (Zipper k a) Source #
Axis following
zipper_foll :: (Ord k, Alternative f) => Zipper k a -> f (Zipper k a) Source #
Axis parent
zipper_parent :: (Ord k, Alternative f) => Zipper k a -> f (Zipper k a) Source #
Filter
zipper_filter :: (Zipper k a -> [Zipper k a]) -> (Zipper k a -> Bool) -> Zipper k a -> [Zipper k a] infixl 5 Source #