#include <DTT0.h>

Public Types
typedef std::vector< std::pair < DTT0Id, DTT0Data > >::const_iterator	const_iterator
	Access methods to data. More...

Public Member Functions
const_iterator	begin () const

int	cellT0 (int wheelId, int stationId, int sectorId, int slId, int layerId, int cellId, float &t0mean, float &t0rms, DTTimeUnits::type unit) const
	get content More...

int	cellT0 (const DTWireId &id, float &t0mean, float &t0rms, DTTimeUnits::type unit) const

void	clear ()
	reset content More...

	DTT0 ()

	DTT0 (const std::string &version)

const_iterator	end () const

int	get (int wheelId, int stationId, int sectorId, int slId, int layerId, int cellId, float &t0mean, float &t0rms, DTTimeUnits::type unit) const

int	get (const DTWireId &id, float &t0mean, float &t0rms, DTTimeUnits::type unit) const

int	set (int wheelId, int stationId, int sectorId, int slId, int layerId, int cellId, float t0mean, float t0rms, DTTimeUnits::type unit)

int	set (const DTWireId &id, float t0mean, float t0rms, DTTimeUnits::type unit)

int	setCellT0 (int wheelId, int stationId, int sectorId, int slId, int layerId, int cellId, float t0mean, float t0rms, DTTimeUnits::type unit)

int	setCellT0 (const DTWireId &id, float t0mean, float t0rms, DTTimeUnits::type unit)

void	setUnit (float unit)

void	sortData ()

float	unit () const

const std::string &	version () const
	access version More...

std::string &	version ()

	~DTT0 ()

Private Member Functions
void	cacheMap () const

bool	checkOrder () const
	read and store full content More...

int	getRandom (int wheelId, int stationId, int sectorId, int slId, int layerId, int cellId, float &t0mean, float &t0rms, DTTimeUnits::type unit) const

int	getSorted (int wheelId, int stationId, int sectorId, int slId, int layerId, int cellId, float &t0mean, float &t0rms, DTTimeUnits::type unit) const

std::string	mapName () const

int	maxCellsPerLayer () const

Private Attributes
std::vector< std::pair< DTT0Id, DTT0Data > >	dataList

std::string	dataVersion

DTBufferTree< int, int > *	dBuf

float	nsPerCount

std::vector< int > *	sequencePtr

DTBufferTree< int, int > *	sortedLayers

Detailed Description

Description: Class to hold drift tubes T0s ( cell by cell time offsets )

Date:: 2010/03/01 10:27:08

Revision:: 1.10

Author: Paolo Ronchese INFN Padova

Definition at line 68 of file DTT0.h.

Member Typedef Documentation

typedef std::vector< std::pair<DTT0Id, DTT0Data> >::const_iterator DTT0::const_iterator

Access methods to data.

Definition at line 158 of file DTT0.h.

Constructor & Destructor Documentation

DTT0::DTT0 ( )

Constructor

Definition at line 35 of file DTT0.cc.

References dataList, dBuf, sequencePtr, and sortedLayers.

           :
   dataVersion( " " ),
   nsPerCount( 25.0 / 32.0 ) {
   dataList.reserve( 12000 );
 //  dBuf = sortedLayers = 0;
   dBuf = 0;
   sortedLayers = 0;
   sequencePtr = 0;
 }

DTT0::DTT0 ( const std::string & version )

Definition at line 46 of file DTT0.cc.

References dataList, dBuf, sequencePtr, and sortedLayers.

                                     :
   dataVersion( version ),
   nsPerCount( 25.0 / 32.0 ) {
   dataList.reserve( 12000 );
 //  dBuf = sortedLayers = 0;
   dBuf = 0;
   sortedLayers = 0;
   sequencePtr = 0;
 }

DTT0::~DTT0 ( )

Destructor

Definition at line 76 of file DTT0.cc.

References dBuf, sequencePtr, and sortedLayers.

             {
   delete dBuf;
   delete sortedLayers;
   delete sequencePtr;
 }

Member Function Documentation

DTT0::const_iterator DTT0::begin ( void ) const

Definition at line 384 of file DTT0.cc.

References dataList.

Referenced by DTT0Calibration::endJob(), and DTT0CalibrationNew::endJob().

                                      {
   return dataList.begin();
 }

void DTT0::cacheMap ( ) const

private

Definition at line 507 of file DTT0.cc.

References dataList, dBuf, DTBufferTree< Key, Content >::insert(), sortedLayers, and DTT0Id::stationId.

