69 cout<<
" version_ = "<<ptr->version_<<endl;
70 cout<<
" bxmask_default_ = "<<ptr->bxmask_default_<<endl;
72 size_t len_prescale_table_ = 0;
73 for(
size_t col=0;
col<ptr->prescale_table_.size();
col++){
74 size_t nRows = (ptr->prescale_table_)[
col ].
size();
75 len_prescale_table_ += nRows;
78 for(
size_t row=0; row<nRows; row++)
79 column[ row ] = (ptr->prescale_table_)[
col ][ row ];
80 cout <<
" prescale_table_[" <<
col<<
"][" << nRows <<
"] = ";
82 cout <<
hash( column,
sizeof(
int)*nRows ) << endl;
83 else cout << 0 << endl;
86 int prescale_table_[len_prescale_table_];
87 for(
size_t col=0,
pos=0;
col<ptr->prescale_table_.size();
col++){
88 size_t nRows = (ptr->prescale_table_)[
col ].
size();
89 for(
size_t row=0; row<nRows; row++,
pos++)
90 prescale_table_[
pos ] = (ptr->prescale_table_)[
col ][ row ];
92 cout <<
" prescale_table_[["<<len_prescale_table_<<
"]] = ";
93 if( len_prescale_table_ )
94 cout <<
hash( prescale_table_,
sizeof(
int)*len_prescale_table_ ) << endl;
95 else cout << 0 << endl;
98 cout << endl <<
" Detailed view on the prescales * masks: " << endl;
99 for(
size_t col=0;
col<ptr->prescale_table_.size();
col++)
100 cout << setw(8) <<
" Index " <<
col;
102 size_t nRows = (ptr->prescale_table_)[ 0 ].
size();
103 for(
size_t row=0; row<nRows; row++){
104 for(
size_t col=0;
col<ptr->prescale_table_.size();
col++)
105 cout << setw(8) << (ptr->prescale_table_)[
col ][ row ] ;
111 size_t len_bxmask_map_ = 0;
112 for(
std::map<
int, std::vector<int> >::const_iterator it = (ptr->bxmask_map_).begin(); it != (ptr->bxmask_map_).
end(); it++){
113 len_bxmask_map_ += it->second.size();
115 int masks[ it->second.size() ];
116 for(
size_t i=0;
i<it->second.size();
i++)
117 masks[
i ] = it->second[
i];
118 cout <<
" bxmask_map_[" << it->first <<
"][" << it->second.size() <<
"] = ";
119 if( !it->second.empty() )
120 cout <<
hash( masks,
sizeof(
int)*it->second.size() ) << endl;
121 else cout << 0 << endl;
124 cout <<
" bxmask_map_[" << it->first <<
"][" << it->second.size() <<
"] = ";
129 int bxmask_map_[ len_bxmask_map_ ];
131 for(
std::map<
int, std::vector<int> >::const_iterator it = (ptr->bxmask_map_).begin(); it != (ptr->bxmask_map_).
end(); it++){
132 for(
size_t i=0;
i<it->second.size();
i++,pos++) bxmask_map_[ pos ] = it->second[
i];
134 cout <<
" bxmask_map_[["<< len_bxmask_map_ <<
"]] = ";
135 if( len_bxmask_map_ )
136 cout <<
hash( bxmask_map_,
sizeof(
int)*len_bxmask_map_ ) << endl;
137 else cout << 0 << endl;
139 int veto_[ (ptr->veto_).
size() ];
140 bool veto_allZeros =
true;
141 for(
size_t i=0;
i<(ptr->veto_).
size();
i++){
142 veto_[
i] = (ptr->veto_)[
i];
143 if( veto_[
i] ) veto_allZeros =
false;
145 cout <<
" veto_[" << (ptr->veto_).
size() <<
"] = ";
147 if( !(ptr->veto_).empty() ){
148 cout <<
hash( veto_,
sizeof(
int)*(ptr->veto_).size() );
149 if( veto_allZeros )
cout <<
" (all zeros)" << endl;
151 }
else cout << 0 << endl;
153 for(
size_t i=0;
i<(ptr->veto_).
size() ;
i++)
cout << veto_[
i] << endl;
155 int exp_ints_[ (ptr->exp_ints_).
size() ];
156 for(
size_t i=0;
i<(ptr->exp_ints_).
size();
i++) exp_ints_[
i] = (ptr->exp_ints_)[
i];
157 cout <<
" exp_ints_[" << (ptr->exp_ints_).
size() <<
"] = ";
158 if( !(ptr->exp_ints_).empty() )
159 cout <<
hash( exp_ints_,
sizeof(
int)*(ptr->exp_ints_).
size() ) << endl;
160 else cout << 0 << endl;
162 int exp_doubles_[ (ptr->exp_doubles_).
size() ];
163 for(
size_t i=0;
i<(ptr->exp_doubles_).
size();
i++) exp_ints_[
i] = (ptr->exp_doubles_)[
i];
164 cout <<
" exp_doubles_[" << (ptr->exp_doubles_).
size() <<
"] = ";
165 if( !(ptr->exp_doubles_).empty() )
166 cout <<
hash( exp_doubles_,
sizeof(
int)*(ptr->exp_doubles_).
size() ) << endl;
167 else cout << 0 << endl;
int32_t prescale_table_verbosity
int32_t bxmask_map_verbosity
std::string hash(void *buf, size_t len) const
T const * product() const