Cursor.Forest

Documentation

newtype ForestCursor a b

Constructors

ForestCursor

Fields

• forestCursorListCursor :: NonEmptyCursor (TreeCursor a b) (CTree b)

Instances

(Eq b, Eq a) => Eq (ForestCursor a b)

Defined in Cursor.Forest

Methods

(==) :: ForestCursor a b -> ForestCursor a b -> Bool

(/=) :: ForestCursor a b -> ForestCursor a b -> Bool

(Show b, Show a) => Show (ForestCursor a b)

Defined in Cursor.Forest

Methods

showsPrec :: Int -> ForestCursor a b -> ShowS

show :: ForestCursor a b -> String

showList :: [ForestCursor a b] -> ShowS

Generic (ForestCursor a b)

Defined in Cursor.Forest

Associated Types

type Rep (ForestCursor a b) :: Type -> Type

Methods

from :: ForestCursor a b -> Rep (ForestCursor a b) x

to :: Rep (ForestCursor a b) x -> ForestCursor a b

(NFData a, NFData b) => NFData (ForestCursor a b)

Defined in Cursor.Forest

Methods

rnf :: ForestCursor a b -> ()

(Validity a, Validity b) => Validity (ForestCursor a b)

Defined in Cursor.Forest

Methods

validate :: ForestCursor a b -> Validation

type Rep (ForestCursor a b)

Defined in Cursor.Forest

type Rep (ForestCursor a b) = D1 (MetaData "ForestCursor" "Cursor.Forest" "cursor-0.3.0.0-4Hn80vYAl979Qxk54M4vdL" True) (C1 (MetaCons "ForestCursor" PrefixI True) (S1 (MetaSel (Just "forestCursorListCursor") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (NonEmptyCursor (TreeCursor a b) (CTree b)))))

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

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

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

mapForestCursor :: (a -> c) -> (b -> d) -> ForestCursor a b -> ForestCursor c d

forestCursorListCursorL :: Lens (ForestCursor a b) (ForestCursor c d) (NonEmptyCursor (TreeCursor a b) (CTree b)) (NonEmptyCursor (TreeCursor c d) (CTree d))

forestCursorSelectedTreeL :: Lens' (ForestCursor a b) (TreeCursor a b)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

forestCursorSelection :: ForestCursor a b -> Int

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

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

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

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

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

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

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

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

forestCursorInsertAndSelectTreeCursor :: (a -> b) -> TreeCursor a b -> ForestCursor a b -> ForestCursor a b

forestCursorAppendAndSelectTreeCursor :: (a -> b) -> TreeCursor a b -> ForestCursor a b -> ForestCursor a b

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

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

forestCursorInsertAndSelectTree :: (a -> b) -> (b -> a) -> Tree b -> ForestCursor a b -> ForestCursor a b

forestCursorAppendAndSelectTree :: (a -> b) -> (b -> a) -> Tree b -> ForestCursor a b -> ForestCursor a b

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

forestCursorAddRoot :: (a -> b) -> (b -> a) -> ForestCursor a b -> a -> TreeCursor a b

forestCursorSwapPrev :: 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

forestCursorSwapNext :: 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 <--

forestCursorPromoteElem :: (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

forestCursorPromoteSubTree :: (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

forestCursorDemoteElem :: (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

forestCursorDemoteSubTree :: (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

forestCursorDemoteElemUnder :: 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

forestCursorDemoteSubTreeUnder :: 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

data CTree a

Constructors

CNode !a (CForest a)

Instances

Functor CTree

Defined in Cursor.Tree.Types

Methods

fmap :: (a -> b) -> CTree a -> CTree b

(<$) :: a -> CTree b -> CTree a

Eq a => Eq (CTree a)

Defined in Cursor.Tree.Types

Methods

(==) :: CTree a -> CTree a -> Bool

(/=) :: CTree a -> CTree a -> Bool

Show a => Show (CTree a)

Defined in Cursor.Tree.Types

Methods

showsPrec :: Int -> CTree a -> ShowS

show :: CTree a -> String

showList :: [CTree a] -> ShowS

Generic (CTree a)

Defined in Cursor.Tree.Types

Associated Types

type Rep (CTree a) :: Type -> Type

Methods

from :: CTree a -> Rep (CTree a) x

to :: Rep (CTree a) x -> CTree a

NFData a => NFData (CTree a)

Defined in Cursor.Tree.Types

Methods

rnf :: CTree a -> ()

Validity a => Validity (CTree a)

Defined in Cursor.Tree.Types

Methods

validate :: CTree a -> Validation

type Rep (CTree a)

Defined in Cursor.Tree.Types

type Rep (CTree a) = D1 (MetaData "CTree" "Cursor.Tree.Types" "cursor-0.3.0.0-4Hn80vYAl979Qxk54M4vdL" False) (C1 (MetaCons "CNode" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 a) :*: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (CForest a))))

makeCTree :: Tree a -> CTree a

cTree :: Bool -> Tree a -> CTree a

rebuildCTree :: CTree a -> Tree a

data CForest a

Constructors

EmptyCForest

ClosedForest !(NonEmpty (Tree a))

OpenForest !(NonEmpty (CTree a))

Instances

Functor CForest

Defined in Cursor.Tree.Types

Methods

fmap :: (a -> b) -> CForest a -> CForest b

(<$) :: a -> CForest b -> CForest a

Eq a => Eq (CForest a)

Defined in Cursor.Tree.Types

Methods

(==) :: CForest a -> CForest a -> Bool

(/=) :: CForest a -> CForest a -> Bool

Show a => Show (CForest a)

Defined in Cursor.Tree.Types

Methods

showsPrec :: Int -> CForest a -> ShowS

show :: CForest a -> String

showList :: [CForest a] -> ShowS

Generic (CForest a)

Defined in Cursor.Tree.Types

Associated Types

type Rep (CForest a) :: Type -> Type

Methods

from :: CForest a -> Rep (CForest a) x

to :: Rep (CForest a) x -> CForest a

NFData a => NFData (CForest a)

Defined in Cursor.Tree.Types

Methods

rnf :: CForest a -> ()

Validity a => Validity (CForest a)

Defined in Cursor.Tree.Types

Methods

validate :: CForest a -> Validation

type Rep (CForest a)

Defined in Cursor.Tree.Types

type Rep (CForest a) = D1 (MetaData "CForest" "Cursor.Tree.Types" "cursor-0.3.0.0-4Hn80vYAl979Qxk54M4vdL" False) (C1 (MetaCons "EmptyCForest" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "ClosedForest" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 (NonEmpty (Tree a)))) :+: C1 (MetaCons "OpenForest" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 (NonEmpty (CTree a))))))

makeCForest :: Forest a -> CForest a

cForest :: Bool -> Forest a -> CForest a

rebuildCForest :: CForest a -> Forest a

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

foldForestCursor :: ([CTree b] -> TreeCursor a b -> [CTree b] -> c) -> ForestCursor a b -> c