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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
let gcd = Int.gcd
let (%.) = Int.gcd
type 'a range = {
offset: int ;
length: int ;
data: 'a ;
}
let pp_range fmt r =
Format.fprintf fmt "%04d..%04d" r.offset (r.offset + r.length - 1)
let pp_offset fmt r =
Format.fprintf fmt "%04d:%04d" r.offset r.length
type 'a t = R of 'a range list
let empty = R []
let singleton r =
if not (0 <= r.offset && 0 < r.length) then
raise (Invalid_argument "Region.Ranges.singleton") ;
R [r]
let range ?(offset=0) ?(length=1) data = singleton { offset ; length ; data }
let rec find (k: int) = function
| [] -> raise Not_found
| ({ offset ; length } as r) :: rs ->
if offset <= k && k < offset + length then r else find k rs
let find k (R rs) = find k rs
let rec merge f ra rb =
match ra, rb with
| [], rs | rs, [] -> rs
| a :: wa, b :: wb ->
let a' = a.offset + a.length in
let b' = b.offset + b.length in
if a' <= b.offset then a :: merge f wa rb else
if b' <= a.offset then b :: merge f ra wb else
let offset = min a.offset b.offset in
let length = max a' b' - offset in
let data = f a b in
let r = { offset ; length ; data } in
if a' < b' then merge f wa (r::wb) else
if b' < a' then merge f (r::wa) wb else
r :: merge f wa wb
let merge f (R x) (R y) = R (merge f x y)
let iteri f (R xs) = List.iter f xs
let foldi f w (R xs) = List.fold_left f w xs
let iter f (R xs) = List.iter (fun r -> f r.data) xs
let fold f w (R xs) = List.fold_left (fun w r -> f w r.data) w xs
let mapi f (R xs) = R (List.map f xs)
let map f (R xs) = R (List.map (fun r -> { r with data = f r.data }) xs)