- some bugfix

[helm.git] / helm / software / lambda-delta / src / toplevel / metaOutput.ml

diff --git a/helm/software/lambda-delta/src/toplevel/metaOutput.ml b/helm/software/lambda-delta/src/toplevel/metaOutput.ml
deleted file mode 100644 (file)
index 73ff70e..0000000
--- a/helm/software/lambda-delta/src/toplevel/metaOutput.ml
+++ /dev/null
@@ -1,108 +0,0 @@
-(*
-    ||M||  This file is part of HELM, an Hypertextual, Electronic        
-    ||A||  Library of Mathematics, developed at the Computer Science     
-    ||T||  Department, University of Bologna, Italy.                     
-    ||I||                                                                
-    ||T||  HELM is free software; you can redistribute it and/or         
-    ||A||  modify it under the terms of the GNU General Public License   
-    \   /  version 2 or (at your option) any later version.              
-     \ /   This software is distributed as is, NO WARRANTY.              
-      V_______________________________________________________________ *)
-
-module P = Printf
-module F = Format
-module U = NUri
-module C = Cps
-module L = Log
-module E = Entity
-module M = Meta
-
-type counters = {
-   eabsts: int;
-   eabbrs: int;
-   pabsts: int;    
-   tsorts: int;
-   tlrefs: int;
-   tgrefs: int;
-   pappls: int;
-   tappls: int;
-   tabsts: int;
-   uris  : U.uri list;
-   nodes : int;
-   xnodes: int
-}
-
-let initial_counters = {
-   eabsts = 0; eabbrs = 0; pabsts = 0; pappls = 0;
-   tsorts = 0; tlrefs = 0; tgrefs = 0; tappls = 0; tabsts = 0;
-   uris = []; nodes = 0; xnodes = 0
-}
-
-let rec count_term f c = function
-   | M.Sort _          -> 
-      f {c with tsorts = succ c.tsorts; nodes = succ c.nodes}
-   | M.LRef _          -> 
-      f {c with tlrefs = succ c.tlrefs; nodes = succ c.nodes}
-   | M.GRef (_, u, ts) -> 
-      let c = {c with tgrefs = succ c.tgrefs} in
-      let c = {c with pappls = c.pappls + List.length ts} in
-      let c = {c with nodes = c.nodes + List.length ts} in
-      let c =    
-        if Cps.list_mem ~eq:U.eq u c.uris
-        then {c with nodes = succ c.nodes}
-        else {c with xnodes = succ c.xnodes}
-      in
-      Cps.list_fold_left f count_term c ts
-   | M.Appl (v, t)     -> 
-      let c = {c with tappls = succ c.tappls; nodes = succ c.nodes} in
-      let f c = count_term f c t in
-      count_term f c v
-   | M.Abst (_, w, t)  -> 
-      let c = {c with tabsts = succ c.tabsts; nodes = succ c.nodes} in
-      let f c = count_term f c t in
-      count_term f c w
-
-let count_par f c (_, w) = count_term f c w
-
-let count_xterm f c = function
-   | None   -> f c
-   | Some v -> count_term f c v
-
-let count_entity f c = function
-   | _, u, E.Abst (_, (pars, w, xv)) ->
-      let c = {c with eabsts = succ c.eabsts} in
-      let c = {c with pabsts = c.pabsts + List.length pars} in
-      let c = {c with uris = u :: c.uris; nodes = succ c.nodes + List.length pars} in
-      let f c = count_xterm f c xv in      
-      let f c = count_term f c w in
-      Cps.list_fold_left f count_par c pars   
-   | _, _, E.Abbr (pars, w, xv)      ->
-      let c = {c with eabbrs = succ c.eabbrs; xnodes = succ c.xnodes} in
-      let c = {c with pabsts = c.pabsts + List.length pars} in
-      let c = {c with nodes = c.nodes + List.length pars} in
-      let f c = count_xterm f c xv in
-      let f c = count_term f c w in
-      Cps.list_fold_left f count_par c pars
-   | _, _, E.Void                    -> assert false
-
-let print_counters f c =
-   let terms = c.tsorts + c.tlrefs + c.tgrefs + c.tappls + c.tabsts in
-   let pars = c.pabsts + c.pappls in
-   let entries = c.eabsts + c.eabbrs in
-   let nodes = c.nodes + c.xnodes in
-   L.warn (P.sprintf "  Intermediate representation summary (meta)");
-   L.warn (P.sprintf "    Total entries:            %7u" entries);
-   L.warn (P.sprintf "      Declaration items:      %7u" c.eabsts);
-   L.warn (P.sprintf "      Definition items:       %7u" c.eabbrs);
-   L.warn (P.sprintf "    Total parameter items:    %7u" pars);
-   L.warn (P.sprintf "      Application items:      %7u" c.pappls);
-   L.warn (P.sprintf "      Abstraction items:      %7u" c.pabsts);
-   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 "      Application items:      %7u" c.tappls);
-   L.warn (P.sprintf "      Abstraction items:      %7u" c.tabsts);
-   L.warn (P.sprintf "    Global Int. Complexity:   %7u" c.nodes);
-   L.warn (P.sprintf "      + Abbreviation nodes:   %7u" nodes);
-   f ()