Idris2Doc : Data.Container.Base.TreeUtils

Data.Container.Base.TreeUtils

(source)

Definitions

dataBinTreeShape : Type
  Shapes of binary trees

Totality: total
Visibility: public export
Constructors:
LeafS : BinTreeShape
NodeS : BinTreeShape->BinTreeShape->BinTreeShape

Hints:
EqBinTreeShape
Eq (BinTreePosb)
Eq (BinTreePosNodeb)
Eq (BinTreePosLeafb)
MOrd (BinTreePosb)
MOrd (BinTreePosNodeb)
MOrd (BinTreePosLeafb)
ShowBinTreeShape
Show (BinTreePosb)
Show (BinTreePosNodeb)
Show (BinTreePosLeafb)
numLeaves : BinTreeShape->Nat
Visibility: public export
numNodes : BinTreeShape->Nat
Visibility: public export
numNodesAndLeaves : BinTreeShape->Nat
Visibility: public export
dataBinTreePos : BinTreeShape->Type
  Positions corresponding to both nodes and leaves within a BinTreeShape

Totality: total
Visibility: public export
Constructors:
AtLeaf : BinTreePosLeafS
AtNode : BinTreePos (NodeSlr)
GoLeft : BinTreePosl->BinTreePos (NodeSlr)
GoRight : BinTreePosr->BinTreePos (NodeSlr)

Hints:
Eq (BinTreePosb)
MOrd (BinTreePosb)
Show (BinTreePosb)
dataBinTreePosNode : BinTreeShape->Type
  Positions corresponding to nodes within a BinTreeNode shape.

Totality: total
Visibility: public export
Constructors:
AtNode : BinTreePosNode (NodeSlr)
GoLeft : BinTreePosNodel->BinTreePosNode (NodeSlr)
GoRight : BinTreePosNoder->BinTreePosNode (NodeSlr)

Hints:
Eq (BinTreePosNodeb)
MOrd (BinTreePosNodeb)
Show (BinTreePosNodeb)
dataBinTreePosLeaf : BinTreeShape->Type
  Positions corresponding to leaves within a BinTreeShape 

Totality: total
Visibility: public export
Constructors:
AtLeaf : BinTreePosLeafLeafS
GoLeft : BinTreePosLeafl->BinTreePosLeaf (NodeSlr)
GoRight : BinTreePosLeafr->BinTreePosLeaf (NodeSlr)

Hints:
Eq (BinTreePosLeafb)
MOrd (BinTreePosLeafb)
Show (BinTreePosLeafb)