Safe Haskell	None
Language	Haskell2010

Cursor.Forest

Synopsis

newtype ForestCursor a b = ForestCursor {
- forestCursorListCursor :: NonEmptyCursor (TreeCursor a b) (CTree b)
}
singletonForestCursor :: a -> ForestCursor a 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
forestCursorSelectFirstOnSameLevel :: (a -> b) -> (b -> a) -> ForestCursor a b -> ForestCursor a b
forestCursorSelectLastOnSameLevel :: (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
forestCursorInsertNodeSingleAndSelect :: (a -> b) -> a -> ForestCursor a b -> ForestCursor a b
forestCursorAppendNodeSingleAndSelect :: (a -> b) -> a -> ForestCursor a b -> ForestCursor a b
forestCursorInsertNodeAndSelect :: (a -> b) -> a -> CForest b -> ForestCursor a b -> ForestCursor a b
forestCursorAppendNodeAndSelect :: (a -> b) -> a -> CForest 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
forestCursorAddChildTreeToNodeAtPosAndSelect :: (a -> b) -> (b -> a) -> Int -> Tree b -> ForestCursor a b -> ForestCursor a b
forestCursorAddChildTreeToNodeAtStartAndSelect :: (a -> b) -> (b -> a) -> Tree b -> ForestCursor a b -> ForestCursor a b
forestCursorAddChildTreeToNodeAtEndAndSelect :: (a -> b) -> (b -> a) -> Tree b -> ForestCursor a b -> ForestCursor a b
forestCursorAddChildToNodeAtPosAndSelect :: (a -> b) -> (b -> a) -> Int -> b -> ForestCursor a b -> ForestCursor a b
forestCursorAddChildToNodeAtStartAndSelect :: (a -> b) -> (b -> a) -> b -> ForestCursor a b -> ForestCursor a b
forestCursorAddChildToNodeAtEndAndSelect :: (a -> b) -> (b -> a) -> b -> ForestCursor a b -> ForestCursor a b
forestCursorAddChildNodeSingleToNodeAtPosAndSelect :: (a -> b) -> Int -> a -> ForestCursor a b -> ForestCursor a b
forestCursorAddChildNodeSingleToNodeAtStartAndSelect :: (a -> b) -> a -> ForestCursor a b -> ForestCursor a b
forestCursorAddChildNodeSingleToNodeAtEndAndSelect :: (a -> b) -> a -> ForestCursor a b -> ForestCursor a b
forestCursorAddChildNodeToNodeAtPosAndSelect :: (a -> b) -> Int -> a -> Forest b -> ForestCursor a b -> ForestCursor a b
forestCursorAddChildNodeToNodeAtStartAndSelect :: (a -> b) -> a -> Forest b -> ForestCursor a b -> ForestCursor a b
forestCursorAddChildNodeToNodeAtEndAndSelect :: (a -> b) -> a -> Forest 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)
forestCursorSwapNext :: ForestCursor a b -> Maybe (ForestCursor a b)
forestCursorPromoteElem :: (a -> b) -> (b -> a) -> ForestCursor a b -> Maybe (ForestCursor a b)
forestCursorPromoteSubTree :: (a -> b) -> (b -> a) -> ForestCursor a b -> Maybe (ForestCursor a b)
forestCursorDemoteElem :: (a -> b) -> (b -> a) -> ForestCursor a b -> Maybe (ForestCursor a b)
forestCursorDemoteSubTree :: (a -> b) -> (b -> a) -> ForestCursor a b -> Maybe (ForestCursor a b)
forestCursorDemoteElemUnder :: b -> b -> ForestCursor a b -> ForestCursor a b
forestCursorDemoteSubTreeUnder :: b -> ForestCursor a b -> ForestCursor a b
data CTree a = CNode !a (CForest a)
makeCTree :: Tree a -> CTree a
cTree :: Bool -> Tree a -> CTree a
rebuildCTree :: CTree a -> Tree a
data CForest a
- = EmptyCForest
- | ClosedForest !(NonEmpty (Tree a))
- | OpenForest !(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

Documentation

newtype ForestCursor a b Source #

Constructors

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

Instances

Instances details

(Eq b, Eq a) => Eq (ForestCursor a b) Source #
Instance details 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) Source #
Instance details 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) Source #
Instance details 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) Source #
Instance details Defined in Cursor.Forest Methods rnf :: ForestCursor a b -> () #
(Validity a, Validity b) => Validity (ForestCursor a b) Source #
Instance details Defined in Cursor.Forest Methods validate :: ForestCursor a b -> Validation #
type Rep (ForestCursor a b) Source #
Instance details Defined in Cursor.Forest type Rep (ForestCursor a b) = D1 ('MetaData "ForestCursor" "Cursor.Forest" "cursor-0.3.2.0-Ch3lJwc3yY89mrJgbt03T" 'True) (C1 ('MetaCons "ForestCursor" 'PrefixI 'True) (S1 ('MetaSel ('Just "forestCursorListCursor") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NonEmptyCursor (TreeCursor a b) (CTree b)))))

singletonForestCursor :: a -> ForestCursor a b Source #

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

forestCursorSelectFirstOnSameLevel :: (a -> b) -> (b -> a) -> ForestCursor a b -> ForestCursor a b Source #

forestCursorSelectLastOnSameLevel :: (a -> b) -> (b -> a) -> ForestCursor a b -> ForestCursor a b Source #

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

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

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

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

forestCursorSelection :: ForestCursor a b -> Int Source #

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

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

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

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

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

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

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

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

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

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

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

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

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

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

forestCursorInsert :: b -> ForestCursor a b -> ForestCursor a b Source #

forestCursorAppend :: b -> ForestCursor a b -> ForestCursor a b Source #

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

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

forestCursorInsertNodeSingleAndSelect :: (a -> b) -> a -> ForestCursor a b -> ForestCursor a b Source #

forestCursorAppendNodeSingleAndSelect :: (a -> b) -> a -> ForestCursor a b -> ForestCursor a b Source #

forestCursorInsertNodeAndSelect :: (a -> b) -> a -> CForest b -> ForestCursor a b -> ForestCursor a b Source #

forestCursorAppendNodeAndSelect :: (a -> b) -> a -> CForest b -> ForestCursor a b -> ForestCursor a b Source #

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

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

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

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

forestCursorAddChildToNodeAtStart :: b -> ForestCursor a b -> ForestCursor a b Source #

forestCursorAddChildToNodeAtEnd :: b -> ForestCursor a b -> ForestCursor a b Source #

forestCursorAddChildTreeToNodeAtPosAndSelect :: (a -> b) -> (b -> a) -> Int -> Tree b -> ForestCursor a b -> ForestCursor a b Source #

forestCursorAddChildTreeToNodeAtStartAndSelect :: (a -> b) -> (b -> a) -> Tree b -> ForestCursor a b -> ForestCursor a b Source #

forestCursorAddChildTreeToNodeAtEndAndSelect :: (a -> b) -> (b -> a) -> Tree b -> ForestCursor a b -> ForestCursor a b Source #

forestCursorAddChildToNodeAtPosAndSelect :: (a -> b) -> (b -> a) -> Int -> b -> ForestCursor a b -> ForestCursor a b Source #

forestCursorAddChildToNodeAtStartAndSelect :: (a -> b) -> (b -> a) -> b -> ForestCursor a b -> ForestCursor a b Source #

forestCursorAddChildToNodeAtEndAndSelect :: (a -> b) -> (b -> a) -> b -> ForestCursor a b -> ForestCursor a b Source #

forestCursorAddChildNodeSingleToNodeAtPosAndSelect :: (a -> b) -> Int -> a -> ForestCursor a b -> ForestCursor a b Source #

forestCursorAddChildNodeSingleToNodeAtStartAndSelect :: (a -> b) -> a -> ForestCursor a b -> ForestCursor a b Source #

forestCursorAddChildNodeSingleToNodeAtEndAndSelect :: (a -> b) -> a -> ForestCursor a b -> ForestCursor a b Source #

forestCursorAddChildNodeToNodeAtPosAndSelect :: (a -> b) -> Int -> a -> Forest b -> ForestCursor a b -> ForestCursor a b Source #

forestCursorAddChildNodeToNodeAtStartAndSelect :: (a -> b) -> a -> Forest b -> ForestCursor a b -> ForestCursor a b Source #

forestCursorAddChildNodeToNodeAtEndAndSelect :: (a -> b) -> a -> Forest b -> ForestCursor a b -> ForestCursor a b Source #

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

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

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

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

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

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

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

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

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

forestCursorSwapPrev :: ForestCursor a b -> Maybe (ForestCursor a b) Source #

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) Source #

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) Source #

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) Source #

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) Source #

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) Source #

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 Source #

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 Source #

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 Source #

