--- /dev/null
+(* 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/.
+ *)
+
+(*
+ *
+ *)
+
+open Dbconn;;
+open Utility;;
+open Intersect;;
+
+
+let getpid p =
+ if (p = "refObj") then "F"
+ else "B"
+;;
+
+(*
+ * implementazione delle funzioni dublin core
+ *)
+let rec property_ex rop path inv = function
+ [] -> []
+ | s::tl -> let mprop = fst path in
+ print_endline mprop;
+ let prop = List.hd (snd path) in
+ match mprop with
+
+ "refObj" (* in base al valore di prop restituisco i valori del relativo campo della tabella relativa all'uri rappresentata da s *)
+ | "backPointer" ->
+ print_endline mprop;
+ let mpid = getpid mprop in
+ let res =
+ let c = pgc () in
+ let tv = pgresult_to_string (c#exec ("select id from registry where uri='" ^ s ^ "'")) in
+ let q = "select t" ^ tv ^ "." ^ prop ^ " from t" ^ tv ^ " where prop_id= '" ^ mpid ^ "'" in
+ print_endline q;
+ pgresult_to_string_list (c#exec q)
+ in
+ append (res,(property_ex rop path inv tl))
+
+ (*Rimane da capire cosa restituire nelle inverse!!!!*)
+
+
+ | "refRel"
+ | "refSort" ->
+ if inv then (* restituisco gli uri che il valore della prop richiesta uguale a s *)
+ let res =
+ let c = pgc () in
+ let q = ("select h" ^ mprop ^ ".uri from h" ^ mprop ^ " where h" ^ mprop ^ "." ^ prop ^ "= '" ^ s ^ "'") in
+ print_endline q;
+ pgresult_to_string_list (c#exec q)
+ in
+ append (res,(property_ex rop path inv tl))
+
+ else
+ let res = (* restituisco il valore della prop relativo all'uri rappresentato da s*)
+ let c = pgc () in
+ let q = ("select h" ^ mprop ^ "." ^ prop ^" from h" ^ mprop ^ " where h" ^ mprop ^ ".uri = '" ^ s ^ "'") in
+ pgresult_to_string_list (c#exec q)
+ in
+ append (res,(property_ex rop path inv tl))
+
+
+
+ | _ -> (* metadati DC !!!! Controllare se i nomi delle tabelle cominciano con h !!!!*)
+ if inv then
+ let res =
+ let c = pgc () in
+ let q = ("select " ^ mprop ^ ".uri from " ^ mprop ^ " where " ^ mprop ^ ".value = '" ^ s ^ "'") in
+ pgresult_to_string_list (c#exec q)
+ in
+ append (res,(property_ex rop path inv tl))
+ else
+ let res =
+ let c = pgc () in
+ let q = ("select " ^ mprop ^ ".value from " ^ mprop ^ " where " ^ mprop ^ ".uri = '" ^ s ^ "'") in
+ pgresult_to_string_list (c#exec q)
+ in
+ append (res,(property_ex rop path inv tl))
+
+;;
+
(* Copyright (C) 2000, HELM Team.
*
- * This file is part of HELM, an Hypertextual, Electronic
+ *
+ if This file is part of HELM, an Hypertextual, Electronic
* Library of Mathematics, developed at the Computer Science
* Department, University of Bologna, Italy.
*
open Utility;;
+(* Cerca in una lista di assegnamenti (lista di coppie (path,path) dove path e'
+di tipo (string * string list) quello relativo alla proprietà p e ne
+restituisce la variabile a cui tale proprietà deve essere associata *)
+let rec search p = function
+ [] -> ""
+ | (path1,path2)::tl -> if (fst(path2) = p) then fst(path1)
+ else search p tl
+;;
-let get_prop_id propl =
- let prop = fst propl in
+let get_prop_id prop =
if prop="refObj" then "F"
else if prop="backPointer" then "B"
else assert false
;;
-let relation_ex inv rop path rset attl =
- let usek = get_prop_id path in
- let vvar = if attl = [] then "position"
- else List.hd attl
- in
- let c = pgc () in
- let rset_list = (* lista di singoletti:resource_set di un elemento *)
- (List.fold_left (fun acc (uri,l) ->
- let tv = pgresult_to_string (c#exec ("select id from registry where uri='" ^ uri ^ "'")) in
- let qq = "select uri, position from t" ^ tv ^ " where prop_id='" ^ usek ^ "' order by uri asc" in
- let res = c#exec qq in
- (List.map
- (function
- [uri;context] -> [(uri,[[((vvar, []),[context])]])]
- | _ -> assert false )
- res#get_list) @ acc
- )
- [] rset
- )
- in
- let rec edup = function
- [] -> []
- | rs1::tl -> union_ex rs1 (edup tl)
- in
- edup rset_list
+let relation_ex inv rop path rset assl =
+ let relk = fst path in
+ match relk with
+
+ (* Nota: mancano le inverse di refObj e backPointer!!!! *)
+
+(* Notabis: ora per refObj si restituiscono tutti gli uri della tabella, nella diretta c'e` l'uri vuota *)
+(* Notater: quando non richiedo tutte le proprieta` della tabella quelle che non voglio mi vengono restituite lo stesso ma con nome vuoto *)
+
+ "refObj"
+ | "backPointer" -> (* proprieta` refObj e backPointer *)
+ print_endline "IN BACKPOINTER";
+ let prop = get_prop_id relk in
+ if assl = [] then (* se non ci sono assegnamenti *)
+ let c = pgc () in
+ let rset_list = (* lista di singoletti:resource_set di un elemento *)
+ (List.fold_left (fun acc (uri,l) ->
+ let tv = pgresult_to_string (c#exec ("select id from registry where uri='" ^ uri ^ "'")) in
+ let qq = "select uri from t" ^ tv ^ " where prop_id='" ^ prop ^ "' order by uri asc" in
+ print_endline qq;
+ let res = c#exec qq in
+
+ let l = (pgresult_to_string_list res) in
+ List.iter print_endline l;
+ (List.map
+ (function
+ [uri] -> [(uri,[])]
+ | _ -> assert false )
+ res#get_list) @ acc
+ )
+ [] rset
+ )
+ in
+ let rec edup = function
+ [] -> []
+ | rs1::tl -> union_ex rs1 (edup tl)
+ in
+ edup rset_list
+
+
+ else (* con assegnamenti *)
+ let c = pgc () in
+ let rset_list = (* lista di singoletti:resource_set di un elemento *)
+ (List.fold_left (fun acc (uri,l) ->
+ let tv = pgresult_to_string (c#exec ("select id from registry where uri='" ^ uri ^ "'")) in
+ let qq = "select uri, position, depth from t" ^ tv ^ " where prop_id='" ^ prop ^ "' order by uri asc" in
+ print_endline qq;
+ let res = c#exec qq in
+ let pos = search "position" assl in
+ let dep = search "depth" assl in
+ if ((pos != "") && (dep != "")) then (*caso in cui voglio sia position che depth*)
+ (List.map
+ (function
+ [uri;position;depth] -> [(uri,[[((pos, []),[position]);((dep, []),[depth])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+ else
+ if (dep = "") then (* voglio solo position *)
+ (List.map
+ (function
+ [uri;position;depth] -> [(uri,[[((pos, []),[position])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+ else (* voglio solo depth *)
+ (List.map
+ (function
+ [uri;position;depth] -> [(uri,[[((dep, []),[depth])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+
+ )
+ [] rset
+ )
+ in
+ let rec edup = function
+ [] -> []
+ | rs1::tl -> union_ex rs1 (edup tl)
+ in
+ edup rset_list
+
+(* Fine proprieta` refObj e backPointer *)
+
+ | "refRel" -> (* proprietà refRel *)
+ if assl = [] then [] (* se non ci sono assegnamenti *)
+(* let c = pgc () in
+ let rset_list = (* lista di singoletti:resource_set di un elemento *)
+ (List.fold_left (fun acc (uri,l) ->
+ let qq = "select uri from hrefRel order by uri asc" in
+ let res = c#exec qq in
+ (List.map
+ (function
+ [uri] -> [(uri,[])]
+ | _ -> assert false )
+ res#get_list) @ acc
+ )
+ [] rset
+ )
+ in
+ let rec edup = function
+ [] -> []
+ | rs1::tl -> union_ex rs1 (edup tl)
+ in
+ edup rset_list
+*)
+
+ else (* con assegnamenti *)
+ if inv then (* INVERSA *)
+ let c = pgc () in
+ let rset_list = (* lista di singoletti:resource_set di un elemento *)
+ (List.fold_left (fun acc (uri,l) ->
+ let qq = "select uri, position, depth from hrefRel order by uri asc" in
+ let res = c#exec qq in
+ let pos = search "position" assl in
+ let dep = search "depth" assl in
+ if ((pos != "") && (dep != "")) then (*caso in cui voglio sia position che depth*)
+ (List.map
+ (function
+ [uri;position;depth] -> [(uri,[[((pos, []),[position]);((dep, []),[depth])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+ else
+ if (dep = "") then (* voglio solo position *)
+ (List.map
+ (function
+ [uri;position;depth] -> [(uri,[[((pos, []),[position])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+ else (* voglio solo depth *)
+ (List.map
+ (function
+ [uri;position;depth] -> [(uri,[[((dep, []),[depth])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+
+ )
+ [] rset
+ )
+ in
+ let rec edup = function
+ [] -> []
+ | rs1::tl -> union_ex rs1 (edup tl)
+ in
+ edup rset_list
+ else (* DIRETTA, con risorsa nulla *)
+ let c = pgc () in
+ let rset_list = (* lista di singoletti:resource_set di un elemento *)
+ (List.fold_left (fun acc (uri,l) ->
+ let qq = "select position, depth from hrefRel order by uri asc" in
+ let res = c#exec qq in
+ let pos = search "position" assl in
+ let dep = search "depth" assl in
+ if ((pos != "") && (dep != "")) then (*caso in cui voglio sia position che depth*)
+ (List.map
+ (function
+ [position;depth] -> [("",[[((pos, []),[position]);((dep, []),[depth])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+ else
+ if (dep = "") then (* voglio solo position *)
+ (List.map
+ (function
+ [position;depth] -> [("",[[((pos, []),[position])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+ else (* voglio solo depth *)
+ (List.map
+ (function
+ [position;depth] -> [("",[[((dep, []),[depth])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+
+ )
+ [] rset
+ )
+ in
+ let rec edup = function
+ [] -> []
+ | rs1::tl -> union_ex rs1 (edup tl)
+ in
+ edup rset_list
+
+
+
+
+
+(* Fine proprieta` refRel *)
+
+
+
+
+ | "refSort" -> (* proprietà refSort *)
+ if assl = [] then [] (* se non ci sono assegnamenti *)
+(* let c = pgc () in
+ let rset_list = (* lista di singoletti:resource_set di un elemento *)
+ (List.fold_left (fun acc (uri,l) ->
+ let qq = "select uri from hrefSort order by uri asc" in
+ let res = c#exec qq in
+ (List.map
+ (function
+ [uri] -> [(uri,[])]
+ | _ -> assert false )
+ res#get_list) @ acc
+
+ )
+ [] rset
+ )
+ in
+ let rec edup = function
+ [] -> []
+ | rs1::tl -> union_ex rs1 (edup tl)
+ in
+ edup rset_list
+*)
+
+
+ else (* con assegnamenti *)
+ if inv then (*INVERSA ----> SISTEMARE: vedi refRel!!!!*)
+ let c = pgc () in
+ let rset_list = (* lista di singoletti:resource_set di un elemento *)
+ (List.fold_left (fun acc (uri,l) ->
+ let qq = "select uri, position, depth, sort from hrefSort order by uri asc" in
+ let res = c#exec qq in
+ let pos = search "position" assl in
+ let dep = search "depth" assl in
+ let sor = search "sort" assl in
+ if ((pos != "") && (dep != "") && (sor != "")) then (*caso in cui
+ voglio position, depth e sort*)
+ (List.map
+ (function
+ [uri;position;depth;sort] -> [(uri,[[((pos, []),[position]);((dep, []),[depth]);((sor, []),[sort])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+ else
+ if ((dep = "") && (sor = "")) then (* voglio solo position *)
+ (List.map
+ (function
+ [uri;position;depth;sort] -> [(uri,[[((pos, []),[position])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+
+ else
+ if ((pos = "") && (sor = "")) then (* voglio solo depth *)
+ (List.map
+ (function
+ [uri;position;depth;sort] -> [(uri,[[((dep, []),[depth])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+
+ else
+ if ((pos = "") && (dep = "")) then (* voglio solo sort *)
+ (List.map
+ (function
+ [uri;position;depth;sort] -> [(uri,[[((sor, []),[sort])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+
+ else
+ if ((pos = "") && (dep != "") && (sor != "")) then (*voglio depth e sort*)
+ (List.map
+ (function
+ [uri;position;depth;sort] -> [(uri,[[((dep, []),[depth]);((sor, []),[sort])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+
+ else
+ if((pos != "") && (dep = "") && (sor != "")) then (*voglio
+ position e sort*)
+ (List.map
+ (function
+ [uri;position;depth;sort] -> [(uri,[[((pos, []),[position]);((sor, []),[sort])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+
+ else
+ (* if ((pos != "") && (dep != "") && (sor = "")) then*) (*voglio
+ position e depth*)
+ (List.map
+ (function
+ [uri;position;depth;sort] -> [(uri,[[((pos, []),[position]);((dep, []),[depth])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+
+ )
+ [] rset
+ )
+ in
+ let rec edup = function
+ [] -> []
+ | rs1::tl -> union_ex rs1 (edup tl)
+ in
+ edup rset_list
+
+ else (* DIRETTA con risorsa vuota ----> SISTEMARE: vedi refRel!!!!*)
+ let c = pgc () in
+ let rset_list = (* lista di singoletti:resource_set di un elemento *)
+ (List.fold_left (fun acc (uri,l) ->
+ let qq = "select position, depth, sort from hrefSort order by uri asc" in
+ let res = c#exec qq in
+ let pos = search "position" assl in
+ let dep = search "depth" assl in
+ let sor = search "sort" assl in
+ if ((pos != "") && (dep != "") && (sor != "")) then (*caso in cui
+ voglio position, depth e sort*)
+ (List.map
+ (function
+ [position;depth;sort] -> [("",[[((pos, []),[position]);((dep, []),[depth]);((sor, []),[sort])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+ else
+ if ((dep = "") && (sor = "")) then (* voglio solo position *)
+ (List.map
+ (function
+ [position;depth;sort] -> [("",[[((pos, []),[position])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+
+ else
+ if ((pos = "") && (sor = "")) then (* voglio solo depth *)
+ (List.map
+ (function
+ [position;depth;sort] -> [("",[[((dep, []),[depth])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+
+ else
+ if ((pos = "") && (dep = "")) then (* voglio solo sort *)
+ (List.map
+ (function
+ [position;depth;sort] -> [("",[[((sor, []),[sort])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+
+ else
+ if ((pos = "") && (dep != "") && (sor != "")) then (*voglio depth e sort*)
+ (List.map
+ (function
+ [position;depth;sort] -> [("",[[((dep, []),[depth]);((sor, []),[sort])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+
+ else
+ if((pos != "") && (dep = "") && (sor != "")) then (*voglio
+ position e sort*)
+ (List.map
+ (function
+ [position;depth;sort] -> [("",[[((pos, []),[position]);((sor, []),[sort])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+
+ else
+ (* if ((pos != "") && (dep != "") && (sor = "")) then*) (*voglio
+ position e depth*)
+ (List.map
+ (function
+ [position;depth;sort] -> [("",[[((pos, []),[position]);((dep, []),[depth])]])]
+ | _ -> assert false )
+ res#get_list) @ acc
+
+ )
+ [] rset
+ )
+ in
+ let rec edup = function
+ [] -> []
+ | rs1::tl -> union_ex rs1 (edup tl)
+ in
+ edup rset_list
+
+
+
+(* Fine proprieta` refSort *)
+
+
+
+ | _ -> []
+
;;
| [] -> []
-(* prende una resource e una vvar e restituisce la lista delle resource in relazione (refObj o backPointer in base al parametro "path") con tale resource e associa alla proprieta' il nome della vvar contenuto in "attl" *)
-let muse path attl r =
- let vvar = if attl = [] then "position"
- else List.hd attl
+(* prende una resource e una vvar e restituisce la lista delle resource in relazione (refObj o backPointer in base al parametro "path") con tale resource e associa alla proprieta' il nome della vvar contenuto in "assl" *)
+let muse path assl r =
+ let vvar = if assl = [] then "position"
+ else List.hd assl
in
let uri = fst r in
let furi = tofname uri in
-(* prende un resource_set, una vvar (primo el. di attl) a cui associare la posizione, e la relazione (refObj o backPointer) e per ogni resource chiama la muse
+(* prende un resource_set, una vvar (primo el. di assl) a cui associare la posizione, e la relazione (refObj o backPointer) e per ogni resource chiama la muse
NOTA: "rop" per ora non viene usato perche' vale sempre "ExactOp" *)
-let relation_galax_ex inv rop path rset attl =
- List.stable_sort (fun (uri1,l1) (uri2,l2) -> compare uri1 uri2) (List.concat (List.map (muse path attl) rset))
+let relation_galax_ex inv rop path rset assl = []
+
+(*
+ List.stable_sort (fun (uri1,l1) (uri2,l2) -> compare uri1 uri2) (List.concat (List.map (muse path assl) rset))
+*)
projects / helm.git / commitdiff