ElementObjectDatabase.cc 39.6 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"
25
#include <fstream>
Thomas Witkowski's avatar
Thomas Witkowski committed
26

27
28
#include "Serializer.h"

29
30
using namespace std;

31
namespace AMDiS { namespace Parallel {
32
33
34
35
36
37
38
39
40
41
42
  
  void ElementObjectDatabase::init(vector<Mesh*>& meshes_, 
				   map<Mesh*, vector<const FiniteElemSpace*> >& meshToFeSpaces)
  {
    meshes = meshes_;
    for(size_t i = 0; i < meshes.size(); i++) 
      feSpaces.push_back(meshToFeSpaces[meshes[i]][0]);
    
    macroMesh = meshes[0];
    feSpace = meshToFeSpaces[macroMesh][0];
  }
Thomas Witkowski's avatar
Thomas Witkowski committed
43

44
45
46
47
48
49
50
51
52
53
54
55
56
57
  void ElementObjectData::serialize(std::ostream &out) const
  {
    SerUtil::serialize(out, elIndex);
    SerUtil::serialize(out, ithObject);
  }

  /// Read this element object from disk.
  void ElementObjectData::deserialize(std::istream &in)
  {
    SerUtil::deserialize(in, elIndex);
    SerUtil::deserialize(in, ithObject);
  }


58
  void ElementObjectDatabase::create(map<int, int>& rankMap, MeshLevelData& ld)
59
  {
60
    FUNCNAME_DBG("ElementObjectDatabase::create()");
61
62
63
64

    macroElementRankMap = &rankMap;
    levelData = &ld;

65
66
67
68
69
70
    // === Reset temporary data ===
    
    tmpVertexElements.clear();
    tmpEdgeElements.clear();
    tmpFaceElements.clear();

71
72
73
    // === Fills macro element data structures. ===
    
    TraverseStack stack;
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
    ElInfo* elInfo = NULL;
    
    for(size_t i = 0; i < meshes.size(); i++) {
      
      elInfo = stack.traverseFirst(meshes[i], -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();
	
	// Macro data info is stored once.
	if (i == 0) {
	  macroElIndexTypeMap.insert(make_pair(el->getIndex(), elInfo->getType()));
	
	  // Add all sub object of the element to the variable elObjDb.
	  addElement(el);
	  
	  addElementPeriodicBoundary(elInfo);
	}
96

97
98
99
100
101
102
103
        // Element pointer has to be stored for each mesh one copy.
	macroElIndexMap[el->getIndex()][meshes[i]] = el;
	
	elInfo = stack.traverseNext(elInfo);
      }
    }
    
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
    // === 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
121
    // Handle periodic boudaries
122
    createPeriodicData();
123
124
125
126

    // Create data about the reverse modes of neighbouring elements.
    createReverseModeData();
  }
127
128
  
  void ElementObjectDatabase::createMacroElementInfo(std::map<Mesh*, std::vector<MacroElement*> >& mel)
129
130
131
  {
    macroElIndexMap.clear();
    macroElIndexTypeMap.clear();
132
133
134
135
136
137
138
139
140
141
142
    
    std::map<Mesh*, std::vector<MacroElement*> >::iterator iter = mel.begin();
    while(iter != mel.end()) {
      Mesh* mesh = iter->first;
      for (vector<MacroElement*>::iterator it = iter->second.begin();
	   it != iter->second.end(); it++) {
	macroElIndexMap[(*it)->getIndex()][mesh] = (*it)->getElement();
        if(iter == mel.begin())
          macroElIndexTypeMap.insert(make_pair((*it)->getIndex(), (*it)->getElType()));
      }
      iter++;
143
144
145
    }
  }
      
146
  void ElementObjectDatabase::addElement(Element *el)
147
148
149
150
151
152
153
154
155
156
157
  {
    // === 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);
158
159
160
161
162
  }
  
