uris = []; nodes = 0; xnodes = 0
}
+IFDEF SUMMARY THEN
+
let rec count_term_binder f c e = function
| B.Abst (_, _, w) ->
let c = {c with tabsts = succ c.tabsts; nodes = succ c.nodes} in
count_term_binder f c e b
let count_entity f c = function
- | _, _, u, E.Abst w ->
+ | _, _, u, E.Abst (_, w) ->
let c = {c with
eabsts = succ c.eabsts; nodes = succ c.nodes; uris = u :: c.uris
} in
count_term f c B.empty w
- | _, _, _, E.Abbr v ->
+ | _, _, _, E.Abbr (_, v) ->
let c = {c with eabbrs = succ c.eabbrs; xnodes = succ c.xnodes} in
count_term f c B.empty v
- | _, _, _, E.Void -> assert false
+ | _, _, _, E.Void -> assert false
let print_counters f c =
let terms =
L.warn level (KP.sprintf " + Abbreviation nodes: %7u" nodes);
f ()
+END
+
(* lenv/term pretty printing ************************************************)
let name err och a =
L.pp_term = pp_term; L.pp_lenv = pp_lenv
}
+IFDEF OBJECTS THEN
+
(* term xml printing ********************************************************)
let export_term st =
BD.crg_of_brg (XD.export_term st)
+
+END