#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
|
| bool | inRange (int run, int lb) |
| | is this run, lumiblock in any of the ranges?
|
| void | sort () |
| | sort the runs by the number of good lumi blocks
|
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.
48 {
49
51
53 std::pair< iterator, bool > in = insert( std::pair<int, grl_run >( run, grl_run( run ) ) );
55 }
56
57 it->second.add_range( start, stop );
58
59 if ( !
m_terse ) std::cout <<
"lumiList::addRange() run " <<
run <<
";\t" <<
start <<
" - " <<
stop << std::endl;
60 }
std::map< int, grl_run >::iterator iterator
iterators over the full map
std::string find(const std::string &s)
return a remapped string
◆ 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.
67 {
68
70
71 if ( itr ==
end() )
return true;
72 else {
73 grl_run&
v = itr->second;
74 for (
unsigned i=0 ;
i<
v.size() ;
i++ ) {
75 if (
lb>=v[i].first &&
lb<=v[i].second )
return true;
76 }
77 }
78 return false;
79 }
◆ 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.
83 {
84
85 std::cout << "lumiList::sort() sorting ..." << std::endl;
86
87 std::vector< const grl_run* >
vec;
88
90
91 while ( itr!=
end() ) {
92 vec.push_back( &(itr->second) );
93 ++itr;
94 }
95
98
100
101 double total = 0;
102 for (
unsigned i=
vec.size() ; i-- ; ) total +=
vec[
i]->lbsize();
103
104
106 for (
unsigned i=0 ;
i<
vec.size() ;
i++ ) {
107
109
111 <<
"\t" <<
int(100*(i+1.0)/
vec.size())
113 <<
"\t" << *
vec[
i] <<
"\tfraction: " <<
vec[
i]->lbsize()/total << std::endl;
114
115 }
116 }
std::vector< size_t > vec
static bool comparison(const grl_run *r1, const grl_run *r2)
std::map< int, grl_run >::const_iterator const_iterator
void sort(typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end)
Specialization of sort for DataVector/List.
◆ elements
| T std::map< K, T >::elements |
|
inherited |
◆ keys
◆ m_terse
The documentation for this class was generated from the following file: