TIndexCellIter Class Reference

#include <TIndexCell.h>

Inheritance diagram for TIndexCellIter:

Collaboration diagram for TIndexCellIter:

Public Member Functions
const TIndexCell *	GetCell () const
int	LevelDown ()
TIndexCell const *	Next ()
void	Reset ()
void	Test ()
	TIndexCellIter (const TIndexCell *cell, int level, Bool_t dir=kIterForward)
	~TIndexCellIter ()

Private Member Functions
	TIndexCellIter ()

Private Attributes
const TIndexCell *	fCell
Bool_t	fDirection
Int_t	fLevel
Int_t	fLevel0
Int_t	fPass
Int_t *	fVind

Constructor & Destructor Documentation

TIndexCellIter() [1/2]

TIndexCellIter::TIndexCellIter ( )

inlineprivate

: fCell(0) { }

TIndexCellIter() [2/2]

TIndexCellIter::TIndexCellIter	(	const TIndexCell *	cell,
		int	level,
		Bool_t	dir = kIterForward
	)

{
   // Create cell iterator. By default the iteration direction
   // is kIterForward. To go backward use kIterBackward.
 
   fPass = 0;
   fCell     = cell;
   fDirection = dir;
   if( level > fCell->Nlevels() ) level=0;
   if( level < 1 ) level=0;
   fLevel = fLevel0 = level-1;
   if(fLevel0 >= 0) {
     fVind = new int[ fLevel0+1 ];
     Reset();
   }
}

~TIndexCellIter()

TIndexCellIter::~TIndexCellIter

(

)

{
  if(fVind) delete [] fVind;
  fVind=0;
}

Member Function Documentation

GetCell()

const TIndexCell* TIndexCellIter::GetCell ( ) const

inline

{ return fCell; }

LevelDown()

int TIndexCellIter::LevelDown

(

)

{
  if(fLevel<1) return 0;
  fVind[fLevel] = 0;
  fLevel--;
  int nent = fCell->At(fLevel,fVind)->GetEntriesFast();
  //printf("LevelDown: level = %d, nent= %d  fVind= %d\n",fLevel, nent,fVind[fLevel]);
  if( fVind[fLevel] < nent-1 ) {
    fVind[fLevel]++;
    fLevel=fLevel0;
    fVind[fLevel0]=-1;
    return 1;
  } else return LevelDown();
  return 0;
}

Next()

TIndexCell const * TIndexCellIter::Next

(

)

{
   // Return next object in cell. Returns 0 when no more objects in cell.
 
  if( fLevel0 <0 )   return 0;
 
 START:
 
  if( fLevel != fLevel0 )   return 0;
 
  int nent = fCell->At(fLevel,fVind)->GetEntriesFast();
  //printf("Next: nent= %d  fPass= %d\n",nent,fPass);
 
  if( fVind[fLevel] < nent-1 ) {
    fVind[fLevel]++;
    fPass++;
    return  fCell->At(fLevel+1,fVind);
  } else {
    if( LevelDown() ) goto START;
  }
  return 0;
}

Reset()

void TIndexCellIter::Reset

(

)

{
   // Reset array iterator.
 
  if (fDirection == kIterForward) {
    fLevel = fLevel0;
    for(int i=0; i<fLevel0; i++ ) fVind[i]=0;
    fVind[fLevel0]=-1;
  }
  else    {}
}

Test()

void TIndexCellIter::Test

(

)

{
  int count=0;
  while( Next() ) count++;
  printf("count = %d\n",count);
}

Member Data Documentation

fCell

const TIndexCell* TIndexCellIter::fCell

private

fDirection

Bool_t TIndexCellIter::fDirection

private

fLevel

Int_t TIndexCellIter::fLevel

private

fLevel0

Int_t TIndexCellIter::fLevel0

private

fPass

Int_t TIndexCellIter::fPass

private

fVind

Int_t* TIndexCellIter::fVind

private

---

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

• src/libEmath/TIndexCell.h
• src/libEmath/TIndexCell.cpp