module U = NUri
module K = U.UriHash
module C = Cps
-module J = Marks
module N = Level
module E = Entity
module G = Options
let l = if !G.cc then match y, d with
| true, _ -> N.one
| _ , 0 -> N.one
- | _ , 1 -> N.unknown st.S.lenv (J.new_mark ())
+ | _ , 1 -> N.unknown st.S.lenv
| _ , 2 -> N.two
| _ -> assert false
else N.infinite
in
complete_qid f lst (name, true, [])
in
- get_cnt_relaxed f lst
+ get_cnt_relaxed (D.sta f) lst
| A.Def (name, w, trans, v) ->
let f lenv =
let f qid =