1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
|
(*
* Copyright (C) 2006-2009 Citrix Systems Inc.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
* by the Free Software Foundation; version 2.1 only. with the special
* exception on linking described in file LICENSE.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*)
type t = { l : int; u : int }
let make l u =
if l <= u then { l = l; u = u } else invalid_arg "Range.make"
let get r = r.l, r.u
let mem i r = r.l <= i && i < r.u
let rec fold_left_aux f accu l u =
if l < u then
fold_left_aux f (f accu l) (l + 1) u
else accu
let fold_left f accu r = fold_left_aux f accu r.l r.u
let rec fold_right_aux f l u accu =
if l < u then
let u = u - 1 in
fold_right_aux f l u (f u accu)
else
accu
let fold_right f r accu = fold_right_aux f r.l r.u accu
let string_of_range r =
"[" ^ string_of_int r.l ^ ", " ^ string_of_int r.u ^ ")"
let to_list r =
fold_right (fun x y -> x :: y) r []
|
