sig
val length : 'a list -> int
val hd : 'a list -> 'a
val tl : 'a list -> 'a list
val nth : 'a list -> int -> 'a
val rev : 'a list -> 'a list
val rev_append : 'a list -> 'a list -> 'a list
val concat : 'a list list -> 'a list
val iter : f:('a -> unit) -> 'a list -> unit
val rev_map : f:('a -> 'b) -> 'a list -> 'b list
val fold_left : f:('a -> 'b -> 'a) -> init:'a -> 'b list -> 'a
val iter2 : f:('a -> 'b -> unit) -> 'a list -> 'b list -> unit
val map2 : f:('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list
val rev_map2 : f:('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list
val fold_left2 :
f:('a -> 'b -> 'c -> 'a) -> init:'a -> 'b list -> 'c list -> 'a
val fold_right2 :
f:('a -> 'b -> 'c -> 'c) -> 'a list -> 'b list -> init:'c -> 'c
val for_all : f:('a -> bool) -> 'a list -> bool
val exists : f:('a -> bool) -> 'a list -> bool
val for_all2 : f:('a -> 'b -> bool) -> 'a list -> 'b list -> bool
val exists2 : f:('a -> 'b -> bool) -> 'a list -> 'b list -> bool
val memq : 'a -> set:'a list -> bool
val find : f:('a -> bool) -> 'a list -> 'a
val find_all : f:('a -> bool) -> 'a list -> 'a list
val partition : f:('a -> bool) -> 'a list -> 'a list * 'a list
val assoc : 'a -> ('a * 'b) list -> 'b
val assq : 'a -> ('a * 'b) list -> 'b
val mem_assoc : 'a -> map:('a * 'b) list -> bool
val mem_assq : 'a -> map:('a * 'b) list -> bool
val remove_assoc : 'a -> ('a * 'b) list -> ('a * 'b) list
val remove_assq : 'a -> ('a * 'b) list -> ('a * 'b) list
val split : ('a * 'b) list -> 'a list * 'b list
val combine : 'a list -> 'b list -> ('a * 'b) list
val sort : cmp:('a -> 'a -> int) -> 'a list -> 'a list
val stable_sort : cmp:('a -> 'a -> int) -> 'a list -> 'a list
val fast_sort : cmp:('a -> 'a -> int) -> 'a list -> 'a list
val merge : cmp:('a -> 'a -> int) -> 'a list -> 'a list -> 'a list
type 'a t = 'a list
val empty : 'a CCListLabels.t
val is_empty : 'a CCListLabels.t -> bool
val map : f:('a -> 'b) -> 'a CCListLabels.t -> 'b CCListLabels.t
val ( >|= ) : 'a CCListLabels.t -> ('a -> 'b) -> 'b CCListLabels.t
val cons : 'a -> 'a CCListLabels.t -> 'a CCListLabels.t
val append : 'a CCListLabels.t -> 'a CCListLabels.t -> 'a CCListLabels.t
val cons_maybe : 'a option -> 'a CCListLabels.t -> 'a CCListLabels.t
val ( @ ) : 'a CCListLabels.t -> 'a CCListLabels.t -> 'a CCListLabels.t
val filter : f:('a -> bool) -> 'a CCListLabels.t -> 'a CCListLabels.t
val fold_right : ('a -> 'b -> 'b) -> 'a CCListLabels.t -> 'b -> 'b
val fold_while :
f:('a -> 'b -> 'a * [ `Continue | `Stop ]) ->
init:'a -> 'b CCListLabels.t -> 'a
val fold_map :
f:('acc -> 'a -> 'acc * 'b) -> init:'acc -> 'a list -> 'acc * 'b list
val fold_map2 :
f:('acc -> 'a -> 'b -> 'acc * 'c) ->
init:'acc -> 'a list -> 'b list -> 'acc * 'c list
val fold_filter_map :
f:('acc -> 'a -> 'acc * 'b option) ->
init:'acc -> 'a list -> 'acc * 'b list
val fold_flat_map :
f:('acc -> 'a -> 'acc * 'b list) ->
init:'acc -> 'a list -> 'acc * 'b list
val init : int -> f:(int -> 'a) -> 'a CCListLabels.t
val compare :
('a -> 'a -> int) -> 'a CCListLabels.t -> 'a CCListLabels.t -> int
val equal :
('a -> 'a -> bool) -> 'a CCListLabels.t -> 'a CCListLabels.t -> bool
val flat_map :
f:('a -> 'b CCListLabels.t) -> 'a CCListLabels.t -> 'b CCListLabels.t
val flatten : 'a CCListLabels.t CCListLabels.t -> 'a CCListLabels.t
val product :
f:('a -> 'b -> 'c) ->
'a CCListLabels.t -> 'b CCListLabels.t -> 'c CCListLabels.t
val fold_product :
f:('c -> 'a -> 'b -> 'c) ->
init:'c -> 'a CCListLabels.t -> 'b CCListLabels.t -> 'c
val diagonal : 'a CCListLabels.t -> ('a * 'a) CCListLabels.t
val partition_map :
f:('a -> [< `Drop | `Left of 'b | `Right of 'c ]) ->
'a list -> 'b list * 'c list
val pure : 'a -> 'a CCListLabels.t
val ( <*> ) :
('a -> 'b) CCListLabels.t -> 'a CCListLabels.t -> 'b CCListLabels.t
val ( <$> ) : ('a -> 'b) -> 'a CCListLabels.t -> 'b CCListLabels.t
val return : 'a -> 'a CCListLabels.t
val ( >>= ) :
'a CCListLabels.t -> ('a -> 'b CCListLabels.t) -> 'b CCListLabels.t
val take : int -> 'a CCListLabels.t -> 'a CCListLabels.t
val drop : int -> 'a CCListLabels.t -> 'a CCListLabels.t
val hd_tl : 'a CCListLabels.t -> 'a * 'a CCListLabels.t
val take_drop :
int -> 'a CCListLabels.t -> 'a CCListLabels.t * 'a CCListLabels.t
val take_while : f:('a -> bool) -> 'a CCListLabels.t -> 'a CCListLabels.t
val drop_while : f:('a -> bool) -> 'a CCListLabels.t -> 'a CCListLabels.t
val last : int -> 'a CCListLabels.t -> 'a CCListLabels.t
val head_opt : 'a CCListLabels.t -> 'a option
val last_opt : 'a CCListLabels.t -> 'a option
val find_pred : f:('a -> bool) -> 'a CCListLabels.t -> 'a option
val find_pred_exn : f:('a -> bool) -> 'a CCListLabels.t -> 'a
val find_map : f:('a -> 'b option) -> 'a CCListLabels.t -> 'b option
val find_mapi :
f:(int -> 'a -> 'b option) -> 'a CCListLabels.t -> 'b option
val find_idx : f:('a -> bool) -> 'a CCListLabels.t -> (int * 'a) option
val remove :
?eq:('a -> 'a -> bool) ->
key:'a -> 'a CCListLabels.t -> 'a CCListLabels.t
val filter_map :
f:('a -> 'b option) -> 'a CCListLabels.t -> 'b CCListLabels.t
val sorted_merge : ?cmp:('a -> 'a -> int) -> 'a list -> 'a list -> 'a list
val sort_uniq : ?cmp:('a -> 'a -> int) -> 'a list -> 'a list
val sorted_merge_uniq :
?cmp:('a -> 'a -> int) -> 'a list -> 'a list -> 'a list
val is_sorted : ?cmp:('a -> 'a -> int) -> 'a list -> bool
val sorted_insert :
?cmp:('a -> 'a -> int) -> ?uniq:bool -> 'a -> 'a list -> 'a list
val uniq_succ : ?eq:('a -> 'a -> bool) -> 'a list -> 'a list
val group_succ : ?eq:('a -> 'a -> bool) -> 'a list -> 'a list list
val mapi : f:(int -> 'a -> 'b) -> 'a CCListLabels.t -> 'b CCListLabels.t
val iteri : f:(int -> 'a -> unit) -> 'a CCListLabels.t -> unit
val foldi : f:('b -> int -> 'a -> 'b) -> init:'b -> 'a CCListLabels.t -> 'b
val get_at_idx : int -> 'a CCListLabels.t -> 'a option
val get_at_idx_exn : int -> 'a CCListLabels.t -> 'a
val set_at_idx : int -> 'a -> 'a CCListLabels.t -> 'a CCListLabels.t
val insert_at_idx : int -> 'a -> 'a CCListLabels.t -> 'a CCListLabels.t
val remove_at_idx : int -> 'a CCListLabels.t -> 'a CCListLabels.t
val add_nodup :
?eq:('a -> 'a -> bool) -> 'a -> 'a CCListLabels.t -> 'a CCListLabels.t
val remove_one :
?eq:('a -> 'a -> bool) -> 'a -> 'a CCListLabels.t -> 'a CCListLabels.t
val mem : ?eq:('a -> 'a -> bool) -> 'a -> 'a CCListLabels.t -> bool
val subset :
?eq:('a -> 'a -> bool) -> 'a CCListLabels.t -> 'a CCListLabels.t -> bool
val uniq : ?eq:('a -> 'a -> bool) -> 'a CCListLabels.t -> 'a CCListLabels.t
val union :
?eq:('a -> 'a -> bool) ->
'a CCListLabels.t -> 'a CCListLabels.t -> 'a CCListLabels.t
val inter :
?eq:('a -> 'a -> bool) ->
'a CCListLabels.t -> 'a CCListLabels.t -> 'a CCListLabels.t
val range_by : step:int -> int -> int -> int CCListLabels.t
val range : int -> int -> int CCListLabels.t
val range' : int -> int -> int CCListLabels.t
val ( -- ) : int -> int -> int CCListLabels.t
val ( --^ ) : int -> int -> int CCListLabels.t
val replicate : int -> 'a -> 'a CCListLabels.t
val repeat : int -> 'a CCListLabels.t -> 'a CCListLabels.t
module Assoc :
sig
type ('a, 'b) t = ('a * 'b) list
val get :
?eq:('a -> 'a -> bool) ->
'a -> ('a, 'b) CCListLabels.Assoc.t -> 'b option
val get_exn :
?eq:('a -> 'a -> bool) -> 'a -> ('a, 'b) CCListLabels.Assoc.t -> 'b
val set :
?eq:('a -> 'a -> bool) ->
'a ->
'b -> ('a, 'b) CCListLabels.Assoc.t -> ('a, 'b) CCListLabels.Assoc.t
val mem :
?eq:('a -> 'a -> bool) -> 'a -> ('a, 'b) CCListLabels.Assoc.t -> bool
val update :
?eq:('a -> 'a -> bool) ->
f:('b option -> 'b option) ->
'a -> ('a, 'b) CCListLabels.Assoc.t -> ('a, 'b) CCListLabels.Assoc.t
val remove :
?eq:('a -> 'a -> bool) ->
'a -> ('a, 'b) CCListLabels.Assoc.t -> ('a, 'b) CCListLabels.Assoc.t
end
module Ref :
sig
type 'a t = 'a list Pervasives.ref
val push : 'a CCListLabels.Ref.t -> 'a -> unit
val pop : 'a CCListLabels.Ref.t -> 'a option
val pop_exn : 'a CCListLabels.Ref.t -> 'a
val create : unit -> 'a CCListLabels.Ref.t
val clear : 'a CCListLabels.Ref.t -> unit
val lift : ('a list -> 'b) -> 'a CCListLabels.Ref.t -> 'b
val push_list : 'a CCListLabels.Ref.t -> 'a list -> unit
end
module type MONAD =
sig
type 'a t
val return : 'a -> 'a CCListLabels.MONAD.t
val ( >>= ) :
'a CCListLabels.MONAD.t ->
('a -> 'b CCListLabels.MONAD.t) -> 'b CCListLabels.MONAD.t
end
module Traverse :
functor (M : MONAD) ->
sig
val sequence_m : 'a M.t CCListLabels.t -> 'a CCListLabels.t M.t
val fold_m :
f:('b -> 'a -> 'b M.t) -> init:'b -> 'a CCListLabels.t -> 'b M.t
val map_m :
f:('a -> 'b M.t) -> 'a CCListLabels.t -> 'b CCListLabels.t M.t
val map_m_par :
f:('a -> 'b M.t) -> 'a CCListLabels.t -> 'b CCListLabels.t M.t
end
type 'a sequence = ('a -> unit) -> unit
type 'a gen = unit -> 'a option
type 'a klist = unit -> [ `Cons of 'a * 'a CCListLabels.klist | `Nil ]
type 'a printer = Format.formatter -> 'a -> unit
type 'a random_gen = Random.State.t -> 'a
val random :
'a CCListLabels.random_gen -> 'a CCListLabels.t CCListLabels.random_gen
val random_non_empty :
'a CCListLabels.random_gen -> 'a CCListLabels.t CCListLabels.random_gen
val random_len :
int ->
'a CCListLabels.random_gen -> 'a CCListLabels.t CCListLabels.random_gen
val random_choose : 'a CCListLabels.t -> 'a CCListLabels.random_gen
val random_sequence :
'a CCListLabels.random_gen CCListLabels.t ->
'a CCListLabels.t CCListLabels.random_gen
val to_seq : 'a CCListLabels.t -> 'a CCListLabels.sequence
val of_seq : 'a CCListLabels.sequence -> 'a CCListLabels.t
val to_gen : 'a CCListLabels.t -> 'a CCListLabels.gen
val of_gen : 'a CCListLabels.gen -> 'a CCListLabels.t
val to_klist : 'a CCListLabels.t -> 'a CCListLabels.klist
val of_klist : 'a CCListLabels.klist -> 'a CCListLabels.t
module Infix :
sig
val ( >|= ) : 'a CCListLabels.t -> ('a -> 'b) -> 'b CCListLabels.t
val ( @ ) : 'a CCListLabels.t -> 'a CCListLabels.t -> 'a CCListLabels.t
val ( <*> ) :
('a -> 'b) CCListLabels.t -> 'a CCListLabels.t -> 'b CCListLabels.t
val ( <$> ) : ('a -> 'b) -> 'a CCListLabels.t -> 'b CCListLabels.t
val ( >>= ) :
'a CCListLabels.t -> ('a -> 'b CCListLabels.t) -> 'b CCListLabels.t
val ( -- ) : int -> int -> int CCListLabels.t
val ( --^ ) : int -> int -> int CCListLabels.t
end
val pp :
?start:string ->
?stop:string ->
?sep:string ->
'a CCListLabels.printer -> 'a CCListLabels.t CCListLabels.printer
end