Cursor.Tree.Movement

Documentation

treeCursorSelection :: TreeCursor a b -> TreeCursorSelection

data TreeCursorSelection

Constructors

SelectNode

SelectChild !Int !TreeCursorSelection

Instances

Eq TreeCursorSelection

Defined in Cursor.Tree.Types

Methods

(==) :: TreeCursorSelection -> TreeCursorSelection -> Bool

(/=) :: TreeCursorSelection -> TreeCursorSelection -> Bool

Show TreeCursorSelection

Defined in Cursor.Tree.Types

Methods

showsPrec :: Int -> TreeCursorSelection -> ShowS

show :: TreeCursorSelection -> String

showList :: [TreeCursorSelection] -> ShowS

Generic TreeCursorSelection

Defined in Cursor.Tree.Types

Associated Types

type Rep TreeCursorSelection :: Type -> Type

Methods

from :: TreeCursorSelection -> Rep TreeCursorSelection x

to :: Rep TreeCursorSelection x -> TreeCursorSelection

NFData TreeCursorSelection

Defined in Cursor.Tree.Types

Methods

rnf :: TreeCursorSelection -> ()

Validity TreeCursorSelection

Defined in Cursor.Tree.Types

Methods

validate :: TreeCursorSelection -> Validation

type Rep TreeCursorSelection

Defined in Cursor.Tree.Types

type Rep TreeCursorSelection = D1 (MetaData "TreeCursorSelection" "Cursor.Tree.Types" "cursor-0.3.0.0-4Hn80vYAl979Qxk54M4vdL" False) (C1 (MetaCons "SelectNode" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "SelectChild" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 Int) :*: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 TreeCursorSelection)))

treeCursorSelect :: (a -> b) -> (b -> a) -> TreeCursorSelection -> TreeCursor a b -> Maybe (TreeCursor a b)

treeCursorSelectPrev :: (a -> b) -> (b -> a) -> TreeCursor a b -> Maybe (TreeCursor a b)

treeCursorSelectNext :: (a -> b) -> (b -> a) -> TreeCursor a b -> Maybe (TreeCursor a b)

treeCursorSelectFirst :: (a -> b) -> (b -> a) -> TreeCursor a b -> TreeCursor a b

treeCursorSelectLast :: (a -> b) -> (b -> a) -> TreeCursor a b -> TreeCursor a b

treeCursorSelectAbove :: (a -> b) -> (b -> a) -> TreeCursor a b -> Maybe (TreeCursor a b)

treeCursorSelectBelowAtPos :: (a -> b) -> (b -> a) -> Int -> TreeCursor a b -> Maybe (TreeCursor a b)

treeCursorSelectBelowAtStart :: (a -> b) -> (b -> a) -> TreeCursor a b -> Maybe (TreeCursor a b)

treeCursorSelectBelowAtEnd :: (a -> b) -> (b -> a) -> TreeCursor a b -> Maybe (TreeCursor a b)

treeCursorSelectBelowAtStartRecursively :: (a -> b) -> (b -> a) -> TreeCursor a b -> Maybe (TreeCursor a b)

treeCursorSelectBelowAtEndRecursively :: (a -> b) -> (b -> a) -> TreeCursor a b -> Maybe (TreeCursor a b)

treeCursorSelectPrevOnSameLevel :: (a -> b) -> (b -> a) -> TreeCursor a b -> Maybe (TreeCursor a b)

treeCursorSelectNextOnSameLevel :: (a -> b) -> (b -> a) -> TreeCursor a b -> Maybe (TreeCursor a b)

treeCursorSelectAbovePrev :: (a -> b) -> (b -> a) -> TreeCursor a b -> Maybe (TreeCursor a b)

Go back and down as far as necessary to find a previous element on a level below

treeCursorSelectAboveNext :: (a -> b) -> (b -> a) -> TreeCursor a b -> Maybe (TreeCursor a b)

Go up as far as necessary to find a next element on a level above and forward

Note: This will fail if there is a next node on the same level or any node below the current node