sig
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 Invariant_intf.inv -> 'a t Invariant_intf.inv
module Arbitrary_order :
sig
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
end
module Front_to_back :
sig
val of_list : 'a list -> 'a Fdeque.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
end
module Back_to_front :
sig
val of_list : 'a list -> 'a Fdeque.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
end
val empty : 'a Fdeque.t
val singleton : 'a -> 'a Fdeque.t
val of_list : 'a list -> 'a Fdeque.t
val rev : 'a Fdeque.t -> 'a Fdeque.t
val enqueue : 'a Fdeque.t -> [ `back | `front ] -> 'a -> 'a Fdeque.t
val enqueue_front : 'a Fdeque.t -> 'a -> 'a Fdeque.t
val enqueue_back : 'a Fdeque.t -> 'a -> 'a Fdeque.t
val peek : 'a Fdeque.t -> [ `back | `front ] -> 'a option
val peek_exn : 'a Fdeque.t -> [ `back | `front ] -> 'a
val peek_front : 'a Fdeque.t -> 'a option
val peek_front_exn : 'a Fdeque.t -> 'a
val peek_back : 'a Fdeque.t -> 'a option
val peek_back_exn : 'a Fdeque.t -> 'a
val drop : 'a Fdeque.t -> [ `back | `front ] -> 'a Fdeque.t option
val drop_exn : 'a Fdeque.t -> [ `back | `front ] -> 'a Fdeque.t
val drop_front : 'a Fdeque.t -> 'a Fdeque.t option
val drop_front_exn : 'a Fdeque.t -> 'a Fdeque.t
val drop_back : 'a Fdeque.t -> 'a Fdeque.t option
val drop_back_exn : 'a Fdeque.t -> 'a Fdeque.t
val dequeue :
'a Fdeque.t -> [ `back | `front ] -> ('a * 'a Fdeque.t) option
val dequeue_exn : 'a Fdeque.t -> [ `back | `front ] -> 'a * 'a Fdeque.t
val dequeue_front : 'a Fdeque.t -> ('a * 'a Fdeque.t) option
val dequeue_front_exn : 'a Fdeque.t -> 'a * 'a Fdeque.t
val dequeue_back : 'a Fdeque.t -> ('a * 'a Fdeque.t) option
val dequeue_back_exn : 'a Fdeque.t -> 'a * 'a Fdeque.t
module Stable :
sig
module V1 :
sig
type 'a t = 'a t
val t_of_sexp :
(Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a Fdeque.t
val sexp_of_t :
('a -> Sexplib.Sexp.t) -> 'a Fdeque.t -> Sexplib.Sexp.t
val compare :
('a -> 'a -> int) -> 'a Fdeque.t -> 'a Fdeque.t -> int
val bin_t :
'a Bin_prot.Type_class.t -> 'a Fdeque.t Bin_prot.Type_class.t
val bin_read_t :
'a Bin_prot.Read.reader -> 'a Fdeque.t Bin_prot.Read.reader
val __bin_read_t__ :
'a Bin_prot.Read.reader ->
(int -> 'a Fdeque.t) Bin_prot.Read.reader
val bin_reader_t :
'a Bin_prot.Type_class.reader ->
'a Fdeque.t Bin_prot.Type_class.reader
val bin_size_t :
'a Bin_prot.Size.sizer -> 'a Fdeque.t Bin_prot.Size.sizer
val bin_write_t :
'a Bin_prot.Write.writer -> 'a Fdeque.t Bin_prot.Write.writer
val bin_writer_t :
'a Bin_prot.Type_class.writer ->
'a Fdeque.t Bin_prot.Type_class.writer
end
end
val t_of_sexp : (Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a Fdeque.t
val sexp_of_t : ('a -> Sexplib.Sexp.t) -> 'a Fdeque.t -> Sexplib.Sexp.t
val compare : ('a -> 'a -> int) -> 'a Fdeque.t -> 'a Fdeque.t -> int
val bin_t : 'a Bin_prot.Type_class.t -> 'a Fdeque.t Bin_prot.Type_class.t
val bin_read_t :
'a Bin_prot.Read.reader -> 'a Fdeque.t Bin_prot.Read.reader
val __bin_read_t__ :
'a Bin_prot.Read.reader -> (int -> 'a Fdeque.t) Bin_prot.Read.reader
val bin_reader_t :
'a Bin_prot.Type_class.reader -> 'a Fdeque.t Bin_prot.Type_class.reader
val bin_size_t : 'a Bin_prot.Size.sizer -> 'a Fdeque.t Bin_prot.Size.sizer
val bin_write_t :
'a Bin_prot.Write.writer -> 'a Fdeque.t Bin_prot.Write.writer
val bin_writer_t :
'a Bin_prot.Type_class.writer -> 'a Fdeque.t Bin_prot.Type_class.writer
end