Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- treeCursorPromoteElem :: (a -> b) -> (b -> a) -> TreeCursor a b -> PromoteElemResult (TreeCursor a b)
- data PromoteElemResult a
- treeCursorPromoteSubTree :: (a -> b) -> (b -> a) -> TreeCursor a b -> PromoteResult (TreeCursor a b)
- data PromoteResult a
Documentation
treeCursorPromoteElem :: (a -> b) -> (b -> a) -> TreeCursor a b -> PromoteElemResult (TreeCursor a b) Source #
Promotes the current node to the level of its parent.
Example:
Before:
p |- a | |- b | | |- c | |- d <-- | | |- e | |- f | |- g |- h
After:
p |- a | |- b | | |- c | | |- e | |- f | |- g |- d <-- |- h
data PromoteElemResult a Source #
Instances
treeCursorPromoteSubTree :: (a -> b) -> (b -> a) -> TreeCursor a b -> PromoteResult (TreeCursor a b) Source #
Promotes the current node to the level of its parent.
Example:
Before:
p |- a | |- b | | |- c | |- d <-- | | |- e | |- f | |- g |- h
After:
p |- a | |- b | | |- c | |- f | |- g |- d <-- | |- e |- h
data PromoteResult a Source #