InteriorBoundary.h 3.9 KB
Newer Older
1
2
3
4
// ============================================================================
// ==                                                                        ==
// == AMDiS - Adaptive multidimensional simulations                          ==
// ==                                                                        ==
5
// ==  http://www.amdis-fem.org                                              ==
6
7
// ==                                                                        ==
// ============================================================================
8
9
10
11
12
13
14
15
16
17
18
19
//
// 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.


20
21
22
23
24
25
26

/** \file InteriorBoundary.h */

#ifndef AMDIS_INTERIORBOUNDARY_H
#define AMDIS_INTERIORBOUNDARY_H

#include <vector>
Thomas Witkowski's avatar
Thomas Witkowski committed
27
#include <map>
28

29
#include "AMDiS_fwd.h"
30
#include "BoundaryObject.h"
31
#include "parallel/MeshLevelData.h"
32
33
34

namespace AMDiS {

35
36
  using namespace std;

37
38
39
40
41
  /** \brief
   * Defines the interior boundary, i.e. a bound within the domain. It is used for
   * the classical domain decomposition parallelization.
   */
  class InteriorBoundary {
Thomas Witkowski's avatar
Thomas Witkowski committed
42
  public:
43
    typedef map<int, vector<AtomicBoundary> > RankToBoundMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
44

Thomas Witkowski's avatar
Thomas Witkowski committed
45
46
47
    /// Iterator for the interior boundary object.
    class iterator {      
    public:
48
      iterator(InteriorBoundary &b, int traverseLevel = 0)
49
	: bound(b),
50
	  level(traverseLevel)
51
52
53
54
      {
	reset();
      }

Thomas Witkowski's avatar
Thomas Witkowski committed
55
56
57
      /// Set the iterator to the first position.
      void reset()
      {
58
	mapIt = bound.boundary.begin();
Thomas Witkowski's avatar
Thomas Witkowski committed
59
60
61
62
63
64
	nextNonempty();
      }

      /// Test if iterator is at the final position.
      bool end() const
      {
65
	return (mapIt == bound.boundary.end());
Thomas Witkowski's avatar
Thomas Witkowski committed
66
67
68
69
70
      }

      /// Move iterator to the next position.
      void operator++()
      {
71
72
73
74
	do {
	  ++vecIt;
	} while (vecIt->maxLevel < level && vecIt != mapIt->second.end());

Thomas Witkowski's avatar
Thomas Witkowski committed
75
76
77
78
79
80
	if (vecIt == mapIt->second.end()) {
	  ++mapIt;
	  nextNonempty();
	}	
      }

81
82
83
84
85
86
87
88
89
90
      inline AtomicBoundary& operator*()
      {
	return *vecIt;
      }

      inline AtomicBoundary* operator->()
      {
	return &(*vecIt);
      }

Thomas Witkowski's avatar
Thomas Witkowski committed
91
92
93
94
95
96
      void nextRank()
      {
	++mapIt;
	nextNonempty();
      }

97
      inline int getRank() 
Thomas Witkowski's avatar
Thomas Witkowski committed
98
99
100
101
102
103
104
105
      {
	return mapIt->first;
      }

    protected:

      inline void nextNonempty()
      {
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
	do {
	  // Return, we are at the end.
	  if (mapIt == bound.boundary.end())
	    return;
	  
	  // Search for the next non empty boundary map.
	  while (mapIt->second.size() == 0) {
	    ++mapIt;
	    if (mapIt == bound.boundary.end())
	      return;	  
	  }
	  
	  vecIt = mapIt->second.begin();
	  
	  // Search for the next atomic boundary on the mesh level
	  while (vecIt->maxLevel < level && vecIt != mapIt->second.end())
	    ++vecIt;
	  
	  // If vector iterator is not at the end, we have found one and
	  // can return.
	  if (vecIt != mapIt->second.end())
	    return;
	  
	  // In this case, no boundary on the given level is found, continue
	  // with next rank.
131
	  ++mapIt;
132
	} while (true);
Thomas Witkowski's avatar
Thomas Witkowski committed
133
134
135
136
137
      }

    protected:
      RankToBoundMap::iterator mapIt;

138
      vector<AtomicBoundary>::iterator vecIt;
Thomas Witkowski's avatar
Thomas Witkowski committed
139
140

      InteriorBoundary &bound;
141
142

      int level;
Thomas Witkowski's avatar
Thomas Witkowski committed
143
144
    };

145
  public:
146
    void clear();
Thomas Witkowski's avatar
Thomas Witkowski committed
147

148
    AtomicBoundary& getNewAtomic(int rank);
Thomas Witkowski's avatar
Thomas Witkowski committed
149

150
    /// Writes this object to a file.
151
    void serialize(ostream &out);
152

153
    /// Reads the state of an interior boundary from a file.
154
    void deserialize(istream &in, map<int, Element*> &elIndexMap);
155

156
157
158
159
    /// Compares this interior boundaries with some other. The order of the
    /// boundary elements within the object does not play a role.
    bool operator==(const InteriorBoundary& other) const;

160
  protected:
161
    void serializeExcludeList(ostream &out, ExcludeList &list);
162

163
    void deserializeExcludeList(istream &in, ExcludeList &list);    
164

Thomas Witkowski's avatar
Thomas Witkowski committed
165
  public:
166
    RankToBoundMap boundary;    
167
168
169
170
  };
}

#endif // AMDIS_INTERIORBOUNDARY_H