#include <lumiList.h>
|
| lumiList (bool b=true) |
|
| ~lumiList () |
|
void | setterse (bool b) |
|
void | addRange (int run, int start, int stop) |
| add a lumi block range for a given run More...
|
|
bool | inRange (int run, int lb) |
| is this run, lumiblock in any of the ranges? if the run is not in the list, it is assumed that all events from that run are required
More...
|
|
void | sort () |
| sort the runs by the number of good lumi blocks More...
|
|
Definition at line 27 of file lumiList.h.
◆ const_iterator
◆ full_type
◆ iterator
iterators over the full map
Definition at line 35 of file lumiList.h.
◆ lumiList()
lumiList::lumiList |
( |
bool |
b = true | ) |
|
|
inline |
◆ ~lumiList()
◆ addRange()
void lumiList::addRange |
( |
int |
run, |
|
|
int |
start, |
|
|
int |
stop |
|
) |
| |
|
inline |
add a lumi block range for a given run
Definition at line 48 of file lumiList.h.
53 std::pair< iterator, bool > in = insert( std::pair<int, grl_run >(
run,
grl_run(
run ) ) );
59 if ( !
m_terse ) std::cout <<
"lumiList::addRange() run " <<
run <<
";\t" <<
start <<
" - " <<
stop << std::endl;
◆ inRange()
bool lumiList::inRange |
( |
int |
run, |
|
|
int |
lb |
|
) |
| |
|
inline |
is this run, lumiblock in any of the ranges? if the run is not in the list, it is assumed that all events from that run are required
Definition at line 67 of file lumiList.h.
71 if ( itr ==
end() )
return true;
74 for (
unsigned i=0 ;
i<
v.size() ;
i++ ) {
◆ setterse()
void lumiList::setterse |
( |
bool |
b | ) |
|
|
inline |
◆ sort()
sort the runs by the number of good lumi blocks
sort the vector
print out
Definition at line 83 of file lumiList.h.
85 std::cout <<
"lumiList::sort() sorting ..." << std::endl;
87 std::vector< const grl_run* >
vec;
91 while ( itr!=
end() ) {
92 vec.push_back( &(itr->second) );
102 for (
unsigned i=
vec.size() ;
i-- ; ) total +=
vec[
i]->lbsize();
106 for (
unsigned i=0 ;
i<
vec.size() ;
i++ ) {
111 <<
"\t" <<
int(100*(
i+1.0)/
vec.size())
113 <<
"\t" << *
vec[
i] <<
"\tfraction: " <<
vec[
i]->lbsize()/total << std::endl;
◆ elements
T std::map< K, T >::elements |
|
inherited |
◆ keys
◆ m_terse
The documentation for this class was generated from the following file:
void sort(typename std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > end, const Compare &comp)
Specialization of sort for DataVector/List.