Modulecursor-0.3.2.0Haskell2010
Cursor.Tree.Movement
- 1 type
- 18 values
- Packagecursor-0.3.2.0
- Exports19
- LanguageHaskell2010
- LicenceMIT
- SourceMovement.hs
Constructors
Instances6Eq, Show, Generic, NFData, Validity, Rep
Eq TreeCursorSelectionDefined in cursor-0.3.2.0 · Cursor.Tree.TypesShow TreeCursorSelectionDefined in cursor-0.3.2.0 · Cursor.Tree.TypesGeneric TreeCursorSelectionDefined in cursor-0.3.2.0 · Cursor.Tree.TypesNFData TreeCursorSelectionDefined in cursor-0.3.2.0 · Cursor.Tree.TypesValidity TreeCursorSelectionDefined in cursor-0.3.2.0 · Cursor.Tree.Typestype Rep TreeCursorSelection = D1 ('MetaDataDefined in cursor-0.3.2.0 · Cursor.Tree.Types"TreeCursorSelection"
"Cursor.Tree.Types"
"cursor-0.3.2.0-F9X8WOAtgDl2Ee7ztttX2k"
'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)))
Go back and down as far as necessary to find a previous element on a level below
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