  void ElementObjectDatabase::addElementPeriodicBoundary(ElInfo* elInfo)
  {
    FUNCNAME("ElementObjectDatabase::addElementPeriodicBoundary()");
163

164
    TEST_EXIT_DBG(macroMesh)("Mesh not set!\n");
165

166
    Element *el = elInfo->getElement();
167
    
168
    switch (macroMesh->getDim()) {
169
170
    case 2:
      for (int i = 0; i < el->getGeo(EDGE); i++) {
171
	if (macroMesh->isPeriodicAssociation(elInfo->getBoundary(EDGE, i))) {
172
173
	  // The current element's i-th edge is periodic.
	  Element *neigh = elInfo->getNeighbour(i);
174
175

	  TEST_EXIT_DBG(neigh)("Should not happen!\n");
176
177
178
179
	  
	  DofEdge edge0 = el->getEdge(i);
	  DofEdge edge1 = neigh->getEdge(elInfo->getOppVertex(i));
	  BoundaryType boundaryType = elInfo->getBoundary(EDGE, i);
180

Thomas Witkowski's avatar
Thomas Witkowski committed
181
182
183
184
185
	  // Add the periodic edge.
	  periodicEdges[make_pair(edge0, edge1)] = boundaryType;
	  periodicEdgeAssoc[edge0].insert(edge1);
	  
	  // Add both vertices of the edge to be periodic.
186
	  DegreeOfFreedom mappedDof0 = 
187
	    macroMesh->getPeriodicAssociations(boundaryType)[edge0.first];
188
	  DegreeOfFreedom mappedDof1 = 
189
	    macroMesh->getPeriodicAssociations(boundaryType)[edge0.second];
190
191
192
	  periodicVertices[make_pair(edge0.first, mappedDof0)] = boundaryType;
	  periodicVertices[make_pair(edge0.second, mappedDof1)] = boundaryType;

Thomas Witkowski's avatar
Thomas Witkowski committed
193
	  periodicDofAssoc[edge0.first].insert(boundaryType);
194
	  periodicDofAssoc[edge0.second].insert(boundaryType); 
195
196
197
198
199
	}
      }
      break;
    case 3:
      for (int i = 0; i < el->getGeo(FACE); i++) {
200
	if (macroMesh->isPeriodicAssociation(elInfo->getBoundary(FACE, i))) {
201
202
	  // The current element's i-th face is periodic.
	  Element *neigh = elInfo->getNeighbour(i);
203
204

	  TEST_EXIT_DBG(neigh)("Should not happen!\n");
205
206
207
208
	  
	  DofFace face0 = el->getFace(i);
	  DofFace face1 = neigh->getFace(elInfo->getOppVertex(i));
	  BoundaryType boundaryType = elInfo->getBoundary(FACE, i);
209

210
211
212
213
	  // Add the periodic face.
	  periodicFaces[make_pair(face0, face1)] = elInfo->getBoundary(i);
	  
	  /// Add all three vertices of the face to be periodic.
214
	  DegreeOfFreedom mappedDof0 = 
215
	    macroMesh->getPeriodicAssociations(boundaryType)[face0.get<0>()];
216
	  DegreeOfFreedom mappedDof1 = 
217
	    macroMesh->getPeriodicAssociations(boundaryType)[face0.get<1>()];
218
	  DegreeOfFreedom mappedDof2 = 
219
	    macroMesh->getPeriodicAssociations(boundaryType)[face0.get<2>()];
220
221
222
223

	  periodicVertices[make_pair(face0.get<0>(), mappedDof0)] = boundaryType;
	  periodicVertices[make_pair(face0.get<1>(), mappedDof1)] = boundaryType;
	  periodicVertices[make_pair(face0.get<2>(), mappedDof2)] = boundaryType;
224
225
226
227
228
229
	  
	  periodicDofAssoc[face0.get<0>()].insert(boundaryType);
	  periodicDofAssoc[face0.get<1>()].insert(boundaryType);
	  periodicDofAssoc[face0.get<2>()].insert(boundaryType);
	  
	  TEST_EXIT_DBG(face0.get<0>() == 
230
			macroMesh->getPeriodicAssociations(boundaryType)[face1.get<0>()] &&
231
			face0.get<1>() == 
232
			macroMesh->getPeriodicAssociations(boundaryType)[face1.get<1>()] &&
233
			face0.get<2>() == 
234
			macroMesh->getPeriodicAssociations(boundaryType)[face1.get<2>()])
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
	    ("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");
257
258
    }  
    
259
260
  }

261

Thomas Witkowski's avatar
Thomas Witkowski committed
262
263
264
265
266
  void ElementObjectDatabase::addVertex(Element *el, int ith)
  {
    DegreeOfFreedom vertex = el->getDof(ith, 0);
    int elIndex = el->getIndex();
    ElementObjectData elObj(elIndex, ith);
267
   
268
    tmpVertexElements[vertex].push_back(elObj);
Thomas Witkowski's avatar
Thomas Witkowski committed
269
270
271
272
273
274
275
276
277
278
    vertexLocalMap[elObj] = vertex;
  }


  void ElementObjectDatabase::addEdge(Element *el, int ith)
  {
    DofEdge edge = el->getEdge(ith);
    int elIndex = el->getIndex();
    ElementObjectData elObj(elIndex, ith);
    
279
    tmpEdgeElements[edge].push_back(elObj);
Thomas Witkowski's avatar
Thomas Witkowski committed
280
281
282
283
284
285
286
287
288
289
    edgeLocalMap[elObj] = edge;
  }

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

294

295
  void ElementObjectDatabase::createPeriodicData()
296
  {
297
    FUNCNAME_DBG("ElementObjectDatabase::createPeriodicData()");
298

299
    TEST_EXIT_DBG(macroMesh)("Mesh not set!\n");
300

301
302
    // === Return, if there are no periodic vertices, i.e., there are no  ===
    // === periodic boundaries in the mesh.                               ===
303
304
305
    
    if (periodicVertices.size() == 0)
      return;
306
 
307
308
309
    // === Calculate smallest periodic boundary ID in mesh. ===

    smallestPeriodicBcType = 0;
310
311
    for (map<BoundaryType, VertexVector*>::iterator it = macroMesh->getPeriodicAssociations().begin();
	 it != macroMesh->getPeriodicAssociations().end(); ++it)
312
      smallestPeriodicBcType = std::min(smallestPeriodicBcType, it->first);
313
314
315
316

    // === Get all vertex DOFs that have multiple periodic associations. ===
    
    // We group all vertices together, that have either two or three periodic
317
318
319
    // 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.
320
321
322
323

    vector<DegreeOfFreedom> multPeriodicDof2, multPeriodicDof3;
    for (map<DegreeOfFreedom, std::set<BoundaryType> >::iterator it = periodicDofAssoc.begin();
	 it != periodicDofAssoc.end(); ++it) {
324
325
      TEST_EXIT_DBG((macroMesh->getDim() == 2 && it->second.size() <= 2) ||
		    (macroMesh->getDim() == 3 && it->second.size() <= 3))
326
327
328
329
330
331
332
333
	("Should not happen!\n");
      
      if (it->second.size() == 2)
	multPeriodicDof2.push_back(it->first);
      if (it->second.size() == 3)
	multPeriodicDof3.push_back(it->first);
    }

334
    if (macroMesh->getDim() == 2) {
335
336
337
338
339
      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");
    }
340

341
    if (macroMesh->getDim() == 3) {
342
343
344
345
      TEST_EXIT_DBG(multPeriodicDof3.size() == 0 || 
		    multPeriodicDof3.size() == 8)
	("Should not happen (%d)!\n", multPeriodicDof3.size());
    }
346

347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
    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");
389
390

 	periodicVertices[make_pair(dof0, dof3)] = 
391
	  provideConnectedPeriodicBoundary(type0, type1);
392
 	periodicVertices[make_pair(dof3, dof0)] = 
393
 	  provideConnectedPeriodicBoundary(type0, type1);
394

395
396
397
398
399
400
401
402
	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();
403

404
405
406
407
408
409
410
411
      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) {
412
	    BoundaryType b = getNewBoundaryType();
413
414
	    periodicVertices[perDofs0] = b;
	    periodicVertices[perDofs1] = b;
415
416
417
418
	  }
	}
      }
    }
419
420
  
   
421
422
423
424
425
    // === 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) {
426
	TEST_EXIT_DBG(macroMesh->getDim() == 3)("Should not happen!\n");
427
428
	TEST_EXIT_DBG(it->second.size() == 2)("Should not happen!\n");
	
429
430
431
	DofEdge edge0 = it->first;
	DofEdge edge1 = *(it->second.begin());
	DofEdge edge2 = *(++(it->second.begin()));
432
	
433
434
435
436
437
438
439
440
441
442
	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)];
