Data.TreeMap.Strict.Zipper

Type Zipper

data Zipper k a

Constructors

Zipper

Fields

• zipper_path :: [Zipper_Step k a]
• zipper_curr :: TreeMap k a

Instances

(Eq k, Eq a) => Eq (Zipper k a)

Methods

(==) :: Zipper k a -> Zipper k a -> Bool

(/=) :: Zipper k a -> Zipper k a -> Bool

(Ord k, Data a, Data k) => Data (Zipper k a)

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Zipper k a -> c (Zipper k a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Zipper k a)

toConstr :: Zipper k a -> Constr

dataTypeOf :: Zipper k a -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Zipper k a))

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Zipper k a))

gmapT :: (forall b. Data b => b -> b) -> Zipper k a -> Zipper k a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Zipper k a -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Zipper k a -> r

gmapQ :: (forall d. Data d => d -> u) -> Zipper k a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Zipper k a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Zipper k a -> m (Zipper k a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Zipper k a -> m (Zipper k a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Zipper k a -> m (Zipper k a)

(Show k, Show a) => Show (Zipper k a)

Methods

showsPrec :: Int -> Zipper k a -> ShowS

show :: Zipper k a -> String

showList :: [Zipper k a] -> ShowS

zipper :: TreeMap k a -> Zipper k a

zipper_root :: Ord k => Zipper k a -> TreeMap k a

path_of_zipper :: Zipper k x -> [k]

Type Zipper_Step

data Zipper_Step k a

Constructors

Zipper_Step

Fields

• zipper_step_prec :: TreeMap k a
• zipper_step_self :: (k, Node k a)
• zipper_step_foll :: TreeMap k a

Instances

(Eq k, Eq a) => Eq (Zipper_Step k a)

Methods

(==) :: Zipper_Step k a -> Zipper_Step k a -> Bool

(/=) :: Zipper_Step k a -> Zipper_Step k a -> Bool

(Ord k, Data a, Data k) => Data (Zipper_Step k a)

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Zipper_Step k a -> c (Zipper_Step k a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Zipper_Step k a)

toConstr :: Zipper_Step k a -> Constr

dataTypeOf :: Zipper_Step k a -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Zipper_Step k a))

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Zipper_Step k a))

gmapT :: (forall b. Data b => b -> b) -> Zipper_Step k a -> Zipper_Step k a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Zipper_Step k a -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Zipper_Step k a -> r

gmapQ :: (forall d. Data d => d -> u) -> Zipper_Step k a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Zipper_Step k a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Zipper_Step k a -> m (Zipper_Step k a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Zipper_Step k a -> m (Zipper_Step k a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Zipper_Step k a -> m (Zipper_Step k a)

(Show k, Show a) => Show (Zipper_Step k a)

Methods

showsPrec :: Int -> Zipper_Step k a -> ShowS

show :: Zipper_Step k a -> String

showList :: [Zipper_Step k a] -> ShowS

Axis

zipper_collect :: (z -> Maybe z) -> z -> [z]

Collect all Zippers along a given axis, including the first Zipper.

zipper_collect_without_self :: (z -> Maybe z) -> z -> [z]

Collect all Zippers along a given axis, excluding the first Zipper.

Axis self

zipper_self :: Zipper k a -> Node k a

Axis child

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)

Axis ancestor

zipper_ancestor :: Ord k => Zipper k a -> [Zipper k a]

zipper_ancestor_or_self :: Ord k => Zipper k a -> [Zipper k a]

Axis descendant

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)

Axis preceding

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]

Axis following

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]

Axis parent

zipper_parent :: (Ord k, Alternative f) => Zipper k a -> f (Zipper k a)

Filter

zipper_filter :: (Zipper k a -> [Zipper k a]) -> (Zipper k a -> Bool) -> Zipper k a -> [Zipper k a] infixl 5

zipper_at :: Alternative f => (Zipper k a -> [Zipper k a]) -> Int -> Zipper k a -> f (Zipper k a) infixl 5

zipper_null :: (Zipper k a -> [Zipper k a]) -> Zipper k a -> Bool