Updating contests and time misurations

[helm.git] / helm / ocaml / mathql_interpreter / union.ml

diff --git a/helm/ocaml/mathql_interpreter/union.ml b/helm/ocaml/mathql_interpreter/union.ml
index 35999170c830cd9cc073a2d9af32660fbc269b7f..e2d9fcb01a7e75be68bc141783eca03ccb1423bf 100644 (file)
--- a/helm/ocaml/mathql_interpreter/union.ml
+++ b/helm/ocaml/mathql_interpreter/union.ml
@@ -27,85 +27,7 @@
  * implementazione del comando UNION
  *)
 
-(*
-(*
- * 
- *)
-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 ...*)
-       (Sort.list
-        (fun l m -> List.hd l < List.hd m)
-        (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 (* List.fold_left *)
-              tail2 (* List.fold_left *)
-(*          first @
-            List.map (fun l -> [List.hd l] @
-                      xres_fill_context
-                       (List.tl headr) (List.tl head2) (List.tl l)
-                     ) tail2
-*)
-        ) (* match *)
-       )
-;;
-*)
 (* Merges two attribute group lists preserves order and gets rid of duplicates*)
 let rec merge l1 l2 =
   match (l1,l2) with
@@ -127,14 +49,4 @@ let rec union_ex rs1 rs2 =
                                      else (uri1,merge l1 l2)::(union_ex tl1 tl2)       
 ;;
 
-let union_ex l1 l2 =
- let before = Sys.time () in
- let res = union_ex l1 l2 in
- let after = Sys.time () in
-  let ll1 = string_of_int (List.length l1) in
-  let ll2 = string_of_int (List.length l2) in
-  let diff = string_of_float (after -. before) in
-  print_endline ("UNION(" ^ ll1 ^ "," ^ ll2 ^ "): " ^ diff ^ "s") ;
-  flush stdout ;
-  res
-;;
+