aux 0 l
;;
+let list_index p =
+ let rec aux n =
+ function
+ [] -> None
+ | he::_ when p he -> Some (n,he)
+ | _::tl -> aux (n + 1) tl
+ in
+ aux 0
+;;
+
let rec list_iter_default2 f l1 def l2 =
match l1,l2 with
| [], _ -> ()
aux []
let rec list_findopt f l =
- let rec aux = function
+ let rec aux k = function
| [] -> None
| x::tl ->
- (match f x with
- | None -> aux tl
+ (match f x k with
+ | None -> aux (succ k) tl
| Some _ as rc -> rc)
in
- aux l
+ aux 0 l
let split_nth n l =
let rec aux acc n l =