ElementObjectDatabase.cc 38.2 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
/******************************************************************************
 *
 * AMDiS - Adaptive multidimensional simulations
 *
 * Copyright (C) 2013 Dresden University of Technology. All Rights Reserved.
 * Web: https://fusionforge.zih.tu-dresden.de/projects/amdis
 *
 * Authors: 
 * Simon Vey, Thomas Witkowski, Andreas Naumann, Simon Praetorius, et al.
 *
 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
 *
 *
 * This file is part of AMDiS
 *
 * See also license.opensource.txt in the distribution.
 * 
 ******************************************************************************/
20
21


22
#include "VertexVector.h"
23
#include "parallel/ElementObjectDatabase.h"
24
#include "parallel/MeshLevelData.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
25

26
namespace AMDiS { namespace Parallel {
Thomas Witkowski's avatar
Thomas Witkowski committed
27

28
  void ElementObjectDatabase::create(map<int, int>& rankMap, MeshLevelData& ld)
29
  {
30
31
32
33
34
    FUNCNAME("ElementObjectDatabase::create()");

    macroElementRankMap = &rankMap;
    levelData = &ld;

35
36
37
38
39
40
41
42

    // === Reset temporary data ===
    
    tmpVertexElements.clear();
    tmpEdgeElements.clear();
    tmpFaceElements.clear();


43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
    // === Fills macro element data structures. ===
    
    TraverseStack stack;
    ElInfo *elInfo = stack.traverseFirst(mesh, -1, 
					 Mesh::CALL_LEAF_EL | 
					 Mesh::FILL_NEIGH | 
					 Mesh::FILL_BOUND);
    while (elInfo) {
      TEST_EXIT_DBG(elInfo->getLevel() == 0)("Should not happen!\n");

      Element *el = elInfo->getElement();
      macroElIndexMap.insert(make_pair(el->getIndex(), el));
      macroElIndexTypeMap.insert(make_pair(el->getIndex(), elInfo->getType()));
     
      // Add all sub object of the element to the variable elObjDb.
      addElement(elInfo);

      elInfo = stack.traverseNext(elInfo);
    }
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81


    // === Move temporary data to original one ===
    
    for (map<DegreeOfFreedom, vector<ElementObjectData> >::iterator it = tmpVertexElements.begin();
	 it != tmpVertexElements.end(); ++it)
      vertexElements[it->first] = it->second;
    tmpVertexElements.clear();

    for (map<DofEdge, vector<ElementObjectData> >::iterator it = tmpEdgeElements.begin();
	 it != tmpEdgeElements.end(); ++it)
      edgeElements[it->first] = it->second;
    tmpEdgeElements.clear();

    for (map<DofFace, vector<ElementObjectData> >::iterator it = tmpFaceElements.begin();
	 it != tmpFaceElements.end(); ++it)
      faceElements[it->first] = it->second;
    tmpFaceElements.clear();


Thomas Witkowski's avatar
Thomas Witkowski committed
82
83
    
    // Handle periodic boudaries
84
    createPeriodicData();
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103

    // Create data about the reverse modes of neighbouring elements.
    createReverseModeData();
  }


  void ElementObjectDatabase::createMacroElementInfo(vector<MacroElement*> &mel)
  {
    macroElIndexMap.clear();
    macroElIndexTypeMap.clear();

    for (vector<MacroElement*>::iterator it = mel.begin(); 
	 it != mel.end(); ++it) {
      macroElIndexMap.insert(make_pair((*it)->getIndex(), (*it)->getElement()));
      macroElIndexTypeMap.insert(make_pair((*it)->getIndex(), (*it)->getElType()));
    }
  }

      
104
  void ElementObjectDatabase::addElement(ElInfo *elInfo)
105
  {
106
    FUNCNAME("ElementObjectDatabase::addElement()");
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132

    TEST_EXIT_DBG(mesh)("Mesh not set!\n");

    Element *el = elInfo->getElement();


    // === First, add all element objects to the database. ===

    for (int i = 0; i < el->getGeo(VERTEX); i++)
      addVertex(el, i);
    
    for (int i = 0; i < el->getGeo(EDGE); i++)
      addEdge(el, i);      
    
    for (int i = 0; i < el->getGeo(FACE); i++)
      addFace(el, i);


    // === Get periodic boundary information. === 
    
    switch (mesh->getDim()) {
    case 2:
      for (int i = 0; i < el->getGeo(EDGE); i++) {
	if (mesh->isPeriodicAssociation(elInfo->getBoundary(EDGE, i))) {
	  // The current element's i-th edge is periodic.
	  Element *neigh = elInfo->getNeighbour(i);
133
134

	  TEST_EXIT_DBG(neigh)("Should not happen!\n");
135
136
137
138
	  
	  DofEdge edge0 = el->getEdge(i);
	  DofEdge edge1 = neigh->getEdge(elInfo->getOppVertex(i));
	  BoundaryType boundaryType = elInfo->getBoundary(EDGE, i);
139

Thomas Witkowski's avatar
Thomas Witkowski committed
140
141
142
143
144
	  // Add the periodic edge.
	  periodicEdges[make_pair(edge0, edge1)] = boundaryType;
	  periodicEdgeAssoc[edge0].insert(edge1);
	  
	  // Add both vertices of the edge to be periodic.
145
146
147
148
149
150
151
	  DegreeOfFreedom mappedDof0 = 
	    mesh->getPeriodicAssociations(boundaryType)[edge0.first];
	  DegreeOfFreedom mappedDof1 = 
	    mesh->getPeriodicAssociations(boundaryType)[edge0.second];
	  periodicVertices[make_pair(edge0.first, mappedDof0)] = boundaryType;
	  periodicVertices[make_pair(edge0.second, mappedDof1)] = boundaryType;

Thomas Witkowski's avatar
Thomas Witkowski committed
152
	  periodicDofAssoc[edge0.first].insert(boundaryType);
153
	  periodicDofAssoc[edge0.second].insert(boundaryType); 
154
155
156
157
158
159
160
161
	}
      }
      break;
    case 3:
      for (int i = 0; i < el->getGeo(FACE); i++) {
	if (mesh->isPeriodicAssociation(elInfo->getBoundary(FACE, i))) {
	  // The current element's i-th face is periodic.
	  Element *neigh = elInfo->getNeighbour(i);
162
163

	  TEST_EXIT_DBG(neigh)("Should not happen!\n");
164
165
166
167
	  
	  DofFace face0 = el->getFace(i);
	  DofFace face1 = neigh->getFace(elInfo->getOppVertex(i));
	  BoundaryType boundaryType = elInfo->getBoundary(FACE, i);
168

169
170
171
172
	  // Add the periodic face.
	  periodicFaces[make_pair(face0, face1)] = elInfo->getBoundary(i);
	  
	  /// Add all three vertices of the face to be periodic.
173
174
175
176
177
178
179
180
181
182
	  DegreeOfFreedom mappedDof0 = 
	    mesh->getPeriodicAssociations(boundaryType)[face0.get<0>()];
	  DegreeOfFreedom mappedDof1 = 
	    mesh->getPeriodicAssociations(boundaryType)[face0.get<1>()];
	  DegreeOfFreedom mappedDof2 = 
	    mesh->getPeriodicAssociations(boundaryType)[face0.get<2>()];

	  periodicVertices[make_pair(face0.get<0>(), mappedDof0)] = boundaryType;
	  periodicVertices[make_pair(face0.get<1>(), mappedDof1)] = boundaryType;
	  periodicVertices[make_pair(face0.get<2>(), mappedDof2)] = boundaryType;
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
	  
	  periodicDofAssoc[face0.get<0>()].insert(boundaryType);
	  periodicDofAssoc[face0.get<1>()].insert(boundaryType);
	  periodicDofAssoc[face0.get<2>()].insert(boundaryType);
	  
	  TEST_EXIT_DBG(face0.get<0>() == 
			mesh->getPeriodicAssociations(boundaryType)[face1.get<0>()] &&
			face0.get<1>() == 
			mesh->getPeriodicAssociations(boundaryType)[face1.get<1>()] &&
			face0.get<2>() == 
			mesh->getPeriodicAssociations(boundaryType)[face1.get<2>()])
	    ("Should not happen!\n");
	  
	  // Create all three edges of the element and add them to be periodic.
	  DofEdge elEdge0 = make_pair(face0.get<0>(), face0.get<1>());
	  DofEdge elEdge1 = make_pair(face0.get<0>(), face0.get<2>());
	  DofEdge elEdge2 = make_pair(face0.get<1>(), face0.get<2>());
	  DofEdge neighEdge0 = make_pair(face1.get<0>(), face1.get<1>());
	  DofEdge neighEdge1 = make_pair(face1.get<0>(), face1.get<2>());
	  DofEdge neighEdge2 = make_pair(face1.get<1>(), face1.get<2>());
	  	  
	  periodicEdges[make_pair(elEdge0, neighEdge0)] = boundaryType;
	  periodicEdges[make_pair(elEdge1, neighEdge1)] = boundaryType;
	  periodicEdges[make_pair(elEdge2, neighEdge2)] = boundaryType;
	  
	  periodicEdgeAssoc[elEdge0].insert(neighEdge0);
	  periodicEdgeAssoc[elEdge1].insert(neighEdge1);
	  periodicEdgeAssoc[elEdge2].insert(neighEdge2);
	}
      }
      break;
    default:
      ERROR_EXIT("Should not happen!\n");
    }       
  }

219

Thomas Witkowski's avatar
Thomas Witkowski committed
220
221
222
223
224
  void ElementObjectDatabase::addVertex(Element *el, int ith)
  {
    DegreeOfFreedom vertex = el->getDof(ith, 0);
    int elIndex = el->getIndex();
    ElementObjectData elObj(elIndex, ith);
225
   
226
    tmpVertexElements[vertex].push_back(elObj);
Thomas Witkowski's avatar
Thomas Witkowski committed
227
228
229
230
231
232
233
234
235
236
237
238
    vertexLocalMap[elObj] = vertex;
  }


