Cursor.Simple.Tree · cursor-0.3.2.0

typetype TreeCursor a = TreeCursor a a

#

datadata TreeAbove b

#

Constructors

TreeAbove
- treeAboveLefts :: ![CTree b]
- treeAboveAbove :: !Maybe (TreeAbove b)
- treeAboveNode :: !b
- treeAboveRights :: ![CTree b]

Instances7Functor, Eq, Show, Generic, NFData, Validity, …

Functor TreeAboveDefined in cursor-0.3.2.0 · Cursor.Tree.Types
Eq b => Eq (TreeAbove b)Defined in cursor-0.3.2.0 · Cursor.Tree.Types
Show b => Show (TreeAbove b)Defined in cursor-0.3.2.0 · Cursor.Tree.Types
Generic (TreeAbove b)Defined in cursor-0.3.2.0 · Cursor.Tree.Types
NFData b => NFData (TreeAbove b)Defined in cursor-0.3.2.0 · Cursor.Tree.Types
Validity b => Validity (TreeAbove b)Defined in cursor-0.3.2.0 · Cursor.Tree.Types
type Rep (TreeAbove b) = D1 ('MetaData "TreeAbove" "Cursor.Tree.Types" "cursor-0.3.2.0-F9X8WOAtgDl2Ee7ztttX2k" 'False) (C1 ('MetaCons "TreeAbove" 'PrefixI 'True) ((S1 ('MetaSel ('Just "treeAboveLefts") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 [CTree b]) :*: S1 ('MetaSel ('Just "treeAboveAbove") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (Maybe (TreeAbove b)))) :*: (S1 ('MetaSel ('Just "treeAboveNode") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 b) :*: S1 ('MetaSel ('Just "treeAboveRights") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 [CTree b]))))Defined in cursor-0.3.2.0 · Cursor.Tree.Types

valuesingletonTreeCursor :: a -> TreeCursor a

#

valuemakeTreeCursor :: CTree a -> TreeCursor a

#

valuemakeNodeTreeCursor :: a -> CForest b -> TreeCursor a b

#

valuemakeTreeCursorWithSelection

#

valuerebuildTreeCursor :: TreeCursor a -> CTree a

#

valuedrawTreeCursor :: (Show a, Show b) => TreeCursor a b -> String

#

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

#

valuetreeCursorAboveL

:: Functor f
=> Maybe (TreeAbove b) -> f (Maybe (TreeAbove b))
-> TreeCursor a b
-> f (TreeCursor a b)

#

valuetreeCursorCurrentL

:: Functor f
=> a -> f a'
-> TreeCursor a b
-> f (TreeCursor a' b)

#

valuetreeCursorBelowL

:: Functor f
=> CForest b -> f (CForest b)
-> TreeCursor a b
-> f (TreeCursor a b)

#

valuetreeAboveLeftsL

:: Functor f
=> [CTree b] -> f [CTree b]
-> TreeAbove b
-> f (TreeAbove b)

#

valuetreeAboveAboveL

:: Functor f
=> Maybe (TreeAbove b) -> f (Maybe (TreeAbove b))
-> TreeAbove b
-> f (TreeAbove b)

#

valuetreeAboveNodeL :: Functor f => (b -> f b) -> TreeAbove b -> f (TreeAbove b)

#

valuetreeAboveRightsL

:: Functor f
=> [CTree b] -> f [CTree b]
-> TreeAbove b
-> f (TreeAbove b)

#

valuetreeCursorWithPointer :: (Show a, Show b) => TreeCursor a b -> Tree String

#

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-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)))Defined in cursor-0.3.2.0 · Cursor.Tree.Types

valuetreeCursorSelect

#

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

#

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

#

valuetreeCursorSelectFirst :: TreeCursor a -> TreeCursor a

#

valuetreeCursorSelectLast :: TreeCursor a -> TreeCursor a

#

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

#

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

#

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

#

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

#

valuetreeCursorSelectBelowAtStartRecursively

:: TreeCursor a
-> Maybe (TreeCursor a)

#

valuetreeCursorSelectBelowAtEndRecursively

:: TreeCursor a
-> Maybe (TreeCursor a)

#

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

#

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

#

valuetreeCursorSelectFirstOnSameLevel :: TreeCursor a -> TreeCursor a

#

valuetreeCursorSelectLastOnSameLevel :: TreeCursor a -> TreeCursor a

#

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

#

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

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

#

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

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

#

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

#

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

#

valuetreeCursorOpenCurrentForestRecursively

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

#

valuetreeCursorToggleCurrentForestRecursively

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

#

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

#

valuetreeCursorInsertAndSelect :: Tree a -> TreeCursor a -> Maybe (TreeCursor a)

#

valuetreeCursorInsertNodeSingleAndSelect

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

#

valuetreeCursorInsertNodeAndSelect

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

#

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

#

valuetreeCursorAppendAndSelect :: Tree a -> TreeCursor a -> Maybe (TreeCursor a)

#

valuetreeCursorAppendNodeSingleAndSelect

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

#

valuetreeCursorAppendNodeAndSelect

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

#

valuetreeCursorAddChildAtPos :: Int -> Tree b -> TreeCursor a b -> TreeCursor a b

#

valuetreeCursorAddChildAtStart :: Tree b -> TreeCursor a b -> TreeCursor a b

#

valuetreeCursorAddChildAtEnd :: Tree b -> TreeCursor a b -> TreeCursor a b

#

valuetreeCursorAddChildAtPosAndSelect

:: Int
-> Tree a
-> TreeCursor a
-> TreeCursor a

#

valuetreeCursorAddChildAtStartAndSelect :: Tree a -> TreeCursor a -> TreeCursor a

#

valuetreeCursorAddChildAtEndAndSelect :: Tree a -> TreeCursor a -> TreeCursor a

#

valuetreeCursorAddChildNodeSingleAtPosAndSelect

:: Int
-> a
-> TreeCursor a
-> TreeCursor a

#

valuetreeCursorAddChildNodeSingleAtStartAndSelect

:: a
-> TreeCursor a
-> TreeCursor a

#

valuetreeCursorAddChildNodeSingleAtEndAndSelect

:: a
-> TreeCursor a
-> TreeCursor a

#

valuetreeCursorAddChildNodeAtPosAndSelect

:: Int
-> a
-> Forest a
-> TreeCursor a
-> TreeCursor a

#

valuetreeCursorAddChildNodeAtStartAndSelect

:: a
-> Forest a
-> TreeCursor a
-> TreeCursor a

#

valuetreeCursorAddChildNodeAtEndAndSelect

:: a
-> Forest a
-> TreeCursor a
-> TreeCursor a

#

valuetreeCursorDeleteSubTreeAndSelectPrevious

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

#

valuetreeCursorDeleteSubTreeAndSelectNext

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

#

valuetreeCursorDeleteSubTreeAndSelectAbove

:: TreeCursor a
-> DeleteOrUpdate (TreeCursor a)

#

valuetreeCursorRemoveSubTree :: TreeCursor a -> DeleteOrUpdate (TreeCursor a)

#

valuetreeCursorDeleteSubTree :: TreeCursor a -> DeleteOrUpdate (TreeCursor a)

#

valuetreeCursorDeleteElemAndSelectPrevious

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

#

valuetreeCursorDeleteElemAndSelectNext

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

#

valuetreeCursorDeleteElemAndSelectAbove

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

#

valuetreeCursorRemoveElem :: TreeCursor a -> DeleteOrUpdate (TreeCursor a)

#

valuetreeCursorDeleteElem :: TreeCursor a -> DeleteOrUpdate (TreeCursor a)

#

valuetreeCursorSwapPrev :: TreeCursor a b -> SwapResult (TreeCursor a b)

#

Swaps the current node with the previous node on the same level

Example:

Before:

p
|- a
|- b <--

After:

p
|- b <--
|- a

valuetreeCursorSwapNext :: TreeCursor a b -> SwapResult (TreeCursor a b)

#

Swaps the current node with the next node on the same level

Example:

Before:

p
|- a <--
|- b

After:

p
|- b
|- a <--

datadata SwapResult a

#

Constructors

Instances7Functor, Eq, Show, Generic, NFData, Validity, …

Functor SwapResultDefined in cursor-0.3.2.0 · Cursor.Tree.Swap
Eq a => Eq (SwapResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Swap
Show a => Show (SwapResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Swap
Generic (SwapResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Swap
NFData a => NFData (SwapResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Swap
Validity a => Validity (SwapResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Swap
type Rep (SwapResult a) = D1 ('MetaData "SwapResult" "Cursor.Tree.Swap" "cursor-0.3.2.0-F9X8WOAtgDl2Ee7ztttX2k" 'False) (C1 ('MetaCons "SwapperIsTopNode" 'PrefixI 'False) U1 :+: (C1 ('MetaCons "NoSiblingsToSwapWith" 'PrefixI 'False) U1 :+: C1 ('MetaCons "Swapped" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a))))Defined in cursor-0.3.2.0 · Cursor.Tree.Swap

valuetreeCursorPromoteElem :: TreeCursor a -> PromoteElemResult (TreeCursor a)

#

datadata PromoteElemResult a

#

Constructors

Instances9Monad, Functor, Applicative, Eq, Show, Generic, …

Monad PromoteElemResultDefined in cursor-0.3.2.0 · Cursor.Tree.Promote
Functor PromoteElemResultDefined in cursor-0.3.2.0 · Cursor.Tree.Promote
Applicative PromoteElemResultDefined in cursor-0.3.2.0 · Cursor.Tree.Promote
Eq a => Eq (PromoteElemResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Promote
Show a => Show (PromoteElemResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Promote
Generic (PromoteElemResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Promote
NFData a => NFData (PromoteElemResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Promote
Validity a => Validity (PromoteElemResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Promote
type Rep (PromoteElemResult a) = D1 ('MetaData "PromoteElemResult" "Cursor.Tree.Promote" "cursor-0.3.2.0-F9X8WOAtgDl2Ee7ztttX2k" 'False) ((C1 ('MetaCons "CannotPromoteTopElem" 'PrefixI 'False) U1 :+: C1 ('MetaCons "NoGrandparentToPromoteElemUnder" 'PrefixI 'False) U1) :+: (C1 ('MetaCons "NoSiblingsToAdoptChildren" 'PrefixI 'False) U1 :+: C1 ('MetaCons "PromotedElem" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a))))Defined in cursor-0.3.2.0 · Cursor.Tree.Promote

valuetreeCursorPromoteSubTree :: TreeCursor a -> PromoteResult (TreeCursor a)

#

datadata PromoteResult a

#

Constructors

Instances9Monad, Functor, Applicative, Eq, Show, Generic, …

Monad PromoteResultDefined in cursor-0.3.2.0 · Cursor.Tree.Promote
Functor PromoteResultDefined in cursor-0.3.2.0 · Cursor.Tree.Promote
Applicative PromoteResultDefined in cursor-0.3.2.0 · Cursor.Tree.Promote
Eq a => Eq (PromoteResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Promote
Show a => Show (PromoteResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Promote
Generic (PromoteResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Promote
NFData a => NFData (PromoteResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Promote
Validity a => Validity (PromoteResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Promote
type Rep (PromoteResult a) = D1 ('MetaData "PromoteResult" "Cursor.Tree.Promote" "cursor-0.3.2.0-F9X8WOAtgDl2Ee7ztttX2k" 'False) (C1 ('MetaCons "CannotPromoteTopNode" 'PrefixI 'False) U1 :+: (C1 ('MetaCons "NoGrandparentToPromoteUnder" 'PrefixI 'False) U1 :+: C1 ('MetaCons "Promoted" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a))))Defined in cursor-0.3.2.0 · Cursor.Tree.Promote

valuetreeCursorDemoteElem :: TreeCursor a -> DemoteResult (TreeCursor a)

#

valuetreeCursorDemoteSubTree :: TreeCursor a -> DemoteResult (TreeCursor a)

#

datadata DemoteResult a

#

Constructors

Instances7Functor, Eq, Show, Generic, NFData, Validity, …

Functor DemoteResultDefined in cursor-0.3.2.0 · Cursor.Tree.Demote
Eq a => Eq (DemoteResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Demote
Show a => Show (DemoteResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Demote
Generic (DemoteResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Demote
NFData a => NFData (DemoteResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Demote
Validity a => Validity (DemoteResult a)Defined in cursor-0.3.2.0 · Cursor.Tree.Demote
type Rep (DemoteResult a) = D1 ('MetaData "DemoteResult" "Cursor.Tree.Demote" "cursor-0.3.2.0-F9X8WOAtgDl2Ee7ztttX2k" 'False) (C1 ('MetaCons "CannotDemoteTopNode" 'PrefixI 'False) U1 :+: (C1 ('MetaCons "NoSiblingsToDemoteUnder" 'PrefixI 'False) U1 :+: C1 ('MetaCons "Demoted" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a))))Defined in cursor-0.3.2.0 · Cursor.Tree.Demote

valuetreeCursorDemoteElemUnder

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

#

Demotes the current node to the level of its children, by adding two roots. One for the current node and one for its children that are left behind.

Example:

Before:

 p
 |- a <--
    |- b

After:

 p
 |- <given element 1>
 |  |- a <--
 |- <given element 2>
 |  |- b

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

#

Demotes the current subtree to the level of its children, by adding a root.

Example:

Before:

 a <--
 |- b

After:

 <given element>
 |- a <--
    |- b

datadata CTree a

#

Constructors

CNode !a (CForest a)

Instances9Functor, Foldable, Traversable, Eq, Show, Generic, …

Functor CTreeDefined in cursor-0.3.2.0 · Cursor.Tree.Types
Foldable CTreeDefined in cursor-0.3.2.0 · Cursor.Tree.Types
Traversable CTreeDefined in cursor-0.3.2.0 · Cursor.Tree.Types
Eq a => Eq (CTree a)Defined in cursor-0.3.2.0 · Cursor.Tree.Types
Show a => Show (CTree a)Defined in cursor-0.3.2.0 · Cursor.Tree.Types
Generic (CTree a)Defined in cursor-0.3.2.0 · Cursor.Tree.Types
NFData a => NFData (CTree a)Defined in cursor-0.3.2.0 · Cursor.Tree.Types
Validity a => Validity (CTree a)Defined in cursor-0.3.2.0 · Cursor.Tree.Types
type Rep (CTree a) = D1 ('MetaData "CTree" "Cursor.Tree.Types" "cursor-0.3.2.0-F9X8WOAtgDl2Ee7ztttX2k" 'False) (C1 ('MetaCons "CNode" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a) :*: S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (CForest a))))Defined in cursor-0.3.2.0 · Cursor.Tree.Types

datadata CForest a

#

Instances9Functor, Foldable, Traversable, Eq, Show, Generic, …

Functor CForestDefined in cursor-0.3.2.0 · Cursor.Tree.Types
Foldable CForestDefined in cursor-0.3.2.0 · Cursor.Tree.Types
Traversable CForestDefined in cursor-0.3.2.0 · Cursor.Tree.Types
Eq a => Eq (CForest a)Defined in cursor-0.3.2.0 · Cursor.Tree.Types
Show a => Show (CForest a)Defined in cursor-0.3.2.0 · Cursor.Tree.Types
Generic (CForest a)Defined in cursor-0.3.2.0 · Cursor.Tree.Types
NFData a => NFData (CForest a)Defined in cursor-0.3.2.0 · Cursor.Tree.Types
Validity a => Validity (CForest a)Defined in cursor-0.3.2.0 · Cursor.Tree.Types
type Rep (CForest a) = D1 ('MetaData "CForest" "Cursor.Tree.Types" "cursor-0.3.2.0-F9X8WOAtgDl2Ee7ztttX2k" 'False) (C1 ('MetaCons "EmptyCForest" 'PrefixI 'False) U1 :+: (C1 ('MetaCons "ClosedForest" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (NonEmpty (Tree a)))) :+: C1 ('MetaCons "OpenForest" 'PrefixI 'False) (S1 ('MetaSel 'Nothing 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (NonEmpty (CTree a))))))Defined in cursor-0.3.2.0 · Cursor.Tree.Types

valuemakeCTree :: Tree a -> CTree a

#

valuecTree :: Bool -> Tree a -> CTree a

#

valuerebuildCTree :: CTree a -> Tree a

#