40#include "EST_multistats.h"
49 for (i = 0, p =
lex.head(); p!=0; p = p->next(), ++i)
53 cerr <<
"Item " << name <<
" not found in word list\n";
64 for (p = list.
list.head(); p!=0; p = p->next())
68 if ((n != -1) && (
m != -1))
69 a(
m, n) = a(
m, n) + 1;
89 for (i = 0; i < n; ++i)
92 for (
j = 0;
j < n; ++
j)
96 for (
j = 0;
j < n; ++
j)
99 for (i = 0; i < n; ++i)
103 for (i = 0; i < n; ++i)
112 for (p =
lex.head(); p != 0; p = p->next())
116 cout <<
lex(p).before(3) <<
" ";
120 for (p =
lex.head(), i = 0; i < n; ++i, p = p->next())
124 for (
j = 0;
j < n; ++
j)
128 cout.setf(ios::right);
129 cout.setf(ios::fixed, ios::floatfield);
130 cout << ( (int) a(i,
j) ) <<
" ";
135 cout.setf(ios::right);
136 cout <<
"[" << ((int)a(i, i)) <<
"/" << ((
int)
row_total(i)) <<
"]";
139 cout.setf(ios::right);
147 for (
j = 0;
j < n; ++
j)
166 cout <<
"total " << ((int)t) <<
" correct " << s <<
" "
EST_TList< EST_TKVI< K, V > > list
Linked list of key-val pairs. Don't use this as it will be made private in the future.
const V & val(const K &rkey, bool m=0) const
return value according to key (const)
const K & key(EST_Litem *ptr, int m=1) const
find key, reference by ptr
int num_rows() const
return number of rows