X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Focaml%2Fmathql_interpreter%2Funion.ml;h=e2d9fcb01a7e75be68bc141783eca03ccb1423bf;hb=0373aa12449568c5aca2027d8e8773ea0c0fa4a5;hp=bf402a2f17359ef6ba398dafd2b97c82dff3e913;hpb=6a1d05b388683befc860b48b4f2bbaf42f58a112;p=helm.git

diff --git a/helm/ocaml/mathql_interpreter/union.ml b/helm/ocaml/mathql_interpreter/union.ml
index bf402a2f1..e2d9fcb01 100644
--- a/helm/ocaml/mathql_interpreter/union.ml
+++ b/helm/ocaml/mathql_interpreter/union.ml
@@ -1,93 +1,52 @@
-
-(*
- * implementazione del comando UNION
- *)
-
-(*
+(* Copyright (C) 2000, HELM Team.
+ * 
+ * This file is part of HELM, an Hypertextual, Electronic
+ * Library of Mathematics, developed at the Computer Science
+ * Department, University of Bologna, Italy.
  * 
+ * HELM is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License
+ * as published by the Free Software Foundation; either version 2
+ * of the License, or (at your option) any later version.
+ * 
+ * HELM is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with HELM; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
+ * MA  02111-1307, USA.
+ * 
+ * For details, see the HELM World-Wide-Web page,
+ * http://cs.unibo.it/helm/.
  *)
-let xres_fill_context hr h1 l1 =
- match l1 with
-    [] -> []
- |   _ ->
-     let hh = List.combine h1 l1
-     in
-      List.map
-       (fun x ->
-        if (List.mem_assoc x hh) then
-	 List.assoc x hh
-	else
-	 ""
-       )
-       hr
-;;
 
 (*
  * implementazione del comando UNION
  *)
-let union_ex alist1 alist2 =
- let head1 = List.hd alist1
- and tail1 = List.tl alist1
- and head2 = List.hd alist2
- and tail2 = List.tl alist2 (* e fin qui ... *)
- in
-  match (head1, head2) with
-     ([], _) -> assert false (* gli header non devono mai essere vuoti *)
-  |  (_, []) -> assert false (* devono contenere almeno [retVal] *)
-  |  (_,  _) -> let headr = (head2 @
-                            (List.find_all
-			     (function t -> not (List.mem t head2))
-			     head1)
-			    ) in (* header del risultato finale *)
-      List.append (* il risultato finale e' la concatenazione ...*)
-       [headr] (* ... dell'header costruito prima ...*)
-       (match (tail1, tail2) with (* e di una coda "unione" *)
-           ([], _) -> tail2 (* va bene perche' l'altra lista e' vuota *)
-        |  (_, []) -> tail1 (* va bene perche' l'altra lista e' vuota *)
-        |  (_,  _) ->
-	    let first = (* parte dell'unione che riguarda solo il primo set *)
-	     List.map (fun l -> [List.hd l] @
-	               xres_fill_context
-	                (List.tl headr) (List.tl head1) (List.tl l)
-		      ) tail1
-            in
-	     List.fold_left
-	      (fun par x ->
-	       let y = (* elemento candidato ad entrare *)
-	        [List.hd x]
-		@
-	        xres_fill_context
-	         (List.tl headr) (List.tl head2) (List.tl x)
-	       in
-	        par @ if (List.find_all (fun t -> t = y) par) = [] then
-		       [y]
-		      else
-		       []
-	      )
-	      first
-	      tail2
-(*	     first @
-	     List.map (fun l -> [List.hd l] @
-	               xres_fill_context
-	                (List.tl headr) (List.tl head2) (List.tl l)
-		      ) tail2
-*)
-       ) (* match *)
-;;
 
-(** TEST **)
 
-(*
-let h1 = ["retVal";     "a";      "b"];;
-let l1 = ["pippo";      "3";      "3"];;
-let l3 = ["pluto";      "7";      "8"]
-let r1 = [h1; l1; l3];;
+(* Merges two attribute group lists preserves order and gets rid of duplicates*)
+let rec merge l1 l2 =
+  match (l1,l2) with
+     [],l
+   | l,[] -> l
+   | g1::tl1,g2::_ when g1 < g2 -> g1::(merge tl1 l2)
+   | g1::_,g2::tl2 when g2 < g1 -> g2::(merge l1 tl2)
+   | g1::tl1,g2::tl2 -> g1::(merge tl1 tl2)
+;;       
+
+(* preserves order and gets rid of duplicates *)
+let rec union_ex rs1 rs2 =
+  match (rs1, rs2) with
+     [],l
+   | l,[] -> l
+   | (uri1,l1)::tl1,(uri2,_)::_ when uri1 < uri2 -> (uri1,l1)::(union_ex tl1 rs2)
+   | (uri1,_)::_,(uri2,l2)::tl2 when uri2 < uri1 -> (uri2,l2)::(union_ex rs1 tl2)
+   | (uri1,l1)::tl1,(uri2,l2)::tl2 -> if l1 = l2 then (uri1,l1)::(union_ex tl1 tl2)
+				      else (uri1,merge l1 l2)::(union_ex tl1 tl2)	
+;;
 
-(*let h2 = ["retVal";               "b";      "c"];;
-let l2 = ["pippo";                "3";      "1"];;*)
-let h2 = ["retVal";     "a";      "b"];;
-let l2 = ["pippo";      "3";      "3"];;
-let r2 = [h2; l2];;
 
-List.map (fun l -> List.iter print_endline l) (xres_union (r1, r2));;
-*)