443
	BoundaryType type2 = provideConnectedPeriodicBoundary(type0, type1);
444
445
446

 	periodicEdges[perEdge0] = type2;
 	periodicEdges[perEdge1] = type2;
447
448
449
450
451
452
453
454
455
456
457
458
459
460
      }
    }


    // === 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);
      
461
462
463
464
      TEST_EXIT_DBG(periodicVertices.count(testVertex) == 1)
	("Should not happen!\n");
      TEST_EXIT_DBG(periodicVertices[testVertex] == it->second)
	("Should not happen!\n");
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
    }

    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       
  }

487
  BoundaryType ElementObjectDatabase::getNewBoundaryType()
488
  {
489
    FUNCNAME_DBG("ElementObjectDatabase::getNewBoundaryType()");
490
491

    BoundaryType newPeriodicBoundaryType = 0;
492
493
    for (map<BoundaryType, VertexVector*>::iterator it = macroMesh->getPeriodicAssociations().begin();
	 it != macroMesh->getPeriodicAssociations().end(); ++it)
494
495
496
497
498
      newPeriodicBoundaryType = std::min(newPeriodicBoundaryType, it->first);
    
    TEST_EXIT_DBG(newPeriodicBoundaryType < 0)("Should not happen!\n");
    newPeriodicBoundaryType--;
    
499
500
501
502
503
    for(size_t i = 0; i < meshes.size(); i++) {
      meshes[i]->getPeriodicAssociations()[newPeriodicBoundaryType] = 
        new VertexVector(feSpaces[i]->getAdmin(), "");
    }
        
504
505
    return newPeriodicBoundaryType;
  }
