Documentation

singletonTreeCursor :: a -> TreeCursor a b Source #

makeTreeCursor :: (b -> a) -> CTree b -> TreeCursor a b Source #

makeNodeTreeCursor :: a -> CForest b -> TreeCursor a b Source #

makeTreeCursorWithSelection :: (a -> b) -> (b -> a) -> TreeCursorSelection -> CTree b -> Maybe (TreeCursor a b) Source #

rebuildTreeCursor :: (a -> b) -> TreeCursor a b -> CTree b Source #

mapTreeCursor :: (a -> c) -> (b -> d) -> TreeCursor a b -> TreeCursor c d Source #

currentTree :: (a -> b) -> TreeCursor a b -> CTree b Source #

makeTreeCursorWithAbove :: (b -> a) -> CTree b -> Maybe (TreeAbove b) -> TreeCursor a b Source #

traverseTreeCursor :: forall a b m c. Monad m => ([CTree b] -> b -> [CTree b] -> c -> m c) -> (a -> CForest b -> m c) -> TreeCursor a b -> m c Source #

foldTreeCursor :: forall a b c. ([CTree b] -> b -> [CTree b] -> c -> c) -> (a -> CForest b -> c) -> TreeCursor a b -> c Source #