Module Binsec.List_utils

is_empty l returns true if l = []

take n l returns up to the n first elements of list l

drop n l removes the n first elements of list l if n is greater than the length of the list, returns . @assumes n >= 0

last l returns the last element of list l. Raise Failure "last" if the list is empty

drop_last l returns list l without its last element. Raise Failure "drop_last" if the list is empty

rev_flatten l reverses and flatten the list of list l at the same time. It is the same as doing List.flatten l |> List.rev but tail-recursive and more efficient. *

flat_map f l is like List.map f l |> List.flatten but tail-recusrive and more efficient

hd_hd l gets the two first elements of a list.

• raises Failure

  "hd_hd" if l is empty or the singleton list

pop l returns the head and tail of the list.contents

• raises Failure

  "pop" if l is empty

make n x returns a list of x of length n. @assumes n >= 0

map_if p f l behaves like map f l but applied only on elements of l verifying p.

Tail recursive.

filter_map p f l behaves like map f l but applied only on elements e of l verifying p (f e).

Tail recursive.

eq_lenght l1 l2 returns true if l1 and l2 have the same length, ** independently of what their cells contain

compare f l1 l2 compares l1 and l2 according to lexicographic order using f as the order on elements.