2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department, University of Bologna, Italy.
6 ||T|| HELM is free software; you can redistribute it and/or
7 ||A|| modify it under the terms of the GNU General Public License
8 \ / version 2 or (at your option) any later version.
9 \ / This software is distributed as is, NO WARRANTY.
10 V_______________________________________________________________ *)
12 let err _ = assert false
18 let rec list_sub_strict f l1 l2 = match l1, l2 with
20 | _ :: tl1, _ :: tl2 -> list_sub_strict f tl1 tl2
23 let rec list_fold_left f map a = function
26 let f a = list_fold_left f map a tl in
29 let rec list_rev_map_append f map ~tail = function
32 let f hd = list_rev_map_append f map ~tail:(hd :: tail) tl in
35 let rec list_forall2 f map l1 l2 = match l1, l2 with
37 | hd1 :: tl1, hd2 :: tl2 ->
38 let f b = if b then list_forall2 f map tl1 tl2 else f false in
42 let list_rev_append f =
43 list_rev_map_append f (fun f t -> f t)
46 list_rev_map_append ~tail:[]
49 list_rev_append ~tail:[]
51 let list_fold_right f map l a =
52 let map f a m = map f m a in
53 list_rev (list_fold_left f map a) l
56 list_rev_map (list_rev f)
58 let list_iter f map l =
59 let map f () x = map f x in
60 list_fold_left f map () l
62 let rec list_fold_left2 f map a l1 l2 = match l1, l2 with
64 | hd1 :: tl1, hd2 :: tl2 ->
65 let f a = list_fold_left2 f map a tl1 tl2 in
69 let list_iter2 f map l1 l2 =
70 let map f () x1 x2 = map f x1 x2 in
71 list_fold_left2 f map () l1 l2
73 let rec list_mem ?(eq=(=)) a = function
75 | hd :: _ when eq a hd -> true
76 | _ :: tl -> list_mem ~eq a tl