package merlin-lib

  1. Overview
  2. Docs
package merlin-lib
Legend:
Library
Module
Module type
Parameter
Class
Class type
include module type of struct include Stdlib.ListLabels 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 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 equal : eq:('a -> 'a -> bool) -> 'a list -> 'a list -> bool
val compare : cmp:('a -> 'a -> int) -> 'a list -> 'a list -> int
val iter : f:('a -> unit) -> 'a list -> unit
val iteri : f:(int -> 'a -> unit) -> 'a list -> unit
val map : f:('a -> 'b) -> 'a list -> 'b list
val mapi : f:(int -> 'a -> 'b) -> 'a list -> 'b list
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 fold_right : f:('a -> 'b -> 'b) -> 'a list -> init:'b -> 'b
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 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 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 to_seq : 'a list -> 'a Stdlib.Seq.t
val of_seq : 'a Stdlib.Seq.t -> 'a list
val init : f:(int -> 'a) -> int -> 'a t
val index : f:('a -> bool) -> 'a t -> int
val find_some : f:('a -> bool) -> 'a list -> 'a option
val rev_scan_left : 'a t -> f:('a -> 'b -> 'a) -> 'b t -> init:'a -> 'a t
val scan_left : f:('a -> 'b -> 'a) -> 'b t -> init:'a -> 'a list
val rev_filter : f:('a -> bool) -> 'a t -> 'a t
val filter_map : f:('a -> 'b option) -> 'a t -> 'b t
val find_map : f:('a -> 'b option) -> 'a t -> 'b
val map_end : f:('a -> 'b) -> 'a t -> 'b t -> 'b t
val concat_map : f:('a -> 'b list) -> 'a list -> 'b list
val replicate : 'a -> int -> 'a t
val remove : ?phys:bool -> 'a -> 'a t -> 'a t
val remove_all : 'a -> 'a t -> 'a t
val same : f:('a -> 'b -> bool) -> 'a t -> 'b t -> bool
val length_lessthan : int -> 'a t -> int option
val filter_dup' : equiv:('a -> 'b) -> 'a list -> 'a list
val filter_dup : 'a list -> 'a list
val merge_cons : f:('a -> 'a -> 'a option) -> 'a t -> 'a t
val take_while : f:('a -> bool) -> 'a t -> 'a t
val drop_while : f:('a -> bool) -> 'a t -> 'a t
val take_n : int -> 'a t -> 'a list
val drop_n : int -> 'a t -> 'a t
val split_n : int -> 'a t -> 'a list * 'a t
val split3 : ('a * 'b * 'c) t -> 'a list * 'b list * 'c list
val unfold : f:('a -> 'a option) -> 'a -> 'a t
val rev_unfold : 'a t -> f:('a -> 'a option) -> 'a -> 'a t
val fold_n_map : f:('a -> 'b -> 'a * 'c) -> init:'a -> 'b t -> 'a * 'c t
module Lazy : sig ... end
val last : 'a t -> 'a option
val group_by : ('a -> 'a -> bool) -> 'a t -> 'a t list
val merge : cmp:('a -> 'a -> int) -> 'a t -> 'a t -> 'a t
val dedup_adjacent : cmp:('a -> 'a -> int) -> 'a t -> 'a t
val sort_uniq : cmp:('a -> 'a -> int) -> 'a list -> 'a t
val print : (unit -> 'a -> string) -> unit -> 'a list -> string
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct