1 # This file is part of NIT ( http://www.nitlanguage.org ).
3 # Licensed under the Apache License, Version 2.0 (the "License");
4 # you may not use this file except in compliance with the License.
5 # You may obtain a copy of the License at
7 # http://www.apache.org/licenses/LICENSE-2.0
9 # Unless required by applicable law or agreed to in writing, software
10 # distributed under the License is distributed on an "AS IS" BASIS,
11 # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 # See the License for the specific language governing permissions and
13 # limitations under the License.
15 # Simple numerical statistical analysis and presentation
20 # A counter counts occurrences of things
21 # Use this instead of a `HashMap[E, Int]`
22 class Counter[E
: Object]
25 # Total number of counted occurrences
28 private var map
= new HashMap[E
, Int]
30 # The number of counted occurrences of `e`
31 redef fun [](e
: E
): Int
34 if map
.has_key
(e
) then return map
[e
]
38 redef fun []=(e
: E
, value
: Int)
45 redef fun keys
do return map
.keys
47 redef fun values
do return map
.values
49 # Count one more occurrence of `e`
52 self.map
[e
] = self[e
] + 1
56 # Return an array of elements sorted by occurrences
59 var res
= map
.keys
.to_a
60 var sorter
= new CounterSorter[E
](self)
65 # The method used to display an element
66 # @toimplement by default just call `to_s` on the element
67 protected fun element_to_s
(e
: E
): String
72 # Display statistical information
76 print
" population: {list.length}"
77 if list
.is_empty
then return
78 print
" minimum value: {self[list.first]}"
79 print
" maximum value: {self[list.last]}"
80 print
" total value: {self.total}"
81 print
" average value: {div(self.total,list.length)}"
82 print
" distribution:"
85 var limit
= self[list
.first
]
87 if self[t
] > limit
then
88 print
" <={limit}: sub-population={count} ({div(count*100,list.length)}%); cumulated value={sum} ({div(sum*100,self.total)}%)"
91 while self[t
] > limit
do
93 if limit
== 0 then limit
= 1
99 print
" <={limit}: sub-population={count} ({div(count*100,list.length)}%); cumulated value={sum} ({div(sum*100,self.total)}%)"
102 # Display up to `count` most used elements and `count` least used elements
103 # Use `element_to_s` to display the element
104 fun print_elements
(count
: Int)
109 if list
.length
<= count
*2 then min
= list
.length
111 var t
= list
[list
.length-i-1
]
112 print
" {element_to_s(t)}: {self[t]} ({div(self[t]*100,self.total)}%)"
114 if list
.length
<= count
*2 then return
117 var t
= list
[min-i-1
]
118 print
" {element_to_s(t)}: {self[t]} ({div(self[t]*100,self.total)}%)"
123 private class CounterSorter[E
: Object]
124 super AbstractSorter[E
]
125 var counter
: Counter[E
]
126 redef fun compare
(a
,b
) do return self.counter
.map
[a
] <=> self.counter
.map
[b
]
130 private fun show_counter
(c
: Counter[Int])
133 (new ComparableSorter[Int]).sort
(list
)
135 print
" {e} -> {c[e]} times ({div(c[e]*100, c.total)}%)"
139 # Display exhaustive metrics about the poset
142 var nb_greaters
= new Counter[E
]
143 var nb_direct_greaters
= new Counter[E
]
144 var nb_smallers
= new Counter[E
]
145 var nb_direct_smallers
= new Counter[E
]
146 var nb_direct_edges
= 0
150 nb_edges
+= ne
.greaters
.length
151 nb_direct_edges
+= ne
.direct_greaters
.length
152 nb_greaters
[n
] = ne
.greaters
.length
153 nb_direct_greaters
[n
] = ne
.direct_greaters
.length
154 nb_smallers
[n
] = ne
.smallers
.length
155 nb_direct_smallers
[n
] = ne
.direct_smallers
.length
157 print
"Number of nodes: {self.length}"
158 print
"Number of edges: {nb_edges} ({div(nb_edges,self.length)} per node)"
159 print
"Number of direct edges: {nb_direct_edges} ({div(nb_direct_edges,self.length)} per node)"
160 print
"Distribution of greaters"
161 nb_greaters
.print_summary
162 print
"Distribution of direct greaters"
163 nb_direct_greaters
.print_summary
164 print
"Distribution of smallers"
165 nb_smallers
.print_summary
166 print
"Distribution of direct smallers"
167 nb_direct_smallers
.print_summary
171 # Helper function to display `n/d` and handle division by 0
172 fun div
(n
: Int, d
: Int): String
174 if d
== 0 then return "na"
175 return ((100*n
/d
).to_f
/100.0).to_precision
(2)