InteriorBoundary.cc 7.12 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
18

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

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

    bool otherMode = false;

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

32
    case 3:
33
34
35
      TEST_EXIT_DBG(otherBound.elType == 0)
	("Only 3D macro elements with level 0 are supported!\n");

36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
      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);

	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; 	
      }

      if (subObj == FACE && ithObj != 1) {
60
61
62
	const BasisFunction *basFcts = feSpace->getBasisFcts();
	int nBasFcts = basFcts->getNumber();
	std::vector<DegreeOfFreedom> localDofs0(nBasFcts), localDofs1(nBasFcts);
63
	basFcts->getLocalIndices(el, feSpace->getAdmin(), localDofs0);
64
	basFcts->getLocalIndices(otherBound.el, feSpace->getAdmin(), localDofs1);
65
66
67
68
69
	
	if (ithObj == 2 || ithObj == 3)
	  otherMode = (localDofs0[0] != localDofs1[0]);
	  
	if (ithObj == 0)
70
	  otherMode = (localDofs0[1] != localDofs1[1]);
71
72
      }
      break;
73

74
75
76
77
78
79
80
81
    default:
      ERROR_EXIT("This should not happen!\n");
    }

    otherBound.reverseMode = otherMode;
  }


82
83
84
  bool BoundaryObject::operator==(const BoundaryObject& other) const
  {
    return (other.elIndex == elIndex && 
85
	    //	    other.elType == elType &&
86
87
88
89
90
91
92
93
	    other.subObj == subObj && 
	    other.ithObj == ithObj);
  }


  bool BoundaryObject::operator!=(const BoundaryObject& other) const
  {
    return (other.elIndex != elIndex || 
94
	    //    other.elType != elType ||
95
96
97
98
99
	    other.subObj != subObj || 
	    other.ithObj != ithObj);
  }


100
101
102
103
104
105
106
107
  bool AtomicBoundary::operator==(const AtomicBoundary& other) const
  {
    return (rankObj == other.rankObj && 
	    neighObj == other.neighObj && 
	    type == other.type);
  }


108
  AtomicBoundary& InteriorBoundary::getNewAtomic(int rank)
Thomas Witkowski's avatar
Thomas Witkowski committed
109
110
111
112
113
  {
    boundary[rank].resize(boundary[rank].size() + 1);
    return boundary[rank][boundary[rank].size() - 1];
  }

114

115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
  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;
  }


141
142
  void InteriorBoundary::serialize(std::ostream &out)
  {
143
144
    FUNCNAME("InteriorBoundary::serialize()");

145
    int mSize = boundary.size();
146
    SerUtil::serialize(out, mSize);
147
148
149
    for (RankToBoundMap::iterator it = boundary.begin(); it != boundary.end(); ++it) {
      int rank = it->first;
      int boundSize = it->second.size();
150
151
      SerUtil::serialize(out, rank);
      SerUtil::serialize(out, boundSize);
152
153
154
      for (int i = 0; i < boundSize; i++) {
	AtomicBoundary &bound = (it->second)[i];

155
	SerUtil::serialize(out, bound.rankObj.elIndex);
156
	SerUtil::serialize(out, bound.rankObj.elType);
157
158
	SerUtil::serialize(out, bound.rankObj.subObj);
	SerUtil::serialize(out, bound.rankObj.ithObj);
159
	SerUtil::serialize(out, bound.rankObj.reverseMode);
160
	serializeExcludeList(out, bound.rankObj.excludedSubstructures);
161

162
	SerUtil::serialize(out, bound.neighObj.elIndex);
163
	SerUtil::serialize(out, bound.neighObj.elType);
164
165
	SerUtil::serialize(out, bound.neighObj.subObj);
	SerUtil::serialize(out, bound.neighObj.ithObj);
166
	SerUtil::serialize(out, bound.neighObj.reverseMode);
167
	serializeExcludeList(out, bound.neighObj.excludedSubstructures);
168
169

	SerUtil::serialize(out, bound.type);
170
171
      }
    }
172
173
  }

174

175
176
  void InteriorBoundary::deserialize(std::istream &in, 
				     std::map<int, Element*> &elIndexMap)
177
  {
178
179
    FUNCNAME("InteriorBoundary::deserialize()");

180
    int mSize = 0;
181
    SerUtil::deserialize(in, mSize);
182
183
184
    for (int i = 0; i < mSize; i++) {
      int rank = 0;
      int boundSize = 0;
185
186
      SerUtil::deserialize(in, rank);
      SerUtil::deserialize(in, boundSize);
187
188
189
190
191

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

192
	SerUtil::deserialize(in, bound.rankObj.elIndex);
193
	SerUtil::deserialize(in, bound.rankObj.elType);
194
195
	SerUtil::deserialize(in, bound.rankObj.subObj);
	SerUtil::deserialize(in, bound.rankObj.ithObj);
196
	SerUtil::deserialize(in, bound.rankObj.reverseMode);
197
	deserializeExcludeList(in, bound.rankObj.excludedSubstructures);
198

199
	SerUtil::deserialize(in, bound.neighObj.elIndex);
200
	SerUtil::deserialize(in, bound.neighObj.elType);
201
202
	SerUtil::deserialize(in, bound.neighObj.subObj);
	SerUtil::deserialize(in, bound.neighObj.ithObj);
203
	SerUtil::deserialize(in, bound.neighObj.reverseMode);
204
	deserializeExcludeList(in, bound.neighObj.excludedSubstructures);
205

206
207
	SerUtil::deserialize(in, bound.type);

208
209
210
211
	TEST_EXIT_DBG(elIndexMap.count(bound.rankObj.elIndex) == 1)
	  ("Cannot find element with index %d for deserialization!\n", 
	   bound.rankObj.elIndex);

212
213
214
	TEST_EXIT_DBG(elIndexMap[bound.rankObj.elIndex]->getIndex() == 
		      bound.rankObj.elIndex)("Should not happen!\n");

215
216
	bound.rankObj.el = elIndexMap[bound.rankObj.elIndex];
	bound.neighObj.el = NULL;
217
218
      }
    }
219
  }
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249


  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));
    }
  }

250
}