let compare = Pervasives.compare
end
module S = Set.Make(Codomain)
-module TI = Discrimination_tree.Make(Discrimination_tree.CicIndexable)(S)
+module TI = Discrimination_tree.Make(Cic_indexable.CicIndexable)(S)
type universe = TI.t
-let empty = TI.empty
+let empty = TI.empty ;;
+
+let iter u f =
+ TI.iter u
+ (fun p s -> f p (S.elements s))
;;
let get_candidates univ ty =