rev_itlist : ('a -> 'b -> 'b) -> 'a list -> 'b -> 'b
- SYNOPSIS
-
Applies a binary function between adjacent elements of the reverse of a list.
- DESCRIPTION
-
rev_itlist f [x1;...;xn] y returns f xn ( ... (f x2 (f x1 y))...).
It returns y if the list is empty.
- FAILURE CONDITIONS
-
Never fails.
- EXAMPLE
-
# rev_itlist (fun x y -> x * y) [1;2;3;4] 1;;
val it : int = 24
- SEE ALSO
-
itlist, end_itlist.