-
Notifications
You must be signed in to change notification settings - Fork 0
/
cellpartition.cpp
317 lines (225 loc) · 8.23 KB
/
cellpartition.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
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
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
/*******************************************************************
*
* DESCRIPTION: class CellPartition
*
* AUTHOR: Alejandro Troccoli
*
* EMAIL: mailto://atroccol@dc.uba.ar
*
*
* DATE: 12/02/2001
*
*******************************************************************/
#include "cellpartition.h"
using namespace std;
/* Set the InvalidCellIndex to the maximum positive integer */
const unsigned long CellPartition::InvalidCellIndex(-1);
/*******************************************************************
* Method: Constructor
********************************************************************/
CellPartition::CellPartition(const nTupla& dimension, bool border)
: currentIndex(0)
, localElements(0)
, dim(dimension)
, wrapped( border)
{}
/*******************************************************************
* Method: Destructor
********************************************************************/
CellPartition::~CellPartition() {
PartitionZoneList::iterator cursor1;
PartitionCellList::iterator cursor2;
for( cursor1 = localCells.begin(); cursor1 != localCells.end(); cursor1++)
delete *cursor1;
for( cursor2 = remoteNeighbors.begin(); cursor2 != remoteNeighbors.end(); cursor2++)
delete *cursor2;
}
/*******************************************************************
* Method: addLocalZone
* Adds a zone to the list of zones
********************************************************************/
CellPartition &CellPartition::addLocalZone( const string& strZone) {
PartitionZoneDetails *pzone = new PartitionZoneDetails( strZone );
MASSERTMSG( !localCellsInclude(pzone->zone.firstCell()), "Cannot add zone: " + strZone + " because it will overlap to existing zones.")
pzone->firstIndex = currentIndex;
currentIndex += pzone->zone.dimension().totalElements();
localElements += pzone->zone.dimension().totalElements();
pzone->lastIndex = currentIndex - 1;
localCells.push_back( pzone );
return *this;
}
/*******************************************************************
* Method: addNeighborCell
* Adds a neighbor cell to the partition. Duplicate cells will not be added
********************************************************************/
CellPartition &CellPartition::addNeighborCell( const CellPosition& cell) {
// If the cell is already in the partition, do not add it
if ( !localCellsInclude(cell) && !neighborCellsInclude( cell ) ) {
PartitionCellDetails *celldetail = new PartitionCellDetails;
celldetail->cell = cell;
celldetail->cellIndex = currentIndex;
remoteNeighbors.push_back ( celldetail );
currentIndex++;
}
return *this;
}
/*******************************************************************
* Method: addNeighborCells
* Adds all the remote neighbors corresponding to the localcells
********************************************************************/
CellPartition &CellPartition::addNeighborCells( const CellPositionList& neighborList) {
CellPartition::LocalCellsIterator cells;
CellPositionList::const_iterator neighbors;
nTupla pos;
for( cells = begin(); !(cells == end()); cells++ ) {
for ( neighbors = neighborList.begin(); neighbors!= neighborList.end(); neighbors++ ) {
pos = *cells;
pos += *neighbors;
if ( borderWrapped() ) {
pos.canonizar( dimension() );
//if the cell already exists, it will not be added twice.
//That is guaranteed by addNeighborCell
addNeighborCell( pos );
} else {
if( dimension().includes( pos ) ) {
addNeighborCell( pos );
}
}//if
} // for neighbors
} //for cells
return *this;
}
/*******************************************************************
* Method: localCellsInclude
* Returns true if the local cells include cell
********************************************************************/
bool CellPartition::localCellsInclude( CellPosition cell) const {
PartitionZoneList::const_iterator cursor;
if ( borderWrapped() )
cell.canonizar( dimension());
cursor = localCells.begin();
while ( cursor != localCells.end() ) {
if( cell.isInRegion( (*cursor)->zone.firstCell(), (*cursor)->zone.lastCell() ))
return true;
cursor++;
};
return false;
}
/*******************************************************************
* Method: neighborCellsInclude
* Returns true if the neighbor cells include cell
********************************************************************/
bool CellPartition::neighborCellsInclude( CellPosition cell) const {
PartitionCellList::const_iterator cursor;
if ( borderWrapped() )
cell.canonizar( dimension());
cursor = remoteNeighbors.begin();
while ( cursor != remoteNeighbors.end() ) {
if ( (*cursor)->cell == cell )
return true;
cursor++;
}
return false;
}
/*******************************************************************
* Method: cellIndex
* Returns the index of the cell within the partition
* If the cell is not in the partition, then it returns InvalidCellIndex
* An InvalidCellIndex is used by CellState to return Real::undef.
********************************************************************/
unsigned long CellPartition::cellIndex( CellPosition cell) const {
// First, search in the local cells
PartitionZoneList::const_iterator cursor;
if ( borderWrapped() )
cell.canonizar( dimension());
cursor = localCells.begin();
while ( cursor != localCells.end() ) {
if( cell.isInRegion( (*cursor)->zone.firstCell(), (*cursor)->zone.lastCell() ) )
{
nTupla pos = cell;
pos -= (*cursor)->zone.firstCell();
return (*cursor)->firstIndex + pos.totalElements() - 1;
}
cursor++;
};
//Now search in the neighbor cells
PartitionCellList::const_iterator cursor2;
cursor2 = remoteNeighbors.begin();
while ( cursor2 != remoteNeighbors.end() ) {
if ( (*cursor2)->cell == cell ) {
return (*cursor2)->cellIndex;
}
cursor2++;
}
return InvalidCellIndex;
}
/*******************************************************************
* Method: begin
********************************************************************/
CellPartition::LocalCellsIterator CellPartition::begin() const
{
LocalCellsIterator it (localCells.begin(), localCells.end());
return it;
}
/*******************************************************************
* Method: end
********************************************************************/
CellPartition::LocalCellsIterator CellPartition::end() const
{
LocalCellsIterator it;
return it;
}
/*******************************************************************
* Method: operator=
********************************************************************/
CellPartition::LocalCellsIterator &CellPartition::LocalCellsIterator::operator=( const LocalCellsIterator &it )
{
cursor = it.cursor;
zones = it.zones;
currentZone = it.currentZone;
zoneListEnd = it.zoneListEnd;
return *this;
}
/*******************************************************************
* Method: operator++
********************************************************************/
CellPartition::LocalCellsIterator &CellPartition::LocalCellsIterator::operator++( int )
{
cursor++;
if ( cursor == currentZone->zone.end() ) {
zones++;
if ( zones == zoneListEnd )
currentZone = NULL;
else
cursor = (*zones)->zone.begin();
}
return *this;
}
/*******************************************************************
* Method: Iterator
********************************************************************/
CellPartition::LocalCellsIterator::LocalCellsIterator( const CellPartition::PartitionZoneList::const_iterator &begin, const CellPartition::PartitionZoneList::const_iterator &end) {
zones = begin;
zoneListEnd = end;
if ( begin != end ) {
currentZone = *begin;
cursor = currentZone->zone.begin();
} else {
currentZone = NULL;
}
}
CellPartition::LocalCellsIterator::LocalCellsIterator( const CellPartition::PartitionZoneList::const_iterator &begin, const CellPartition::PartitionZoneList::const_iterator &end, PartitionZoneDetails *current) {
zones = begin;
zoneListEnd = end;
currentZone = current;
cursor = currentZone->zone.begin();
}
/*******************************************************************
* Method: operator==
********************************************************************/
bool CellPartition::LocalCellsIterator::operator ==( const LocalCellsIterator &it ) const {
if ( currentZone == NULL )
return it.currentZone == NULL;
else
return *cursor == *it;
}