506
  
507
  BoundaryType 
508
  ElementObjectDatabase::provideConnectedPeriodicBoundary(BoundaryType b0, 
509
							  BoundaryType b1)
510
  {
511
    FUNCNAME_DBG("ElementObjectDatabase::provideConnectedPeriodicBoundary()");
512
513

    std::pair<BoundaryType, BoundaryType> bConn = 
514
      (b0 <= b1 ? make_pair(b0, b1) : make_pair(b1, b0));
515
516

    if (bConnMap.count(bConn) == 0) {
517
      BoundaryType newPeriodicBoundaryType = getNewBoundaryType();
518

519
520
521
522
523
      for(size_t i = 0; i < meshes.size(); i++) {
      
        VertexVector &vecB0 = meshes[i]->getPeriodicAssociations(b0);
        VertexVector &vecB1 = meshes[i]->getPeriodicAssociations(b1);
        VertexVector &vecC = meshes[i]->getPeriodicAssociations(newPeriodicBoundaryType);
524

525
        DOFIteratorBase it(const_cast<DOFAdmin*>(feSpaces[i]->getAdmin()), USED_DOFS);
526

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

532
533
	    vecC[it.getDOFIndex()] = vecB1[vecB0[it.getDOFIndex()]];
	  }
534
535
536
537
538
	}
      }
      
      bConnMap[bConn] = newPeriodicBoundaryType;
    }
539
    
540
541
542
543
    return bConnMap[bConn];
  }


544
  void ElementObjectDatabase::updateRankData()
