ParMooN
 All Classes Functions Variables Friends Pages
It_Search.h
1 // =======================================================================
2 // @(#)It_Search.h 1.1 10/30/98
3 //
4 // Class: TIt_Search
5 // Purpose: class of iterators which search the cell tree by
6 // graph-theoretic methods
7 //
8 // Author: Volker Behns 01.09.97
9 //
10 // =======================================================================
11 
12 #ifndef __IT_SEARCH__
13 #define __IT_SEARCH__
14 
15 #include <Iterator.h>
16 
19 class TIt_Search : public TIterator
20 {
21  protected:
23  struct {int N_Children, CurrentChild;} Status[MAX_ItLevel];
24 
29 
32 
33  public:
34  // Constructors
35 
36  // Methods
38  virtual int Init(int level);
39 
41  virtual int GetMaxLevel();
42 };
43 
44 #endif
int ActiveLevel
Definition: It_Search.h:26
TBaseCell * ActiveCell
Definition: It_Search.h:31
virtual int Init(int level)
Definition: It_Search.C:15
struct TIt_Search::@0 Status[MAX_ItLevel]
Definition: It_Search.h:19
virtual int GetMaxLevel()
Definition: It_Search.C:29
int ActiveRootCell
Definition: It_Search.h:28
information for finite element data structure
Definition: BaseCell.h:25
Definition: Iterator.h:25