Module `Tjr_list`

include List

val length : 'a list -> int
val compare_lengths : 'a list -> 'b list -> int
val compare_length_with : 'a list -> int -> int
val cons : 'a -> 'a list -> 'a list
val hd : 'a list -> 'a
val tl : 'a list -> 'a list
val nth : 'a list -> int -> 'a
val nth_opt : 'a list -> int -> 'a option
val rev : 'a list -> 'a list
val init : int -> (int -> 'a) -> 'a list
val append : 'a list -> 'a list -> 'a list
val rev_append : 'a list -> 'a list -> 'a list
val concat : 'a list list -> 'a list
val flatten : 'a list list -> 'a list
val iter : ('a -> unit) -> 'a list -> unit
val iteri : (int -> 'a -> unit) -> 'a list -> unit
val map : ('a -> 'b) -> 'a list -> 'b list
val mapi : (int -> 'a -> 'b) -> 'a list -> 'b list
val rev_map : ('a -> 'b) -> 'a list -> 'b list
val fold_left : ('a -> 'b -> 'a) -> 'a -> 'b list -> 'a
val fold_right : ('a -> 'b -> 'b) -> 'a list -> 'b -> 'b
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 mem : 'a -> 'a list -> bool
val memq : 'a -> 'a list -> bool
val find : ('a -> bool) -> 'a list -> 'a
val find_opt : ('a -> bool) -> 'a list -> 'a option
val filter : ('a -> bool) -> 'a list -> 'a list
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 assoc_opt : 'a -> ('a * 'b) list -> 'b option
val assq : 'a -> ('a * 'b) list -> 'b
val assq_opt : 'a -> ('a * 'b) list -> 'b option
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 sort_uniq : ('a -> 'a -> int) -> 'a list -> 'a list
val merge : ('a -> 'a -> int) -> 'a list -> 'a list -> 'a list

val concat_with : ('a -> 'a -> 'a) -> 'a list -> 'a
val last : 'a list -> 'a
val butlast : 'a list -> 'a list
val inc : ('a -> bool) -> 'a list -> 'a list
val exc : ('a -> bool) -> 'a list -> 'a list
val assoc_inv : 'a -> ('b * 'a) list -> 'b
val from_to : int -> int -> int list
val take : int -> 'a list -> 'a list
val drop : int -> 'a list -> 'a list
val split_while : f:('a -> bool) -> 'a list -> 'a list * 'a list
val take_while : f:('a -> bool) -> 'a list -> 'a list
val take_while : f:('a -> bool) -> 'a list -> 'a list
val rev_mapi : 'a list -> f:(int -> 'a -> 'b) -> 'b list
val mapi : 'a list -> f:(int -> 'a -> 'b) -> 'b list
val index : 'a list -> ('a * int) list
val interleave : 'a list -> 'a list -> 'a list
val split_at : int -> 'a list -> 'a list * 'a list
val assoc_list_to_bst : ('a * 'b) list -> 'a -> 'b option
val fold_left_ : step:(state:'a -> 'b -> 'a) -> init_state:'a -> 'b list -> 'a
val with_each_elt' : step:(state:'a -> 'b -> 'a) -> init_state:'a -> 'b list -> 'a
val with_each_elt : list:'a list -> step:(state:'b -> 'a -> 'b) -> init:'b -> 'b

module List_as_set : sig ... end

val unique : 'a list -> 'a list
val prefix : prefix:'a list -> 'a list -> bool
val suffix : suffix:'a list -> 'a list -> bool
val fold_assoc_comm : op:('a -> 'a -> 'a) -> 'a list -> 'a
val max_list : int list -> int
val filter_rev_map : f:('a -> 'b option) -> 'a list -> 'b list: NOTE returns a reversed version of the list

val assoc_list_remdups : ('a * 'b) list -> ('a * 'b) list
val mk_range : min:int -> max:int -> step:int -> int list