Thomas Witkowski's avatar
Thomas Witkowski committed
545
  {
546
    FUNCNAME("ElementObjectDatabase::updateRankData()");
547
    
Thomas Witkowski's avatar
Thomas Witkowski committed
548
549
    TEST_EXIT(macroElementRankMap)("Should not happen!\n");

Thomas Witkowski's avatar
Thomas Witkowski committed
550
    vertexInRank.clear();
551
    for (flat_map<DegreeOfFreedom, vector<ElementObjectData> >::iterator it = vertexElements.begin();
Thomas Witkowski's avatar
Thomas Witkowski committed
552
	 it != vertexElements.end(); ++it) {
553
      for (vector<ElementObjectData>::iterator it2 = it->second.begin(); 
Thomas Witkowski's avatar
Thomas Witkowski committed
554
	   it2 != it->second.end(); ++it2) {
Thomas Witkowski's avatar
Thomas Witkowski committed
555
	int elementInRank = (*macroElementRankMap)[it2->elIndex];	
Thomas Witkowski's avatar
Thomas Witkowski committed
556
557
	if (it2->elIndex > vertexInRank[it->first][elementInRank].elIndex)
	  vertexInRank[it->first][elementInRank] = *it2;
Thomas Witkowski's avatar
Thomas Witkowski committed
558
559
560
      }
    }
    
Thomas Witkowski's avatar
Thomas Witkowski committed
561
    edgeInRank.clear();
562
    for (flat_map<DofEdge, vector<ElementObjectData> >::iterator it = edgeElements.begin();
Thomas Witkowski's avatar
Thomas Witkowski committed
563
	 it != edgeElements.end(); ++it) {
564
      for (vector<ElementObjectData>::iterator it2 = it->second.begin(); 
Thomas Witkowski's avatar
Thomas Witkowski committed
565
	   it2 != it->second.end(); ++it2) {
566
	int elementInRank = (*macroElementRankMap)[it2->elIndex];
Thomas Witkowski's avatar
Thomas Witkowski committed
567
568
	if (it2->elIndex > edgeInRank[it->first][elementInRank].elIndex)
	  edgeInRank[it->first][elementInRank] = *it2;
Thomas Witkowski's avatar
Thomas Witkowski committed
569
570
571
      }
    }
    
Thomas Witkowski's avatar
Thomas Witkowski committed
572
    faceInRank.clear();
573
    for (flat_map<DofFace, vector<ElementObjectData> >::iterator it = faceElements.begin();
Thomas Witkowski's avatar
Thomas Witkowski committed
574
	 it != faceElements.end(); ++it) {
575
      for (vector<ElementObjectData>::iterator it2 = it->second.begin(); 
Thomas Witkowski's avatar
Thomas Witkowski committed
576
	   it2 != it->second.end(); ++it2) {
577
	int elementInRank = (*macroElementRankMap)[it2->elIndex];
Thomas Witkowski's avatar
Thomas Witkowski committed
578
579
	if (it2->elIndex > faceInRank[it->first][elementInRank].elIndex)
	  faceInRank[it->first][elementInRank] = *it2;
Thomas Witkowski's avatar
Thomas Witkowski committed
580
581
582
583
      }
    }
  }

584

Thomas Witkowski's avatar
bla    
Thomas Witkowski committed
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
  void 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();

609
    macroElementRankMap = NULL;
Thomas Witkowski's avatar
bla    
Thomas Witkowski committed
610
611
612
613
614
    macroElIndexMap.clear();
    macroElIndexTypeMap.clear();
  }


615
  void ElementObjectDatabase::createReverseModeData()
616
  {
617
    FUNCNAME_DBG("ElementObjectDatabase::createReverseModeData()");
618

619
620
    // === In 2D, all reverse modes are always true! ===

621
    if (macroMesh->getDim() == 2)
622
623
      return;

624
625
626

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

627
    for (flat_map<DofEdge, vector<ElementObjectData> >::iterator edgeIt = edgeElements.begin();
628
629
630
631
632
	 edgeIt != edgeElements.end(); ++edgeIt) {

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

      for (unsigned int i = 0; i < els.size(); i++) {
633
	BoundaryObject obj0(macroElIndexMap[els[i].elIndex][macroMesh], 
634
			    macroElIndexTypeMap[els[i].elIndex], 
635
636
637
			    EDGE, els[i].ithObject);

	for (unsigned int j = i + 1; j < els.size(); j++) {
638
	  BoundaryObject obj1(macroElIndexMap[els[j].elIndex][macroMesh], 
639
			      macroElIndexTypeMap[els[j].elIndex], 
640
641
642
643
			      EDGE, els[j].ithObject);

	  bool reverseMode = 
	    BoundaryObject::computeReverseMode(obj0, obj1, feSpace, INTERIOR);
644
645
646
647
	  if (reverseMode) {
	    edgeReverseMode.insert(make_pair(els[i], els[j]));
	    edgeReverseMode.insert(make_pair(els[j], els[i]));
	  }
648
649
650
651
	}
      }
    }

652
    for (flat_map<DofFace, vector<ElementObjectData> >::iterator faceIt = faceElements.begin();
653
654
655
656
657
	 faceIt != faceElements.end(); ++faceIt) {

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

      for (unsigned int i = 0; i < els.size(); i++) {
658
	BoundaryObject obj0(macroElIndexMap[els[i].elIndex][macroMesh], 
659
			    macroElIndexTypeMap[els[i].elIndex], 
660
661
662
			    FACE, els[i].ithObject);

	for (unsigned int j = i + 1; j < els.size(); j++) {
663
	  BoundaryObject obj1(macroElIndexMap[els[j].elIndex][macroMesh], 
664
			      macroElIndexTypeMap[els[j].elIndex], 
665
666
667
668
			      FACE, els[j].ithObject);

	  bool reverseMode = 
	    BoundaryObject::computeReverseMode(obj0, obj1, feSpace, INTERIOR);
669
670
671
672
	  if (reverseMode) {
	    faceReverseMode.insert(make_pair(els[i], els[j]));
	    faceReverseMode.insert(make_pair(els[j], els[i]));
	  }
673
674
675
	}
      }
    }
676
677
678
679
680
681
682
683
684
685


    // === 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++) {
686
	BoundaryObject obj0(macroElIndexMap[edges0[i].elIndex][macroMesh], 
687
			    macroElIndexTypeMap[edges0[i].elIndex], 
688
689
690
			    EDGE, edges0[i].ithObject);

	for (unsigned int j = 0; j < edges1.size(); j++) {
691
	  BoundaryObject obj1(macroElIndexMap[edges1[j].elIndex][macroMesh], 
692
			      macroElIndexTypeMap[edges1[j].elIndex], 
693
694
695
			      EDGE, edges1[j].ithObject);

	  bool reverseMode = 
696
697
	    BoundaryObject::computeReverseMode(obj0, obj1, feSpace, 
					       edgeIt->second);
698
699
700
701
	  if (reverseMode) {
	    edgeReverseMode.insert(make_pair(edges0[i], edges1[j]));
	    edgeReverseMode.insert(make_pair(edges1[j], edges0[i]));
	  }
702
703
704
705
706
707
708
709
710
	}
      }
    }

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

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

