InteriorBoundary.cc 7.42 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
//
// 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.


13
#include "InteriorBoundary.h"
14
15
#include "FiniteElemSpace.h"
#include "BasisFunction.h"
16
#include "Serializer.h"
17
#include "VertexVector.h"
18
19

namespace AMDiS {
Thomas Witkowski's avatar
Thomas Witkowski committed
20

21
  void BoundaryObject::setReverseMode(BoundaryObject &otherBound, 
22
23
				      FiniteElemSpace *feSpace,
				      BoundaryType boundary)
24
25
26
27
28
29
30
  {
    FUNCNAME("BoundaryObject::setReverseMode()");

    bool otherMode = false;

    switch (feSpace->getMesh()->getDim()) {
    case 2:
31
      otherMode = true;
32
      break;
33

34
    case 3:
35
      TEST_EXIT_DBG(otherBound.elType == 0)
36
37
	("Only 3D macro elements with level 0 are supported. This element has level %d!\n", otherBound.elType);

38

39
40
41
42
43
44
45
46
47
48
49
50
      if (subObj == EDGE) {	
	int el0_v0 = el->getVertexOfEdge(ithObj, 0);
	int el0_v1 = el->getVertexOfEdge(ithObj, 1);
	int el1_v0 = el->getVertexOfEdge(otherBound.ithObj, 0);
	int el1_v1 = el->getVertexOfEdge(otherBound.ithObj, 1);

	const BasisFunction *basFcts = feSpace->getBasisFcts();
	int nBasFcts = basFcts->getNumber();
	std::vector<DegreeOfFreedom> localDofs0(nBasFcts), localDofs1(nBasFcts);
	basFcts->getLocalIndices(el, feSpace->getAdmin(), localDofs0);
	basFcts->getLocalIndices(otherBound.el, feSpace->getAdmin(), localDofs1);

51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
	Mesh *mesh = feSpace->getMesh();

	if (mesh->isPeriodicAssociation(boundary) == false) {
	  TEST_EXIT_DBG(localDofs0[el0_v0] == localDofs1[el1_v0] ||
			localDofs0[el0_v0] == localDofs1[el1_v1])
	    ("This should not happen!\n");
	  TEST_EXIT_DBG(localDofs0[el0_v1] == localDofs1[el1_v0] ||
			localDofs0[el0_v1] == localDofs1[el1_v1])
	    ("This should not happen!\n");
	  
	  if (localDofs0[el0_v0] != localDofs1[el1_v0])
	    otherMode = true; 	
	} else {
	  if (mesh->associated(localDofs0[el0_v0], localDofs1[el1_v0]) == false)
	    otherMode = true;
	}
67
68
69
      }

      if (subObj == FACE && ithObj != 1) {
70
71
72
	const BasisFunction *basFcts = feSpace->getBasisFcts();
	int nBasFcts = basFcts->getNumber();
	std::vector<DegreeOfFreedom> localDofs0(nBasFcts), localDofs1(nBasFcts);
73
	basFcts->getLocalIndices(el, feSpace->getAdmin(), localDofs0);
74
	basFcts->getLocalIndices(otherBound.el, feSpace->getAdmin(), localDofs1);
75
76
77
78
79
	
	if (ithObj == 2 || ithObj == 3)
	  otherMode = (localDofs0[0] != localDofs1[0]);
	  
	if (ithObj == 0)
80
	  otherMode = (localDofs0[1] != localDofs1[1]);
81
82
      }
      break;
83

84
85
86
87
88
89
90
91
    default:
      ERROR_EXIT("This should not happen!\n");
    }

    otherBound.reverseMode = otherMode;
  }


92
93
94
  bool BoundaryObject::operator==(const BoundaryObject& other) const
  {
    return (other.elIndex == elIndex && 
95
	    //	    other.elType == elType &&
96
97
98
99
100
101
102
103
	    other.subObj == subObj && 
	    other.ithObj == ithObj);
  }


