package ppxlib

  1. Overview
  2. Docs
Legend:
Library
Module
Module type
Parameter
Class
Class type
include module type of struct include Caml.StdLabels.List end
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 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 rev_append : 'a list -> 'a 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 iteri : f:(int -> 'a -> unit) -> 'a list -> unit
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 fold_left : f:('a -> 'b -> 'a) -> init:'a -> 'b list -> 'a
val iter2 : f:('a -> 'b -> unit) -> 'a list -> 'b list -> unit
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 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 mem : 'a -> set:'a list -> bool
val memq : 'a -> set:'a list -> bool
val find : f:('a -> bool) -> 'a list -> 'a
val find_opt : f:('a -> bool) -> 'a list -> 'a option
val filter : f:('a -> bool) -> 'a list -> 'a list
val find_all : f:('a -> bool) -> 'a list -> 'a list
val filteri : f:(int -> 'a -> bool) -> 'a list -> 'a list
val partition : f:('a -> bool) -> 'a list -> 'a list * 'a list
val partition_map : f:('a -> ('b, 'c) Stdlib.Either.t) -> 'a list -> 'b list * 'c list
val assoc : 'a -> ('a * 'b) list -> 'b
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 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 Stdlib.Seq.t
val of_seq : 'a Stdlib.Seq.t -> 'a list
include sig ... end
val merge : [> `not_tail_recursive ]
val remove_assoc : [> `not_tail_recursive ]
val remove_assq : [> `not_tail_recursive ]
val rev_mapi : 'a t -> f:(int -> 'a -> 'b) -> 'b t
val fold_right2 : 'a list -> 'b list -> init:'c -> f:('d -> 'e -> 'f -> 'g) -> 'h
val map : 'a list -> f:('a -> 'b) -> 'c list
val mapi : 'a t -> f:(int -> 'a -> 'b) -> 'c list
val fold_right : 'a list -> init:'b -> f:('c -> 'd -> 'e) -> 'f
val append : 'a list -> 'b list -> 'b list
val concat : 'a list list -> 'b t
val rev_combine : 'a list -> 'b list -> ('c * 'd) t
val combine : 'a list -> 'b list -> ('a * 'b) list
val split : ('a * 'b) list -> 'c t * 'd t
val map2 : 'a list -> 'b list -> f:('c -> 'd -> 'e) -> 'f list
val init : len:int -> f:(int -> 'a) -> 'a list
val is_empty : 'a t -> bool
val rev_filter_opt : 'a option list -> 'b t
val filter_opt : 'a option list -> 'b list
val filter_map : 'a list -> f:('a -> 'b option) -> 'b t
val concat_map : 'a list -> f:('a -> 'b list) -> 'b t
val find_map : 'a t -> f:('b -> 'c option) -> 'd option
val find_map_exn : 'a t -> f:('a -> 'b option) -> 'c
val last : 'a t -> 'b option
val split_while : 'a t -> f:('a -> bool) -> 'a list * 'a t
val find_a_dup : 'elt t -> compare:('elt0 -> 'elt0 -> int) -> 'elt option
val assoc_opt : 'a -> ('b * 'c) list -> 'd option
val iter : 'a list -> f:('a -> unit) -> unit
OCaml

Innovation. Community. Security.