Module Goblint_lib.GobList

val combine_short : 'a list -> 'b list -> ('a * 'b) list

The normal haskell zip that throws no exception

val assoc_eq_opt : ('a -> 'a -> bool) -> 'a -> ('a * 'b) list -> 'b option
val fold_left3 : ('a -> 'b -> 'c -> 'd -> 'a) -> 'a -> 'b list -> 'c list -> 'd list -> 'a
val for_all3 : ('a -> 'b -> 'c -> bool) -> 'a list -> 'b list -> 'c list -> bool
val fold_while_some : ('a -> 'b -> 'a option) -> 'a -> 'b list -> 'a option
val equal : 'a BatOrd.eq -> 'a list BatOrd.eq
val until_last_with : ('a -> bool) -> 'a list -> 'a list * 'a list

Given a predicate and a list, returns two lists (l1, l2). l1 contains the prefix of the list until the last element that satisfies the predicate, l2 contains all subsequent elements. The order of elements is preserved.

module Syntax : sig ... end

Open this to use applicative functor/monad syntax for list.