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/.
26 (* AUTOR: Ferruccio Guidi <fguidi@cs.unibo.it>
36 raise (Failure ("MQIProperty: feature not supported: " ^ s))
38 (* debugging ***************************************************************)
41 let rec pg_record = function
42 | [] -> prerr_newline ()
43 | head :: tail -> prerr_string (head ^ " "); pg_record tail
48 let c_print (b, p, v) =
49 prerr_string (if b then "match " else "in ");
50 List.iter (fun x -> prerr_string ("/" ^ x)) p;
52 List.iter prerr_endline v
56 (* Common functions ********************************************************)
58 let pg_result subj el res =
59 let get_name = function (p, None) -> p | (_, Some p) -> p in
60 let names = List.map get_name el in
61 let mk_grp l = U.grp_iter2 I.grp_make names l in
63 if subj = "" then I.make "" (mk_grp l)
64 else I.make (List.hd l) (mk_grp (List.tl l))
68 let get_table h mc ct cfl el =
69 let aux_c ts (_, p, _) = A.refine_tables ts (C.tables h p) in
70 let aux_e ts (p, _) = A.refine_tables ts (C.tables h p) in
71 let fst = C.tables h mc in
72 let snd = List.fold_left aux_c fst (ct @ (List.concat cfl)) in
73 let trd = List.fold_left aux_e snd el in
76 let exec_single h mc ct cfl el table =
77 let conv p = C.field h p table in
78 let first = conv mc in
79 let mk_con l = List.map (fun (pat, p, v) -> (pat, conv p, v)) l in
80 let cons_true = mk_con ct in
81 let cons_false = List.map mk_con cfl in
82 let other_cols = List.map (fun (p, _) -> conv p) el in
83 let cols = if first = "" then other_cols else first :: other_cols in
84 let result, q = C.exec h (C.resolve h table) cols cons_true cons_false in
85 if C.set h C.Queries then C.log h (q ^ "\n");
86 pg_result first el result
90 let exec h refine mc ct cfl el =
91 if refine <> M.RefineExact then not_supported "exec";
92 let table = get_table h mc ct cfl el in
93 let rec exec_aux ct = match ct with
94 | (pat, p, v) :: tail when U.count v > deadline ->
95 let single a s _ = I.union a (exec_aux ((pat, p, I.make s I.grp_empty) :: tail)) in
96 I.iter single U.val_false v
98 exec_single h mc ct cfl el table