IOVData< T > Class Template Reference

#include <CoolQuery.h>

Collaboration diagram for IOVData< T >:

Public Member Functions
	IOVData ()
	~IOVData ()
	IOVData (const IOVData &)=default
	IOVData (IOVData &&)=default
IOVData &	operator= (const IOVData &)=default
IOVData &	operator= (IOVData &&)=default
void	clear ()
T	getValue (IOVTime time)
std::list< std::pair< IOVRange, T > >	getOverlap (const IOVRange &range)
void	add (IOVRange range, T val)

Public Attributes
std::list< std::pair< IOVRange, T > >	data

Private Attributes
bool	m_lastData
std::list< std::pair< IOVRange, T > >::iterator	m_last

Detailed Description

template<class T>
class IOVData< T >

Definition at line 54 of file CoolQuery.h.

Constructor & Destructor Documentation

IOVData() [1/3]

template<class T >

IOVData< T >::IOVData ( )

inline

Definition at line 57 of file CoolQuery.h.

            {
    clear();
  }

~IOVData()

template<class T >

IOVData< T >::~IOVData ( )

inline

Definition at line 61 of file CoolQuery.h.

             {
    clear();
  }

IOVData() [2/3]

template<class T >

IOVData< T >::IOVData ( const IOVData< T > &  )

default

IOVData() [3/3]

template<class T >

IOVData< T >::IOVData ( IOVData< T > &&  )

default

Member Function Documentation

add()

template<class T >

void IOVData< T >::add	(	IOVRange	range,
		T	val
	)

Definition at line 97 of file CoolQuery.h.

                                          {
  data.push_back(std::pair<IOVRange, T>(range, val));
  m_last = data.begin();
  m_lastData = false;
}

clear()

template<class T >

void IOVData< T >::clear ( )

inline

Definition at line 70 of file CoolQuery.h.

               {
    data.clear();
    m_last = data.begin();
    m_lastData = false;
  }

getOverlap()

template<class T >

std::list< std::pair< IOVRange, T > > IOVData< T >::getOverlap

(

const IOVRange &

range

)

Definition at line 178 of file CoolQuery.h.

                                                                           {
 
  std::list<std::pair<IOVRange, T> > mydata;
  mydata.clear();
 
  // Find first time
  IOVTime firsttime = range.start();
  IOVTime lasttime = range.stop();
 
  // Use this to efficiently set the 'm_last' pointer
  getValue(firsttime);
 
  // Pointer to found element
  typename std::list<std::pair<IOVRange, T> >::iterator elem;
 
  std::pair<IOVRange, T> val;
 
  // Loop over elements
  for (elem = m_last; elem != data.end(); ++elem) {
 
    val = *elem;
 
    // Truncate this if necessary
    if (val.first.start() < firsttime || val.first.stop() > lasttime) {
      IOVTime iovstart((val.first.start() < firsttime ? firsttime : val.first.start()));
      IOVTime iovstop((val.first.stop() > lasttime ? lasttime : val.first.stop()));
      val.first = IOVRange(iovstart, iovstop);
    }
    mydata.push_back(val);
 
    // Check if we are done
    if (elem->first.isInRange(lasttime)) break;
  }
 
  return mydata;
}

getValue()

template<class T >

T IOVData< T >::getValue

(

IOVTime

time

)

Definition at line 104 of file CoolQuery.h.

                                   {
 
  // bool verbose = false;
  // if (verbose) {
  //   cout << endl << "getValue(" << time << ")" << endl;
  //   cout << "Data Size: " << data.size() << endl;
  // }
 
  if (data.empty()) return T(-1);
 
  typename std::list<std::pair<IOVRange, T> >::iterator it;
 
  // if (verbose) {
  //   for (it = data.begin(); it != data.end(); it++)
  //     cout << "(" << it->first << ", " << it->second << ")" << endl;
  //   cout << "Last is valid - " << m_lastData << endl;
  // }
 
  // Check if previous value is still good
  if (m_lastData) {
    // if (verbose) {
    //   cout << "Check previous " << m_last->first << endl;
    // }
 
    if ((m_last->first).isInRange(time)) return m_last->second;
 
    // Previous not good, try next as best guess
    if (++(m_last) != data.end()) {
      // if (verbose) cout << "Check next " << m_last->first << endl;
      if ((m_last->first).isInRange(time)) return m_last->second;
    }
  } else {
    m_last = data.begin();
  }
 
  m_lastData = false;
 
  // OK, suck it up and find the best value by stepping through entire list
  // Make sure we start on a valid value
  if ( m_last == data.end() ) --m_last;
 
  // Step forward looking for a match
  if (m_last->first.stop() <= time) {
 
    // if (verbose) cout << "Search upwards" << endl;
    for (++m_last; m_last != data.end(); ++m_last) {
      // if (verbose) cout << m_last->first << endl;
      if ((m_lastData = (m_last->first).isInRange(time))) return m_last->second;
    }
 
  } else if ( m_last != data.begin() && m_last->first.start() > time) {
 
    // if (verbose) cout << "Search downwards" << endl;
    do {
      --m_last;
      // if (verbose) cout << m_last->first << endl;
      if ((m_lastData = (m_last->first).isInRange(time))) return m_last->second;
    } while (m_last != data.begin());
 
  } else {
 
    if ((m_lastData = m_last->first.isInRange(time))) return m_last->second;
 
  } 
 
  // Set to valid data if we didn't find anything
  m_last = data.begin();
  m_lastData = false;
 
  // If we got to here, we didn't find it
  return T(-1);
}

operator=() [1/2]

template<class T >

IOVData& IOVData< T >::operator= ( const IOVData< T > &  )

default

operator=() [2/2]

template<class T >

IOVData& IOVData< T >::operator= ( IOVData< T > &&  )

default

Member Data Documentation

data

template<class T >

std::list<std::pair<IOVRange, T > > IOVData< T >::data

Definition at line 86 of file CoolQuery.h.

m_last

template<class T >

std::list<std::pair<IOVRange, T > >::iterator IOVData< T >::m_last

private

Definition at line 92 of file CoolQuery.h.

m_lastData

template<class T >

bool IOVData< T >::m_lastData

private

Definition at line 89 of file CoolQuery.h.

---

The documentation for this class was generated from the following file:

• CoolQuery.h