sig
type 'a t
val invariant : 'a Invariant.inv -> 'a t Invariant.inv
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 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 of_list : 'a list -> 'a Stack_intf.S.t
val create : unit -> 'a Stack_intf.S.t
val push : 'a Stack_intf.S.t -> 'a -> unit
val pop : 'a Stack_intf.S.t -> 'a option
val pop_exn : 'a Stack_intf.S.t -> 'a
val top : 'a Stack_intf.S.t -> 'a option
val top_exn : 'a Stack_intf.S.t -> 'a
val clear : 'a Stack_intf.S.t -> unit
val copy : 'a Stack_intf.S.t -> 'a Stack_intf.S.t
val until_empty : 'a Stack_intf.S.t -> ('a -> unit) -> unit
val t_of_sexp :
(Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a Stack_intf.S.t
val sexp_of_t :
('a -> Sexplib.Sexp.t) -> 'a Stack_intf.S.t -> Sexplib.Sexp.t
val bin_t :
'a Bin_prot.Type_class.t -> 'a Stack_intf.S.t Bin_prot.Type_class.t
val bin_read_t :
'a Bin_prot.Unsafe_read_c.reader ->
'a Stack_intf.S.t Bin_prot.Read_ml.reader
val bin_read_t_ :
'a Bin_prot.Unsafe_read_c.reader ->
'a Stack_intf.S.t Bin_prot.Unsafe_read_c.reader
val bin_read_t__ :
'a Bin_prot.Unsafe_read_c.reader ->
(int -> 'a Stack_intf.S.t) Bin_prot.Unsafe_read_c.reader
val bin_reader_t :
'a Bin_prot.Type_class.reader ->
'a Stack_intf.S.t Bin_prot.Type_class.reader
val bin_size_t :
'a Bin_prot.Size.sizer -> 'a Stack_intf.S.t Bin_prot.Size.sizer
val bin_write_t :
'a Bin_prot.Unsafe_write_c.writer ->
'a Stack_intf.S.t Bin_prot.Write_ml.writer
val bin_write_t_ :
'a Bin_prot.Unsafe_write_c.writer ->
'a Stack_intf.S.t Bin_prot.Unsafe_write_c.writer
val bin_writer_t :
'a Bin_prot.Type_class.writer ->
'a Stack_intf.S.t Bin_prot.Type_class.writer
end