| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Cursor.Tree.Swap
Synopsis
- treeCursorSwapPrev :: TreeCursor a b -> SwapResult (TreeCursor a b)
- treeCursorSwapNext :: TreeCursor a b -> SwapResult (TreeCursor a b)
- data SwapResult a
Documentation
treeCursorSwapPrev :: TreeCursor a b -> SwapResult (TreeCursor a b) Source #
Swaps the current node with the previous node on the same level
Example:
Before:
p |- a |- b <--
After:
p |- b <-- |- a
treeCursorSwapNext :: TreeCursor a b -> SwapResult (TreeCursor a b) Source #
Swaps the current node with the next node on the same level
Example:
Before:
p |- a <-- |- b
After:
p |- b |- a <--
data SwapResult a Source #
Constructors
| SwapperIsTopNode | |
| NoSiblingsToSwapWith | |
| Swapped a |