package epictetus

  1. Overview
  2. Docs
type t = {
  1. width : int;
  2. children : t list;
}

The structure of a tree. A tree_size is consistent if all integers are non negative. Moreover the sum of sizes of the children of a node must be lower than or equal to the size of the node.

When printing with a tree_size, each element of the tree_contents must have a length lower than or equal to the size in the tree_size.

Every generated tree_size satisfy this constraints. Be careful if you want to use them manually.

val merge : t -> t -> t

Compute the join of given tree_size. Intended for internal use. Be careful.