Referenced by checkOrder(), and set().

                           {
 
   delete sortedLayers;
   sortedLayers = 0;
 //  dBuf = new std::map<int,int>;
   dBuf = new DTBufferTree<int,int>;
 
   int entryNum = 0;
   int entryMax = dataList.size();
   std::vector<int> chanKey;
   chanKey.reserve(6);
   while ( entryNum < entryMax ) {
 
    const DTT0Id& chan = dataList[entryNum].first;
 
 //    DTWireId detId( chan.  wheelId, chan.stationId, chan. sectorId,
 //                    chan.     slId, chan.  layerId, chan.   cellId );
 //    dBuf->insert( std::pair<int,int>( detId.rawId(), entryNum++ ) );
     chanKey.clear();
     chanKey.push_back( chan.  wheelId );
     chanKey.push_back( chan.stationId );
     chanKey.push_back( chan. sectorId );
     chanKey.push_back( chan.     slId );
     chanKey.push_back( chan.  layerId );
     chanKey.push_back( chan.   cellId );
     dBuf->insert( chanKey.begin(), chanKey.end(), entryNum++ );
 
   }
 
   return;
 
 }

int DTT0::cellT0	(	int	wheelId,
		int	stationId,
		int	sectorId,
		int	slId,
		int	layerId,
		int	cellId,
		float &	t0mean,
		float &	t0rms,
		DTTimeUnits::type	unit
	)		const

inline

get content

Operations

Definition at line 84 of file DTT0.h.

93 { return get( wheelId, stationId, sectorId, slId, layerId, cellId,

94 t0mean, t0rms, unit ); };

DTT0::unit

float unit() const

Definition: DTT0.cc:255

int DTT0::cellT0	(	const DTWireId &	id,
		float &	t0mean,
		float &	t0rms,
		DTTimeUnits::type	unit
	)		const

inline

Definition at line 95 of file DTT0.h.

References unit().

99 { return get( id, t0mean, t0rms, unit ); };

DTT0::unit

float unit() const

Definition: DTT0.cc:255

bool DTT0::checkOrder ( ) const

private

read and store full content

Definition at line 401 of file DTT0.cc.

References cacheMap(), DTT0Id::cellId, dataList, DTBufferTree< Key, Content >::find(), DTSequentialLayerNumber::id(), DTBufferTree< Key, Content >::insert(), DTSequentialLayerNumber::max(), maxCellsPerLayer(), evf::evtn::offset(), sequencePtr, sortedLayers, and DTT0Id::stationId.