713
      BoundaryObject obj0(macroElIndexMap[faces0[0].elIndex][macroMesh], 
714
			  macroElIndexTypeMap[faces0[0].elIndex], 
715
			  FACE, faces0[0].ithObject);      
716
      BoundaryObject obj1(macroElIndexMap[faces1[0].elIndex][macroMesh], 
717
			  macroElIndexTypeMap[faces1[0].elIndex], 
718
719
720
721
			  FACE, faces1[0].ithObject);
      
      bool reverseMode = 
	BoundaryObject::computeReverseMode(obj0, obj1, feSpace, faceIt->second);
722
723
724
725
      if (reverseMode) {
	faceReverseMode.insert(make_pair(faces0[0], faces1[0]));
	faceReverseMode.insert(make_pair(faces1[0], faces0[0]));
      }
726
    }  
727
728
729
  }


730
  int ElementObjectDatabase::getIterateOwner(int level)
731
732
733
734
735
  {
    FUNCNAME("ElementObjectDatabase::getIterateOwner()");

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

736
737
    switch (iterGeoPos) {
    case VERTEX:
738
      return getOwner(vertexElements[vertexIter->first], level);
739
740
      break;
    case EDGE:
741
      return getOwner(edgeElements[edgeIter->first], level);
742
743
      break;
    case FACE:
744
      return getOwner(faceElements[faceIter->first], level);
745
      break;
746
747
748
    default:
      ERROR_EXIT("There is something reallllly wrong!\n");
      return -1;
749
750
    }
    
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
    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)
  {
776
    FUNCNAME_DBG("ElementObjectDatabase::getOwner()");
777

778
779
    int owner = -1;

780
    std::set<int> &levelRanks = levelData->getLevelRanks(level);
781
782
    bool allRanks = (level == 0);
   
783
784
    for (vector<ElementObjectData>::iterator it = objData.begin();
	 it != objData.end(); ++it) {
785
786
787
788
789
790
791
      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);
    
792
793
794
795
796
797
798
799
    return owner;
  }


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

800
    int nLevel = levelData->getNumberOfLevels();
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
    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:
824
825
826
827
828
829
      {
	vector<ElementObjectData>& faceData = faceElements[faceIter->first];
	for (vector<ElementObjectData>::iterator it = faceData.begin();
	     it != faceData.end(); ++it)
	  ranksInLevel[0].insert((*macroElementRankMap)[it->elIndex]);
      }
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
      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;
  }


849
  void ElementObjectDatabase::serialize(ostream &out)
