(* 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/.
 *)

exception NotCompatible;;

(* Catenates two lists preserving order and getting rid of duplicates *)
let rec append (l1,l2) =
  match l1,l2 with
     [],_ -> l2
   | _,[] -> l1
   | s1::tl1, s2::_ when s1 < s2 -> s1::append (tl1,l2)                     
   | s1::_, s2::tl2 when s2 < s1 -> s2::append (l1,tl2) 
   | s1::tl1, s2::tl2 -> s1::append (tl1,tl2) 

;;


(* Sums two attribute groups preserving order *)
let rec sum_groups(gr1, gr2) =
  match gr1, gr2 with
     [],_ -> gr2
   | _,[] -> gr1
   | (key1,l1)::tl1, (key2,l2)::_ when key1 < key2 -> (key1,l1)::(sum_groups (tl1,gr2))
   | (key1,l1)::_, (key2,l2)::tl2 when key2 < key1 -> (key2,l2)::(sum_groups (gr1,tl2))
   | (key1,l1)::tl1, (key2,l2)::tl2 -> (key1,(append (l1,l2)))::(sum_groups (tl1,tl2))

;;

(* Product between an attribute set and a gropu of attributes *)
let rec sub_prod (aset, gr) =           (*prende un aset e un gr e fa la somma tra tutti i gruppi di aset e gr *)
  match aset with
      [] -> []
    | gr1::tl1 -> sum_groups (gr1, gr)::(sub_prod(tl1, gr)) 
;;


(* Cartesian product between two attribute sets*)
let rec prod (as1, as2) =
  match as1, as2 with
    [],_ -> as2
  | _,[] -> as1
  | gr1::tl1, _ -> (sub_prod (as2, gr1))@(prod (tl1, as2))  (* chiamo la sub_prod con un el. as1 e as2 *)
;;

(* Intersection between two resource sets, preserves order and gets rid of duplicates *)
let rec intersect_ex rs1 rs2 =
  match (rs1, rs2) with
     [],_
   | _,[] -> []
   | (uri1,as1)::tl1,
     (uri2,as2)::_ when uri1 < uri2 -> intersect_ex tl1 rs2
   | (uri1,as1)::_,
     (uri2,as2)::tl2 when uri2 < uri1 -> intersect_ex rs1 tl2
   | (uri1,as1)::tl1,
     (uri2,as2)::tl2 -> (uri1, prod(as1,as2))::intersect_ex tl1 tl2 
;;

let intersect_ex l1 l2 =
 (* PRE-CLAUDIO
 (*let _ = print_string ("INTERSECT ")
 and t = Unix.time () in*)
 let result = 
  match (l1, l2) with
     ((head1::tail1), (head2::tail2)) ->
      (match (head1, head2) with
          ([], _) -> assert false (* gli header non devono mai essere vuoti *)
       |  (_, []) -> assert false (* devono contenere almeno [retVal] *)
       |  (_,  _) ->
           (match (tail1, tail2) with
               ([], _) -> [["retVal"]] (* se una delle due code e' vuota... *)
            |  (_, []) -> [["retVal"]] (* ... l'intersezione e' vuota *)
            |  (_,  _) ->
                [head2 @
                 (List.find_all
     	          (function t -> not (List.mem t head2))
	          head1
	         )
	        ] (* header del risultato finale *)
	        @
	        intersect_tails (List.tl head1) tail1 (List.tl head2) tail2
	        (*
	        List.fold_left
                 (fun par1 elem1 -> par1 @
                  List.map
	           (fun elem2 ->
	            [(List.hd elem1)] @
	            (xres_join_context (List.tl head1) (List.tl elem1)
	                               (List.tl head2) (List.tl elem2)
                    )
	           )
                   (List.find_all (* *)
                    (fun elem2 ->    (* trova tutti gli elementi della lista tail2 *)
	             ((List.hd elem1) = (List.hd elem2)) && (* che stanno in tail1 *)
	             not ((xres_join_context (List.tl head1) (List.tl elem1)
		                             (List.tl head2) (List.tl elem2)) = [])
	             (* e per i quali la xres_join_context non sia vuota *)
	            )
                    tail2 (* List.find_all *)
	           )
                  )
                []
                tail1 (* per ogni elemento di tail1 applica la List.fold_left *)
	        *)
           ) (* match *)
      )
  | _ -> []
   in
    (*let _ = print_endline (string_of_float (Unix.time () -. t)); flush stdout in*)
    result*)
 let before = Unix.time () in
 let res = intersect_ex l1 l2 in
 let after = Unix.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
   ("INTERSECT(" ^ ll1 ^ "," ^ ll2 ^ ") = " ^ string_of_int (List.length res) ^
    ": " ^ diff ^ "s") ;
  flush stdout ;
  res
;;