Cursor.Simple.Tree

Documentation

type TreeCursor a = TreeCursor a a

data TreeAbove b

Constructors

TreeAbove

Fields

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

Instances

Functor TreeAbove

Defined in Cursor.Tree.Types

Methods

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

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

Eq b => Eq (TreeAbove b)

Defined in Cursor.Tree.Types

Methods

(==) :: TreeAbove b -> TreeAbove b -> Bool

(/=) :: TreeAbove b -> TreeAbove b -> Bool

Show b => Show (TreeAbove b)

Defined in Cursor.Tree.Types

Methods

showsPrec :: Int -> TreeAbove b -> ShowS

show :: TreeAbove b -> String

showList :: [TreeAbove b] -> ShowS

Generic (TreeAbove b)

Defined in Cursor.Tree.Types

Associated Types

type Rep (TreeAbove b) :: Type -> Type

Methods

from :: TreeAbove b -> Rep (TreeAbove b) x

to :: Rep (TreeAbove b) x -> TreeAbove b

NFData b => NFData (TreeAbove b)

Defined in Cursor.Tree.Types

Methods

rnf :: TreeAbove b -> ()

Validity b => Validity (TreeAbove b)

Defined in Cursor.Tree.Types

Methods

validate :: TreeAbove b -> Validation

type Rep (TreeAbove b)

Defined in Cursor.Tree.Types

type Rep (TreeAbove b) = D1 (MetaData "TreeAbove" "Cursor.Tree.Types" "cursor-0.3.0.0-4Hn80vYAl979Qxk54M4vdL" 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]))))

singletonTreeCursor :: a -> TreeCursor a

makeTreeCursor :: CTree a -> TreeCursor a

makeTreeCursorWithSelection :: TreeCursorSelection -> CTree a -> Maybe (TreeCursor a)

rebuildTreeCursor :: TreeCursor a -> CTree a

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

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

treeCursorAboveL :: Lens' (TreeCursor a b) (Maybe (TreeAbove b))

treeCursorCurrentL :: Lens (TreeCursor a b) (TreeCursor a' b) a a'

treeCursorBelowL :: Lens' (TreeCursor a b) (CForest b)

treeAboveLeftsL :: Lens' (TreeAbove b) [CTree b]

treeAboveAboveL :: Lens' (TreeAbove b) (Maybe (TreeAbove b))

treeAboveNodeL :: Lens' (TreeAbove b) b

treeAboveRightsL :: Lens' (TreeAbove b) [CTree b]

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

treeCursorSelection :: TreeCursor a b -> TreeCursorSelection

data TreeCursorSelection

Constructors

SelectNode

SelectChild !Int !TreeCursorSelection

Instances

Eq TreeCursorSelection

Defined in Cursor.Tree.Types

Methods

(==) :: TreeCursorSelection -> TreeCursorSelection -> Bool

(/=) :: TreeCursorSelection -> TreeCursorSelection -> Bool

Show TreeCursorSelection

Defined in Cursor.Tree.Types

Methods

showsPrec :: Int -> TreeCursorSelection -> ShowS

show :: TreeCursorSelection -> String

showList :: [TreeCursorSelection] -> ShowS

Generic TreeCursorSelection

Defined in Cursor.Tree.Types

Associated Types

type Rep TreeCursorSelection :: Type -> Type

Methods

from :: TreeCursorSelection -> Rep TreeCursorSelection x

to :: Rep TreeCursorSelection x -> TreeCursorSelection

NFData TreeCursorSelection

Defined in Cursor.Tree.Types

Methods

rnf :: TreeCursorSelection -> ()

Validity TreeCursorSelection

Defined in Cursor.Tree.Types

Methods

validate :: TreeCursorSelection -> Validation

type Rep TreeCursorSelection

Defined in Cursor.Tree.Types

type Rep TreeCursorSelection = D1 (MetaData "TreeCursorSelection" "Cursor.Tree.Types" "cursor-0.3.0.0-4Hn80vYAl979Qxk54M4vdL" False) (C1 (MetaCons "SelectNode" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "SelectChild" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 Int) :*: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness SourceStrict DecidedStrict) (Rec0 TreeCursorSelection)))

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

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

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