Referenced by get(), and sortData().

                             {
 
   delete sortedLayers;
   delete sequencePtr;
 //  sortedLayers = new std::map<int,int>;
   sortedLayers = new DTBufferTree<int,int>;
 //  sequencePtr = new std::vector<int>;
 //  sequencePtr->reserve( DTSequentialLayerNumber::max() + 2 );
   sequencePtr = new std::vector<int>( DTSequentialLayerNumber::max() + 2 );
   std::vector<int>::iterator iter = sequencePtr->begin();
   std::vector<int>::iterator iend = sequencePtr->end();
   while ( iter != iend ) *iter++ = 0;
 
   int entryNum = 0;
   int mCells = maxCellsPerLayer();
   int entryMax = dataList.size();
 //  int oldId = 0;
   std::vector<int> chanOld;
   int lCell = -999999999;
   bool layerOrder = true;
 
   int lCode;
   int seqId;
   int oldId = 0;
   std::vector<int>& sequenceLay = *sequencePtr;
 
   std::vector<int> chanKey;
   chanKey.reserve(6);
 
   while ( entryNum < entryMax ) {
     const DTT0Id& chan = dataList[entryNum].first;
     if ( ( seqId = DTSequentialLayerNumber::id( chan.  wheelId,
                                                 chan.stationId,
                                                 chan. sectorId,
                                                 chan.     slId,
                                                 chan.  layerId ) ) < 0 ) {
       oldId = 0;
 //      std::cout << "out of sequence" << std::endl;
 //    DTLayerId detId( chan.  wheelId, chan.stationId, chan. sectorId,
 //                     chan.     slId, chan.  layerId );
 //    int rawId = detId.rawId();
       chanKey.clear();
       chanKey.push_back( chan.  wheelId );
       chanKey.push_back( chan.stationId );
       chanKey.push_back( chan. sectorId );
       chanKey.push_back( chan.     slId );
       chanKey.push_back( chan.  layerId );
 //    std::map<int,int>::iterator layer_iter = sortedLayers->find( rawId );
 //    std::map<int,int>::iterator layer_iend = sortedLayers->end();
 //    if ( layer_iter == layer_iend ) {
       if ( sortedLayers->find( chanKey.begin(), chanKey.end(), lCode ) ) {
 //      sortedLayers->insert( std::pair<int,int>( rawId,
 //                                                1 + ( entryNum * 1000 ) ) );
 //      oldId = rawId;
         sortedLayers->insert( chanKey.begin(), chanKey.end(),
                               1 + ( entryNum * mCells ) );
         chanOld = chanKey;
       }
       else {
 //      int& lCode = layer_iter->second;
         int offset = lCode / mCells;
         int length = lCode % mCells;
         int ncells = entryNum - offset;
 //      if ( ( ncells != length     ) ||
 //           (  rawId != oldId      ) ||
 //           ( chan.cellId <= lCell ) ) layerOrder = false;
 //      layer_iter->second = ( offset * 1000 ) + ncells + 1;
         if ( ( ncells      >= mCells     ) ||
              ( ncells      != length     ) ||
              ( chanKey[0]  != chanOld[0] ) ||
              ( chanKey[1]  != chanOld[1] ) ||
              ( chanKey[2]  != chanOld[2] ) ||
              ( chanKey[3]  != chanOld[3] ) ||
              ( chanKey[4]  != chanOld[4] ) ||
              ( chan.cellId <= lCell      ) ) layerOrder = false;
         sortedLayers->insert( chanKey.begin(), chanKey.end(),
                               ( offset * mCells ) + ncells + 1 );
       }
     }
     else {
       chanOld.clear();
 //      std::cout << "inside sequence" << std::endl;
       lCode = sequenceLay[seqId];
       if ( lCode == 0 ) {
         sequenceLay[seqId] = 1 + ( entryNum * mCells );
         oldId = seqId;
       }
       else {
         int offset = lCode / mCells;
         int length = lCode % mCells;
         int ncells = entryNum - offset;
         if ( ( ncells      >= mCells     ) ||
              ( ncells      != length     ) ||
              ( seqId       != oldId      ) ||
              ( chan.cellId <= lCell      ) ) layerOrder = false;
         sequenceLay[seqId] = ( offset * mCells ) + ncells + 1;
       }
     }
     lCell = chan.cellId;
     entryNum++;
   }
   if ( !layerOrder ) cacheMap();
   return layerOrder;
 }

void DTT0::clear ( void )

reset content

Definition at line 271 of file DTT0.cc.

References dataList, and dBuf.

Referenced by python.Vispa.Views.WidgetView.WidgetView::closeEvent(), python.Vispa.Views.BoxDecayView.BoxDecayView::closeEvent(), python.Vispa.Share.FindAlgorithm.FindAlgorithm::findUsingFindDialog(), python.Vispa.Views.LineDecayView.LineDecayView::setDataObjects(), python.Vispa.Views.WidgetView.WidgetView::setDataObjects(), python.Vispa.Views.TreeView.TreeView::updateContent(), python.Vispa.Views.TableView.TableView::updateContent(), python.Vispa.Views.BoxDecayView.BoxDecayView::updateContent(), and python.Vispa.Views.PropertyView.PropertyView::updateContent().

                  {
   delete dBuf;
   dBuf = 0;
   dataList.clear();
   return;
 }

DTT0::const_iterator DTT0::end ( void ) const

Definition at line 389 of file DTT0.cc.

References dataList.

Referenced by Types.LuminosityBlockRange::cppID(), Types.EventRange::cppID(), DTT0Calibration::endJob(), and DTT0CalibrationNew::endJob().

                                    {
   return dataList.end();
 }

int DTT0::get	(	int	wheelId,
		int	stationId,
		int	sectorId,
		int	slId,
		int	layerId,
		int	cellId,
		float &	t0mean,
		float &	t0rms,
		DTTimeUnits::type	unit
	)		const

Definition at line 94 of file DTT0.cc.

References checkOrder(), dBuf, getRandom(), getSorted(), and sortedLayers.

