parser: `Visitor::visit` does not accepts `null`

[nit.git] / src / counter.nit

diff --git a/src/counter.nit b/src/counter.nit
index a9621fe..6db5c2b 100644 (file)
--- a/src/counter.nit
+++ b/src/counter.nit
@@ -15,6 +15,8 @@
 # Simple numerical statistical analysis and presentation
 module counter
 
+import poset
+
 # A counter counts occurrences of things
 # Use this instead of a HashMap[E, Int]
 class Counter[E: Object]
@@ -61,6 +63,13 @@ class Counter[E: Object]
                return res
        end
 
+       # The method used to display an element
+       # @toimplement by default just call `to_s` on the element
+       protected fun element_to_s(e: E): String
+       do
+               do return e.to_s
+       end
+
        # Display statistical information
        fun print_summary
        do
@@ -90,6 +99,27 @@ class Counter[E: Object]
                end
                print "  <={limit}: sub-population={count} ({div(count*100,list.length)}%); cumulated value={sum} ({div(sum*100,self.total)}%)"
        end
+
+       # Display up to `count` most used elements and `count` least used elements
+       # Use `element_to_s` to display the element
+       fun print_elements(count: Int)
+       do
+               # Display most used types (ie the last of `types')
+               print " list:"
+               var list = self.sort
+               var min = count
+               if list.length <= count*2 then min = list.length
+               for i in [0..min[ do
+                       var t = list[list.length-i-1]
+                       print "  {element_to_s(t)}: {self[t]} ({div(self[t]*100,self.total)}%)"
+               end
+               if list.length <= count*2 then return
+               print "  ..."
+               for i in [0..min[ do
+                       var t = list[min-i-1]
+                       print "  {element_to_s(t)}: {self[t]} ({div(self[t]*100,self.total)}%)"
+               end
+       end
 end
 
 private class CounterSorter[E: Object]
@@ -98,6 +128,48 @@ private class CounterSorter[E: Object]
        redef fun compare(a,b) do return self.counter.map[a] <=> self.counter.map[b]
 end
 
+redef class POSet[E]
+       private fun show_counter(c: Counter[Int])
+       do
+               var list = c.sort
+               (new ComparableSorter[Int]).sort(list)
+               for e in list do
+                       print " {e} -> {c[e]} times ({div(c[e]*100, c.total)}%)"
+               end
+       end
+
+       # Display exhaustive metrics about the poset
+       fun print_metrics
+       do
+               var nb_greaters = new Counter[E]
+               var nb_direct_greaters = new Counter[E]
+               var nb_smallers = new Counter[E]
+               var nb_direct_smallers = new Counter[E]
+               var nb_direct_edges = 0
+               var nb_edges = 0
+               for n in self do
+                       var ne = self[n]
+                       nb_edges += ne.greaters.length
+                       nb_direct_edges += ne.direct_greaters.length
+                       nb_greaters[n] = ne.greaters.length
+                       nb_direct_greaters[n] = ne.direct_greaters.length
+                       nb_smallers[n] = ne.smallers.length
+                       nb_direct_smallers[n] = ne.direct_smallers.length
+               end
+               print "Number of nodes: {self.length}"
+               print "Number of edges: {nb_edges} ({div(nb_edges,self.length)} per node)"
+               print "Number of direct edges: {nb_direct_edges} ({div(nb_direct_edges,self.length)} per node)"
+               print "Distribution of greaters"
+               nb_greaters.print_summary
+               print "Distribution of direct greaters"
+               nb_direct_greaters.print_summary
+               print "Distribution of smallers"
+               nb_smallers.print_summary
+               print "Distribution of direct smallers"
+               nb_direct_smallers.print_summary
+       end
+end
+
 # Helper function to display n/d and handle division by 0
 fun div(n: Int, d: Int): String
 do