package tezos-stdlib

is_empty l returns true iff l = [].

remove nb list remove the first nb elements from the list list.

repeat n x is a list of n x's

shift (hd :: tl) computes tl @ [hd]

product a b computes the Cartesian product of two lists a and b.

take_n n l returns the n first elements of l. When compare is provided, it returns the n greatest element of l.

drop_n n l returns the suffix of l after the first n elements, or if n > length l.

split_n n l is a pair of lists (j, k) where j contains the n first elements of l and k the remainder elements. If l has less than or exactly n elements, j is l and k is [].

select n l is (nth element of l, l without that element)

rev_sub l n is List.rev l capped to max n elements

sub l n is l capped to max n elements

shuffle l is a list that contains the same elements as l but in a random order.

Get the index of an element in a list.

filter_some l returns all Some elements of l

find_map f l applies f to the elements of l in order, and returns the first result of the form Some v, or None if none exist.

Present in OCaml 4.10: this function can be removed once we catch up.

fold_left_i f init l is equivalent to fold_left except that the index of the element is passed as a first argument to f.