Referenced by Options.Options::__getitem__(), and DTConfigPedestals::getOffset().

                                             {
 
   t0mean =
   t0rms  = 0.0;
 
   if ( ( dBuf == 0 ) && ( sortedLayers == 0 ) ) checkOrder();
 //  if ( sortedLayers != 0 ) std::cout << "sorted data" << std::endl;
 //  else                     std::cout << "random data" << std::endl;
   if ( sortedLayers != 0 ) return getSorted( wheelId, stationId, sectorId,
                                                 slId,   layerId,   cellId,
                                               t0mean,     t0rms,     unit );
   else                     return getRandom( wheelId, stationId, sectorId,
                                                 slId,   layerId,   cellId,
                                               t0mean,     t0rms,     unit );
   return -999999999;
 }

int DTT0::get	(	const DTWireId &	id,
		float &	t0mean,
		float &	t0rms,
		DTTimeUnits::type	unit
	)		const

Definition at line 241 of file DTT0.cc.

References unit().

Referenced by Options.Options::__getitem__().

                                             {
   return get( id.wheel(),
               id.station(),
               id.sector(),
               id.superLayer(),
               id.layer(),
               id.wire(),
               t0mean, t0rms, unit );
 }

int DTT0::getRandom	(	int	wheelId,
		int	stationId,
		int	sectorId,
		int	slId,
		int	layerId,
		int	cellId,
		float &	t0mean,
		float &	t0rms,
		DTTimeUnits::type	unit
	)		const

private

Definition at line 120 of file DTT0.cc.

References runTheMatrix::data, dataList, dBuf, DTBufferTree< Key, Content >::find(), DTTimeUnits::ns, nsPerCount, edm::second(), DTT0Data::t0mean, and DTT0Data::t0rms.

Referenced by get().

                                                   {
 
 //  DTWireId detId( wheelId, stationId, sectorId,
 //                  slId,   layerId,   cellId );
 //  int chanKey = detId.rawId();
   std::vector<int> chanKey;
   chanKey.reserve(6);
   chanKey.push_back(   wheelId );
   chanKey.push_back( stationId );
   chanKey.push_back(  sectorId );
   chanKey.push_back(      slId );
   chanKey.push_back(   layerId );
   chanKey.push_back(    cellId );
 
   int ientry;
 //  std::map<int,int>::const_iterator buf_iter = dBuf->find( chanKey );
 //  std::map<int,int>::const_iterator buf_iend = dBuf->end();
 //  int searchStatus = ( buf_iter == buf_iend );
   int searchStatus = dBuf->find( chanKey.begin(), chanKey.end(), ientry );
   if ( !searchStatus ) {
 //    ientry = buf_iter->second;
     const DTT0Data& data( dataList[ientry].second );
     t0mean = data.t0mean;
     t0rms  = data.t0rms;
     if ( unit == DTTimeUnits::ns ) {
       t0mean *= nsPerCount;
       t0rms  *= nsPerCount;
     }
   }
 
   return searchStatus;
 
 }

int DTT0::getSorted	(	int	wheelId,
		int	stationId,
		int	sectorId,
		int	slId,
		int	layerId,
		int	cellId,
		float &	t0mean,
		float &	t0rms,
		DTTimeUnits::type	unit
	)		const

private

Definition at line 168 of file DTT0.cc.

References runTheMatrix::data, dataList, DTBufferTree< Key, Content >::find(), DTSequentialLayerNumber::id(), maxCellsPerLayer(), DTTimeUnits::ns, nsPerCount, edm::second(), sequencePtr, sortedLayers, DTT0Data::t0mean, and DTT0Data::t0rms.

Referenced by get().

                                                   {
 
   int lCode;
   int seqId;
   std::vector<int>& sequenceLay = *sequencePtr;
 
   if ( ( seqId = DTSequentialLayerNumber::id( wheelId, stationId, sectorId,
                                               slId,   layerId ) ) < 0 ) {
 //  DTLayerId detId( wheelId, stationId, sectorId,
 //                      slId,   layerId );
 //  int chanKey = detId.rawId();
     std::vector<int> chanKey;
     chanKey.reserve(6);
     chanKey.push_back(   wheelId );
     chanKey.push_back( stationId );
     chanKey.push_back(  sectorId );
     chanKey.push_back(      slId );
     chanKey.push_back(   layerId );
 
 //  std::map<int,int>::iterator layer_iter = sortedLayers->find( chanKey );
 //  std::map<int,int>::iterator layer_iend = sortedLayers->end();
 //
 //  if ( layer_iter == layer_iend ) return 1;
 //
 //  int& lCode = layer_iter->second;
     if ( sortedLayers->find( chanKey.begin(), chanKey.end(), lCode ) )
          return 1;
   }
   else {
     lCode = sequenceLay[seqId];
   }
   int mCells = maxCellsPerLayer();
   int idprev = lCode / mCells;
   int length = lCode % mCells;
   int idnext = idprev + length;
 
   --idprev;
   int idtest;
   while ( ( length = idnext - idprev ) >= 2 ) {
     idtest = idprev + ( length / 2 );
     int cCell = dataList[idtest].first.cellId;
     if ( cCell < cellId ) {
       idprev = idtest;
       continue;
     }
     if ( cCell > cellId ) {
       idnext = idtest;
       continue;
     }
     idprev = idtest++;
     idnext = idtest;
     const DTT0Data& data( dataList[idprev].second );
     t0mean = data.t0mean;
     t0rms  = data.t0rms;
     if ( unit == DTTimeUnits::ns ) {
       t0mean *= nsPerCount;
       t0rms  *= nsPerCount;
     }
     return 0;
   }
   // std::cout << "cell not found!" << std::endl;
   return 1;
 }

