Idris2Doc : Data.Tree

Data.Tree

(source)
Finite Rose Trees

Definitions

recordTree : Type->Type
  A finite rose tree

Totality: total
Visibility: public export
Constructor: 
T : a->List (Treea) ->Treea

Projections:
.forest : Treea->List (Treea)
.value : Treea->a

Hints:
ApplicativeTree
Eqa=>Eq (Treea)
FoldableTree
FunctorTree
MonadTree
Showa=>Show (Treea)
TraversableTree
.value : Treea->a
Totality: total
Visibility: public export
value : Treea->a
Totality: total
Visibility: public export
.forest : Treea->List (Treea)
Totality: total
Visibility: public export
forest : Treea->List (Treea)
Totality: total
Visibility: public export
Forest : Type->Type
  A finite forest of trees

Totality: total
Visibility: public export
singleton : a->Treea
  Wrap a single value in a tree

Totality: total
Visibility: public export
replicate : Nat->Nat->a->Treea
  Create a regular tree of the given depth, where each branch has
`width` children.

Totality: total
Visibility: public export
unfold : Nat-> (s-> (a, Lists)) ->s->Treea
  Unfold a tree up to the given depth.

Totality: total
Visibility: public export
flatten : Treea->Lista
  Flatten a tree into a list.

Totality: total
Visibility: public export
layers : Treea->List (Lista)
  Convert a tree to a list of lists, so that all values at the same
depth appear in the same list.

Totality: total
Visibility: public export
index : ListNat->Treea->Maybea
  Try to look up a value in the tree by following the given path.

Totality: total
Visibility: public export
drawTree : TreeString->String
  Pretty print a tree.

Unlike `prettyTree`, this has support for multi-line strings and
will result in a vertically elongated representation.

Totality: total
Visibility: export
prettyTree : Bool->TreeString->String
  Pretty print a tree.

Unlike `drawTree`, this does not work with multi-line node labels,
but will otherwise result in a vertically more compact representation.
In addition, it is possible to print the tree "upside-down" by
setting `rev` to `True`.

Totality: total
Visibility: export