850
851
852
  {
    int nSize = vertexElements.size();
    SerUtil::serialize(out, nSize);
853
    for (flat_map<DegreeOfFreedom, vector<ElementObjectData> >::iterator it = vertexElements.begin();
854
855
856
857
858
859
860
	 it != vertexElements.end(); ++it) {
      SerUtil::serialize(out, it->first);
      serialize(out, it->second);
    }

    nSize = edgeElements.size();
    SerUtil::serialize(out, nSize);
861
    for (flat_map<DofEdge, vector<ElementObjectData> >::iterator it = edgeElements.begin();
862
863
864
865
866
867
868
	 it != edgeElements.end(); ++it) {
      SerUtil::serialize(out, it->first);
      serialize(out, it->second);
    }

    nSize = faceElements.size();
    SerUtil::serialize(out, nSize);
869
    for (flat_map<DofFace, vector<ElementObjectData> >::iterator it = faceElements.begin();
870
871
872
873
874
875
	 it != faceElements.end(); ++it) {
      SerUtil::serialize(out, it->first);
      serialize(out, it->second);
    }


876

877
878
    nSize = vertexLocalMap.size();
    SerUtil::serialize(out, nSize);
879
    for (boost::container::flat_map<ElementObjectData, DegreeOfFreedom>::iterator it = vertexLocalMap.begin();
880
881
882
883
884
885
886
	 it != vertexLocalMap.end(); ++it) {
      it->first.serialize(out);
      SerUtil::serialize(out, it->second);
    }

    nSize = edgeLocalMap.size();
    SerUtil::serialize(out, nSize);
887
    for (boost::container::flat_map<ElementObjectData, DofEdge>::iterator it = edgeLocalMap.begin();
888
889
890
891
892
893
894
	 it != edgeLocalMap.end(); ++it) {
      it->first.serialize(out);
      SerUtil::serialize(out, it->second);
    }

    nSize = faceLocalMap.size();
    SerUtil::serialize(out, nSize);
895
    for (boost::container::flat_map<ElementObjectData, DofFace>::iterator it = faceLocalMap.begin();
896
897
898
899
900
901
	 it != faceLocalMap.end(); ++it) {
      it->first.serialize(out);
      SerUtil::serialize(out, it->second);
    }


902
    nSize = vertexInRank.size();
903
    SerUtil::serialize(out, nSize);
904
    for (flat_map<DegreeOfFreedom, flat_map<int, ElementObjectData> >::iterator it = vertexInRank.begin();
905
906
907
908
909
910
	 it != vertexInRank.end(); ++it) {
      SerUtil::serialize(out, it->first);
      serialize(out, it->second);
    }

    nSize = edgeInRank.size();
911
    SerUtil::serialize(out, nSize);
912
    for (flat_map<DofEdge, flat_map<int, ElementObjectData> >::iterator it = edgeInRank.begin();
913
914
915
916
917
918
	 it != edgeInRank.end(); ++it) {
      SerUtil::serialize(out, it->first);
      serialize(out, it->second);
    }

    nSize = faceInRank.size();
919
    SerUtil::serialize(out, nSize);
920
    for (flat_map<DofFace, flat_map<int, ElementObjectData> >::iterator it = faceInRank.begin();
921
922
923
924
925
	 it != faceInRank.end(); ++it) {
      SerUtil::serialize(out, it->first);
      serialize(out, it->second);
    }

926
927
928
    SerUtil::serialize(out, periodicVertices);
    SerUtil::serialize(out, periodicEdges);
    SerUtil::serialize(out, periodicFaces);
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949


    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);
950
    for (std::set<pair<ElementObjectData, ElementObjectData> >::iterator it = edgeReverseMode.begin();
951
	 it != edgeReverseMode.end(); ++it) {
952
953
      it->first.serialize(out);
      it->second.serialize(out);
954
955
956
957
    }

    nSize = faceReverseMode.size();
    SerUtil::serialize(out, nSize);
958
    for (std::set<pair<ElementObjectData, ElementObjectData> >::iterator it = faceReverseMode.begin();
959
	 it != faceReverseMode.end(); ++it) {
960
961
      it->first.serialize(out);
      it->second.serialize(out);
962
963
      SerUtil::serialize(out, it->second);
    }
964
965
966
  }


967
  void ElementObjectDatabase::deserialize(istream &in)
