Sf.Rawtype elt = Eqtype.Equality.sorttype tree = TFunName.St.Raw.tree = | Leaf| Node of Int.Z_as_Int.t * tree * Eqtype.Equality.sort * treeval empty : treeval is_empty : tree -> boolval mem : Eqtype.Equality.sort -> tree -> boolval elements_aux :
Eqtype.Equality.sort list ->
tree ->
Eqtype.Equality.sort listval elements : tree -> Eqtype.Equality.sort listval rev_elements_aux :
Eqtype.Equality.sort list ->
tree ->
Eqtype.Equality.sort listval rev_elements : tree -> Eqtype.Equality.sort listval cardinal : tree -> Datatypes.natval maxdepth : tree -> Datatypes.natval mindepth : tree -> Datatypes.natval cons : tree -> enumeration -> enumerationval compare_more :
Eqtype.Equality.sort ->
(enumeration -> Datatypes.comparison) ->
enumeration ->
Datatypes.comparisonval compare_cont :
tree ->
(enumeration -> Datatypes.comparison) ->
enumeration ->
Datatypes.comparisonval compare_end : enumeration -> Datatypes.comparisonval compare : tree -> tree -> Datatypes.comparisonval subsetl : (tree -> bool) -> Eqtype.Equality.sort -> tree -> boolval subsetr : (tree -> bool) -> Eqtype.Equality.sort -> tree -> booltype t = treeval height : t -> Int.Z_as_Int.tval singleton : Eqtype.Equality.sort -> treeval create : t -> Eqtype.Equality.sort -> t -> treeval assert_false : t -> Eqtype.Equality.sort -> t -> treeval bal : t -> Eqtype.Equality.sort -> t -> treeval add : Eqtype.Equality.sort -> tree -> treeval remove : Eqtype.Equality.sort -> tree -> treeval t_in : triple -> boolval split : Eqtype.Equality.sort -> tree -> tripleval ltb_tree : Eqtype.Equality.sort -> tree -> boolval gtb_tree : Eqtype.Equality.sort -> tree -> boolval isok : tree -> boolmodule MX : sig ... endmodule L : sig ... endval flatten_e : enumeration -> elt list