std::string DTT0::mapName ( ) const

private

Definition at line 394 of file DTT0.cc.

References dataVersion, and mergeVDriftHistosByStation::name.

                               {
   std::stringstream name;
   name << dataVersion << "_map_T0" << this;
   return name.str();
 }

int DTT0::maxCellsPerLayer ( ) const

private

Definition at line 163 of file DTT0.cc.

Referenced by checkOrder(), and getSorted().

                                  {
   return 2000;
 }

int DTT0::set	(	int	wheelId,
		int	stationId,
		int	sectorId,
		int	slId,
		int	layerId,
		int	cellId,
		float	t0mean,
		float	t0rms,
		DTTimeUnits::type	unit
	)

Definition at line 279 of file DTT0.cc.

References cacheMap(), runTheMatrix::data, dataList, dBuf, DTBufferTree< Key, Content >::find(), DTBufferTree< Key, Content >::insert(), combine::key, DTTimeUnits::ns, nsPerCount, edm::second(), DTT0Id::stationId, DTT0Data::t0mean, and DTT0Data::t0rms.

Referenced by DTT0Calibration::endJob(), DTT0CalibrationNew::endJob(), DTT0Handler::getNewObjects(), DTFakeT0ESProducer::produce(), set(), and setCellT0().

                                       {
 
   if ( unit == DTTimeUnits::ns ) {
     t0mean /= nsPerCount;
     t0rms  /= nsPerCount;
   }
 
   if ( dBuf == 0 ) cacheMap();
 
 //  DTWireId detId( wheelId, stationId, sectorId,
 //                  slId,   layerId,   cellId );
 //  int chanKey = detId.rawId();
   if ( dBuf == 0 ) cacheMap();
   std::vector<int> chanKey;
   chanKey.reserve(6);
   chanKey.push_back(   wheelId );
   chanKey.push_back( stationId );
   chanKey.push_back(  sectorId );
   chanKey.push_back(      slId );
   chanKey.push_back(   layerId );
   chanKey.push_back(    cellId );
 
   int ientry;
 //  std::map<int,int>::const_iterator buf_iter = dBuf->find( chanKey );
 //  std::map<int,int>::const_iterator buf_iend = dBuf->end();
 //  int searchStatus = ( buf_iter == buf_iend );
   int searchStatus = dBuf->find( chanKey.begin(), chanKey.end(), ientry );
 
   if ( !searchStatus ) {
 //    ientry = buf_iter->second;
     DTT0Data& data( dataList[ientry].second );
     data.t0mean = t0mean;
     data.t0rms  = t0rms;
     return -1;
   }
   else {
     DTT0Id key;
     key.  wheelId =   wheelId;
     key.stationId = stationId;
     key. sectorId =  sectorId;
     key.     slId =      slId;
     key.  layerId =   layerId;
     key.   cellId =    cellId;
     DTT0Data data;
     data.t0mean = t0mean;
     data.t0rms  = t0rms;
     ientry = dataList.size();
     dataList.push_back( std::pair<const DTT0Id,DTT0Data>( key, data ) );
 //    dBuf->insert( std::pair<int,int>( detId.rawId(), ientry ) );
     dBuf->insert( chanKey.begin(), chanKey.end(), ientry );
     return 0;
   }
 
   return 99;
 
 }

int DTT0::set	(	const DTWireId &	id,
		float	t0mean,
		float	t0rms,
		DTTimeUnits::type	unit
	)

Definition at line 345 of file DTT0.cc.

