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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
|
(***********************************************************************)
(* *)
(* FaCiLe *)
(* A Functional Constraint Library *)
(* *)
(* Nicolas Barnier, Pascal Brisset, LOG, CENA *)
(* *)
(* Copyright 2004 CENA. All rights reserved. This file is distributed *)
(* under the terms of the GNU Lesser General Public License. *)
(***********************************************************************)
(* $Id: fcl_setDomain.ml,v 1.1 2004/08/09 14:40:01 barnier Exp $ *)
(* Renaming of Fcl_domain *)
module S = struct
include Fcl_domain
let subset = included
let cardinal = size
let choose = min
let max_elt = max
let min_elt = min
let elements = values
let equal x y = x = y
let inter = intersection
let singleton x = create [x]
end
type elt = S.t
type t = { glb : elt; lub : elt}
let empty = {glb = S.empty; lub = S.empty}
let unsafe_interval glb lub =
assert(S.subset glb lub);
{ glb = glb; lub = lub }
let interval glb lub =
if not (S.subset glb lub) then invalid_arg "SetDomain.interval: min > max";
{ glb = glb; lub = lub }
let elt_of_list l =
List.fold_right S.add l S.empty
let size d =
S.cardinal d.lub - S.cardinal d.glb + 1
let min s = s.glb
let max s = s.lub
let min_max d = (min d, max d)
let mem s d = S.subset d.glb s && S.subset s d.lub
let included d1 d2 = S.subset d2.glb d1.glb && S.subset d1.lub d2.lub
(* EXPONENTIAL *)
let iter f d =
let diff = S.diff d.lub d.glb in
let rec loop current possibles =
if S.is_empty possibles then
f current
else
let x = S.choose possibles in
let rest = S.remove x possibles in
loop (S.add x current) rest;
loop current rest in
loop d.glb diff
(* EXPONENTIAL *)
let values d =
let l = ref [] in
iter (fun x -> l := x :: !l) d;
!l
open Printf
let fprint_elt c s =
fprintf c "{ ";
S.iter (fun i -> fprintf c "%d " i) s;
fprintf c "}"
let fprint c d =
fprint_elt c d.glb;
fprintf c "..";
fprint_elt c d.lub
let intersection = S.inter
let strictly_inf a b = S.cardinal a < S.cardinal b
let compare_elt = S.compare
let remove_low x d =
if S.subset x d.glb then d else
if S.subset d.lub x then empty else
if S.subset x d.lub then {glb = x; lub = d.lub}
else Fcl_debug.fatal_error "Setdomain.remove_low"
let remove_up x d =
if S.subset d.lub x then d else
if S.subset x d.glb then empty else
if S.subset d.glb x then {glb = d.glb; lub = x}
else Fcl_debug.fatal_error "Setdomain.remove_up"
|
