let f hd = list_rev_map_append f map ~tail:(hd :: tail) tl in
map f hd
+let rec list_forall2 f map l1 l2 = match l1, l2 with
+ | [], [] -> f true
+ | hd1 :: tl1, hd2 :: tl2 ->
+ let f b = if b then list_forall2 f map tl1 tl2 else f false in
+ map f hd1 hd2
+ | _ -> f false
+
let list_rev_append f =
list_rev_map_append f (fun f t -> f t)
let list_rev =
list_rev_append ~tail:[]
+let list_fold_right f map l a =
+ let map f a m = map f m a in
+ list_rev (list_fold_left f map a) l
+
let list_map f =
list_rev_map (list_rev f)
+let list_iter f map l =
+ let map f () x = map f x in
+ list_fold_left f map () l
+
+let rec list_fold_left2 f map a l1 l2 = match l1, l2 with
+ | [], [] -> f a
+ | hd1 :: tl1, hd2 :: tl2 ->
+ let f a = list_fold_left2 f map a tl1 tl2 in
+ map f a hd1 hd2
+ | _ -> assert false
+
+let rec list_mem ?(eq=(=)) a = function
+ | [] -> false
+ | hd :: _ when eq a hd -> true
+ | _ :: tl -> list_mem ~eq a tl