hashcons 1.4.0 · OCaml Package

type 'a t

type 'a elt = 'a hash_consed

val empty : 'a t

val is_empty : 'a t -> bool

val mem : 'a elt -> 'a t -> bool

val add : 'a elt -> 'a t -> 'a t

val singleton : 'a elt -> 'a t

val remove : 'a elt -> 'a t -> 'a t

val union : 'a t -> 'a t -> 'a t

val subset : 'a t -> 'a t -> bool

val inter : 'a t -> 'a t -> 'a t

val diff : 'a t -> 'a t -> 'a t

val equal : 'a t -> 'a t -> bool

val compare : 'a t -> 'a t -> int

val choose : 'a t -> 'a elt

val choose_opt : 'a t -> 'a elt option

val cardinal : 'a t -> int

val for_all : ('a elt -> bool) -> 'a t -> bool

val exists : ('a elt -> bool) -> 'a t -> bool

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

val disjoint : 'a t -> 'a t -> bool

val find : 'a elt -> 'a t -> 'a elt

val find_opt : 'a elt -> 'a t -> 'a elt option

val add_seq : 'a elt Stdlib.Seq.t -> 'a t -> 'a t

val of_seq : 'a elt Stdlib.Seq.t -> 'a t

val of_list : 'a elt list -> 'a t

val split : 'a elt -> 'a t -> 'a t * bool * 'a t

val iter : ('a elt -> unit) -> 'a t -> unit

val fold : ('a elt -> 'b -> 'b) -> 'a t -> 'b -> 'b

val map : ('a elt -> 'b elt) -> 'a t -> 'b t

val filter : ('a elt -> bool) -> 'a t -> 'a t

val filter_map : ('a elt -> 'b elt option) -> 'a t -> 'b t

val elements : 'a t -> 'a elt list

val to_seq : 'a t -> 'a elt Stdlib.Seq.t

val min_elt : 'a t -> 'a elt

val min_elt_opt : 'a t -> 'a elt option

val max_elt : 'a t -> 'a elt

val max_elt_opt : 'a t -> 'a elt option

val find_first : ('a elt -> bool) -> 'a t -> 'a elt

val find_first_opt : ('a elt -> bool) -> 'a t -> 'a elt option

val find_last : ('a elt -> bool) -> 'a t -> 'a elt

val find_last_opt : ('a elt -> bool) -> 'a t -> 'a elt option

val intersect : 'a t -> 'a t -> bool

val find_any : ('a elt -> bool) -> 'a t -> 'a elt

val find_any_opt : ('a elt -> bool) -> 'a t -> 'a elt option

val is_singleton : 'a t -> 'a elt option

val bind : ('a elt -> 'b t) -> 'a t -> 'b t

package hashcons