References set(), and relativeConstraints::station.

                                       {
   return set( id.wheel(),
               id.station(),
               id.sector(),
               id.superLayer(),
               id.layer(),
               id.wire(),
               t0mean, t0rms, unit );
 }

int DTT0::setCellT0	(	int	wheelId,
		int	stationId,
		int	sectorId,
		int	slId,
		int	layerId,
		int	cellId,
		float	t0mean,
		float	t0rms,
		DTTimeUnits::type	unit
	)

inline

Definition at line 123 of file DTT0.h.

References set().

132 { return set( wheelId, stationId, sectorId, slId, layerId, cellId,

133 t0mean, t0rms, unit ); };

DTT0::set

int set(int wheelId, int stationId, int sectorId, int slId, int layerId, int cellId, float t0mean, float t0rms, DTTimeUnits::type unit)

Definition: DTT0.cc:279

DTT0::unit

float unit() const

Definition: DTT0.cc:255

int DTT0::setCellT0	(	const DTWireId &	id,
		float	t0mean,
		float	t0rms,
		DTTimeUnits::type	unit
	)

inline

Definition at line 134 of file DTT0.h.

References set().

138 { return set( id, t0mean, t0rms, unit ); };

DTT0::set

int set(int wheelId, int stationId, int sectorId, int slId, int layerId, int cellId, float t0mean, float t0rms, DTTimeUnits::type unit)

Definition: DTT0.cc:279

DTT0::unit

float unit() const

Definition: DTT0.cc:255

void DTT0::setUnit ( float unit )

Definition at line 359 of file DTT0.cc.

References nsPerCount, and unit().

                                {
   nsPerCount = unit;
 }

void DTT0::sortData ( )

Definition at line 364 of file DTT0.cc.

References checkOrder(), DTBufferTree< Key, Content >::contList(), dataList, dBuf, and sortedLayers.

                     {
   if ( sortedLayers != 0 ) return;
   if ( dBuf == 0 ) checkOrder();
   if ( sortedLayers != 0 ) return;
   if ( dBuf == 0 ) return;
   std::vector< std::pair<DTT0Id,DTT0Data> > tempList;
 //  std::map<int,int>::const_iterator iter = dBuf->begin();
 //  std::map<int,int>::const_iterator iend = dBuf->end();
 //  while ( iter != iend ) tempList.push_back( dataList[iter++->second] );
   std::vector<int> indexList = dBuf->contList();
   std::vector<int>::const_iterator iter = indexList.begin();
   std::vector<int>::const_iterator iend = indexList.end();
   while ( iter != iend ) tempList.push_back( dataList[*iter++] );
   dataList = tempList;
   delete dBuf;
   dBuf = 0;
   return;
 }

float DTT0::unit ( ) const

Definition at line 255 of file DTT0.cc.

References nsPerCount.

Referenced by cellT0(), get(), and setUnit().

                        {
   return nsPerCount;
 }

const std::string & DTT0::version ( ) const

access version

Definition at line 261 of file DTT0.cc.

References dataVersion.

                                {
   return dataVersion;
 }

std::string & DTT0::version ( )

Definition at line 266 of file DTT0.cc.

References dataVersion.

                          {
   return dataVersion;
 }

Member Data Documentation

std::vector< std::pair<DTT0Id,DTT0Data> > DTT0::dataList

private

Definition at line 167 of file DTT0.h.

Referenced by begin(), cacheMap(), checkOrder(), clear(), DTT0(), end(), getRandom(), getSorted(), set(), and sortData().

std::string DTT0::dataVersion

private

Definition at line 164 of file DTT0.h.

Referenced by mapName(), and version().

DTBufferTree<int,int>* DTT0::dBuf

mutableprivate

Definition at line 171 of file DTT0.h.

Referenced by cacheMap(), clear(), DTT0(), get(), getRandom(), set(), sortData(), and ~DTT0().

float DTT0::nsPerCount

private

Definition at line 165 of file DTT0.h.

Referenced by getRandom(), getSorted(), set(), setUnit(), and unit().

std::vector<int>* DTT0::sequencePtr

mutableprivate

Definition at line 169 of file DTT0.h.

Referenced by checkOrder(), DTT0(), getSorted(), and ~DTT0().

DTBufferTree<int,int>* DTT0::sortedLayers

mutableprivate

Definition at line 170 of file DTT0.h.

Referenced by cacheMap(), checkOrder(), DTT0(), get(), getSorted(), sortData(), and ~DTT0().

Public Types

Public Member Functions

Private Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation