Module NextList

Next List

include module type of Stdlib.List
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 -> int -> int
val is_empty : 'a list -> bool
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 equal : ('a -> 'a -> bool) -> 'a list -> 'a list -> bool
val compare : ('a -> 'a -> int) -> 'a list -> 'a list -> int
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 filter_map : ('a -> 'b option) -> 'a list -> 'b list
val concat_map : ('a -> 'b list) -> 'a list -> 'b list
val fold_left_map : ('acc -> 'a -> 'acc * 'b) -> 'acc -> 'a list -> 'acc * 'b list
val fold_left : ('acc -> 'a -> 'acc) -> 'acc -> 'a list -> 'acc
val fold_right : ('a -> 'acc -> 'acc) -> 'a list -> 'acc -> 'acc
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 : ('acc -> 'a -> 'b -> 'acc) -> 'acc -> 'a list -> 'b list -> 'acc
val fold_right2 : ('a -> 'b -> 'acc -> 'acc) -> 'a list -> 'b list -> 'acc -> 'acc
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 find_index : ('a -> bool) -> 'a list -> int option
val find_map : ('a -> 'b option) -> 'a list -> 'b option
val find_mapi : (int -> 'a -> 'b option) -> 'a list -> 'b option
val filter : ('a -> bool) -> 'a list -> 'a list
val find_all : ('a -> bool) -> 'a list -> 'a list
val filteri : (int -> 'a -> bool) -> 'a list -> 'a list
val take_while : ('a -> bool) -> 'a list -> 'a list
val drop_while : ('a -> bool) -> 'a list -> 'a list
val partition : ('a -> bool) -> 'a list -> 'a list * 'a list
val partition_map : ('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 -> ('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 to_seq : 'a list -> 'a Stdlib.Seq.t
val of_seq : 'a Stdlib.Seq.t -> 'a list
val union_sorted : ('a -> 'a -> int) -> 'a list -> 'a list -> 'a list

Returns the union of two sorted lists seen as sets. union_sorted cmp l1 l2 is equivalent to sort_uniq cmp (l1 @ l2) except faster.

val inter_sorted : ('a -> 'a -> int) -> 'a list -> 'a list -> 'a list

Returns the intersection of two sorted lists seen as sets. inter_sorted cmp l1 l2 is equivalent to filter (fun x1 -> exists (fun x2 -> cmp x1 x2 = 0) l2) l1 except much faster.

val diff_sorted : ('a -> 'a -> int) -> 'a list -> 'a list -> 'a list

Returns the difference of two sorted lists seen as sets. diff_sorted cmp l1 l2 is equivalent to filter (fun x1 -> not (exists (fun x2 -> cmp x1 x2 = 0) l2)) l1 except much faster.

val symdiff_sorted : ('a -> 'a -> int) -> 'a list -> 'a list -> 'a list

Returns the symmetric difference of two sorted lists seen as sets. symdiff_sorted cmp l1 l2 is equivalent to union_sorted (diff_sorted l1 l2) (diff_sorted l2 l1) except faster.

val hdn : int -> 'a list -> 'a list

hdn n l returns the n first elements of l in a list. If n is bigger than the size of l, returns l.

val bd : 'a list -> 'a list
val ft : 'a list -> 'a
val init_until : (int -> 'a option) -> 'a list

init_until f initialises a list by calling f until it returns None.

val sub : 'a list -> int -> int -> 'a list

sub l pos len is a list of length len, containing the sublist of l that starts at position pos and has length len.

  • raises Invalid_argument

    if pos and len do not designate a valid sublist of l.

val take : int -> 'a list -> 'a list

take n l returns the prefix of l of length n. It is the same as sub l 0 n. For all n between 0 and length l, l = take n l @ drop n l.

  • raises Invalid_argument

    if n is negative or bigger than length l.

val drop : int -> 'a list -> 'a list

drop n l returns the suffix of l after the n first elements. It is the same as sub l n (length l - n). For all n between 0 and length l, l = take n l @ drop n l.

  • raises Invalid_argument

    if n is negative or bigger than length l.

val count : ('a -> bool) -> 'a list -> int

Counts the number of elements in the list that respect the given predicate. This is the same as filter followed by length, but faster.

val singleton : 'a -> 'a list
val update_nth : int -> ('a -> 'a) -> 'a list -> 'a list
val prefix_until_inclusive : ('a -> bool) -> 'a list -> 'a list

Returns the prefix consisting in a bunch of elements not satisfying the given predicate, followed by the first elements satisfying the given predicate, if there is one.