Modulecursor-0.3.2.0Haskell2010

Cursor.Forest

3 types
89 values

Packagecursor-0.3.2.0
Exports92
LanguageHaskell2010
LicenceMIT
SourceForest.hs

newtypenewtype ForestCursor a b

Constructors

ForestCursor
- forestCursorListCursor :: NonEmptyCursor (TreeCursor a b) (CTree b)

Instances6Eq, Show, Generic, NFData, Validity, Rep

(Eq b, Eq a) => Eq (ForestCursor a b)Defined in cursor-0.3.2.0 · Cursor.Forest
(Show b, Show a) => Show (ForestCursor a b)Defined in cursor-0.3.2.0 · Cursor.Forest
Generic (ForestCursor a b)Defined in cursor-0.3.2.0 · Cursor.Forest
(NFData a, NFData b) => NFData (ForestCursor a b)Defined in cursor-0.3.2.0 · Cursor.Forest
(Validity a, Validity b) => Validity (ForestCursor a b)Defined in cursor-0.3.2.0 · Cursor.Forest
type Rep (ForestCursor a b) = D1 ('MetaData "ForestCursor" "Cursor.Forest" "cursor-0.3.2.0-F9X8WOAtgDl2Ee7ztttX2k" 'True) (C1 ('MetaCons "ForestCursor" 'PrefixI 'True) (S1 ('MetaSel ('Just "forestCursorListCursor") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NonEmptyCursor (TreeCursor a b) (CTree b)))))Defined in cursor-0.3.2.0 · Cursor.Forest

valuesingletonForestCursor :: a -> ForestCursor a b

valuemakeForestCursor :: (b -> a) -> NonEmpty (CTree b) -> ForestCursor a b

valuerebuildForestCursor :: (a -> b) -> ForestCursor a b -> NonEmpty (CTree b)

valuedrawForestCursor :: (Show a, Show b) => ForestCursor a b -> String

valuemapForestCursor

:: a -> c
-> b -> d
-> ForestCursor a b
-> ForestCursor c d

valueforestCursorListCursorL

:: Functor f
=> NonEmptyCursor (TreeCursor a b) (CTree b) -> f (NonEmptyCursor (TreeCursor c d) (CTree d))
-> ForestCursor a b
-> f (ForestCursor c d)

valueforestCursorSelectedTreeL

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

valueforestCursorSelectPrevTreeCursor

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

valueforestCursorSelectNextTreeCursor

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

valueforestCursorSelectFirstTreeCursor

:: a -> b
-> b -> a
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorSelectLastTreeCursor

:: a -> b
-> b -> a
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorSelectPrev

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

valueforestCursorSelectNext

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

valueforestCursorSelectPrevOnSameLevel

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

valueforestCursorSelectNextOnSameLevel

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

valueforestCursorSelectFirst

:: a -> b
-> b -> a
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorSelectLast

:: a -> b
-> b -> a
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorSelectFirstOnSameLevel

:: a -> b
-> b -> a
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorSelectLastOnSameLevel

:: a -> b
-> b -> a
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorSelectAbove

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

valueforestCursorSelectBelowAtPos

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

valueforestCursorSelectBelowAtStart

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

valueforestCursorSelectBelowAtEnd

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

valueforestCursorSelection :: ForestCursor a b -> Int

valueforestCursorSelectIndex

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

valueforestCursorOpenCurrentForest

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

valueforestCursorCloseCurrentForest

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

valueforestCursorToggleCurrentForest

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

valueforestCursorOpenCurrentForestRecursively

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

valueforestCursorToggleCurrentForestRecursively

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

valueforestCursorInsertEntireTree

:: Tree b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAppendEntireTree

:: Tree b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorInsertAndSelectTreeCursor

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

valueforestCursorAppendAndSelectTreeCursor

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

valueforestCursorInsertTree :: Tree b -> ForestCursor a b -> ForestCursor a b

valueforestCursorAppendTree :: Tree b -> ForestCursor a b -> ForestCursor a b

valueforestCursorInsertAndSelectTree

:: a -> b
-> b -> a
-> Tree b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAppendAndSelectTree

:: a -> b
-> b -> a
-> Tree b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorInsert :: b -> ForestCursor a b -> ForestCursor a b

valueforestCursorAppend :: b -> ForestCursor a b -> ForestCursor a b

valueforestCursorInsertAndSelect

:: a -> b
-> b -> a
-> b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAppendAndSelect

:: a -> b
-> b -> a
-> b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorInsertNodeSingleAndSelect

:: a -> b
-> a
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAppendNodeSingleAndSelect

:: a -> b
-> a
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorInsertNodeAndSelect

:: a -> b
-> a
-> CForest b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAppendNodeAndSelect

:: a -> b
-> a
-> CForest b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAddChildTreeToNodeAtPos

:: Int
-> Tree b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAddChildTreeToNodeAtStart

:: Tree b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAddChildTreeToNodeAtEnd

:: Tree b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAddChildToNodeAtPos

:: Int
-> b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAddChildToNodeAtStart

:: b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAddChildToNodeAtEnd :: b -> ForestCursor a b -> ForestCursor a b

valueforestCursorAddChildTreeToNodeAtPosAndSelect

:: a -> b
-> b -> a
-> Int
-> Tree b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAddChildTreeToNodeAtStartAndSelect

:: a -> b
-> b -> a
-> Tree b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAddChildTreeToNodeAtEndAndSelect

:: a -> b
-> b -> a
-> Tree b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAddChildToNodeAtPosAndSelect

:: a -> b
-> b -> a
-> Int
-> b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAddChildToNodeAtStartAndSelect

:: a -> b
-> b -> a
-> b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAddChildToNodeAtEndAndSelect

:: a -> b
-> b -> a
-> b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAddChildNodeSingleToNodeAtPosAndSelect

:: a -> b
-> Int
-> a
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAddChildNodeSingleToNodeAtStartAndSelect

:: a -> b
-> a
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAddChildNodeSingleToNodeAtEndAndSelect

:: a -> b
-> a
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAddChildNodeToNodeAtPosAndSelect

:: a -> b
-> Int
-> a
-> Forest b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAddChildNodeToNodeAtStartAndSelect

:: a -> b
-> a
-> Forest b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorAddChildNodeToNodeAtEndAndSelect

:: a -> b
-> a
-> Forest b
-> ForestCursor a b
-> ForestCursor a b

valueforestCursorRemoveElemAndSelectPrev

:: b -> a
-> ForestCursor a b
-> Maybe (DeleteOrUpdate (ForestCursor a b))

valueforestCursorDeleteElemAndSelectNext

:: b -> a
-> ForestCursor a b
-> Maybe (DeleteOrUpdate (ForestCursor a b))

valueforestCursorRemoveElem

:: b -> a
-> ForestCursor a b
-> DeleteOrUpdate (ForestCursor a b)

valueforestCursorDeleteElem

:: b -> a
-> ForestCursor a b
-> DeleteOrUpdate (ForestCursor a b)

valueforestCursorRemoveSubTreeAndSelectPrev

:: b -> a
-> ForestCursor a b
-> Maybe (DeleteOrUpdate (ForestCursor a b))

valueforestCursorDeleteSubTreeAndSelectNext

:: b -> a
-> ForestCursor a b
-> Maybe (DeleteOrUpdate (ForestCursor a b))

valueforestCursorRemoveSubTree

:: b -> a
-> ForestCursor a b
-> DeleteOrUpdate (ForestCursor a b)

valueforestCursorDeleteSubTree

:: b -> a
-> ForestCursor a b
-> DeleteOrUpdate (ForestCursor a b)

valueforestCursorAddRoot

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

valueforestCursorSwapPrev :: ForestCursor a b -> Maybe (ForestCursor a b)

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

Example:

Before:

- a
- b <--

After:

- b <--
- a

valueforestCursorSwapNext :: ForestCursor a b -> Maybe (ForestCursor a b)

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

Example:

Before:

- a <--
- b

After:

- b
- a <--

valueforestCursorPromoteElem

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

Promotes the current node to the level of its parent.

Example:

Before:

- a
  |- b
  |  |- c
  |- d <--
  |  |- e
  |- f
     |- g
- h

After:

- a
  |- b
  |  |- c
  |  |- e
  |- f
     |- g
- d <--
- h

valueforestCursorPromoteSubTree

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

Promotes the current node to the level of its parent.

Example:

Before:

 - a
   |- b
   |  |- c
   |- d <--
   |  |- e
   |- f
      |- g
 - h

After:


- a
  |- b
  |  |- c
  |- f
     |- g
- d <--
  |- e
- h

valueforestCursorDemoteElem

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

Demotes the current node to the level of its children.

Example:

Before:

- a
  |- b
- c <--
  |- d
- e

After:

- a
  |- b
  |- c <--
  |- d
- e

valueforestCursorDemoteSubTree

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

Demotes the current subtree to the level of its children.

Example:

Before:

 - a
   |- b
 - c <--
   |- d

After:

 - a
   |- b
   |- c <--
      |- d

valueforestCursorDemoteElemUnder

:: b
-> b
-> ForestCursor a b
-> ForestCursor 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:

 - a <--
   |- b

After:

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

valueforestCursorDemoteSubTreeUnder :: b -> ForestCursor a b -> ForestCursor 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

valuemakeCTree :: Tree a -> CTree a

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

valuerebuildCTree :: CTree a -> Tree a

datadata CForest a

Constructors

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

valuemakeCForest :: Forest a -> CForest a

valuecForest :: Bool -> Forest a -> CForest a

valuerebuildCForest :: CForest a -> Forest a

valuetraverseForestCursor

:: [CTree b] -> TreeCursor a b -> [CTree b] -> f c
-> ForestCursor a b
-> f c

valuefoldForestCursor

:: [CTree b] -> TreeCursor a b -> [CTree b] -> c
-> ForestCursor a b
-> c