DofComm.h 4.21 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
// ============================================================================
// ==                                                                        ==
// == AMDiS - Adaptive multidimensional simulations                          ==
// ==                                                                        ==
// ==  http://www.amdis-fem.org                                              ==
// ==                                                                        ==
// ============================================================================
//
// Software License for AMDiS
//
// Copyright (c) 2010 Dresden University of Technology 
// All rights reserved.
// Authors: Simon Vey, Thomas Witkowski et al.
//
// This file is part of AMDiS
//
// See also license.opensource.txt in the distribution.



/** \file DofComm.h */

#ifndef AMDIS_DOF_COMM_H
#define AMDIS_DOF_COMM_H

#include <map>
#include "FiniteElemSpace.h"
#include "Global.h"

namespace AMDiS {

  using namespace std;

  class DofComm
  {
  public:
37
38
39
    DofComm() 
      : data(1)
    {}
40
41
42
    
    typedef map<const FiniteElemSpace*, DofContainer> FeMapType;
    typedef FeMapType::iterator FeMapIter;
43
    typedef map<int, FeMapType> DataType;
44
    typedef DataType::iterator DataIter;
45
46
    // meshLevel: map[rank -> map[feSpace -> DofContainer]]
    typedef vector<DataType> LevelDataType;
47

48
49
50
    inline DofContainer& getDofContainer(int rank, 
					 const FiniteElemSpace *feSpace, 
					 int level = 0)
51
    {
52
      return data[level][rank][feSpace];
53
54
55
56
    }

    void removeEmpty();

57
    void init(int nLevels = 1)
58
59
    {
      data.clear();
60
      data.resize(nLevels);
61
62
    }

63
    DataType& getData(int level = 0)
64
    {
65
      return data[level];
66
67
68
    }

  protected:
69
    LevelDataType data;
70
71
72
73
74
75
76
77
78
79
80

    friend class Iterator;

  public:
    class Iterator
    {
    public:
      Iterator(DofComm &dc,
	       const FiniteElemSpace *fe = NULL)
	: dofComm(dc),
	  dofCounter(-1),
81
82
	  traverseFeSpace(fe),
	  traverseLevel(0)
83
      {
84
85
	goFirst();
      }
86

87
88
89
90
91
92
93
94
95
      Iterator(DofComm &dc,
	       int level,
	       const FiniteElemSpace *fe = NULL)
	: dofComm(dc),
	  dofCounter(-1),
	  traverseFeSpace(fe),
	  traverseLevel(level)
      {
	goFirst();
96
97
98
99
      }

      inline bool end()
      {
100
	return (dataIter == dofComm.data[traverseLevel].end());
101
102
103
104
      }
      
      inline void nextRank()
      {
105
106
107
	do {
	  ++dataIter;
	} while (setNextFeMap() == false);
108
109
110
111
112
113
114
      }

      inline void nextFeSpace()
      {
	++feMapIter;
      }

115
116
117
118
      inline void next()
      {
	++feMapIter;
	if (feMapIter == dataIter->second.end()) {
119
120
121
	  do {
	    ++dataIter;
	  } while (setNextFeMap() == false);
122
123
124
125
126
127
	} else {
	  dofIter = feMapIter->second.begin();
	  dofCounter = 0;
	}
      }

128
129
130
131
132
133
134
135
136
137
138
139
      inline void beginDofIter(const FiniteElemSpace *fe = NULL)
      {
	FUNCNAME("DofComm::Iterator::beginDofIter()");

	if (fe != NULL) {
	  feMapIter = dataIter->second.begin();

	  while (feMapIter->first != fe &&
		 feMapIter != dataIter->second.end())
	    ++feMapIter;
	}

140
141
142
143
	if (feMapIter != dataIter->second.end()) {
	  dofIter = feMapIter->second.begin();
	  dofCounter = 0;
	}
144
145
146
147
      }

      inline bool endDofIter()
      {
148
149
150
	if (feMapIter == dataIter->second.end())
	  return true;

151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
	return (dofIter == feMapIter->second.end());
      }
      
      inline void nextDof()
      {
	++dofIter;
	++dofCounter;
      }

      inline int getRank()
      {
	return dataIter->first;
      }

      inline const FiniteElemSpace* getFeSpace()
      {
	return feMapIter->first;
      }

      inline DofContainer& getDofs()
      {
	return feMapIter->second;
      }

      inline const DegreeOfFreedom* getDof()
      {
	return *dofIter;
      }

      inline DegreeOfFreedom getDofIndex()
      {
	return **dofIter;
      }

      inline int getDofCounter()
      {
	return dofCounter;
      }

    protected:
191
192
193
194
195
196
197
198
      void goFirst()
      {
	dataIter = dofComm.data[traverseLevel].begin();

	while (setNextFeMap() == false)
	  ++dataIter;
      }

199
      bool setNextFeMap();
200
201
202
203
204
205
206
207
208
209
210
211
212

    protected:
      DofComm &dofComm;
      
      DofComm::DataIter dataIter;
      
      DofComm::FeMapIter feMapIter;

      DofContainer::iterator dofIter;

      int dofCounter;

      const FiniteElemSpace *traverseFeSpace;
213
214

      int traverseLevel;
215
216
217
218
219
220
221
222
    };


  };

}

#endif // AMDIS_DOF_COMM_H