in
rank := fall keys;
let res = ref [] in
+ let resk = ref [] in
MAL.iter
(fun k v ->
- if not (List.mem v !res) then res := v::!res;
- prerr_endline (string_of_universe k ^ " = " ^ string_of_int v)) !rank;
- !res
+ if not (List.mem v !res) then res := v::!res;
+ resk := k :: !resk) !rank;
+ !res, !resk
;;
let get_rank u =
val add_gt:
universe -> universe -> universe_graph -> universe_graph
-val do_rank: universe_graph -> int list
+val do_rank: universe_graph -> int list * universe list
val get_rank: universe -> int
(*
try load_graph u with exn -> ())
roots_alluris;
prerr_endline "finished....";
- let lll = List.sort compare (CicUniv.do_rank (get_graph ())) in
+ let lll,uuu = List.sort compare (CicUniv.do_rank (get_graph ())) in
+ List.iter (fun k ->
+ prerr_endline (string_of_universe k ^ " = " ^ string_of_int (Cicuniv.get_rank k))) uuu
+ in
let _ =
try
let rec aux = function