#include <It_Search.h>

Inheritance diagram for TIt_Search:

Collaboration diagram for TIt_Search:

Public Member Functions
virtual int	Init (int level)

virtual int	GetMaxLevel ()

Public Member Functions inherited from TIterator
int	SetParam (TDomain *domain)

virtual TBaseCell *	Next (int &info)=0

virtual TBaseCell *	Prev ()=0

Protected Attributes
struct {
int N_Children

int CurrentChild

}	Status [MAX_ItLevel]

int	ActiveLevel

int	ActiveRootCell

TBaseCell *	ActiveCell

Protected Attributes inherited from TIterator
int	Level

TDomain *	Domain

TBaseCell **	CellTree

int	N_RootCells

Detailed Description

class of iterators which search the cell tree by graph-theoretic methods

Member Function Documentation

int TIt_Search::GetMaxLevel ( )

virtual

return the maximum level

Implements TIterator.

Reimplemented in TIt_Mortar, and TIt_Finest.

int TIt_Search::Init ( int level )

virtual

Initialize on level

Implements TIterator.

Here is the caller graph for this function:

TBaseCell* TIt_Search::ActiveCell

protected

active cell

int TIt_Search::ActiveLevel

protected

active level in status vector

int TIt_Search::ActiveRootCell

protected

active root cell

struct { ... } TIt_Search::Status[MAX_ItLevel]

status vector

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