1 (***********************************************************************)
5 (* Kim Nguyen, LRI UMR8623 *)
6 (* Université Paris-Sud & CNRS *)
8 (* Copyright 2010-2012 Université Paris-Sud and Centre National de la *)
9 (* Recherche Scientifique. All rights reserved. This file is *)
10 (* distributed under the terms of the GNU Lesser General Public *)
11 (* License, with the special exception on linking described in file *)
14 (***********************************************************************)
18 type move = [ `Left | `Right ]
21 | Or of 'hcons * 'hcons
22 | And of 'hcons * 'hcons
23 | Atom of (move * bool * State.t)
28 st : StateSet.t * StateSet.t;
29 size: int; (* Todo check if this is needed *)
32 external hash_const_variant : [> ] -> int = "%identity"
33 external vb : bool -> int = "%identity"
35 module rec Node : Hcons.S
36 with type data = Data.t = Hcons.Make (Data)
37 and Data : Hashtbl.HashedType with type t = Node.t node =
40 let equal x y = x.size == y.size &&
41 match x.pos, y.pos with
42 | a,b when a == b -> true
43 | Or(xf1, xf2), Or(yf1, yf2)
44 | And(xf1, xf2), And(yf1,yf2) -> (xf1 == yf1) && (xf2 == yf2)
45 | Atom(d1, p1, s1), Atom(d2 ,p2 ,s2) -> d1 == d2 && p1 == p2 && s1 == s2
53 HASHINT3 (PRIME1, Uid.to_int f1.Node.id, Uid.to_int f2.Node.id)
55 HASHINT3(PRIME3, Uid.to_int f1.Node.id, Uid.to_int f2.Node.id)
57 | Atom(d, p, s) -> HASHINT4(PRIME5, hash_const_variant d,vb p,s)
61 let hash x = x.Node.key
63 let equal = Node.equal
64 let expr f = f.Node.node.pos
65 let st f = f.Node.node.st
66 let size f = f.Node.node.size
67 let compare f1 f2 = compare f1.Node.id f2.Node.id
75 (* Begin Lucca Hirschi *)
76 let rec eval_form ss f = match expr f with
79 | And(f1,f2) -> eval_form ss f1 && eval_form ss f2
80 | Or(f1,f2) -> eval_form ss f1 || eval_form ss f2
82 let set = match dir with |`Left -> fst ss | `Right -> snd ss in
86 let rec print ?(parent=false) ppf f =
87 if parent then fprintf ppf "(";
88 let _ = match expr f with
89 | True -> fprintf ppf "%s" Pretty.top
90 | False -> fprintf ppf "%s" Pretty.bottom
92 print ~parent:(prio f > prio f1) ppf f1;
93 fprintf ppf " %s " Pretty.wedge;
94 print ~parent:(prio f > prio f2) ppf f2;
97 fprintf ppf " %s " Pretty.vee;
100 let _ = flush_str_formatter() in
101 let fmt = str_formatter in
104 | `Left -> Pretty.down_arrow, Pretty.subscript 1
105 | `Right -> Pretty.down_arrow, Pretty.subscript 2
107 fprintf fmt "%s%s" a_str d_str;
109 let str = flush_str_formatter() in
110 if b then fprintf ppf "%s" str
111 else Pretty.pp_overline ppf str
113 if parent then fprintf ppf ")"
115 let print ppf f = print ~parent:false ppf f
117 let is_true f = (expr f) == True
118 let is_false f = (expr f) == False
121 let cons pos neg s1 s2 size1 size2 =
122 let nnode = Node.make { pos = neg; neg = (Obj.magic 0); st = s2; size = size2 } in
123 let pnode = Node.make { pos = pos; neg = nnode ; st = s1; size = size1 } in
124 (Node.node nnode).neg <- pnode; (* works because the neg field isn't taken into
125 account for hashing ! *)
129 let empty_pair = StateSet.empty, StateSet.empty
130 let true_,false_ = cons True False empty_pair empty_pair 0 0
132 let si = StateSet.singleton s in
133 let ss = match d with
134 | `Left -> si, StateSet.empty
135 | `Right -> StateSet.empty, si
136 in fst (cons (Atom(d,p,s)) (Atom(d,not p,s)) ss ss 1 1)
138 let not_ f = f.Node.node.neg
140 let union_pair (l1,r1) (l2, r2) =
141 StateSet.union l1 l2,
144 let merge_states f1 f2 =
146 union_pair (st f1) (st f2)
148 union_pair (st (not_ f1)) (st (not_ f2))
152 let order f1 f2 = if uid f1 < uid f2 then f2,f1 else f1,f2
155 (* Tautologies: x|x, x|not(x) *)
157 if equal f1 f2 then f1
158 else if equal f1 (not_ f2) then true_
161 else if is_true f1 || is_true f2 then true_
162 else if is_false f1 && is_false f2 then false_
163 else if is_false f1 then f2
164 else if is_false f2 then f1
166 (* commutativity of | *)
168 let f1, f2 = order f1 f2 in
169 let psize = (size f1) + (size f2) in
170 let nsize = (size (not_ f1)) + (size (not_ f2)) in
171 let sp, sn = merge_states f1 f2 in
172 fst (cons (Or(f1,f2)) (And(not_ f1, not_ f2)) sp sn psize nsize)
176 not_ (or_ (not_ f1) (not_ f2))
179 let of_bool = function true -> true_ | false -> false_
182 module Infix = struct
183 let ( +| ) f1 f2 = or_ f1 f2
185 let ( *& ) f1 f2 = and_ f1 f2
187 let ( *+ ) d s = atom_ d true s
188 let ( *- ) d s = atom_ d false s