968
969
970
971
972
973
  {
    int nSize;
    SerUtil::deserialize(in, nSize);
    vertexElements.clear();
    for (int i = 0; i < nSize; i++) {
      DegreeOfFreedom dof;
974
      vector<ElementObjectData> data;
975
976
977
978
979
980
981
982
983
      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;
984
      vector<ElementObjectData> data;
985
986
987
988
989
990
991
992
993
      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;
994
      vector<ElementObjectData> data;
995
996
997
998
      SerUtil::deserialize(in, face);
      deserialize(in, data);
      faceElements[face] = data;
    }
999
   
1000

1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031

    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
1032

1033
1034
1035
1036
1037

    SerUtil::deserialize(in, nSize);
    vertexInRank.clear();
    for (int i = 0; i < nSize; i++) {
      DegreeOfFreedom dof;
1038
      flat_map<int, ElementObjectData> data;
1039
1040
1041
1042
1043
1044
1045
1046
1047
      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;
1048
      flat_map<int, ElementObjectData> data;
1049
1050
1051
1052
1053
1054
1055
1056
1057
      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;
1058
      flat_map<int, ElementObjectData> data;
1059
1060
1061
1062
      SerUtil::deserialize(in, face);
      deserialize(in, data);
      faceInRank[face] = data;
    }
1063
1064
1065

    SerUtil::deserialize(in, periodicVertices);
    SerUtil::deserialize(in, periodicEdges);
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
    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);

1099
      edgeReverseMode.insert(make_pair(obj0, obj1));
1100
1101
1102
1103
1104
1105
1106
1107
1108
    }

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

1109
      faceReverseMode.insert(make_pair(obj0, obj1));
1110
    }
1111
1112
1113
  }


1114
1115
  void ElementObjectDatabase::serialize(ostream &out, 
					vector<ElementObjectData>& elVec)
1116
1117
1118
1119
1120
1121
1122
1123
  {
    int nSize = elVec.size();
    SerUtil::serialize(out, nSize);
    for (int i = 0; i < nSize; i++)
      elVec[i].serialize(out);
  }


1124
1125
  void ElementObjectDatabase::deserialize(istream &in, 
					  vector<ElementObjectData>& elVec)
1126
1127
1128
1129
1130
1131
1132
1133
1134
  {
    int nSize;
    SerUtil::deserialize(in, nSize);
    elVec.resize(nSize);
    for (int i = 0; i < nSize; i++)
      elVec[i].deserialize(in);
  }

  
1135
  void ElementObjectDatabase::serialize(ostream &out, 
1136
					flat_map<int, ElementObjectData>& data)
1137
1138
1139
  {
    int nSize = data.size();
    SerUtil::serialize(out, nSize);
1140
    for (flat_map<int, ElementObjectData>::iterator it = data.begin();
1141
1142
1143
1144
1145
1146
1147
	 it != data.end(); ++it) {
      SerUtil::serialize(out, it->first);
      it->second.serialize(out);
    }
  }

  
1148
  void ElementObjectDatabase::deserialize(istream &in, 
1149
					  flat_map<int, ElementObjectData>& data)
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
  {
    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;
    }
  }

1163
  //TODO: 047 not yet reimplemented.
1164
1165
  unsigned long ElementObjectDatabase::calculateMemoryUsage()
  {
1166
1167
    FUNCNAME("ElementObjectDatabase::calculateMemoryUsage()");

1168
1169
1170
1171
1172
1173
    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>);
1174
    const unsigned int flatMapOverhead = 24;
1175
//     const unsigned int mapEntryOverhead = 40; // sizeof(_Rb_tree_node_base);
1176
1177
1178
    const unsigned int setOverhead = 48; 
    const unsigned int setEntryOverhead = 40;

1179
1180

    unsigned long value = 0;
1181
    unsigned long tmp = 0;
1182
1183

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

    // edgeElements
1192
1193
    tmp = flatMapOverhead;
    for (flat_map<DofEdge, vector<ElementObjectData> >::iterator mapIt =
1194
	   edgeElements.begin(); mapIt != edgeElements.end(); ++mapIt)
1195
1196
1197
      tmp += dofSize + vectorOverhead + mapIt->second.size() * structElObjDataSize;
    MSG("EL-OBJ-DB MEM 02: %d\n", tmp);
    value += tmp;