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 : ('a -> unit) -> 'a list -> unit
val rev_map : ('a -> 'b) -> 'a list -> 'b list
val fold_left : ('a -> 'b -> 'a) -> 'a -> 'b list -> 'a
val iter2 : ('a -> 'b -> unit) -> 'a list -> 'b list -> unit
val map2 : ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list
val rev_map2 : ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list
val fold_left2 : ('a -> 'b -> 'c -> 'a) -> 'a -> 'b list -> 'c list -> 'a
val fold_right2 : ('a -> 'b -> 'c -> 'c) -> 'a list -> 'b list -> 'c -> 'c
val for_all : ('a -> bool) -> 'a list -> bool
val exists : ('a -> bool) -> 'a list -> bool
val for_all2 : ('a -> 'b -> bool) -> 'a list -> 'b list -> bool
val exists2 : ('a -> 'b -> bool) -> 'a list -> 'b list -> bool
val memq : 'a -> 'a list -> bool
val find : ('a -> bool) -> 'a list -> 'a
val find_all : ('a -> bool) -> 'a list -> 'a list
val partition : ('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 -> ('a * 'b) list -> bool
val mem_assq : 'a -> ('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 : ('a -> 'a -> int) -> 'a list -> 'a list
val stable_sort : ('a -> 'a -> int) -> 'a list -> 'a list
val fast_sort : ('a -> 'a -> int) -> 'a list -> 'a list
val merge : ('a -> 'a -> int) -> 'a list -> 'a list -> 'a list
type 'a t = 'a list
val empty : 'a t
val is_empty : 'a t -> bool
val map : ('a -> 'b) -> 'a t -> 'b t
val ( >|= ) : 'a t -> ('a -> 'b) -> 'b t
val cons : 'a -> 'a t -> 'a t
val append : 'a t -> 'a t -> 'a t
val cons_maybe : 'a option -> 'a t -> 'a t
val ( @ ) : 'a t -> 'a t -> 'a t
val filter : ('a -> bool) -> 'a t -> 'a t
val fold_right : ('a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val fold_while :
('a -> 'b -> 'a * [ `Continue | `Stop ]) -> 'a -> 'b t -> 'a
val fold_map :
('acc -> 'a -> 'acc * 'b) -> 'acc -> 'a list -> 'acc * 'b list
val fold_map2 :
('acc -> 'a -> 'b -> 'acc * 'c) ->
'acc -> 'a list -> 'b list -> 'acc * 'c list
val fold_filter_map :
('acc -> 'a -> 'acc * 'b option) -> 'acc -> 'a list -> 'acc * 'b list
val fold_flat_map :
('acc -> 'a -> 'acc * 'b list) -> 'acc -> 'a list -> 'acc * 'b list
val init : int -> (int -> 'a) -> 'a t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val flat_map : ('a -> 'b t) -> 'a t -> 'b t
val flatten : 'a t t -> 'a t
val product : ('a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t
val fold_product : ('c -> 'a -> 'b -> 'c) -> 'c -> 'a t -> 'b t -> 'c
val diagonal : 'a t -> ('a * 'a) t
val partition_map :
('a -> [< `Drop | `Left of 'b | `Right of 'c ]) ->
'a list -> 'b list * 'c list
val sublists_of_len :
?last:('a list -> 'a list option) ->
?offset:int -> int -> 'a list -> 'a list list
val pure : 'a -> 'a t
val ( <*> ) : ('a -> 'b) t -> 'a t -> 'b t
val ( <$> ) : ('a -> 'b) -> 'a t -> 'b t
val return : 'a -> 'a t
val ( >>= ) : 'a t -> ('a -> 'b t) -> 'b t
val take : int -> 'a t -> 'a t
val drop : int -> 'a t -> 'a t
val hd_tl : 'a t -> 'a * 'a t
val take_drop : int -> 'a t -> 'a t * 'a t
val take_while : ('a -> bool) -> 'a t -> 'a t
val drop_while : ('a -> bool) -> 'a t -> 'a t
val last : int -> 'a t -> 'a t
val head_opt : 'a t -> 'a option
val last_opt : 'a t -> 'a option
val find_pred : ('a -> bool) -> 'a t -> 'a option
val find_pred_exn : ('a -> bool) -> 'a t -> 'a
val find_map : ('a -> 'b option) -> 'a t -> 'b option
val find_mapi : (int -> 'a -> 'b option) -> 'a t -> 'b option
val find_idx : ('a -> bool) -> 'a t -> (int * 'a) option
val remove : ?eq:('a -> 'a -> bool) -> x:'a -> 'a t -> 'a t
val filter_map : ('a -> 'b option) -> 'a t -> 'b 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 : (int -> 'a -> 'b) -> 'a t -> 'b t
val iteri : (int -> 'a -> unit) -> 'a t -> unit
val foldi : ('b -> int -> 'a -> 'b) -> 'b -> 'a t -> 'b
val get_at_idx : int -> 'a t -> 'a option
val get_at_idx_exn : int -> 'a t -> 'a
val set_at_idx : int -> 'a -> 'a t -> 'a t
val insert_at_idx : int -> 'a -> 'a t -> 'a t
val remove_at_idx : int -> 'a t -> 'a t
val add_nodup : ?eq:('a -> 'a -> bool) -> 'a -> 'a t -> 'a t
val remove_one : ?eq:('a -> 'a -> bool) -> 'a -> 'a t -> 'a t
val mem : ?eq:('a -> 'a -> bool) -> 'a -> 'a t -> bool
val subset : ?eq:('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val uniq : ?eq:('a -> 'a -> bool) -> 'a t -> 'a t
val union : ?eq:('a -> 'a -> bool) -> 'a t -> 'a t -> 'a t
val inter : ?eq:('a -> 'a -> bool) -> 'a t -> 'a t -> 'a t
val range_by : step:int -> int -> int -> int t
val range : int -> int -> int t
val range' : int -> int -> int t
val ( -- ) : int -> int -> int t
val ( --^ ) : int -> int -> int t
val replicate : int -> 'a -> 'a t
val repeat : int -> 'a t -> 'a t
module Assoc = CCList.Assoc
module Ref = CCList.Ref
module type MONAD =
sig
type 'a t
val return : 'a -> 'a t
val ( >>= ) : 'a t -> ('a -> 'b t) -> 'b t
end
module Traverse = CCList.Traverse
type 'a sequence = ('a -> unit) -> unit
type 'a gen = unit -> 'a option
type 'a klist = unit -> [ `Cons of 'a * 'a klist | `Nil ]
type 'a printer = Format.formatter -> 'a -> unit
type 'a random_gen = Random.State.t -> 'a
val random : 'a random_gen -> 'a t random_gen
val random_non_empty : 'a random_gen -> 'a t random_gen
val random_len : int -> 'a random_gen -> 'a t random_gen
val random_choose : 'a t -> 'a random_gen
val random_sequence : 'a random_gen t -> 'a t random_gen
val to_seq : 'a t -> 'a sequence
val of_seq : 'a sequence -> 'a t
val to_gen : 'a t -> 'a gen
val of_gen : 'a gen -> 'a t
val to_klist : 'a t -> 'a klist
val of_klist : 'a klist -> 'a t
module Infix = CCList.Infix
val pp :
?start:string ->
?stop:string -> ?sep:string -> 'a printer -> 'a t printer
end