X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Fsoftware%2Fhelena%2Fsrc%2Fbasic_ag%2FbagOutput.ml;h=689423167690dba237ec4d46e605e1bdc94aaae4;hb=88977b2d546e547e23b046792fe2ad8f6ff192a4;hp=feebca464a05bf92fbd2af4d78381dd639511e7a;hpb=95872555aaa040a22ad2d93cb1278f79e20da70c;p=helm.git diff --git a/helm/software/helena/src/basic_ag/bagOutput.ml b/helm/software/helena/src/basic_ag/bagOutput.ml index feebca464..689423167 100644 --- a/helm/software/helena/src/basic_ag/bagOutput.ml +++ b/helm/software/helena/src/basic_ag/bagOutput.ml @@ -9,14 +9,14 @@ \ / This software is distributed as is, NO WARRANTY. V_______________________________________________________________ *) -module P = Printf -module F = Format +module KP = Printf + module U = NUri module L = Log +module P = Marks module G = Options -module E = Entity -module J = Marks module H = Hierarchy +module E = Entity module XD = XmlCrg module Z = Bag module ZD = BagCrg @@ -33,11 +33,15 @@ type counters = { tabbrs: int } +let level = 2 + let initial_counters = { eabsts = 0; eabbrs = 0; tsorts = 0; tlrefs = 0; tgrefs = 0; tcasts = 0; tappls = 0; tabsts = 0; tabbrs = 0 } +IFDEF SUMMARY THEN + let rec count_term_binder f c = function | Z.Abst w -> let c = {c with tabsts = succ c.tabsts} in @@ -67,13 +71,13 @@ and count_term f c = function count_term f c t let count_entity f c = function - | _, _, E.Abst (_, w) -> + | _, _, _, E.Abst (_, w) -> let c = {c with eabsts = succ c.eabsts} in count_term f c w - | _, _, E.Abbr v -> + | _, _, _, E.Abbr (_, v) -> let c = {c with eabbrs = succ c.eabbrs} in count_term f c v - | _, _, E.Void -> assert false + | _, _, _, E.Void -> assert false let print_counters f c = let terms = @@ -81,79 +85,85 @@ let print_counters f c = c.tabbrs in let items = c.eabsts + c.eabbrs in - let locations = J.locations () in - L.warn (P.sprintf " Kernel representation summary (basic_ag)"); - L.warn (P.sprintf " Total entry items: %7u" items); - L.warn (P.sprintf " Declaration items: %7u" c.eabsts); - L.warn (P.sprintf " Definition items: %7u" c.eabbrs); - L.warn (P.sprintf " Total term items: %7u" terms); - L.warn (P.sprintf " Sort items: %7u" c.tsorts); - L.warn (P.sprintf " Local reference items: %7u" c.tlrefs); - L.warn (P.sprintf " Global reference items: %7u" c.tgrefs); - L.warn (P.sprintf " Explicit Cast items: %7u" c.tcasts); - L.warn (P.sprintf " Application items: %7u" c.tappls); - L.warn (P.sprintf " Abstraction items: %7u" c.tabsts); - L.warn (P.sprintf " Abbreviation items: %7u" c.tabbrs); - L.warn (P.sprintf " Total binder locations: %7u" locations); + let locations = P.marks () in + L.warn level (KP.sprintf "Kernel representation summary (basic_ag)"); + L.warn level (KP.sprintf " Total entry items: %7u" items); + L.warn level (KP.sprintf " Declaration items: %7u" c.eabsts); + L.warn level (KP.sprintf " Definition items: %7u" c.eabbrs); + L.warn level (KP.sprintf " Total term items: %7u" terms); + L.warn level (KP.sprintf " Sort items: %7u" c.tsorts); + L.warn level (KP.sprintf " Local reference items: %7u" c.tlrefs); + L.warn level (KP.sprintf " Global reference items: %7u" c.tgrefs); + L.warn level (KP.sprintf " Explicit Cast items: %7u" c.tcasts); + L.warn level (KP.sprintf " Application items: %7u" c.tappls); + L.warn level (KP.sprintf " Abstraction items: %7u" c.tabsts); + L.warn level (KP.sprintf " Abbreviation items: %7u" c.tabbrs); + L.warn level (KP.sprintf " Total binder locations: %7u" locations); f () -let name err frm a = +END + +let name err och a = let f n = function - | true -> F.fprintf frm "%s" n - | false -> F.fprintf frm "-%s" n + | true -> KP.fprintf och "%s" n + | false -> KP.fprintf och "-%s" n in E.name err f a -let res a l frm = - let err () = F.fprintf frm "@[#%u@]" l in - if !G.indexes then err () else name err frm a +let res a l och = + let err () = KP.fprintf och "#%s" (P.string_of_mark l) in + if !G.indexes then err () else name err och a -let rec pp_term c frm = function - | Z.Sort h -> - let err () = F.fprintf frm "@[*%u@]" h in - let f s = F.fprintf frm "@[%s@]" s in +let rec pp_term st c och = function + | Z.Sort h -> + let err () = KP.fprintf och "*%u" h in + let f s = KP.fprintf och "%s" s in H.string_of_sort err f h - | Z.LRef i -> - let err () = F.fprintf frm "@[#%u@]" i in - let f a _ = name err frm a in + | Z.LRef i -> + let err () = KP.fprintf och "#%s" (P.string_of_mark i) in + let f a _ = name err och a in if !G.indexes then err () else Z.get err f c i - | Z.GRef s -> F.fprintf frm "@[$%s@]" (U.string_of_uri s) - | Z.Cast (u, t) -> - F.fprintf frm "@[{%a}.%a@]" (pp_term c) u (pp_term c) t - | Z.Appl (v, t) -> - F.fprintf frm "@[(%a).%a@]" (pp_term c) v (pp_term c) t - | Z.Bind (a, l, Z.Abst w, t) -> + | Z.GRef s -> KP.fprintf och "$%s" (U.string_of_uri s) + | Z.Cast (u, t) -> + KP.fprintf och "{%a}.%a" (pp_term st c) u (pp_term st c) t + | Z.Appl (v, t) -> + KP.fprintf och "(%a).%a" (pp_term st c) v (pp_term st c) t + | Z.Bind (y, l, Z.Abst w, t) -> let f cc = - F.fprintf frm "@[[%t:%a].%a@]" (res a l) (pp_term c) w (pp_term cc) t + KP.fprintf och "[%t:%a].%a" (res y l) (pp_term st c) w (pp_term st cc) t in - Z.push "output abst" f c a l (Z.Abst w) - | Z.Bind (a, l, Z.Abbr v, t) -> + Z.push "output abst" f c y l (Z.Abst w) + | Z.Bind (y, l, Z.Abbr v, t) -> let f cc = - F.fprintf frm "@[[%t=%a].%a@]" (res a l) (pp_term c) v (pp_term cc) t + KP.fprintf och "[%t=%a].%a" (res y l) (pp_term st c) v (pp_term st cc) t in - Z.push "output abbr" f c a l (Z.Abbr v) - | Z.Bind (a, l, Z.Void, t) -> - let f cc = F.fprintf frm "@[[%t].%a@]" (res a l) (pp_term cc) t in - Z.push "output void" f c a l Z.Void - -let pp_lenv frm c = - let pp_entry frm = function - | a, l, Z.Abst w -> - F.fprintf frm "@,@[%t : %a@]" (res a l) (pp_term c) w - | a, l, Z.Abbr v -> - F.fprintf frm "@,@[%t = %a@]" (res a l) (pp_term c) v - | a, l, Z.Void -> - F.fprintf frm "@,%t" (res a l) + Z.push "output abbr" f c y l (Z.Abbr v) + | Z.Bind (y, l, Z.Void, t) -> + let f cc = KP.fprintf och "[%t].%a" (res y l) (pp_term st cc) t in + Z.push "output void" f c y l Z.Void + +let pp_lenv st och c = + let pp_entry och = function + | y, l, Z.Abst w -> + KP.fprintf och "%t : %a\n" (res y l) (pp_term st c) w + | y, l, Z.Abbr v -> + KP.fprintf och "%t = %a\n" (res y l) (pp_term st c) v + | y, l, Z.Void -> + KP.fprintf och "%t\n" (res y l) in - let iter map frm l = List.iter (map frm) l in - let f es = F.fprintf frm "%a" (iter pp_entry) (List.rev es) in + let iter map och l = List.iter (map och) l in + let f es = KP.fprintf och "%a" (iter pp_entry) (List.rev es) in Z.contents f c let specs = { L.pp_term = pp_term; L.pp_lenv = pp_lenv } +IFDEF OBJECTS THEN + (* term xml printing ********************************************************) -let export_term = - ZD.crg_of_bag XD.export_term +let export_term st = + ZD.crg_of_bag (XD.export_term st) + +END