lumiList.h

Go to the documentation of this file.

/* emacs: this is -*- c++ -*- */
 
 
#ifndef ANALYSIS_LUMILIST_H
#define ANALYSIS_LUMILIST_H
 
#include <iostream>
#include <map>
#include <algorithm>
 
#include "grl_run.h"
 
 
 
 
class lumiList : public std::map< int, grl_run >  {
 
public:

  typedef  std::map< int, grl_run >           full_type;

  typedef  std::map< int, grl_run >::iterator       iterator;
 
  typedef  std::map< int, grl_run >::const_iterator const_iterator;
 
public:
  
  lumiList(bool b=true) : m_terse(b) {  }
 
  ~lumiList() { } 
 
  void setterse(bool b) { m_terse=b; }

  void addRange(int run, int start, int stop) {
 
    iterator it = find(run);
 
    if ( it == end() ) {
      std::pair< iterator, bool > in = insert( std::pair<int, grl_run >( run, grl_run( run ) ) );
      it = in.first;
    }
   
    it->second.add_range( start, stop );
   
    if ( !m_terse ) std::cout << "lumiList::addRange() run " << run << ";\t" << start << " - " << stop << std::endl;
  } 
 
 

  bool inRange( int run, int lb ) {
 
    iterator itr  = find(run);
    
    if ( itr == end() ) return true;
    else { 
      grl_run& v = itr->second;
      for ( unsigned i=0 ; i<v.size() ; i++ ) { 
    if ( lb>=v[i].first && lb<=v[i].second ) return true;
      }
    }
    return false; 
  }    
 

  void sort() { 
    
    std::cout << "lumiList::sort() sorting ..." << std::endl; 
 
    std::vector< const grl_run*  > vec;
    
    const_iterator itr  = begin();
    
    while ( itr!=end() ) { 
      vec.push_back( &(itr->second) ); 
      ++itr;
    }

    std::sort(vec.begin(), vec.end(), grl_run::comparison );

 
    double total = 0;
    for ( unsigned i=vec.size() ; i-- ;  ) total += vec[i]->lbsize();
 
   
    double integral = 0;
    for ( unsigned i=0 ; i<vec.size() ; i++ ) {
 
      integral += vec[i]->lbsize();
 
      std::cout << i 
        << "\t" << int(100*(i+1.0)/vec.size()) 
        << "\t" << int(integral/total*1000)*0.1 
        << "\t" << *vec[i] << "\tfraction: " <<  vec[i]->lbsize()/total << std::endl;
 
    } 
  }
 
private: 
 
  bool m_terse;
 
};
 
 
 
 
 
 
 
 
 
 
 
 
inline std::ostream& operator<<( std::ostream& s, const lumiList& ll ) {
 
  lumiList::const_iterator itr = ll.begin();
  
  s << "lumilist: " << ll.size() << " runs" << "\n";
 
  while ( itr!=ll.end() ) {
    
    s << "lumiList: run " << itr->first << " range: " << itr->second.first() << "\t- " << itr->second.last() << "\t : size " << itr->second.lbsize() << "\n"; 
    
    ++itr;
  }
 
  return s;
}
 
 
#endif  // ANALYSIS_LUMILIST_H