  bool BoundaryObject::operator!=(const BoundaryObject& other) const
  {
    return (other.elIndex != elIndex || 
104
	    //    other.elType != elType ||
105
106
107
108
109
	    other.subObj != subObj || 
	    other.ithObj != ithObj);
  }


110
111
112
113
114
115
116
117
  bool AtomicBoundary::operator==(const AtomicBoundary& other) const
  {
    return (rankObj == other.rankObj && 
	    neighObj == other.neighObj && 
	    type == other.type);
  }


118
  AtomicBoundary& InteriorBoundary::getNewAtomic(int rank)
Thomas Witkowski's avatar
Thomas Witkowski committed
119
120
121
122
123
  {
    boundary[rank].resize(boundary[rank].size() + 1);
    return boundary[rank][boundary[rank].size() - 1];
  }

124

125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
  bool InteriorBoundary::operator==(const InteriorBoundary& other) const
  {
    InteriorBoundary& other2 = const_cast<InteriorBoundary&>(other);

    for (RankToBoundMap::const_iterator it = boundary.begin(); 
	 it != boundary.end(); ++it) {
      if (other2.boundary.count(it->first) == 0)
	return false;     

      if (other2.boundary[it->first].size() != it->second.size())
	return false;
            
      for (unsigned int i = 0; i < it->second.size(); i++) {
	std::vector<AtomicBoundary>::iterator bIt = 
	  find(other2.boundary[it->first].begin(),
	       other2.boundary[it->first].end(), it->second[i]);
	
	if (bIt == other2.boundary[it->first].end())
	  return false;	
      }      
    }

    return true;
  }


151
152
  void InteriorBoundary::serialize(std::ostream &out)
  {
153
154
    FUNCNAME("InteriorBoundary::serialize()");

155
    int mSize = boundary.size();
156
    SerUtil::serialize(out, mSize);
157
158
159
    for (RankToBoundMap::iterator it = boundary.begin(); it != boundary.end(); ++it) {
      int rank = it->first;
      int boundSize = it->second.size();
160
161
      SerUtil::serialize(out, rank);
      SerUtil::serialize(out, boundSize);
162
163
164
      for (int i = 0; i < boundSize; i++) {
	AtomicBoundary &bound = (it->second)[i];

165
	SerUtil::serialize(out, bound.rankObj.elIndex);
166
	SerUtil::serialize(out, bound.rankObj.elType);
167
168
	SerUtil::serialize(out, bound.rankObj.subObj);
	SerUtil::serialize(out, bound.rankObj.ithObj);
169
	SerUtil::serialize(out, bound.rankObj.reverseMode);
170
	serializeExcludeList(out, bound.rankObj.excludedSubstructures);
171

172
	SerUtil::serialize(out, bound.neighObj.elIndex);
173
	SerUtil::serialize(out, bound.neighObj.elType);
174
175
	SerUtil::serialize(out, bound.neighObj.subObj);
	SerUtil::serialize(out, bound.neighObj.ithObj);
176
	SerUtil::serialize(out, bound.neighObj.reverseMode);
177
	serializeExcludeList(out, bound.neighObj.excludedSubstructures);
178
179

	SerUtil::serialize(out, bound.type);
180
181
      }
    }
182
183
  }

184

185
186
  void InteriorBoundary::deserialize(std::istream &in, 
				     std::map<int, Element*> &elIndexMap)
187
  {
188
189
    FUNCNAME("InteriorBoundary::deserialize()");

190
    int mSize = 0;
191
    SerUtil::deserialize(in, mSize);
192
193
194
    for (int i = 0; i < mSize; i++) {
      int rank = 0;
      int boundSize = 0;
195
196
      SerUtil::deserialize(in, rank);
      SerUtil::deserialize(in, boundSize);
197
198
199
200
201

      boundary[rank].resize(boundSize);
      for (int i = 0; i < boundSize; i++) {
	AtomicBoundary &bound = boundary[rank][i];

202
	SerUtil::deserialize(in, bound.rankObj.elIndex);
203
	SerUtil::deserialize(in, bound.rankObj.elType);
204
205
	SerUtil::deserialize(in, bound.rankObj.subObj);
	SerUtil::deserialize(in, bound.rankObj.ithObj);
206
	SerUtil::deserialize(in, bound.rankObj.reverseMode);
207
	deserializeExcludeList(in, bound.rankObj.excludedSubstructures);
208

209
	SerUtil::deserialize(in, bound.neighObj.elIndex);
210
	SerUtil::deserialize(in, bound.neighObj.elType);
211
212
	SerUtil::deserialize(in, bound.neighObj.subObj);
	SerUtil::deserialize(in, bound.neighObj.ithObj);
213
	SerUtil::deserialize(in, bound.neighObj.reverseMode);
214
	deserializeExcludeList(in, bound.neighObj.excludedSubstructures);
215

216
217
	SerUtil::deserialize(in, bound.type);

218
219
220
221
	TEST_EXIT_DBG(elIndexMap.count(bound.rankObj.elIndex) == 1)
	  ("Cannot find element with index %d for deserialization!\n", 
	   bound.rankObj.elIndex);

222
223
224
	TEST_EXIT_DBG(elIndexMap[bound.rankObj.elIndex]->getIndex() == 
		      bound.rankObj.elIndex)("Should not happen!\n");

225
226
	bound.rankObj.el = elIndexMap[bound.rankObj.elIndex];
	bound.neighObj.el = NULL;
227
228
      }
    }
229
  }
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259


  void InteriorBoundary::serializeExcludeList(std::ostream &out, ExcludeList &list)
  {
    int size = list.size();
    SerUtil::serialize(out, size);
    for (int i = 0; i < size; i++) {
      SerUtil::serialize(out, list[i].first);
      SerUtil::serialize(out, list[i].second);
    }
  }


  void InteriorBoundary::deserializeExcludeList(std::istream &in, ExcludeList &list)
  {
    int size = 0;
    SerUtil::deserialize(in, size);
    list.resize(0);
    list.reserve(size);

    for (int i = 0; i < size; i++) {
      GeoIndex a;
      int b;

      SerUtil::deserialize(in, a);
      SerUtil::deserialize(in, b);
      list.push_back(std::make_pair(a, b));
    }
  }

260
}