treeCursorSelectFirst :: TreeCursor a -> TreeCursor a

treeCursorSelectLast :: TreeCursor a -> TreeCursor a

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

treeCursorAddChildAtStart :: Tree b -> TreeCursor a b -> TreeCursor a b

treeCursorAddChildAtEnd :: Tree b -> TreeCursor a b -> TreeCursor a b

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

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

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

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

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

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

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

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

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

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

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

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

data SwapResult a

Constructors

SwapperIsTopNode

NoSiblingsToSwapWith

Swapped a

Instances

Functor SwapResult

Defined in Cursor.Tree.Swap

Methods

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

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

Eq a => Eq (SwapResult a)

Defined in Cursor.Tree.Swap

Methods

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

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

Show a => Show (SwapResult a)

Defined in Cursor.Tree.Swap

Methods

showsPrec :: Int -> SwapResult a -> ShowS

show :: SwapResult a -> String

showList :: [SwapResult a] -> ShowS

Generic (SwapResult a)

Defined in Cursor.Tree.Swap

Associated Types

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

Methods

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

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

NFData a => NFData (SwapResult a)

Defined in Cursor.Tree.Swap

Methods

rnf :: SwapResult a -> ()

Validity a => Validity (SwapResult a)

Defined in Cursor.Tree.Swap

Methods

validate :: SwapResult a -> Validation

type Rep (SwapResult a)

Defined in Cursor.Tree.Swap

type Rep (SwapResult a) = D1 (MetaData "SwapResult" "Cursor.Tree.Swap" "cursor-0.3.0.0-4Hn80vYAl979Qxk54M4vdL" False) (C1 (MetaCons "SwapperIsTopNode" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "NoSiblingsToSwapWith" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "Swapped" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a))))

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

data PromoteElemResult a

Constructors

CannotPromoteTopElem

NoGrandparentToPromoteElemUnder

NoSiblingsToAdoptChildren

PromotedElem a

Instances

Monad PromoteElemResult

Defined in Cursor.Tree.Promote

Methods

(>>=) :: PromoteElemResult a -> (a -> PromoteElemResult b) -> PromoteElemResult b

(>>) :: PromoteElemResult a -> PromoteElemResult b -> PromoteElemResult b

return :: a -> PromoteElemResult a

fail :: String -> PromoteElemResult a

Functor PromoteElemResult

Defined in Cursor.Tree.Promote

Methods

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

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

Applicative PromoteElemResult

Defined in Cursor.Tree.Promote

Methods

pure :: a -> PromoteElemResult a

(<*>) :: PromoteElemResult (a -> b) -> PromoteElemResult a -> PromoteElemResult b

liftA2 :: (a -> b -> c) -> PromoteElemResult a -> PromoteElemResult b -> PromoteElemResult c

(*>) :: PromoteElemResult a -> PromoteElemResult b -> PromoteElemResult b

(<*) :: PromoteElemResult a -> PromoteElemResult b -> PromoteElemResult a

Eq a => Eq (PromoteElemResult a)

Defined in Cursor.Tree.Promote

Methods

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

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

Show a => Show (PromoteElemResult a)

Defined in Cursor.Tree.Promote

Methods

showsPrec :: Int -> PromoteElemResult a -> ShowS

show :: PromoteElemResult a -> String

showList :: [PromoteElemResult a] -> ShowS

Generic (PromoteElemResult a)

Defined in Cursor.Tree.Promote

Associated Types

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

Methods

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

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

NFData a => NFData (PromoteElemResult a)

Defined in Cursor.Tree.Promote

Methods

rnf :: PromoteElemResult a -> ()

Validity a => Validity (PromoteElemResult a)

Defined in Cursor.Tree.Promote

Methods

validate :: PromoteElemResult a -> Validation

type Rep (PromoteElemResult a)

Defined in Cursor.Tree.Promote

