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 (******************************************************************************)
30 (* Ferruccio Guidi <fguidi@cs.unibo.it> *)
34 (******************************************************************************)
36 (* Query issuing functions **************************************************)
41 type position = string
42 type depth = int option
45 type r_obj = (uri * position * depth)
46 type r_rel = (position* depth)
47 type r_sort = (position* depth * sort)
49 type must_restrictions = (r_obj list * r_rel list * r_sort list)
50 type only_restrictions =
51 (r_obj list option * r_rel list option * r_sort list option)
61 let confirm_query = ref (fun _ -> true)
68 let set_confirm_query f =
71 let get_query_info () = ! info
73 let execute_query query =
74 let module Util = MQueryUtil in
75 let mode = [Open_wronly; Open_append; Open_creat; Open_text] in
76 let perm = 64 * 6 + 8 * 6 + 4 in
78 let lt = Unix.localtime (Unix.time ()) in
80 string_of_int (lt.Unix.tm_mon + 1) ^ "-" ^
81 string_of_int (lt.Unix.tm_mday + 1) ^ "-" ^
82 string_of_int (lt.Unix.tm_year + 1900) ^ " " ^
83 string_of_int (lt.Unix.tm_hour) ^ ":" ^
84 string_of_int (lt.Unix.tm_min) ^ ":" ^
85 string_of_int (lt.Unix.tm_sec)
88 let och = open_out_gen mode perm ! log_file in
89 let out = output_string och in
90 if ! query_num = 1 then out (time () ^ nl);
91 out ("Query: " ^ string_of_int ! query_num ^ nl); Util.text_of_query out q nl;
92 out ("Result:" ^ nl); Util.text_of_result out r nl;
96 let r = Mqint.execute q in
97 if ! log_file <> "" then log q r;
98 info := string_of_int ! query_num :: ! info;
102 if ! confirm_query query then execute query else raise Discard
104 (* Query building functions ************************************************)
107 let module M = MathQL in
109 M.Ref (M.Property true M.RefineExact ("objectName", []) (M.Const [s]))
113 let searchPattern must_use can_use =
114 let module M = MathQL in
115 let in_path s = (s, []) in
116 let assign v p = (in_path v, in_path p) in
118 (* can restrictions *)
120 let (cr_o,cr_r,cr_s) = can_use in
122 let uri_of_entry (r, p, d) = r in
127 | Some cr_o -> List.map uri_of_entry cr_o
130 let tfst (a,b,c) = a in
131 let tsnd (a,b,c) = b in
132 let trd (a,b,c) = c in
134 let to_int_list l d =
143 | Some cr_o -> (List.map tsnd cr_o) in
148 | Some cr_o -> List.map trd cr_o
149 (* let odep_option_list = List.map trd cr_o in
150 let lo_dep_int = List.fold_left to_int_list [] odep_option_list in
151 List.map string_of_int lo_dep_int*)
153 print_string "#### LUNGHEZZA ODEP: "; print_int (List.length odep); flush stdout;
158 | Some cr_r -> (List.map fst cr_r) in
163 | Some cr_r -> List.map snd cr_r
164 (* let rdep_option_list = List.map snd cr_r in
165 let lr_dep_int = List.fold_left to_int_list [] rdep_option_list in
166 List.map string_of_int lr_dep_int *)
173 | Some cr_s -> (List.map tfst cr_s) in
179 | Some cr_s -> List.map tsnd cr_s
180 (* let sdep_option_list = List.map tsnd cr_s in
181 let ls_dep_int = List.fold_left to_int_list [] sdep_option_list in
182 List.map string_of_int ls_dep_int*)
189 | Some cr_s -> List.map trd cr_s in
191 (* let q_where_obj = function
198 M.Relation (false, M.RefineExact, in_path "refObj", M.Ref (M.RefOf (M.RVar "uri0")), [assign "pos" "position"]),
200 (M.Meet (M.VVar "obj_positions", M.Record ("uri", in_path "pos"))))),
208 (false, M.RefineExact, in_path "refObj",
209 M.Ref (M.RefOf (M.RVar "uri0")),
210 [assign "p" "position"; assign "d" "depth"]
214 ((M.Meet(M.VVar "obj_positions",M.Record("uri",in_path "p"))),
215 (M.Meet(M.VVar "obj_depths", M.Record("uri",in_path "d")))))
226 let q_where_obj n = function
228 let rec q_ex n = function
231 M.Meet (M.VVar ("obj_position" ^ string_of_int n), M.Record ("uri", in_path "p"))
234 print_string "@@@@@ IN-WHERE-OBJ"; flush stdout;
237 (M.Meet(M.VVar ("obj_position" ^ string_of_int n),M.Record("uri",in_path "p")),
238 M.Meet(M.VVar ("obj_depth" ^ string_of_int n), M.Record("uri",in_path "d")))
241 (M.Meet (M.VVar ("obj_position" ^ string_of_int n), M.Record ("uri", in_path "p")),
244 print_string "@@@@@ IN-WHERE-OBJ"; flush stdout;
248 ((M.Meet(M.VVar ("obj_position" ^ string_of_int n),M.Record("uri",in_path "p"))),
249 (M.Meet(M.VVar ("obj_depth" ^ string_of_int n), M.Record("uri",in_path "d"))))),
257 (false, M.RefineExact, in_path "refObj",
258 M.Ref (M.RefOf (M.RVar "uri0")),
259 [assign "p" "position"; assign "d" "depth"]
270 let rec q_where_rel n cr_r= (*function*)
275 (false, M.RefineExact, ("refRel", ["position"]),
276 M.RefOf(M.RVar "uri0")),
277 M.VVar ("rel_position" ^ string_of_int n))
281 | Some [(p,None)] -> q0
287 (false, M.RefineExact, ("refRel", ["depth"]),
288 M.RefOf(M.RVar "uri0")),
289 M.VVar ("rel_depth" ^ string_of_int n)))
290 | Some ((p,None)::tl) ->
293 q_where_rel (n+1) (Some tl))
294 | Some ((p,d)::tl) ->
300 (false, M.RefineExact, ("refRel", ["depth"]),
301 M.RefOf(M.RVar "uri0")),
302 M.VVar ("rel_depth" ^ string_of_int n))),
303 q_where_rel (n+1) (Some tl))
307 let rec q_where_sort n cr_s = (*function *)
313 (false, M.RefineExact, ("refSort", ["position"]),
314 M.RefOf(M.RVar "uri0")
316 M.VVar ("sort_position" ^ string_of_int n)),
319 (false, M.RefineExact, ("refSort", ["sort"]),
320 M.RefOf(M.RVar "uri0")),
321 M.VVar ("sort" ^ string_of_int n)))
325 | Some [(p,None,s)] -> q0
332 (false, M.RefineExact, ("refSort", ["depth"]),
333 M.RefOf(M.RVar "uri0")),
334 M.VVar ("sort_depth" ^ string_of_int n)))
336 | Some ((p,None,s)::tl) ->
339 q_where_sort (n+1) (Some tl))
341 | Some((p,d,s)::tl) ->
347 (false, M.RefineExact, ("refSort", ["depth"]),
348 M.RefOf(M.RVar "uri0")),
349 M.VVar ("sort_depth" ^ string_of_int n))),
350 q_where_sort (n+1) (Some tl))
358 let (cr_o,cr_r,cr_s) = cr in
359 M.And(M.And(q_where_obj 1 cr_o, (q_where_rel 1 cr_r)), (q_where_sort 1 cr_s))
363 (* must restrictions *)
365 let build_select_obj (r, pos, dep) =
369 M.Relation (false, M.RefineExact, ("backPointer", []),
370 M.Ref (M.Const [r]), [assign "p" "position"]),
372 ((M.Sub (M.Const [pos], M.Record ("uri", in_path "p")))))
373 | Some dep -> let string_dep = string_of_int dep in
376 M.Relation (false, M.RefineExact, ("backPointer", []),
377 M.Ref (M.Const [r]), [assign "p" "position";assign "d" "depth"]),
380 ((M.Sub (M.Const [pos], M.Record ("uri", in_path "p"))),
381 (M.Sub (M.Const [string_dep], M.Record ("uri", in_path "d"))))))
384 let build_select_rel (pos, dep) =
388 M.Relation (true, M.RefineExact, ("refRel", []), M.Ref (M.Const [""]), [assign "p" "position";assign "d" "depth"]),
390 (M.Sub (M.Const [pos], M.Record ("uri", in_path "p"))))
391 | Some dep -> let string_dep = string_of_int dep in
394 M.Relation (true, M.RefineExact, ("refRel", []), M.Ref (M.Const [""]), [assign "p" "position";assign "d" "depth"]),
397 ((M.Sub (M.Const [pos], M.Record ("uri", in_path "p"))),
398 (M.Sub (M.Const [string_dep], M.Record ("uri", in_path "d"))))))
401 let build_select_sort (pos, dep, sor) =
405 M.Relation (true, M.RefineExact, ("refSort", []), M.Ref (M.Const [""]), [assign "p" "position";assign "d" "depth";assign "s" "sort"]),
408 ((M.Sub (M.Const [pos], M.Record ("uri", in_path "p"))),
409 (M.Sub (M.Const [sor], M.Record ("uri", in_path "s"))))))
411 | Some dep -> let string_dep = string_of_int dep in
414 M.Relation (true, M.RefineExact, ("refSort", []), M.Ref (M.Const [""]), [assign "p" "position";assign "d" "depth";assign "s" "sort"]),
418 ((M.Sub (M.Const [pos], M.Record ("uri", in_path "p"))),
419 (M.Sub (M.Const [string_dep], M.Record ("uri", in_path "d"))))),
420 (M.Sub (M.Const [sor], M.Record ("uri", in_path "s"))))))
423 let rec build_intersect_obj = function
424 [] -> M.Pattern (M.Const ["[.]*"])
425 | [hd] -> build_select_obj hd
426 | hd :: tl -> M.Intersect (build_select_obj hd, build_intersect_obj tl)
429 let rec build_intersect_rel = function
430 [] -> M.Ref(M.Const [])
431 | [hd] -> build_select_rel hd
432 | hd :: tl -> M.Intersect (build_select_rel hd, build_intersect_rel tl)
435 let rec build_intersect_sort = function
436 [] -> M.Ref(M.Const [])
437 | [hd] -> build_select_sort hd
438 | hd :: tl -> M.Intersect (build_select_sort hd, build_intersect_sort tl)
441 let build_intersect = function
442 (* let tostring_sort (a,b,c) =
443 let b1 = string_of_int b in
446 let tostring_rel (a,b) =
447 let b1 = string_of_int b in
451 (* let (l1,l2,l3) = must in
452 match (l1,l2,l3) with *)
453 l1,[],[] -> build_intersect_obj l1
454 | [],l2,[] -> (*let lrel = List.map tostring_rel l2 in*)
455 build_intersect_rel l2
456 | [],[],l3 ->(* let lsort = List.map tostring_sort l3 in*)
457 build_intersect_sort l3
458 | l1,l2,[] -> (*let lrel = List.map tostring_rel l2 in*)
459 M.Intersect (build_intersect_obj l1, build_intersect_rel l2)
460 | l1,[],l3 ->(* let lsort = List.map tostring_sort l3 in *)
461 M.Intersect (build_intersect_obj l1, build_intersect_sort l3)
462 | [],l2,l3 ->(* let lrel = List.map tostring_rel l2 in
463 let lsort = List.map tostring_sort l3 in*)
464 M.Intersect (build_intersect_rel l2, build_intersect_sort l3)
465 | l1,l2,l3 ->(* let lrel = List.map tostring_rel l2 in
466 let lsort = List.map tostring_sort l3 in *)
467 M.Intersect (M.Intersect (build_intersect_obj l1, build_intersect_rel l2), build_intersect_sort l3)
470 let q_in = build_intersect must_use in
471 let q_select = M.Select ("uri0", q_in, q_where can_use) in
473 (* variables for can restrictions *)
475 let q_let_u = M.LetVVar ("universe", M.Const universe, q_select) in
477 let rec q_let_s sor n =
480 | [s] -> M.LetVVar ("sort" ^ (string_of_int n), M.Const [s], q_let_u)
481 | s::tl -> M.LetVVar ("sort" ^ (string_of_int n), M.Const [s], q_let_s tl (n+1))
484 (* let q_let_s = M.LetVVar ("sorts", M.Const sor, q_let_u) in *)
486 let rec q_let_ds sdep n =
489 | [None] -> q_let_s sor 1
490 | (None)::tl -> q_let_ds tl (n+1)
491 | [Some d] -> M.LetVVar ("sort_depth" ^ (string_of_int n), M.Const [(string_of_int d)], q_let_s sor 1)
492 | (Some d)::tl -> M.LetVVar ("sort_depth" ^ (string_of_int n), M.Const [(string_of_int d)], q_let_ds tl (n+1))
495 (* let q_let_ds = M.LetVVar ("sort_depths", M.Const sdep, q_let_s) in *)
497 let rec q_let_dr rdep n =
500 | [None] -> q_let_ds sdep 1
501 | (None)::tl -> q_let_dr tl (n+1)
502 | [Some d] -> M.LetVVar ("rel_depth" ^ (string_of_int n), M.Const [(string_of_int d)], q_let_ds sdep 1)
503 | (Some d)::tl -> M.LetVVar ("rel_depth" ^ (string_of_int n), M.Const [(string_of_int d)], q_let_dr tl (n+1))
507 (*let q_let_dr = M.LetVVar ("rel_depths", M.Const rdep, q_let_ds) in*)
509 let rec q_let_do odep n =
512 | [None] -> q_let_dr rdep 1
513 | (None)::tl -> q_let_do tl (n+1)
514 | [Some d] -> M.LetVVar ("obj_depth" ^ (string_of_int n), M.Const [(string_of_int d)], q_let_dr rdep 1)
515 | (Some d)::tl -> M.LetVVar ("obj_depth" ^ (string_of_int n), M.Const [(string_of_int d)], q_let_do tl (n+1))
519 (* let q_let_do = M.LetVVar ("obj_depths", M.Const odep, q_let_dr) in *)
522 let rec q_let_ps spos n =
524 [] -> q_let_do odep 1
525 | [p] -> M.LetVVar ("sort_position" ^ (string_of_int n), M.Const [p], q_let_do odep 1)
526 | p::tl -> M.LetVVar ("sort_position" ^ (string_of_int n), M.Const [p], q_let_ps tl (n+1))
530 (* let q_let_ps = M.LetVVar ("sort_positions", M.Const spos, q_let_do) in *)
533 let rec q_let_pr rpos n =
535 [] -> q_let_ps spos 1
536 | [p] -> M.LetVVar ("rel_position" ^ (string_of_int n), M.Const [p], q_let_ps spos 1)
537 | p::tl -> M.LetVVar ("rel_position" ^ (string_of_int n), M.Const [p], q_let_pr tl (n+1))
542 (* let q_let_pr = M.LetVVar ("rel_positions", M.Const rpos, q_let_ps) in *)
544 let rec q_let_po opos n =
546 [] -> q_let_pr rpos 1
547 | [p] -> M.LetVVar ("obj_position" ^ (string_of_int n), M.Const [p], q_let_pr rpos 1)
548 | p::tl -> M.LetVVar ("obj_position" ^ (string_of_int n), M.Const [p], q_let_po tl (n+1))
551 (*let q_let_po = M.LetVVar ("obj_positions", M.Const opos, q_let_pr) in*)
553 print_endline "### "; MQueryUtil.text_of_query print_string (q_let_po opos 1) "\n"; flush stdout;
554 execute_query (q_let_po opos 1)