package nonstd

  1. Overview
  2. Docs
Legend:
Library
Module
Module type
Parameter
Class
Class type
type !'a t = 'a list =
  1. | []
  2. | :: of 'a * 'a list
val length : 'a list -> int
val compare_lengths : 'a list -> 'b list -> int
val compare_length_with : 'a list -> len:int -> int
val cons : 'a -> 'a list -> 'a list
val nth_opt : 'a list -> int -> 'a option
val rev : '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 equal : eq:('a -> 'a -> bool) -> 'a list -> 'a list -> bool
val compare : cmp:('a -> 'a -> int) -> 'a list -> 'a list -> int
val rev_map : f:('a -> 'b) -> 'a list -> 'b list
val fold_left_map : f:('a -> 'b -> 'a * 'c) -> init:'a -> 'b list -> 'a * 'c list
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_all2 : f:('a -> 'b -> bool) -> 'a list -> 'b list -> bool
val exists2 : f:('a -> 'b -> bool) -> 'a list -> 'b list -> bool
val mem : 'a -> set:'a list -> bool
val memq : 'a -> set:'a list -> bool
val find_opt : f:('a -> bool) -> 'a list -> 'a option
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 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 -> 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 sort_uniq : cmp:('a -> 'a -> int) -> 'a list -> 'a list
val to_seq : 'a list -> 'a Seq.t
val of_seq : 'a Seq.t -> 'a list
val hd_exn : 'a list -> 'a
val hd : 'a t -> 'a option
val tl_exn : 'a list -> 'a list
val tl : 'a t -> 'a list option
val nth : 'a t -> int -> 'a option
val nth_exn : 'a t -> int -> 'a
val rev_filter : 'a t -> f:('a -> bool) -> 'a t
val filter : 'a t -> f:('a -> bool) -> 'a list
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val find : 'a t -> f:('a -> bool) -> 'a option
val find_exn : ((f:'a -> 'b) -> bool) -> f:'a -> (f:'a -> 'b) list -> 'b
val findi : 'a t -> f:(int -> 'a -> bool) -> (int * 'a) option
val exists : 'a list -> f:('a -> bool) -> bool
val for_all : 'a list -> f:('a -> bool) -> bool
val iter : 'a list -> f:('a -> unit) -> unit
val fold : 'a list -> init:'b -> f:('b -> 'a -> 'b) -> 'b
val fold_left : 'a list -> init:'b -> f:('b -> 'a -> 'b) -> 'b
val to_array : 'a list -> 'a array
val to_list : 'a -> 'a
val slow_append : 'a list -> 'a list -> 'a list
val count_append : 'a t -> 'a t -> int -> 'a t
val append : 'a t -> 'a t -> 'a t
val map_slow : 'a list -> f:('a -> 'b) -> 'b list
val count_map : f:('a -> 'b) -> 'a t -> int -> 'b t
val map : 'a t -> f:('a -> 'b) -> 'b t
val fold_right : 'a list -> f:('a -> 'b -> 'b) -> init:'b -> 'b
val rev_mapi : 'a t -> f:(int -> 'a -> 'b) -> 'b t
val mapi : 'a t -> f:(int -> 'a -> 'b) -> 'b list
val iteri : 'a list -> f:(int -> 'a -> 'b) -> unit
val foldi : 'a list -> f:(int -> 'b -> 'a -> 'b) -> init:'b -> 'b
val filteri : 'a list -> f:(int -> 'a -> bool) -> 'a list
val reduce : 'a t -> f:('a -> 'a -> 'a) -> 'a option
val concat_map : 'a t -> f:('a -> 'b list) -> 'b list
val concat_mapi : 'a t -> f:(int -> 'a -> 'b list) -> 'b list
val merge : 'a t -> 'a t -> cmp:('a -> 'a -> int) -> 'a list
val last : 'a t -> 'a option
val remove_consecutive_duplicates : 'a t -> equal:('a -> 'a -> bool) -> 'a list
val dedup : ?compare:('a -> 'a -> int) -> 'a list -> 'a list
val contains_dup : ?compare:('a -> 'a -> int) -> 'a list -> bool
val find_a_dup : ?compare:('a -> 'a -> int) -> 'a list -> 'a option
val init : int -> f:(int -> 'a) -> 'a t
val rev_filter_map : 'a t -> f:('a -> 'b option) -> 'b t
val filter_map : 'a t -> f:('a -> 'b option) -> 'b list
val filter_opt : 'a option t -> 'a list
val partition_map : 'a t -> f:('a -> [< `Fst of 'b | `Snd of 'c ]) -> 'b list * 'c list
val split_n : 'a t -> int -> 'a t * 'a t
val take : 'a t -> int -> 'a t
val drop : 'a t -> int -> 'a t
val split_while : 'a t -> f:('a -> bool) -> 'a list * 'a t
val take_while : 'a t -> f:('a -> bool) -> 'a list
val drop_while : 'a t -> f:('a -> bool) -> 'a t
OCaml

Innovation. Community. Security.