  void ElementObjectDatabase::addEdge(Element *el, int ith)
  {
    FUNCNAME("ElementObjectDatabase::addEdge()");

    DofEdge edge = el->getEdge(ith);
    int elIndex = el->getIndex();
    ElementObjectData elObj(elIndex, ith);
    
239
    tmpEdgeElements[edge].push_back(elObj);
Thomas Witkowski's avatar
Thomas Witkowski committed
240
241
242
243
244
245
246
247
248
249
    edgeLocalMap[elObj] = edge;
  }

  
  void ElementObjectDatabase::addFace(Element *el, int ith)
  {
    DofFace face = el->getFace(ith);
    int elIndex = el->getIndex();
    ElementObjectData elObj(elIndex, ith);
    
250
    tmpFaceElements[face].push_back(elObj);
Thomas Witkowski's avatar
Thomas Witkowski committed
251
252
253
    faceLocalMap[elObj] = face;
  }

254

255
  void ElementObjectDatabase::createPeriodicData()
256
  {
257
    FUNCNAME("ElementObjectDatabase::createPeriodicData()");
258
259
260

    TEST_EXIT_DBG(mesh)("Mesh not set!\n");

261
262
    // === Return, if there are no periodic vertices, i.e., there are no  ===
    // === periodic boundaries in the mesh.                               ===
263
264
265
    
    if (periodicVertices.size() == 0)
      return;
266
 
267
268
269
270
271
272
    // === Calculate smallest periodic boundary ID in mesh. ===

    smallestPeriodicBcType = 0;
    for (map<BoundaryType, VertexVector*>::iterator it = mesh->getPeriodicAssociations().begin();
	 it != mesh->getPeriodicAssociations().end(); ++it)
      smallestPeriodicBcType = std::min(smallestPeriodicBcType, it->first);
273
274
275
276

    // === Get all vertex DOFs that have multiple periodic associations. ===
    
    // We group all vertices together, that have either two or three periodic
277
278
279
    // associations. For rectangular domains in 2D, the four corner vertices have
    // all two periodic associations. For box domains in 3D, the eight corner
    // vertices have all three periodic associations.
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299

    vector<DegreeOfFreedom> multPeriodicDof2, multPeriodicDof3;
    for (map<DegreeOfFreedom, std::set<BoundaryType> >::iterator it = periodicDofAssoc.begin();
	 it != periodicDofAssoc.end(); ++it) {
      TEST_EXIT_DBG((mesh->getDim() == 2 && it->second.size() <= 2) ||
		    (mesh->getDim() == 3 && it->second.size() <= 3))
	("Should not happen!\n");
      
      if (it->second.size() == 2)
	multPeriodicDof2.push_back(it->first);
      if (it->second.size() == 3)
	multPeriodicDof3.push_back(it->first);
    }

    if (mesh->getDim() == 2) {
      TEST_EXIT_DBG(multPeriodicDof2.size() == 0 || 
		    multPeriodicDof2.size() == 4)
	("Should not happen (%d)!\n", multPeriodicDof2.size());
      TEST_EXIT_DBG(multPeriodicDof3.size() == 0)("Should not happen!\n");
    }
300

301
302
303
304
305
    if (mesh->getDim() == 3) {
      TEST_EXIT_DBG(multPeriodicDof3.size() == 0 || 
		    multPeriodicDof3.size() == 8)
	("Should not happen (%d)!\n", multPeriodicDof3.size());
    }
306

307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
    if (multPeriodicDof2.size() > 0) {
      for (unsigned int i = 0; i < multPeriodicDof2.size(); i++) {
	DegreeOfFreedom dof0 = multPeriodicDof2[i];
	if (dof0 == -1)
	  continue;
	
	DegreeOfFreedom dof1 = -1;
	DegreeOfFreedom dof2 = -1;
	BoundaryType type0 = *(periodicDofAssoc[dof0].begin());
	BoundaryType type1 = *(++(periodicDofAssoc[dof0].begin()));
	
	for (PerBoundMap<DegreeOfFreedom>::iterator it = periodicVertices.begin();
	     it != periodicVertices.end(); ++it) {
	  if (it->first.first == dof0 && it->second == type0)
	    dof1 = it->first.second;
	  if (it->first.first == dof0 && it->second == type1)
	    dof2 = it->first.second;
	  
	  if (dof1 != -1 && dof2 != -1)
	    break;
	}
	
	TEST_EXIT_DBG(dof1 != -1 && dof2 != -1)("Should not happen!\n");
	
	DegreeOfFreedom dof3 = -1;
	for (PerBoundMap<DegreeOfFreedom>::iterator it = periodicVertices.begin();
	     it != periodicVertices.end(); ++it) {
	  if (it->first.first == dof1 && it->second == type1) {
	    dof3 = it->first.second;
	    
	    TEST_EXIT_DBG(periodicVertices[make_pair(dof2, dof3)] == type0)
	      ("Should not happen!\n");
	    
	    break;
	  }
	}
	  
	TEST_EXIT_DBG(dof3 != -1)("Should not happen!\n");
	TEST_EXIT_DBG(periodicVertices.count(make_pair(dof0, dof3)) == 0)
	  ("Should not happen!\n");
	TEST_EXIT_DBG(periodicVertices.count(make_pair(dof3, dof0)) == 0)
	  ("Should not happen!\n");
349
350

 	periodicVertices[make_pair(dof0, dof3)] = 
351
	  provideConnectedPeriodicBoundary(type0, type1);
352
 	periodicVertices[make_pair(dof3, dof0)] = 
353
 	  provideConnectedPeriodicBoundary(type0, type1);
354

355
356
357
358
359
360
361
362
	for (unsigned int j = i + 1; j < multPeriodicDof2.size(); j++)
	  if (multPeriodicDof2[j] == dof3)
	    multPeriodicDof2[j] = -1;
      }
    }

    if (multPeriodicDof3.size() > 0) {
      int nMultPeriodicDofs = multPeriodicDof3.size();
363

364
365
366
367
368
369
370
371
      for (int i = 0; i < nMultPeriodicDofs; i++) {
	for (int j = i + 1; j < nMultPeriodicDofs; j++) {
	  pair<DegreeOfFreedom, DegreeOfFreedom> perDofs0 = 
	    make_pair(multPeriodicDof3[i], multPeriodicDof3[j]);
	  pair<DegreeOfFreedom, DegreeOfFreedom> perDofs1 = 
	    make_pair(multPeriodicDof3[j], multPeriodicDof3[i]);
	  
	  if (periodicVertices.count(perDofs0) == 0) {
372
	    BoundaryType b = getNewBoundaryType();
373
374
	    periodicVertices[perDofs0] = b;
	    periodicVertices[perDofs1] = b;
375
376
377
378
	  }
	}
      }
    }
379
380
  
   
381
382
383
384
385
386
387
388
    // === Get all edges that have multiple periodic associations (3D only!). ===
    
    for (map<DofEdge, std::set<DofEdge> >::iterator it = periodicEdgeAssoc.begin();
	 it != periodicEdgeAssoc.end(); ++it) {
      if (it->second.size() > 1) {
	TEST_EXIT_DBG(mesh->getDim() == 3)("Should not happen!\n");
	TEST_EXIT_DBG(it->second.size() == 2)("Should not happen!\n");
	
389
390
391
	DofEdge edge0 = it->first;
	DofEdge edge1 = *(it->second.begin());
	DofEdge edge2 = *(++(it->second.begin()));
392
	
393
394
395
396
397
398
399
400
401
402
	pair<DofEdge, DofEdge> perEdge0 = make_pair(edge1, edge2);
	pair<DofEdge, DofEdge> perEdge1 = make_pair(edge2, edge1);

	TEST_EXIT_DBG(periodicEdges.count(make_pair(edge0, edge1)) == 1)
	  ("Should not happen!\n");
	TEST_EXIT_DBG(periodicEdges.count(make_pair(edge1, edge0)) == 1)
	  ("Should not happen!\n");

	BoundaryType type0 = periodicEdges[make_pair(edge0, edge1)];
	BoundaryType type1 = periodicEdges[make_pair(edge0, edge2)];
403
	BoundaryType type2 = provideConnectedPeriodicBoundary(type0, type1);
404
405
406

 	periodicEdges[perEdge0] = type2;
 	periodicEdges[perEdge1] = type2;
407
408
409
410
411
412
413
414
415
416
417
418
419
420
      }
    }


    // === In debug mode we make some tests, if the periodic structures are set ===
    // === in a symmetric way, i.e., if A -> B for a specific boundary type,    ===
    // === there must be a mapping B -> A with the same boundary type.          ===
    
#if (DEBUG != 0)
    for (PerBoundMap<DegreeOfFreedom>::iterator it = periodicVertices.begin();
	 it != periodicVertices.end(); ++it) {
      pair<DegreeOfFreedom, DegreeOfFreedom> testVertex = 
	make_pair(it->first.second, it->first.first);
      
421
422
423
424
      TEST_EXIT_DBG(periodicVertices.count(testVertex) == 1)
	("Should not happen!\n");
      TEST_EXIT_DBG(periodicVertices[testVertex] == it->second)
	("Should not happen!\n");
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
    }

    for (PerBoundMap<DofEdge>::iterator it = periodicEdges.begin();
	 it != periodicEdges.end(); ++it) {
      pair<DofEdge, DofEdge> testEdge = 
	make_pair(it->first.second, it->first.first);
      
      TEST_EXIT_DBG(periodicEdges.count(testEdge) == 1)("Should not happen!\n");
      TEST_EXIT_DBG(periodicEdges[testEdge] == it->second)("Should not happen!\n");
    }
    
    for (PerBoundMap<DofFace>::iterator it = periodicFaces.begin();
	 it != periodicFaces.end(); ++it) {
      pair<DofFace, DofFace> testFace = 
	make_pair(it->first.second, it->first.first);
      
      TEST_EXIT_DBG(periodicFaces.count(testFace) == 1)("Should not happen!\n");
      TEST_EXIT_DBG(periodicFaces[testFace] == it->second)("Should not happen!\n");
    }
#endif       
  }


448
  BoundaryType ElementObjectDatabase::getNewBoundaryType()
449
  {
450
    FUNCNAME("ElementObjectDatabase::getNewBoundaryType()");
451
452
453
454
455
456
457
458
459
460

    BoundaryType newPeriodicBoundaryType = 0;
    for (map<BoundaryType, VertexVector*>::iterator it = mesh->getPeriodicAssociations().begin();
	 it != mesh->getPeriodicAssociations().end(); ++it)
      newPeriodicBoundaryType = std::min(newPeriodicBoundaryType, it->first);
    
    TEST_EXIT_DBG(newPeriodicBoundaryType < 0)("Should not happen!\n");
    newPeriodicBoundaryType--;
    
    mesh->getPeriodicAssociations()[newPeriodicBoundaryType] = 
461
      new VertexVector(feSpace->getAdmin(), "");
462
463
464
465
466
    
    return newPeriodicBoundaryType;
  }


467
  BoundaryType 
468
  ElementObjectDatabase::provideConnectedPeriodicBoundary(BoundaryType b0, 
469
							  BoundaryType b1)
470
  {
471
    FUNCNAME("ElementObjectDatabase::provideConnectedPeriodicBoundary()");
472
473

    std::pair<BoundaryType, BoundaryType> bConn = 
474
      (b0 <= b1 ? make_pair(b0, b1) : make_pair(b1, b0));
475
476

    if (bConnMap.count(bConn) == 0) {
477
      BoundaryType newPeriodicBoundaryType = getNewBoundaryType();
478
479
480
481
482

      VertexVector &vecB0 = mesh->getPeriodicAssociations(b0);
      VertexVector &vecB1 = mesh->getPeriodicAssociations(b1);
      VertexVector &vecC = mesh->getPeriodicAssociations(newPeriodicBoundaryType);

483
      DOFIteratorBase it(const_cast<DOFAdmin*>(feSpace->getAdmin()), USED_DOFS);
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501

      for (it.reset(); !it.end(); ++it) {
	if (!it.isDofFree()) {
	  TEST_EXIT_DBG(vecB1[vecB0[it.getDOFIndex()]] == vecB0[vecB1[it.getDOFIndex()]])
	    ("Should not happen!\n");

	  vecC[it.getDOFIndex()] = vecB1[vecB0[it.getDOFIndex()]];
	}
      }
      
      bConnMap[bConn] = newPeriodicBoundaryType;
    }


    return bConnMap[bConn];
  }


502
  void ElementObjectDatabase::updateRankData()
Thomas Witkowski's avatar
Thomas Witkowski committed
503
  {
504
    FUNCNAME("ElementObjectDatabase::updateRankData()");
505
    
Thomas Witkowski's avatar
Thomas Witkowski committed
506
507
    TEST_EXIT(macroElementRankMap)("Should not happen!\n");

Thomas Witkowski's avatar
Thomas Witkowski committed
508
    vertexInRank.clear();
509
    for (flat_map<DegreeOfFreedom, vector<ElementObjectData> >::iterator it = vertexElements.begin();
Thomas Witkowski's avatar
Thomas Witkowski committed
510
	 it != vertexElements.end(); ++it) {
511
      for (vector<ElementObjectData>::iterator it2 = it->second.begin(); 
Thomas Witkowski's avatar
Thomas Witkowski committed
512
	   it2 != it->second.end(); ++it2) {
Thomas Witkowski's avatar
Thomas Witkowski committed
513
	int elementInRank = (*macroElementRankMap)[it2->elIndex];	
Thomas Witkowski's avatar
Thomas Witkowski committed
514
515
	if (it2->elIndex > vertexInRank[it->first][elementInRank].elIndex)
	  vertexInRank[it->first][elementInRank] = *it2;
Thomas Witkowski's avatar
Thomas Witkowski committed
516
517
518
      }
    }
    
Thomas Witkowski's avatar
Thomas Witkowski committed
519
    edgeInRank.clear();
520
    for (flat_map<DofEdge, vector<ElementObjectData> >::iterator it = edgeElements.begin();
Thomas Witkowski's avatar
Thomas Witkowski committed
521
	 it != edgeElements.end(); ++it) {
522
      for (vector<ElementObjectData>::iterator it2 = it->second.begin(); 
Thomas Witkowski's avatar
Thomas Witkowski committed
523
	   it2 != it->second.end(); ++it2) {
524
	int elementInRank = (*macroElementRankMap)[it2->elIndex];
Thomas Witkowski's avatar
Thomas Witkowski committed
525
526
	if (it2->elIndex > edgeInRank[it->first][elementInRank].elIndex)
	  edgeInRank[it->first][elementInRank] = *it2;
Thomas Witkowski's avatar
Thomas Witkowski committed
527
528
529
      }
    }
    
Thomas Witkowski's avatar
Thomas Witkowski committed
530
    faceInRank.clear();
531
    for (flat_map<DofFace, vector<ElementObjectData> >::iterator it = faceElements.begin();
Thomas Witkowski's avatar
Thomas Witkowski committed
532
	 it != faceElements.end(); ++it) {
533
      for (vector<ElementObjectData>::iterator it2 = it->second.begin(); 
Thomas Witkowski's avatar
Thomas Witkowski committed
534
	   it2 != it->second.end(); ++it2) {
535
	int elementInRank = (*macroElementRankMap)[it2->elIndex];
Thomas Witkowski's avatar
Thomas Witkowski committed
536
537
	if (it2->elIndex > faceInRank[it->first][elementInRank].elIndex)
	  faceInRank[it->first][elementInRank] = *it2;
Thomas Witkowski's avatar
Thomas Witkowski committed
538
539
540
541
      }
    }
  }

542

Thomas Witkowski's avatar
bla    
Thomas Witkowski committed
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
  void ElementObjectDatabase::clear()
  {
    FUNCNAME("ElementObjectDatabase::clear()");

    vertexElements.clear();
    edgeElements.clear();
    faceElements.clear();

    vertexLocalMap.clear();
    edgeLocalMap.clear();
    faceLocalMap.clear();

    vertexInRank.clear();
    edgeInRank.clear();
    faceInRank.clear();

    bConnMap.clear();
    periodicVertices.clear();
    periodicEdges.clear();
    periodicFaces.clear();
    periodicDofAssoc.clear();
    periodicEdgeAssoc.clear();

    edgeReverseMode.clear();
    faceReverseMode.clear();

569
    macroElementRankMap = nullptr;
Thomas Witkowski's avatar
bla    
Thomas Witkowski committed
570
571
572
573
574
    macroElIndexMap.clear();
    macroElIndexTypeMap.clear();
  }


575
  void ElementObjectDatabase::createReverseModeData()
576
  {
577
    FUNCNAME("ElementObjectDatabase::createReverseModeData()");
578

579
580
    // === In 2D, all reverse modes are always true! ===

581
582
583
    if (mesh->getDim() == 2)
      return;

584
585
586

    // === First, create reverse modes for all "directly" neighbouring elements. ===

587
    for (flat_map<DofEdge, vector<ElementObjectData> >::iterator edgeIt = edgeElements.begin();
588
589
590
591
592
	 edgeIt != edgeElements.end(); ++edgeIt) {

      vector<ElementObjectData>& els = edgeIt->second;

      for (unsigned int i = 0; i < els.size(); i++) {
593
594
	BoundaryObject obj0(macroElIndexMap[els[i].elIndex], 
			    macroElIndexTypeMap[els[i].elIndex], 
595
596
597
			    EDGE, els[i].ithObject);

	for (unsigned int j = i + 1; j < els.size(); j++) {
598
599
	  BoundaryObject obj1(macroElIndexMap[els[j].elIndex], 
			      macroElIndexTypeMap[els[j].elIndex], 
600
601
602
603
			      EDGE, els[j].ithObject);

	  bool reverseMode = 
	    BoundaryObject::computeReverseMode(obj0, obj1, feSpace, INTERIOR);
604
605
606
607
	  if (reverseMode) {
	    edgeReverseMode.insert(make_pair(els[i], els[j]));
	    edgeReverseMode.insert(make_pair(els[j], els[i]));
	  }
608
609
610
611
	}
      }
    }

612
    for (flat_map<DofFace, vector<ElementObjectData> >::iterator faceIt = faceElements.begin();
613
614
615
616
617
	 faceIt != faceElements.end(); ++faceIt) {

      vector<ElementObjectData>& els = faceIt->second;

      for (unsigned int i = 0; i < els.size(); i++) {
618
619
	BoundaryObject obj0(macroElIndexMap[els[i].elIndex], 
			    macroElIndexTypeMap[els[i].elIndex], 
620
621
622
			    FACE, els[i].ithObject);

	for (unsigned int j = i + 1; j < els.size(); j++) {
623
624
	  BoundaryObject obj1(macroElIndexMap[els[j].elIndex], 
			      macroElIndexTypeMap[els[j].elIndex], 
625
626
627
628
			      FACE, els[j].ithObject);

	  bool reverseMode = 
	    BoundaryObject::computeReverseMode(obj0, obj1, feSpace, INTERIOR);
629
630
631
632
	  if (reverseMode) {
	    faceReverseMode.insert(make_pair(els[i], els[j]));
	    faceReverseMode.insert(make_pair(els[j], els[i]));
	  }
633
634
635
	}
      }
    }
636
637
638
639
640
641
642
643
644
645


    // === And create reverse modes for periodic neighbouring elements. ===

    for (PerBoundMap<DofEdge>::iterator edgeIt = periodicEdges.begin();
	 edgeIt != periodicEdges.end(); ++edgeIt) {
      vector<ElementObjectData> &edges0 = edgeElements[edgeIt->first.first];
      vector<ElementObjectData> &edges1 = edgeElements[edgeIt->first.second];

      for (unsigned int i = 0; i < edges0.size(); i++) {
646
647
	BoundaryObject obj0(macroElIndexMap[edges0[i].elIndex], 
			    macroElIndexTypeMap[edges0[i].elIndex], 
648
649
650
			    EDGE, edges0[i].ithObject);

	for (unsigned int j = 0; j < edges1.size(); j++) {
651
652
	  BoundaryObject obj1(macroElIndexMap[edges1[j].elIndex], 
			      macroElIndexTypeMap[edges1[j].elIndex], 
653
654
655
			      EDGE, edges1[j].ithObject);

	  bool reverseMode = 
656
657
	    BoundaryObject::computeReverseMode(obj0, obj1, feSpace, 
					       edgeIt->second);
658
659
660
661
	  if (reverseMode) {
	    edgeReverseMode.insert(make_pair(edges0[i], edges1[j]));
	    edgeReverseMode.insert(make_pair(edges1[j], edges0[i]));
	  }
662
663
664
665
666
667
668
669
670
671
672
	}
      }
    }

    for (PerBoundMap<DofFace>::iterator faceIt = periodicFaces.begin();
	 faceIt != periodicFaces.end(); ++faceIt) {
      vector<ElementObjectData> &faces0 = faceElements[faceIt->first.first];
      vector<ElementObjectData> &faces1 = faceElements[faceIt->first.second];

      TEST_EXIT_DBG(faces0.size() == faces1.size() == 1)("Should not happen!\n");

673
674
      BoundaryObject obj0(macroElIndexMap[faces0[0].elIndex], 
			  macroElIndexTypeMap[faces0[0].elIndex], 
675
			  FACE, faces0[0].ithObject);      
676
677
      BoundaryObject obj1(macroElIndexMap[faces1[0].elIndex], 
			  macroElIndexTypeMap[faces1[0].elIndex], 
678
679
680
681
			  FACE, faces1[0].ithObject);
      
      bool reverseMode = 
	BoundaryObject::computeReverseMode(obj0, obj1, feSpace, faceIt->second);
682
683
684
685
      if (reverseMode) {
	faceReverseMode.insert(make_pair(faces0[0], faces1[0]));
	faceReverseMode.insert(make_pair(faces1[0], faces0[0]));
      }
686
    }  
687
688
689
  }


690
  int ElementObjectDatabase::getIterateOwner(int level)
691
692
693
694
695
  {
    FUNCNAME("ElementObjectDatabase::getIterateOwner()");

    TEST_EXIT_DBG(macroElementRankMap)("Should not happen!\n");

696
697
    switch (iterGeoPos) {
    case VERTEX:
698
      return getOwner(vertexElements[vertexIter->first], level);
699
700
      break;
    case EDGE:
701
      return getOwner(edgeElements[edgeIter->first], level);
702
703
      break;
    case FACE:
704
      return getOwner(faceElements[faceIter->first], level);
705
      break;
706
707
708
    default:
      ERROR_EXIT("There is something reallllly wrong!\n");
      return -1;
709
710
    }
    
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
    return -1;
  }


