Raw (djot.Djot_kernel.Document.StrSet.Raw)

type elt = string

type tree =

| Leaf
| Node of Int.Z_as_Int.t * tree * string * tree

val empty : tree

val is_empty : tree -> bool

val mem : string -> tree -> bool

val min_elt : tree -> elt option

val max_elt : tree -> elt option

val choose : tree -> elt option

val fold : (elt -> 'a1 -> 'a1) -> tree -> 'a1 -> 'a1

val elements_aux : string list -> tree -> string list

val elements : tree -> string list

val rev_elements_aux : string list -> tree -> string list

val rev_elements : tree -> string list

val cardinal : tree -> int

val maxdepth : tree -> int

val mindepth : tree -> int

val for_all : (elt -> bool) -> tree -> bool

val exists_ : (elt -> bool) -> tree -> bool

type enumeration =

| End
| More of elt * tree * enumeration

val cons : tree -> enumeration -> enumeration

val compare_more : 
  string ->
  (enumeration -> Datatypes.comparison) ->
  enumeration ->
  Datatypes.comparison

val compare_cont : 
  tree ->
  (enumeration -> Datatypes.comparison) ->
  enumeration ->
  Datatypes.comparison

val compare_end : enumeration -> Datatypes.comparison

val compare : tree -> tree -> Datatypes.comparison

val equal : tree -> tree -> bool

val subsetl : (tree -> bool) -> string -> tree -> bool

val subsetr : (tree -> bool) -> string -> tree -> bool

val subset : tree -> tree -> bool

type t = tree

val height : t -> Int.Z_as_Int.t

val singleton : string -> tree

val create : t -> string -> t -> tree

val assert_false : t -> string -> t -> tree

val bal : t -> string -> t -> tree

val add : string -> tree -> tree

val join : tree -> elt -> t -> t

val remove_min : tree -> elt -> t -> t * elt

val merge : tree -> tree -> tree

val remove : string -> tree -> tree

val concat : tree -> tree -> tree

type triple = {

t_left : t;
t_in : bool;
t_right : t;

}

val t_left : triple -> t

val t_in : triple -> bool

val t_right : triple -> t

val split : string -> tree -> triple

val inter : tree -> tree -> tree

val diff : tree -> tree -> tree

val union : tree -> tree -> tree

val filter : (elt -> bool) -> tree -> tree

val partition : (elt -> bool) -> t -> t * t

val ltb_tree : string -> tree -> bool

val gtb_tree : string -> tree -> bool

val isok : tree -> bool

module MX : sig ... end

module L : sig ... end

val flatten_e : enumeration -> elt list