type Rep (PromoteElemResult a) = D1 (MetaData "PromoteElemResult" "Cursor.Tree.Promote" "cursor-0.3.0.0-4Hn80vYAl979Qxk54M4vdL" False) ((C1 (MetaCons "CannotPromoteTopElem" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "NoGrandparentToPromoteElemUnder" PrefixI False) (U1 :: Type -> Type)) :+: (C1 (MetaCons "NoSiblingsToAdoptChildren" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "PromotedElem" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a))))

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

data PromoteResult a

Constructors

CannotPromoteTopNode

NoGrandparentToPromoteUnder

Promoted a

Instances

Monad PromoteResult

Defined in Cursor.Tree.Promote

Methods

(>>=) :: PromoteResult a -> (a -> PromoteResult b) -> PromoteResult b

(>>) :: PromoteResult a -> PromoteResult b -> PromoteResult b

return :: a -> PromoteResult a

fail :: String -> PromoteResult a

Functor PromoteResult

Defined in Cursor.Tree.Promote

Methods

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

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

Applicative PromoteResult

Defined in Cursor.Tree.Promote

Methods

pure :: a -> PromoteResult a

(<*>) :: PromoteResult (a -> b) -> PromoteResult a -> PromoteResult b

liftA2 :: (a -> b -> c) -> PromoteResult a -> PromoteResult b -> PromoteResult c

(*>) :: PromoteResult a -> PromoteResult b -> PromoteResult b

(<*) :: PromoteResult a -> PromoteResult b -> PromoteResult a

Eq a => Eq (PromoteResult a)

Defined in Cursor.Tree.Promote

Methods

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

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

Show a => Show (PromoteResult a)

Defined in Cursor.Tree.Promote

Methods

showsPrec :: Int -> PromoteResult a -> ShowS

show :: PromoteResult a -> String

showList :: [PromoteResult a] -> ShowS

Generic (PromoteResult a)

Defined in Cursor.Tree.Promote

Associated Types

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

Methods

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

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

NFData a => NFData (PromoteResult a)

Defined in Cursor.Tree.Promote

Methods

rnf :: PromoteResult a -> ()

Validity a => Validity (PromoteResult a)

Defined in Cursor.Tree.Promote

Methods

validate :: PromoteResult a -> Validation

type Rep (PromoteResult a)

Defined in Cursor.Tree.Promote

type Rep (PromoteResult a) = D1 (MetaData "PromoteResult" "Cursor.Tree.Promote" "cursor-0.3.0.0-4Hn80vYAl979Qxk54M4vdL" False) (C1 (MetaCons "CannotPromoteTopNode" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "NoGrandparentToPromoteUnder" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "Promoted" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a))))

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

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

data DemoteResult a

Constructors

CannotDemoteTopNode

NoSiblingsToDemoteUnder

Demoted a

Instances

Functor DemoteResult

Defined in Cursor.Tree.Demote

Methods

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

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

Eq a => Eq (DemoteResult a)

Defined in Cursor.Tree.Demote

Methods

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

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

Show a => Show (DemoteResult a)

Defined in Cursor.Tree.Demote

Methods

showsPrec :: Int -> DemoteResult a -> ShowS

show :: DemoteResult a -> String

showList :: [DemoteResult a] -> ShowS

Generic (DemoteResult a)

Defined in Cursor.Tree.Demote

Associated Types

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

Methods

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

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

NFData a => NFData (DemoteResult a)

Defined in Cursor.Tree.Demote

Methods

rnf :: DemoteResult a -> ()

Validity a => Validity (DemoteResult a)

Defined in Cursor.Tree.Demote

Methods

validate :: DemoteResult a -> Validation

type Rep (DemoteResult a)

Defined in Cursor.Tree.Demote

type Rep (DemoteResult a) = D1 (MetaData "DemoteResult" "Cursor.Tree.Demote" "cursor-0.3.0.0-4Hn80vYAl979Qxk54M4vdL" False) (C1 (MetaCons "CannotDemoteTopNode" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "NoSiblingsToDemoteUnder" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "Demoted" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a))))

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

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

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

data CForest 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))))))

makeCTree :: Tree a -> CTree a

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

rebuildCTree :: CTree a -> Tree a