  int ElementObjectDatabase::getOwner(DegreeOfFreedom vertex, int level)
  {
    return getOwner(vertexElements[vertex], level);
  }


  int ElementObjectDatabase::getOwner(DofEdge edge, int level)
  {
    return getOwner(edgeElements[edge], level);
  }


  int ElementObjectDatabase::getOwner(DofFace face, int level)
  {
    return getOwner(faceElements[face], level);
  }


  int ElementObjectDatabase::getOwner(vector<ElementObjectData>& objData, 
				      int level)
  {
736
737
    FUNCNAME("ElementObjectDatabase::getOwner()");

738
739
    int owner = -1;

740
    std::set<int> &levelRanks = levelData->getLevelRanks(level);
741
742
    bool allRanks = (level == 0);
   
743
744
    for (vector<ElementObjectData>::iterator it = objData.begin();
	 it != objData.end(); ++it) {
745
746
747
748
749
750
751
      int elRank = (*macroElementRankMap)[it->elIndex];
      if (allRanks || levelRanks.count(elRank))
	owner = std::max(owner, elRank);
    }
    
    TEST_EXIT_DBG(owner >= 0)("Cannot find owner on level %d\n", level);
    
752
753
754
755
756
757
758
759
    return owner;
  }


  int ElementObjectDatabase::getIterateMaxLevel()
  {
    FUNCNAME("ElementObjectDatabase::getIterateMaxLevel()");

760
    int nLevel = levelData->getNumberOfLevels();
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
    TEST_EXIT_DBG(nLevel > 0)("Should not happen!\n");

    vector<std::set<int> > ranksInLevel;
    ranksInLevel.resize(nLevel);

    switch (iterGeoPos) {
    case VERTEX:
      {
	vector<ElementObjectData>& vertexData = vertexElements[vertexIter->first];
	for (vector<ElementObjectData>::iterator it = vertexData.begin();
	     it != vertexData.end(); ++it)
	  ranksInLevel[0].insert((*macroElementRankMap)[it->elIndex]);
      }
      break;
    case EDGE:
      {
	vector<ElementObjectData>& edgeData = edgeElements[edgeIter->first];
	for (vector<ElementObjectData>::iterator it = edgeData.begin();
	     it != edgeData.end(); ++it)
	  ranksInLevel[0].insert((*macroElementRankMap)[it->elIndex]);
      }
      break;
    case FACE:
784
785
786
787
788
789
      {
	vector<ElementObjectData>& faceData = faceElements[faceIter->first];
	for (vector<ElementObjectData>::iterator it = faceData.begin();
	     it != faceData.end(); ++it)
	  ranksInLevel[0].insert((*macroElementRankMap)[it->elIndex]);
      }
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
      break;
    default:
      ERROR_EXIT("Should not happen!\n");
    }

    for (std::set<int>::iterator it = ranksInLevel[0].begin(); 
	 it != ranksInLevel[0].end(); ++it) 
      for (int level = 1; level < nLevel; level++)
	ranksInLevel[level].insert(levelData->getLevelId(level, *it));

    int maxLevel = 0;
    for (int level = 1; level < nLevel; level++)
      if (ranksInLevel[level].size() > 1)
	maxLevel = level;
    
    return maxLevel;
  }


809
  void ElementObjectDatabase::serialize(ostream &out)
810
  {
811
    FUNCNAME("ElementObjectDatabase::serialize()");
812
813
814

    int nSize = vertexElements.size();
    SerUtil::serialize(out, nSize);
815
    for (flat_map<DegreeOfFreedom, vector<ElementObjectData> >::iterator it = vertexElements.begin();
816
817
818
819
820
821
822
	 it != vertexElements.end(); ++it) {
      SerUtil::serialize(out, it->first);
      serialize(out, it->second);
    }

    nSize = edgeElements.size();
    SerUtil::serialize(out, nSize);
823
    for (flat_map<DofEdge, vector<ElementObjectData> >::iterator it = edgeElements.begin();
824
825
826
827
828
829
830
	 it != edgeElements.end(); ++it) {
      SerUtil::serialize(out, it->first);
      serialize(out, it->second);
    }

    nSize = faceElements.size();
    SerUtil::serialize(out, nSize);
831
    for (flat_map<DofFace, vector<ElementObjectData> >::iterator it = faceElements.begin();
832
833
834
835
836
837
	 it != faceElements.end(); ++it) {
      SerUtil::serialize(out, it->first);
      serialize(out, it->second);
    }


838

839
840
    nSize = vertexLocalMap.size();
    SerUtil::serialize(out, nSize);
841
    for (boost::container::flat_map<ElementObjectData, DegreeOfFreedom>::iterator it = vertexLocalMap.begin();
842
843
844
845
846
847
848
	 it != vertexLocalMap.end(); ++it) {
      it->first.serialize(out);
      SerUtil::serialize(out, it->second);
    }

    nSize = edgeLocalMap.size();
    SerUtil::serialize(out, nSize);
849
    for (boost::container::flat_map<ElementObjectData, DofEdge>::iterator it = edgeLocalMap.begin();
850
851
852
853
854
855
856
	 it != edgeLocalMap.end(); ++it) {
      it->first.serialize(out);
      SerUtil::serialize(out, it->second);
    }

    nSize = faceLocalMap.size();
    SerUtil::serialize(out, nSize);
857
    for (boost::container::flat_map<ElementObjectData, DofFace>::iterator it = faceLocalMap.begin();
858
859
860
861
862
863
	 it != faceLocalMap.end(); ++it) {
      it->first.serialize(out);
      SerUtil::serialize(out, it->second);
    }


864
    nSize = vertexInRank.size();
865
    SerUtil::serialize(out, nSize);
866
    for (flat_map<DegreeOfFreedom, flat_map<int, ElementObjectData> >::iterator it = vertexInRank.begin();
867
868
869
870
871
872
	 it != vertexInRank.end(); ++it) {
      SerUtil::serialize(out, it->first);
      serialize(out, it->second);
    }

    nSize = edgeInRank.size();
873
    SerUtil::serialize(out, nSize);
874
    for (flat_map<DofEdge, flat_map<int, ElementObjectData> >::iterator it = edgeInRank.begin();
875
876
877
878
879
880
	 it != edgeInRank.end(); ++it) {
      SerUtil::serialize(out, it->first);
      serialize(out, it->second);
    }

    nSize = faceInRank.size();
881
    SerUtil::serialize(out, nSize);
882
    for (flat_map<DofFace, flat_map<int, ElementObjectData> >::iterator it = faceInRank.begin();
883
884
885
886
887
	 it != faceInRank.end(); ++it) {
      SerUtil::serialize(out, it->first);
      serialize(out, it->second);
    }

888
889
890
    SerUtil::serialize(out, periodicVertices);
    SerUtil::serialize(out, periodicEdges);
    SerUtil::serialize(out, periodicFaces);
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911


    nSize = periodicDofAssoc.size();
    SerUtil::serialize(out, nSize);
    for (map<DegreeOfFreedom, std::set<BoundaryType> >::iterator it = periodicDofAssoc.begin();
	 it != periodicDofAssoc.end(); ++it) {
      SerUtil::serialize(out, it->first);
      SerUtil::serialize(out, it->second);
    }

    nSize = periodicEdgeAssoc.size();
    SerUtil::serialize(out, nSize);
    for (map<DofEdge, std::set<DofEdge> >::iterator it = periodicEdgeAssoc.begin();
	 it != periodicEdgeAssoc.end(); ++it) {
      SerUtil::serialize(out, it->first);
      SerUtil::serialize(out, it->second);
    }


    nSize = edgeReverseMode.size();
    SerUtil::serialize(out, nSize);
912
    for (std::set<pair<ElementObjectData, ElementObjectData> >::iterator it = edgeReverseMode.begin();
913
	 it != edgeReverseMode.end(); ++it) {
914
915
      it->first.serialize(out);
      it->second.serialize(out);
916
917
918
919
    }

    nSize = faceReverseMode.size();
    SerUtil::serialize(out, nSize);
920
    for (std::set<pair<ElementObjectData, ElementObjectData> >::iterator it = faceReverseMode.begin();
921
	 it != faceReverseMode.end(); ++it) {
922
923
      it->first.serialize(out);
      it->second.serialize(out);
924
925
      SerUtil::serialize(out, it->second);
    }
926
927
928
  }


929
  void ElementObjectDatabase::deserialize(istream &in)
930
  {
931
    FUNCNAME("ElementObjectDatabase::deserialize()");
932
933
934
935
936
937

    int nSize;
    SerUtil::deserialize(in, nSize);
    vertexElements.clear();
    for (int i = 0; i < nSize; i++) {
      DegreeOfFreedom dof;
938
      vector<ElementObjectData> data;
939
940
941
942
943
944
945
946
947
      SerUtil::deserialize(in, dof);
      deserialize(in, data);
      vertexElements[dof] = data;
    }

    SerUtil::deserialize(in, nSize);
    edgeElements.clear();
    for (int i = 0; i < nSize; i++) {
      DofEdge edge;
948
      vector<ElementObjectData> data;
949
950
951
952
953
954
955
956
957
      SerUtil::deserialize(in, edge);
      deserialize(in, data);
      edgeElements[edge] = data;
    }

    SerUtil::deserialize(in, nSize);
    faceElements.clear();
    for (int i = 0; i < nSize; i++) {
      DofFace face;
958
      vector<ElementObjectData> data;
959
960
961
962
      SerUtil::deserialize(in, face);
      deserialize(in, data);
      faceElements[face] = data;
    }
963
   
964

965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995

    SerUtil::deserialize(in, nSize);
    vertexLocalMap.clear();
    for (int i = 0; i < nSize; i++) {
      ElementObjectData data;
      DegreeOfFreedom dof;
      data.deserialize(in);
      SerUtil::deserialize(in, dof);
      vertexLocalMap[data] = dof;
    }

    SerUtil::deserialize(in, nSize);
    edgeLocalMap.clear();
    for (int i = 0; i < nSize; i++) {
      ElementObjectData data;
      DofEdge edge;
      data.deserialize(in);
      SerUtil::deserialize(in, edge);
      edgeLocalMap[data] = edge;
    }

    SerUtil::deserialize(in, nSize);
    faceLocalMap.clear();
    for (int i = 0; i < nSize; i++) {
      ElementObjectData data;
      DofFace face;
      data.deserialize(in);
      SerUtil::deserialize(in, face);
      faceLocalMap[data] = face;
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
996

997
998
999
1000
1001

    SerUtil::deserialize(in, nSize);
    vertexInRank.clear();
    for (int i = 0; i < nSize; i++) {
      DegreeOfFreedom dof;
1002
      flat_map<int, ElementObjectData> data;
1003
1004
1005
1006
1007
1008
1009
1010
1011
      SerUtil::deserialize(in, dof);
      deserialize(in, data);
      vertexInRank[dof] = data;
    }

    SerUtil::deserialize(in, nSize);
    edgeInRank.clear();
    for (int i = 0; i < nSize; i++) {
      DofEdge edge;
1012
      flat_map<int, ElementObjectData> data;
1013
1014
1015
1016
1017
1018
1019
1020
1021
      SerUtil::deserialize(in, edge);
      deserialize(in, data);
      edgeInRank[edge] = data;
    }

    SerUtil::deserialize(in, nSize);
    faceInRank.clear();
    for (int i = 0; i < nSize; i++) {
      DofFace face;
1022
      flat_map<int, ElementObjectData> data;
1023
1024
1025
1026
      SerUtil::deserialize(in, face);
      deserialize(in, data);
      faceInRank[face] = data;
    }
1027
1028
1029

    SerUtil::deserialize(in, periodicVertices);
    SerUtil::deserialize(in, periodicEdges);
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
    SerUtil::deserialize(in, periodicFaces);

    

    SerUtil::deserialize(in, nSize);
    periodicDofAssoc.clear();
    for (int i = 0; i < nSize; i++) {
      DegreeOfFreedom dof;
      std::set<DegreeOfFreedom> dofs;
      SerUtil::deserialize(in, dof);
      SerUtil::deserialize(in, dofs);
      periodicDofAssoc[dof] = dofs;
    }

    SerUtil::deserialize(in, nSize);
    periodicEdgeAssoc.clear();
    for (int i = 0; i < nSize; i++) {
      DofEdge edge;
      std::set<DofEdge> edges;
      SerUtil::deserialize(in, edge);
      SerUtil::deserialize(in, edges);
      periodicEdgeAssoc[edge] = edges;
    }



    SerUtil::deserialize(in, nSize);
    edgeReverseMode.clear();
    for (int i = 0; i < nSize; i++) {
      ElementObjectData obj0, obj1;
      obj0.deserialize(in);
      obj1.deserialize(in);

1063
      edgeReverseMode.insert(make_pair(obj0, obj1));
1064
1065
1066
1067
1068
1069
1070
1071
1072
    }

    SerUtil::deserialize(in, nSize);
    faceReverseMode.clear();
    for (int i = 0; i < nSize; i++) {
      ElementObjectData obj0, obj1;
      obj0.deserialize(in);
      obj1.deserialize(in);

1073
      faceReverseMode.insert(make_pair(obj0, obj1));
1074
    }
1075
1076
1077
  }


1078
1079
  void ElementObjectDatabase::serialize(ostream &out, 
					vector<ElementObjectData>& elVec)
1080
1081
1082
1083
1084
1085
1086
1087
  {
    int nSize = elVec.size();
    SerUtil::serialize(out, nSize);
    for (int i = 0; i < nSize; i++)
      elVec[i].serialize(out);
  }


1088
1089
  void ElementObjectDatabase::deserialize(istream &in, 
					  vector<ElementObjectData>& elVec)
1090
1091
1092
1093
1094
1095
1096
1097
1098
  {
    int nSize;
    SerUtil::deserialize(in, nSize);
    elVec.resize(nSize);
    for (int i = 0; i < nSize; i++)
      elVec[i].deserialize(in);
  }

  
1099
  void ElementObjectDatabase::serialize(ostream &out, 
1100
					flat_map<int, ElementObjectData>& data)
1101
1102
1103
  {
    int nSize = data.size();
    SerUtil::serialize(out, nSize);
1104
    for (flat_map<int, ElementObjectData>::iterator it = data.begin();
1105
1106
1107
1108
1109
1110
1111
	 it != data.end(); ++it) {
      SerUtil::serialize(out, it->first);
      it->second.serialize(out);
    }
  }

  
1112
  void ElementObjectDatabase::deserialize(istream &in, 
1113
					  flat_map<int, ElementObjectData>& data)
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
  {
    int nSize;
    SerUtil::deserialize(in, nSize);
    for (int i = 0; i < nSize; i++) {
      int index;
      ElementObjectData elObj;
      SerUtil::deserialize(in, index);
      elObj.deserialize(in);

      data[index] = elObj;
    }
  }

1127
1128
1129

  unsigned long ElementObjectDatabase::calculateMemoryUsage()
  {
1130
1131
    FUNCNAME("ElementObjectDatabase::calculateMemoryUsage()");

1132
1133
1134
1135
1136
1137
    const unsigned int structElObjDataSize = sizeof(ElementObjectData);
    const unsigned int dofSize = sizeof(DegreeOfFreedom);
    const unsigned int edgeSize = sizeof(DofEdge);
    const unsigned int faceSize = sizeof(DofFace);
    const unsigned int vectorOverhead = sizeof(vector<int>);
    const unsigned int mapOverhead = 48; //sizeof(_Rb_tree<int, int>);
1138
    const unsigned int flatMapOverhead = 24;
1139
//     const unsigned int mapEntryOverhead = 40; // sizeof(_Rb_tree_node_base);
1140
1141
1142
    const unsigned int setOverhead = 48; 
    const unsigned int setEntryOverhead = 40;

1143
1144

    unsigned long value = 0;
1145
    unsigned long tmp = 0;
1146
1147

    // vertexElements
1148
1149
    tmp = flatMapOverhead;
    for (flat_map<DegreeOfFreedom, vector<ElementObjectData> >::iterator mapIt =
1150
1151
1152
1153
	   vertexElements.begin(); mapIt != vertexElements.end(); ++mapIt)      
      tmp += dofSize + vectorOverhead + mapIt->second.size() * structElObjDataSize;
    MSG("EL-OBJ-DB MEM 01: %d\n", tmp);
    value += tmp;
1154
1155

    // edgeElements
1156
1157
    tmp = flatMapOverhead;
    for (flat_map<DofEdge, vector<ElementObjectData> >::iterator mapIt =
1158
	   edgeElements.begin(); mapIt != edgeElements.end(); ++mapIt)
1159
1160
1161
      tmp += dofSize + vectorOverhead + mapIt->second.size() * structElObjDataSize;
    MSG("EL-OBJ-DB MEM 02: %d\n", tmp);
    value += tmp;
1162
1163

    // faceElements
1164
1165
    tmp = flatMapOverhead;
    for (flat_map<DofFace, vector<ElementObjectData> >::iterator mapIt =
1166
	   faceElements.begin(); mapIt != faceElements.end(); ++mapIt)
1167
1168
1169
1170
      tmp += dofSize + vectorOverhead + mapIt->second.size() * structElObjDataSize;
    MSG("EL-OBJ-DB MEM 03: %d\n", tmp);
    value += tmp;
    tmp = 0;
1171
1172

    // vertexLocalMap
1173
    tmp += flatMapOverhead + vertexLocalMap.size() * (structElObjDataSize + dofSize);
1174
1175

    // edgeLocalMap
1176
    tmp += flatMapOverhead + edgeLocalMap.size() * (structElObjDataSize + edgeSize);
1177
1178

    // faceLocalMap
1179
    tmp += flatMapOverhead + faceLocalMap.size() * (structElObjDataSize + faceSize);
1180
1181
1182

    MSG("EL-OBJ-DB MEM 04: %d\n", tmp);
    value += tmp;
1183
1184

    // vertexInRank
1185
1186
    tmp = flatMapOverhead;
    for (flat_map<DegreeOfFreedom, flat_map<int, ElementObjectData> >::iterator mapIt = 
1187
	   vertexInRank.begin(); mapIt != vertexInRank.end(); ++mapIt)
1188
      tmp += dofSize + flatMapOverhead + mapIt->second.size() * (sizeof(int) + structElObjDataSize);
1189
1190
    MSG("EL-OBJ-DB MEM 05: %d\n", tmp);
    value += tmp;
1191
1192

    // edgeInRank
1193
1194
    tmp = mapOverhead;
    for (flat_map<DofEdge, flat_map<int, ElementObjectData> >::iterator mapIt = 
1195
	   edgeInRank.begin(); mapIt != edgeInRank.end(); ++mapIt)
1196
      tmp += edgeSize + flatMapOverhead + mapIt->second.size() * (sizeof(int) + structElObjDataSize);
1197
1198
    MSG("EL-OBJ-DB MEM 06: %d\n", tmp);
    value += tmp;
1199
1200

    // faceInRank
1201
1202
    tmp = mapOverhead;
    for (flat_map<DofFace, flat_map<int, ElementObjectData> >::iterator mapIt = 
1203
	   faceInRank.begin(); mapIt != faceInRank.end(); ++mapIt)
1204
      tmp += faceSize + flatMapOverhead + mapIt->second.size() * (sizeof(int) + structElObjDataSize);
1205
1206
1207
    MSG("EL-OBJ-DB MEM 07: %d\n", tmp);
    value += tmp;
    tmp = 0;
1208
1209
1210
1211
1212
1213

    if (bConnMap.size() || periodicVertices.size() || periodicDofAssoc.size()) {
      ERROR_EXIT("Not yet implemented for periodic meshes!\n");
    }

    // edgeReverseMode
1214
    tmp += setOverhead + edgeReverseMode.size() * (setEntryOverhead + 2 * structElObjDataSize);
1215
1216

    // faceReverseMode
1217
    tmp += setOverhead + faceReverseMode.size() * (setEntryOverhead + 2 * structElObjDataSize);
1218
1219

    // macroElIndexMap
1220
    tmp += flatMapOverhead + macroElIndexMap.size() * (sizeof(int) + sizeof(int*));
1221
1222

    // macroElIndexTypeMap
1223
    tmp += flatMapOverhead + macroElIndexTypeMap.size() * (sizeof(int) + sizeof(int));
1224
1225
1226

    MSG("EL-OBJ-DB MEM 08: %d\n", tmp);
    value += tmp;
1227
1228
1229
1230

    return value;
  }

1231
} }