Modulecursor-0.3.2.0Haskell2010

Cursor.Tree.Movement

Synopsis

value treeCursorSelection
data TreeCursorSelection
value treeCursorSelect
value treeCursorSelectPrev
value treeCursorSelectNext
value treeCursorSelectFirst
value treeCursorSelectLast
value treeCursorSelectAbove
value treeCursorSelectBelowAtPos
value treeCursorSelectBelowAtStart
value treeCursorSelectBelowAtEnd
value treeCursorSelectBelowAtStartRecursively
value treeCursorSelectBelowAtEndRecursively
value treeCursorSelectPrevOnSameLevel
value treeCursorSelectNextOnSameLevel
value treeCursorSelectFirstOnSameLevel
value treeCursorSelectLastOnSameLevel
value treeCursorSelectAbovePrev
value treeCursorSelectAboveNext

Packagecursor-0.3.2.0
Exports19
LanguageHaskell2010
LicenceMIT
SourceMovement.hs

valuetreeCursorSelection :: TreeCursor a b -> TreeCursorSelection

datadata TreeCursorSelection

Constructors

SelectNode
SelectChild !Int !TreeCursorSelection

Instances6Eq, Show, Generic, NFData, Validity, Rep

Eq TreeCursorSelectionDefined in cursor-0.3.2.0 · Cursor.Tree.Types
Show TreeCursorSelectionDefined in cursor-0.3.2.0 · Cursor.Tree.Types
Generic TreeCursorSelectionDefined in cursor-0.3.2.0 · Cursor.Tree.Types
NFData TreeCursorSelectionDefined in cursor-0.3.2.0 · Cursor.Tree.Types
Validity TreeCursorSelectionDefined in cursor-0.3.2.0 · Cursor.Tree.Types
type Rep TreeCursorSelection = D1 ('MetaData "TreeCursorSelection" "Cursor.Tree.Types" "cursor-0.3.2.0-Goc09bEWCK1ISEU87uNjFO" 'False) (C1 ('MetaCons "SelectNode" 'PrefixI 'False) U1 :+: C1 ('MetaCons "SelectChild" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedUnpack) (Rec0 Int) :*: S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 TreeCursorSelection)))Defined in cursor-0.3.2.0 · Cursor.Tree.Types

valuetreeCursorSelect

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

valuetreeCursorSelectPrev

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

valuetreeCursorSelectNext

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

valuetreeCursorSelectFirst

:: a -> b
-> b -> a
-> TreeCursor a b
-> TreeCursor a b

valuetreeCursorSelectLast

:: a -> b
-> b -> a
-> TreeCursor a b
-> TreeCursor a b

valuetreeCursorSelectAbove

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

valuetreeCursorSelectBelowAtPos

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

valuetreeCursorSelectBelowAtStart

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

valuetreeCursorSelectBelowAtEnd

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

valuetreeCursorSelectBelowAtStartRecursively

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

valuetreeCursorSelectBelowAtEndRecursively

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

valuetreeCursorSelectPrevOnSameLevel

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

valuetreeCursorSelectNextOnSameLevel

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

valuetreeCursorSelectFirstOnSameLevel

:: a -> b
-> b -> a
-> TreeCursor a b
-> TreeCursor a b

valuetreeCursorSelectLastOnSameLevel

:: a -> b
-> b -> a
-> TreeCursor a b
-> TreeCursor a b

valuetreeCursorSelectAbovePrev

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

Source#

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

valuetreeCursorSelectAboveNext

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

Source#

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