61 for (Leaves::const_iterator
i=leaves.
begin();
i != leaves.
end();
i++ ) {
67 if ( j == m_info.end() ) {
70 (*j).second.count = 0;
71 (*j).second.id = m_info.size();
74 m_curr[id].id = m_info[id].id;
75 m_curr[id].count = explore(pReg);
95 log <<
MSG::ALWAYS <<
"== BEGIN ============= Access list content:" << m_info.size() <<
endmsg;
98 log <<
"== ITEM == " <<
right <<
setw(4) <<
dec << info.
id <<
" clid:"
104 if ( c != m_corr.end() ) {
106 log <<
"== CORRELATIONS:" << (*c).second.size() <<
endmsg;
108 if ( (*k).second > 0 ) {
109 log <<
dec << (*k).first <<
":" << (*k).second <<
" ";
116 if ( cnt > 0 ) log <<
endmsg;
119 if ( l != m_links.end() ) {
121 log <<
"== LINKS:" << (*l).second.size() <<
endmsg;
123 if ( (*k).second > 0 ) {
124 log <<
dec << (*k).first <<
":" << (*k).second <<
" ";
131 if ( cnt > 0 ) log <<
endmsg;
134 log <<
MSG::ALWAYS <<
"== END =============== Access list content:" << m_info.size() <<
endmsg;
145 m_curr[
"/Event"].count = explore(root->
registry());
146 m_curr[
"/Event"].clid = root->
clID();
147 m_curr[
"/Event"].id = m_curr.size();
153 const string& nam = (*i).first;
156 if ( c == m_corr.end() ) {
158 c = m_corr.
find(nam);
163 if ( k==(*c).second.
end() ) (*c).second[li.
id] = 0;
164 ++((*c).second[li.
id]);
168 if ( c == m_links.end() ) {
170 c = m_links.
find(nam);
172 if ( m_curr.find(nam) != m_curr.end() ) {
176 for(
long l=0;
l<m->
size(); ++
l) {
180 if ( il != m_curr.end() ) {
184 if ( k==(*c).second.
end() ) (*c).second[li.
id] = 0;
185 ++((*c).second[li.
id]);