`sig
module Elt :
sig
type 'a t
val value : 'a Doubly_linked.Elt.t -> 'a
val equal : 'a Doubly_linked.Elt.t -> 'a Doubly_linked.Elt.t -> bool
val sexp_of_t :
('a -> Sexplib.Sexp.t) -> 'a Doubly_linked.Elt.t -> Sexplib.Sexp.t
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 Doubly_linked.t -> unit
val create : unit -> 'a Doubly_linked.t
val of_list : 'a list -> 'a Doubly_linked.t
val equal : 'a Doubly_linked.t -> 'a Doubly_linked.t -> bool
val is_first : 'a Doubly_linked.t -> 'a Doubly_linked.Elt.t -> bool
val is_last : 'a Doubly_linked.t -> 'a Doubly_linked.Elt.t -> bool
val first_elt : 'a Doubly_linked.t -> 'a Doubly_linked.Elt.t option
val last_elt : 'a Doubly_linked.t -> 'a Doubly_linked.Elt.t option
val first : 'a Doubly_linked.t -> 'a option
val last : 'a Doubly_linked.t -> 'a option
val next :
'a Doubly_linked.t ->
'a Doubly_linked.Elt.t -> 'a Doubly_linked.Elt.t option
val prev :
'a Doubly_linked.t ->
'a Doubly_linked.Elt.t -> 'a Doubly_linked.Elt.t option
val insert_before :
'a Doubly_linked.t ->
'a Doubly_linked.Elt.t -> 'a -> 'a Doubly_linked.Elt.t
val insert_after :
'a Doubly_linked.t ->
'a Doubly_linked.Elt.t -> 'a -> 'a Doubly_linked.Elt.t
val insert_first : 'a Doubly_linked.t -> 'a -> 'a Doubly_linked.Elt.t
val insert_last : 'a Doubly_linked.t -> 'a -> 'a Doubly_linked.Elt.t
val move_to_front : 'a Doubly_linked.t -> 'a Doubly_linked.Elt.t -> unit
val move_to_back : 'a Doubly_linked.t -> 'a Doubly_linked.Elt.t -> unit
val move_after :
'a Doubly_linked.t ->
'a Doubly_linked.Elt.t -> anchor:'a Doubly_linked.Elt.t -> unit
val move_before :
'a Doubly_linked.t ->
'a Doubly_linked.Elt.t -> anchor:'a Doubly_linked.Elt.t -> unit
val remove : 'a Doubly_linked.t -> 'a Doubly_linked.Elt.t -> unit
val remove_first : 'a Doubly_linked.t -> 'a option
val remove_last : 'a Doubly_linked.t -> 'a option
val fold_elt :
'a Doubly_linked.t ->
init:'b -> f:('b -> 'a Doubly_linked.Elt.t -> 'b) -> 'b
val iter_elt :
'a Doubly_linked.t -> f:('a Doubly_linked.Elt.t -> unit) -> unit
val fold_right : 'a Doubly_linked.t -> init:'b -> f:('a -> 'b -> 'b) -> 'b
val find_elt :
'a Doubly_linked.t -> f:('a -> bool) -> 'a Doubly_linked.Elt.t option
val clear : 'a Doubly_linked.t -> unit
val copy : 'a Doubly_linked.t -> 'a Doubly_linked.t
val transfer : src:'a Doubly_linked.t -> dst:'a Doubly_linked.t -> unit
val filter_inplace : 'a Doubly_linked.t -> f:('a -> bool) -> unit
val unchecked_iter : 'a Doubly_linked.t -> f:('a -> unit) -> unit
val to_sequence : 'a Doubly_linked.t -> 'a Sequence.t
val t_of_sexp :
(Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a Doubly_linked.t
val sexp_of_t :
('a -> Sexplib.Sexp.t) -> 'a Doubly_linked.t -> Sexplib.Sexp.t
end`