TIndexCellIterV Class Reference

IndexCell volume iterator. More...

#include <TIndexCell.h>

Inheritance diagram for TIndexCellIterV:

Collaboration diagram for TIndexCellIterV:

Public Member Functions
const TIndexCell *	GetCell () const
int	LevelDown ()
TIndexCell const *	Next ()
TIndexCell const *	NextAll ()
void	Reset ()
void	Test ()
	TIndexCellIterV (const TIndexCell *cell, int level, long vcent[], long vdiff[], Bool_t dir=kIterForward)
	~TIndexCellIterV ()

Private Member Functions
	TIndexCellIterV ()

Private Attributes
const TIndexCell *	fCell
	cell being iterated More...
Bool_t	fDirection
	iteration direction More...
Int_t	fLevel
	current level More...
Int_t	fLevel0
	level to be iterated on More...
Int_t	fPass
	number of cells iterated More...
Long_t *	fVcent
	central subcell More...
Long_t *	fVdiff
	volume to be iterated around Vcent More...
Int_t *	fVind
	current position in array More...
Long_t *	fVval
	values corresponding to Vind More...

Detailed Description

IndexCell volume iterator.

Constructor & Destructor Documentation

TIndexCellIterV() [1/2]

TIndexCellIterV::TIndexCellIterV ( )

inlineprivate

: fCell(0) { }

TIndexCellIterV() [2/2]

TIndexCellIterV::TIndexCellIterV	(	const TIndexCell *	cell,
		int	level,
		long	vcent[],
		long	vdiff[],
		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;
 
   if(fLevel0 >= 0) {
     fVind  = new Int_t[  fLevel0 ];
     fVval  = new Long_t[ fLevel0 ];
     Reset();
   }
 
   fVcent = new Long_t[level];
   fVdiff = new Long_t[level];
 
   for(int i=0; i<level; i++) {
     fVcent[i] = vcent[i];
     fVdiff[i] = vdiff[i];
   }
}

~TIndexCellIterV()

TIndexCellIterV::~TIndexCellIterV ( )

inline

{ }

Member Function Documentation

GetCell()

const TIndexCell * TIndexCellIterV::GetCell ( ) const

inline

{ return fCell; }

LevelDown()

int TIndexCellIterV::LevelDown

(

)

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

Next()

TIndexCell const * TIndexCellIterV::Next

(

)

Return next object in the defined volume.
Returns 0 when no more objects in the cell.

TODO: inefficient cycle ! put here find...

{
 
 
  TIndexCell const *b=0;
 
  while( (b=NextAll()) ) {
    fCell->GetValues( fLevel0, fVind, fVval );
    //printf("flevel0: %d  fVind[0]: %d, fVval[1]: %ld \n",fLevel0,  fVind[0], fVval[1]);
    for(int lev=0; lev<fLevel0; lev++) {
      if( TMath::Abs( fVval[lev]-fVcent[lev] ) > fVdiff[lev] ) break;
      if( lev == fLevel0-1 ) return b;
    }
  }
  return 0;
}

NextAll()

TIndexCell const * TIndexCellIterV::NextAll

(

)

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-1,fVind)->GetEntries();
  //printf("Next: nent= %d  fPass= %d\n",nent,fPass);
 
  if( fVind[fLevel-1] < nent-1 ) {
    fVind[fLevel-1]++;
    fPass++;
    return  fCell->At(fLevel,fVind);
  } else {
    if( LevelDown() ) goto START;
  }
  return 0;
}

Reset()

void TIndexCellIterV::Reset

(

)

Reset array iterator.

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

Test()

void TIndexCellIterV::Test

(

)

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

Member Data Documentation

fCell

const TIndexCell* TIndexCellIterV::fCell

private

cell being iterated

fDirection

Bool_t TIndexCellIterV::fDirection

private

iteration direction

fLevel

Int_t TIndexCellIterV::fLevel

private

current level

fLevel0

Int_t TIndexCellIterV::fLevel0

private

level to be iterated on

fPass

Int_t TIndexCellIterV::fPass

private

number of cells iterated

fVcent

Long_t* TIndexCellIterV::fVcent

private

central subcell

fVdiff

Long_t* TIndexCellIterV::fVdiff

private

volume to be iterated around Vcent

fVind

Int_t* TIndexCellIterV::fVind

private

current position in array

fVval

Long_t* TIndexCellIterV::fVval

private

values corresponding to Vind

---

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

• /home/antonio/fedra_doxygen/src/libEmath/TIndexCell.h
• /home/antonio/fedra_doxygen/src/libEmath/TIndexCell.cpp