Constructors

CNode !a (CForest a)

Instances

Instances details

Functor CTree Source #
Instance details Defined in Cursor.Tree.Types Methods fmap :: (a -> b) -> CTree a -> CTree b # (<$) :: a -> CTree b -> CTree a #
Foldable CTree Source #
Instance details Defined in Cursor.Tree.Types Methods fold :: Monoid m => CTree m -> m # foldMap :: Monoid m => (a -> m) -> CTree a -> m # foldMap' :: Monoid m => (a -> m) -> CTree a -> m # foldr :: (a -> b -> b) -> b -> CTree a -> b # foldr' :: (a -> b -> b) -> b -> CTree a -> b # foldl :: (b -> a -> b) -> b -> CTree a -> b # foldl' :: (b -> a -> b) -> b -> CTree a -> b # foldr1 :: (a -> a -> a) -> CTree a -> a # foldl1 :: (a -> a -> a) -> CTree a -> a # toList :: CTree a -> [a] # null :: CTree a -> Bool # length :: CTree a -> Int # elem :: Eq a => a -> CTree a -> Bool # maximum :: Ord a => CTree a -> a # minimum :: Ord a => CTree a -> a # sum :: Num a => CTree a -> a # product :: Num a => CTree a -> a #
Traversable CTree Source #
Instance details Defined in Cursor.Tree.Types Methods traverse :: Applicative f => (a -> f b) -> CTree a -> f (CTree b) # sequenceA :: Applicative f => CTree (f a) -> f (CTree a) # mapM :: Monad m => (a -> m b) -> CTree a -> m (CTree b) # sequence :: Monad m => CTree (m a) -> m (CTree a) #
Eq a => Eq (CTree a) Source #
Instance details Defined in Cursor.Tree.Types Methods (==) :: CTree a -> CTree a -> Bool # (/=) :: CTree a -> CTree a -> Bool #
Show a => Show (CTree a) Source #
Instance details Defined in Cursor.Tree.Types Methods showsPrec :: Int -> CTree a -> ShowS # show :: CTree a -> String # showList :: [CTree a] -> ShowS #
Generic (CTree a) Source #
Instance details 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) Source #
Instance details Defined in Cursor.Tree.Types Methods rnf :: CTree a -> () #
Validity a => Validity (CTree a) Source #
Instance details Defined in Cursor.Tree.Types Methods validate :: CTree a -> Validation #
type Rep (CTree a) Source #
Instance details Defined in Cursor.Tree.Types type Rep (CTree a) = D1 ('MetaData "CTree" "Cursor.Tree.Types" "cursor-0.3.2.0-Ch3lJwc3yY89mrJgbt03T" '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 Source #

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

rebuildCTree :: CTree a -> Tree a Source #

data CForest a Source #

Constructors

EmptyCForest
ClosedForest !(NonEmpty (Tree a))
OpenForest !(NonEmpty (CTree a))

Instances

Instances details

Functor CForest Source #
Instance details Defined in Cursor.Tree.Types Methods fmap :: (a -> b) -> CForest a -> CForest b # (<$) :: a -> CForest b -> CForest a #
Foldable CForest Source #
Instance details Defined in Cursor.Tree.Types Methods fold :: Monoid m => CForest m -> m # foldMap :: Monoid m => (a -> m) -> CForest a -> m # foldMap' :: Monoid m => (a -> m) -> CForest a -> m # foldr :: (a -> b -> b) -> b -> CForest a -> b # foldr' :: (a -> b -> b) -> b -> CForest a -> b # foldl :: (b -> a -> b) -> b -> CForest a -> b # foldl' :: (b -> a -> b) -> b -> CForest a -> b # foldr1 :: (a -> a -> a) -> CForest a -> a # foldl1 :: (a -> a -> a) -> CForest a -> a # toList :: CForest a -> [a] # null :: CForest a -> Bool # length :: CForest a -> Int # elem :: Eq a => a -> CForest a -> Bool # maximum :: Ord a => CForest a -> a # minimum :: Ord a => CForest a -> a # sum :: Num a => CForest a -> a # product :: Num a => CForest a -> a #
Traversable CForest Source #
Instance details Defined in Cursor.Tree.Types Methods traverse :: Applicative f => (a -> f b) -> CForest a -> f (CForest b) # sequenceA :: Applicative f => CForest (f a) -> f (CForest a) # mapM :: Monad m => (a -> m b) -> CForest a -> m (CForest b) # sequence :: Monad m => CForest (m a) -> m (CForest a) #
Eq a => Eq (CForest a) Source #
Instance details Defined in Cursor.Tree.Types Methods (==) :: CForest a -> CForest a -> Bool # (/=) :: CForest a -> CForest a -> Bool #
Show a => Show (CForest a) Source #
Instance details Defined in Cursor.Tree.Types Methods showsPrec :: Int -> CForest a -> ShowS # show :: CForest a -> String # showList :: [CForest a] -> ShowS #
Generic (CForest a) Source #
Instance details 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) Source #
Instance details Defined in Cursor.Tree.Types Methods rnf :: CForest a -> () #
Validity a => Validity (CForest a) Source #
Instance details Defined in Cursor.Tree.Types Methods validate :: CForest a -> Validation #
type Rep (CForest a) Source #
Instance details Defined in Cursor.Tree.Types type Rep (CForest a) = D1 ('MetaData "CForest" "Cursor.Tree.Types" "cursor-0.3.2.0-Ch3lJwc3yY89mrJgbt03T" '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 Source #

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

rebuildCForest :: CForest a -> Forest a Source #

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

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