# Functor Stack_unit_tests.Debug

    module Debug: functor (Stack : Stack_intf.S) -> sig .. end

Parameters:

`Stack` | : | `Stack_intf.S`

    include struct ... end

    val bin_size_t : 'a Bin_prot.Size.sizer -> 'a Stack.t -> int

    val bin_write_t : 'a Bin_prot.Write.writer ->
           Bin_prot.Common.buf ->
           pos:Bin_prot.Common.pos -> 'a Stack.t -> Bin_prot.Common.pos

    val bin_writer_t : 'a Bin_prot.Type_class.writer -> 'a Stack.t Bin_prot.Type_class.writer

    val __bin_read_t__ : 'a Bin_prot.Read.reader ->
           Bin_prot.Common.buf -> pos_ref:Bin_prot.Common.pos_ref -> int -> 'a Stack.t

    val bin_read_t : 'a Bin_prot.Read.reader ->
           Bin_prot.Common.buf -> pos_ref:Bin_prot.Common.pos_ref -> 'a Stack.t

    val bin_reader_t : 'a Bin_prot.Type_class.reader -> 'a Stack.t Bin_prot.Type_class.reader

    val bin_t : 'a Bin_prot.Type_class.t -> 'a Stack.t Bin_prot.Type_class.t

    val invariant : 'a Invariant_intf.inv -> 'a Stack.t Invariant_intf.inv

    val clear : 'a Stack.t -> unit

    val copy : 'a Stack.t -> 'a t

    val count : 'a Stack.t -> f:('a -> bool) -> int

    val sum : (module Commutative_group.S with type t = 'a) ->
           'b Stack.t -> f:('b -> 'a) -> 'a

    val create : unit -> 'a t

    val exists : 'a Stack.t -> f:('a -> bool) -> bool

    val find : 'a Stack.t -> f:('a -> bool) -> 'a option

    val find_map : 'a Stack.t -> f:('a -> 'b option) -> 'b option

    val fold : 'a Stack.t -> init:'b -> f:('b -> 'a -> 'b) -> 'b

    val for_all : 'a Stack.t -> f:('a -> bool) -> bool

    val is_empty : 'a Stack.t -> bool

    val iter : 'a Stack.t -> f:('a -> unit) -> unit

    val length : 'a Stack.t -> int

    val mem : ?equal:('a -> 'a -> bool) -> 'a Stack.t -> 'a -> bool

    val of_list : 'a list -> 'a t

    val pop : 'a Stack.t -> 'a option

    val pop_exn : 'a Stack.t -> 'a

    val push : 'a Stack.t -> 'a -> unit

    val sexp_of_t : ('a -> Sexplib.Sexp.t) -> 'a Stack.t -> Std_internal.Sexp.t

    val t_of_sexp : (Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a t

    val to_array : 'a Stack.t -> 'a array

    val to_list : 'a Stack.t -> 'a list

    val top : 'a Stack.t -> 'a option

    val top_exn : 'a Stack.t -> 'a

    val until_empty : 'a Stack.t -> ('a -> unit) -> unit

    val min_elt : 'a Stack.t -> cmp:('a -> 'a -> int) -> 'a option

    val max_elt : 'a Stack.t -> cmp:('a -> 'a -> int) -> 'a option