balanced-binary-search-tree-1.0.0.0: Type safe BST and AVL trees
Copyright(c) Nicolás Rodríguez 2021
LicenseGPL-3
MaintainerNicolás Rodríguez
Stabilityexperimental
PortabilityPOSIX
Safe HaskellSafe
LanguageHaskell2010

Data.Tree.ITree

Description

Definition of the trees used at the type level for the type safe BST and AVL trees.

Synopsis

Documentation

data Tree :: Type where Source #

Tree definition for the type level. Type safe trees are indexed by type trees of the kind `Tree.

Constructors

EmptyTree :: Tree 
ForkTree :: Tree -> n -> Tree -> Tree 

data ITree :: Tree -> Type where Source #

Value level trees indexed by trees of kind `Tree. The tree structure from the value level is replicated at the type level.

Constructors

EmptyITree :: ITree 'EmptyTree 
ForkITree :: Show a => ITree l -> Node n a -> ITree r -> ITree ('ForkTree l (Node n a) r) 

Instances

Instances details
Show (ITree t) Source #

Show instance for ITree.

Instance details

Defined in Data.Tree.ITree

Methods

showsPrec :: Int -> ITree t -> ShowS #

show :: ITree t -> String #

showList :: [ITree t] -> ShowS #