1 (* Copyright (C) 2000, HELM Team.
3 * This file is part of HELM, an Hypertextual, Electronic
4 * Library of Mathematics, developed at the Computer Science
5 * Department, University of Bologna, Italy.
7 * HELM is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version 2
10 * of the License, or (at your option) any later version.
12 * HELM is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with HELM; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
22 * For details, see the HELM World-Wide-Web page,
23 * http://cs.unibo.it/helm/.
30 * implementazione del'interprete MathQL
46 let init connection_param = Dbconn.init connection_param
48 let close () = Dbconn.close ()
50 let check () = Dbconn.pgc ()
52 exception BooleExpTrue
56 let set_stat b = stat := b
58 (* valuta una MathQL.set_exp e ritorna un MathQL.resource_set *)
60 let rec exec_set_exp c = function
61 |MathQL.SVar svar -> List.assoc svar c.svars
62 |MathQL.RVar rvar -> [List.assoc rvar c.rvars]
63 | MathQL.Ref vexp -> List.map (fun s -> (s,[])) (exec_val_exp c vexp)
64 | MathQL.Intersect (sexp1, sexp2) ->
65 let before = Sys.time() in
66 let rs1 = exec_set_exp c sexp1 in
67 let rs2 = exec_set_exp c sexp2 in
68 let res = intersect_ex rs1 rs2 in
69 let after = Sys.time() in
70 let ll1 = string_of_int (List.length rs1) in
71 let ll2 = string_of_int (List.length rs2) in
72 let diff = string_of_float (after -. before) in
74 (print_endline("INTERSECT(" ^ ll1 ^ "," ^ ll2 ^ ") = " ^ string_of_int (List.length res) ^
78 | MathQL.Union (sexp1, sexp2) ->
79 let before = Sys.time () in
80 let res = union_ex (exec_set_exp c sexp1) (exec_set_exp c sexp2) in
81 let after = Sys.time() in
82 let diff = string_of_float (after -. before) in
84 (print_endline ("UNION: " ^ diff ^ "s");
87 | MathQL.LetSVar (svar, sexp1, sexp2) ->
88 let before = Sys.time() in
89 let c1 = upd_svars c ((svar, exec_set_exp c sexp1) :: c.svars) in
90 let res = exec_set_exp c1 sexp2 in
92 (print_string ("LETIN " ^ svar ^ " = " ^ string_of_int (List.length res) ^ ": ");
93 print_endline (string_of_float (Sys.time() -. before) ^ "s");
96 | MathQL.LetVVar (vvar, vexp, sexp) ->
97 let before = Sys.time() in
98 let c1 = upd_vvars c ((vvar, exec_val_exp c vexp) :: c.vvars) in
99 let res = exec_set_exp c1 sexp in
101 (print_string ("LETIN " ^ vvar ^ " = " ^ string_of_int (List.length res) ^ ": ");
102 print_endline (string_of_float (Sys.time() -. before) ^ "s");
105 | MathQL.Relation (rop, path, sexp, attl) ->
106 let before = Sys.time() in
107 let res = relation_ex rop path (exec_set_exp c sexp) attl in
109 (print_string ("RELATION " ^ (List.hd path) ^ " = " ^ string_of_int(List.length res) ^ ": ");
110 print_endline (string_of_float (Sys.time() -. before) ^ "s");
113 | MathQL.Select (rvar, sexp, bexp) ->
114 let before = Sys.time() in
115 let rset = (exec_set_exp c sexp) in
116 let rec select_ex rset =
119 | r::tl -> let c1 = upd_rvars c ((rvar,r)::c.rvars) in
120 if (exec_boole_exp c1 bexp) then r::(select_ex tl)
123 let res = select_ex rset in
125 (print_string ("SELECT " ^ rvar ^ " = " ^ string_of_int (List.length res) ^ ": ");
126 print_endline (string_of_float (Sys.time() -. before) ^ "s");
129 | MathQL.Diff (sexp1, sexp2) -> diff_ex (exec_set_exp c sexp1) (exec_set_exp c sexp2)
132 (* valuta una MathQL.boole_exp e ritorna un boole *)
134 and exec_boole_exp c = function
135 | MathQL.False -> false
136 | MathQL.True -> true
137 | MathQL.Not x -> not (exec_boole_exp c x)
138 | MathQL.And (x, y) -> (exec_boole_exp c x) && (exec_boole_exp c y)
139 | MathQL.Or (x, y) -> (exec_boole_exp c x) || (exec_boole_exp c y)
140 | MathQL.Sub (vexp1, vexp2) -> sub_ex (exec_val_exp c vexp1) (exec_val_exp c vexp2)
141 | MathQL.Meet (vexp1, vexp2) -> meet_ex (exec_val_exp c vexp1) (exec_val_exp c vexp2)
142 | MathQL.Eq (vexp1, vexp2) -> (exec_val_exp c vexp1) = (exec_val_exp c vexp2)
143 | MathQL.Ex l bexp ->
144 if l = [] then (exec_boole_exp c bexp)
146 let latt = List.map (fun uri ->
147 let (r,attl) = List.assoc uri c.rvars in (uri,attl)) l (*latt = l + attributi*)
150 let rec prod c = function
151 [] -> if (exec_boole_exp c bexp) then raise BooleExpTrue
152 | (uri,attl)::tail1 -> let rec sub_prod attl =
154 (*per ogni el. di attl *) [] -> ()
155 (*devo andare in ric. su tail1*) | att::tail2 -> let c1 = upd_groups c ((uri,att)::c.groups) in
156 prod c1 tail1; sub_prod tail2
161 with BooleExpTrue -> true
163 (* valuta una MathQL.val_exp e ritorna un MathQL.value *)
165 and exec_val_exp c = function
166 | MathQL.Const x -> let
167 ol = List.sort compare x in
168 let rec edup = function
171 | s::tl -> if tl <> [] then
172 if s = (List.hd tl) then edup tl
177 | MathQL.Record (rvar, vvar) -> List.assoc vvar (List.assoc rvar c.groups)
179 | MathQL.VVar s -> List.assoc s c.vvars
180 | MathQL.RefOf sexp -> List.map (fun (s,_) -> s) (exec_set_exp c sexp)
185 (* valuta una MathQL.set_exp nel contesto vuoto e ritorna un MathQL.resource_set *)
188 exec_set_exp {svars = []; rvars = []; groups = []; vvars = []} x