`sig
module Elt :
sig
type 'a t
val equal : 'a Bag.Elt.t -> 'a Bag.Elt.t -> bool
val sexp_of_t :
('a -> Std_internal.Sexp.t) -> 'a Bag.Elt.t -> Std_internal.Sexp.t
val value : 'a Bag.Elt.t -> 'a
end
type 'a t
val mem : ?equal:('a -> 'a -> bool) -> 'a t -> 'a -> bool
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
val fold : 'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val exists : 'a t -> f:('a -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val sum :
(module Commutative_group.S with type t = 'sum) ->
'a t -> f:('a -> 'sum) -> 'sum
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> 'a array
val min_elt : 'a t -> cmp:('a -> 'a -> int) -> 'a option
val max_elt : 'a t -> cmp:('a -> 'a -> int) -> 'a option
val invariant : 'a Bag.t -> unit
val create : unit -> 'a Bag.t
val add : 'a Bag.t -> 'a -> 'a Bag.Elt.t
val remove : 'a Bag.t -> 'a Bag.Elt.t -> unit
val choose : 'a Bag.t -> 'a Bag.Elt.t option
val remove_one : 'a Bag.t -> 'a option
val clear : 'a Bag.t -> unit
val filter_inplace : 'a Bag.t -> f:('a -> bool) -> unit
val iter_elt : 'a Bag.t -> f:('a Bag.Elt.t -> unit) -> unit
val find_elt : 'a Bag.t -> f:('a -> bool) -> 'a Bag.Elt.t option
val until_empty : 'a Bag.t -> ('a -> unit) -> unit
val transfer : src:'a Bag.t -> dst:'a Bag.t -> unit
val of_list : 'a list -> 'a Bag.t
val elts : 'a Bag.t -> 'a Bag.Elt.t list
val unchecked_iter : 'a Bag.t -> f:('a -> unit) -> unit
val t_of_sexp : (Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a Bag.t
val sexp_of_t : ('a -> Sexplib.Sexp.t) -> 'a Bag.t -> Sexplib.Sexp.t
end`