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 exception NotCompatible;;
28 (* Catenates two lists preserving order and getting rid of duplicates *)
29 let rec append (l1,l2) =
33 | s1::tl1, s2::_ when s1 < s2 -> s1::append (tl1,l2)
34 | s1::_, s2::tl2 when s2 < s1 -> s2::append (l1,tl2)
35 | s1::tl1, s2::tl2 -> s1::append (tl1,tl2)
40 (* Sums two attribute groups preserving order *)
41 let rec sum_groups(gr1, gr2) =
45 | (key1,l1)::tl1, (key2,l2)::_ when key1 < key2 -> (key1,l1)::(sum_groups (tl1,gr2))
46 | (key1,l1)::_, (key2,l2)::tl2 when key2 < key1 -> (key2,l2)::(sum_groups (gr1,tl2))
47 | (key1,l1)::tl1, (key2,l2)::tl2 -> (key1,(append (l1,l2)))::(sum_groups (tl1,tl2))
51 (* Product between an attribute set and a gropu of attributes *)
52 let rec sub_prod (aset, gr) = (*prende un aset e un gr e fa la somma tra tutti i gruppi di aset e gr *)
55 | gr1::tl1 -> sum_groups (gr1, gr)::(sub_prod(tl1, gr))
59 (* Cartesian product between two attribute sets*)
60 let rec prod (as1, as2) =
64 | gr1::tl1, _ -> (sub_prod (as2, gr1))@(prod (tl1, as2)) (* chiamo la sub_prod con un el. as1 e as2 *)
67 (* Intersection between two resource sets, preserves order and gets rid of duplicates *)
68 let rec intersect_ex rs1 rs2 =
73 (uri2,as2)::_ when uri1 < uri2 -> intersect_ex tl1 rs2
75 (uri2,as2)::tl2 when uri2 < uri1 -> intersect_ex rs1 tl2
77 (uri2,as2)::tl2 -> (uri1, prod(as1,as2))::intersect_ex tl1 tl2
80 let intersect_ex l1 l2 =
82 (*let _ = print_string ("INTERSECT ")
83 and t = Unix.time () in*)
86 ((head1::tail1), (head2::tail2)) ->
87 (match (head1, head2) with
88 ([], _) -> assert false (* gli header non devono mai essere vuoti *)
89 | (_, []) -> assert false (* devono contenere almeno [retVal] *)
91 (match (tail1, tail2) with
92 ([], _) -> [["retVal"]] (* se una delle due code e' vuota... *)
93 | (_, []) -> [["retVal"]] (* ... l'intersezione e' vuota *)
97 (function t -> not (List.mem t head2))
100 ] (* header del risultato finale *)
102 intersect_tails (List.tl head1) tail1 (List.tl head2) tail2
105 (fun par1 elem1 -> par1 @
109 (xres_join_context (List.tl head1) (List.tl elem1)
110 (List.tl head2) (List.tl elem2)
114 (fun elem2 -> (* trova tutti gli elementi della lista tail2 *)
115 ((List.hd elem1) = (List.hd elem2)) && (* che stanno in tail1 *)
116 not ((xres_join_context (List.tl head1) (List.tl elem1)
117 (List.tl head2) (List.tl elem2)) = [])
118 (* e per i quali la xres_join_context non sia vuota *)
120 tail2 (* List.find_all *)
124 tail1 (* per ogni elemento di tail1 applica la List.fold_left *)
130 (*let _ = print_endline (string_of_float (Unix.time () -. t)); flush stdout in*)
132 let before = Unix.time () in
133 let res = intersect_ex l1 l2 in
134 let after = Unix.time () in
135 let ll1 = string_of_int (List.length l1) in
136 let ll2 = string_of_int (List.length l2) in
137 let diff = string_of_float (after -. before) in
139 ("INTERSECT(" ^ ll1 ^ "," ^ ll2 ^ ") = " ^ string_of_int (List.length res) ^