let reset_spent_time () = time_spent := 0.0;;
let get_spent_time () = !time_spent ;;
-let begin_spending () =
+let begin_spending () = ()
(*assert (!partial = 0.0);*)
- partial := Unix.gettimeofday ()
+(* partial := Unix.gettimeofday () *)
;;
-let end_spending () =
+let end_spending () = ()
+(*
assert (!partial > 0.0);
let interval = (Unix.gettimeofday ()) -. !partial in
partial := 0.0;
time_spent := !time_spent +. interval
+*)
;;
raise (UniverseInconsistency s)
-let fill_empty_nodes_with_uri (g, already_contained) l uri =
+let fill_empty_nodes_with_uri (g, already_contained,o) l uri =
let fill_empty_universe u =
match u with
(i,None) -> (i,Some uri)
MAL.add (fill_empty_universe k) (fill_empty_entry v) m) m MAL.empty
in
let l' = List.map fill_empty_universe l in
- (m', already_contained),l'
+ (m', already_contained,o),l'
(*****************************************************************************)
(** World interface **)
(*****************************************************************************)
-type universe_graph = bag * UriManager.UriSet.t
-(* the graph , the cache of already merged ugraphs *)
+type universe_graph = bag * UriManager.UriSet.t * bool
+(* the graph , the cache of already merged ugraphs, oblivion? *)
-let empty_ugraph = empty_bag, UriManager.UriSet.empty
+let empty_ugraph = empty_bag, UriManager.UriSet.empty, false
+let oblivion_ugraph = empty_bag, UriManager.UriSet.empty, true
let current_index_anon = ref (-1)
let current_index_named = ref (-1)
let name_universe u uri =
match u with
| (i, None) -> (i, Some uri)
- | _ -> u
+ | (i, Some ouri) ->
+ (* inside obj living at uri 'uri' should live only
+ * universes with uri None. Call Unshare.unshare ~fresh_univs:true
+ * if you want to reuse a Type in another object *)
+ prerr_endline ("Offending universe: " ^ string_of_universe u^
+ " found inside object " ^ UriManager.string_of_uri uri);
+ assert false
+;;
-let print_ugraph (g, _) =
+let print_ugraph (g, _, o) =
+ if o then prerr_endline "oblivion universe" else
prerr_endline (string_of_bag g)
let add_eq ?(fast=(!fast_implementation)) u v b =
(** START: Decomment this for performance comparisons **)
(*****************************************************************************)
-let add_eq ?(fast=(!fast_implementation)) u v (b,already_contained) =
+let add_eq ?(fast=(!fast_implementation)) u v (b,already_contained,oblivion) =
+ if oblivion then (b,already_contained,oblivion) else
(*prerr_endline "add_eq";*)
- begin_spending ();
+ (begin_spending ();
let rc = add_eq ~fast u v b in
end_spending ();
- rc,already_contained
+ rc,already_contained,false)
-let add_ge ?(fast=(!fast_implementation)) u v (b,already_contained) =
+let add_ge ?(fast=(!fast_implementation)) u v (b,already_contained,oblivion) =
+ if oblivion then (b,already_contained,oblivion) else
(* prerr_endline "add_ge"; *)
- begin_spending ();
+ (begin_spending ();
let rc = add_ge ~fast u v b in
end_spending ();
- rc,already_contained
+ rc,already_contained,false)
-let add_gt ?(fast=(!fast_implementation)) u v (b,already_contained) =
+let add_gt ?(fast=(!fast_implementation)) u v (b,already_contained,oblivion) =
+ if oblivion then (b,already_contained,oblivion) else
(* prerr_endline "add_gt"; *)
- begin_spending ();
+ (begin_spending ();
let rc = add_gt ~fast u v b in
end_spending ();
- rc,already_contained
+ rc,already_contained,false)
(* profiling code
let profiler_eq = HExtlib.profile "CicUniv.add_eq"
profiler_eq.HExtlib.profile (fun _ -> add_eq ?fast u v b) ()
*)
+(* ugly *)
+let rank = ref MAL.empty;;
+
+let do_rank (b,_,_) =
+
+ let keys = MAL.fold (fun k _ acc -> k::acc) b [] in
+ let fall =
+ List.fold_left
+ (fun acc u ->
+ let rec aux seen = function
+ | [] -> 0, seen
+ | x::tl when SOF.mem x seen -> aux seen tl
+ | x::tl ->
+ let seen = SOF.add x seen in
+ let t1, seen = aux seen (SOF.elements (repr x b).one_s_eq) in
+ let t2, seen = aux seen (SOF.elements (repr x b).one_s_ge) in
+ let t3, seen = aux seen (SOF.elements (repr x b).one_s_gt) in
+ let t4, seen = aux seen tl in
+ max (max t1 t2)
+ (max (if SOF.is_empty (repr x b).one_s_gt then 0 else t3+1) t4),
+ seen
+ in
+ let rank, _ = aux SOF.empty [u] in
+ MAL.add u rank acc)
+ MAL.empty
+ in
+ rank := fall keys;
+ MAL.iter
+ (fun k v ->
+ prerr_endline (string_of_universe k ^ " = " ^ string_of_int v)) !rank
+;;
+
+let get_rank u =
+ try MAL.find u !rank
+ with Not_found -> 0
+ (* if the universe is not in the graph it means there are
+ * no contraints on it! thus it can be freely set to Type0 *)
+;;
+
(*****************************************************************************)
(** END: Decomment this for performance comparisons **)
(*****************************************************************************)
-let merge_ugraphs ~base_ugraph ~increment:(increment, uri_of_increment) =
- let merge_brutal (u,_) v =
+(* TODO: uncomment l to gain a small speedup *)
+let merge_ugraphs ~base_ugraph ~increment:(increment, uri_of_increment(*,l*)) =
+ let merge_brutal (u,a,_) v =
+(* prerr_endline ("merging graph: "^UriManager.string_of_uri
+ * uri_of_increment); *)
let m1 = u in
let m2 = v in
MAL.fold (
fun u x ->
let m = add_eq k u x in m)
(SOF.union v.one_s_eq v.eq_closure) x)))
- ) m1 m2
+ ) m1 m2
in
- let base, already_contained = base_ugraph in
- if MAL.is_empty base then
+ let base, already_contained, oblivion = base_ugraph in
+ let inc,_,oblivion2 = increment in
+ if oblivion then
+ base_ugraph
+ else if oblivion2 then
+ increment
+ else if MAL.is_empty base then
increment
else if
- MAL.is_empty (fst increment) ||
+ MAL.is_empty inc ||
UriManager.UriSet.mem uri_of_increment already_contained
then
base_ugraph
- else
- fst (merge_brutal increment base_ugraph),
- UriManager.UriSet.add uri_of_increment already_contained
+ else
+ (fun (x,_,_) -> x) (merge_brutal increment base_ugraph),
+(*
+ List.fold_right UriManager.UriSet.add
+ (List.map (fun (_,x) -> HExtlib.unopt x) l)
+*)
+ (UriManager.UriSet.add uri_of_increment already_contained), false
(* profiling code; WARNING: the time spent during profiling can be
greater than the profiled time
let content = xml_of_entry_content e in
ent content
-let write_xml_of_ugraph filename (m,_) l =
+let write_xml_of_ugraph filename (m,_,_) l =
let tokens =
[<
Xml.xml_cdata "<?xml version=\"1.0\" encoding=\"ISO-8859-1\"?>\n";
let univno = fst
-let rec clean_ugraph (m,already_contained) f =
+let rec clean_ugraph m already_contained f =
let m' =
MAL.fold (fun k v x -> if (f k) then MAL.add k v x else x ) m MAL.empty in
let m'' = MAL.fold (fun k v x ->
in
if e_l != [] then
clean_ugraph
- (m'', already_contained) (fun u -> (f u) && not (List.mem u e_l))
+ m'' already_contained (fun u -> (f u) && not (List.mem u e_l))
else
MAL.fold
(fun k v x -> if v <> empty_entry then MAL.add k v x else x)
m'' MAL.empty,
already_contained
-let clean_ugraph g l =
- clean_ugraph g (fun u -> List.mem u l)
+let clean_ugraph (m,a,o) l =
+ assert(not o);
+ let m, a = clean_ugraph m a (fun u -> List.mem u l) in
+ m, a, o
let assigner_of =
function
let xml_source = `Gzip_file filename in
(try XPP.parse xml_parser xml_source
with (XPP.Parse_error err) as exn -> raise exn);
- (!result_map,UriManager.UriSet.empty), !result_list
+ (!result_map,UriManager.UriSet.empty,false), !result_list
\f
(*****************************************************************************)
one_s_gt = recons_set entry.one_s_gt;
}
-let recons_graph (graph,uriset) =
+let recons_graph (graph,uriset,o) =
MAL.fold
(fun universe entry map ->
MAL.add (recons_univ universe) (recons_entry entry) map)
(fun u acc ->
UriManager.UriSet.add
(UriManager.uri_of_string (UriManager.string_of_uri u)) acc)
- uriset UriManager.UriSet.empty
+ uriset UriManager.UriSet.empty, o
let assert_univ u =
match u with
raise (UniverseInconsistency (lazy "This universe graph has a hole"))
| _ -> ()
-let assert_univs_have_uri (graph,_) univlist =
+let assert_univs_have_uri (graph,_,_) univlist =
let assert_set s =
SOF.iter (fun u -> assert_univ u) s
in
| Some uri1, Some uri2 -> UriManager.compare uri1 uri2
else
cmp
+
+let is_anon = function (_,None) -> true | _ -> false
(* EOF *)
projects / helm.git / blobdiff