-
Notifications
You must be signed in to change notification settings - Fork 17
/
Copy pathConnectivityMapInline.hh
404 lines (370 loc) · 15.7 KB
/
ConnectivityMapInline.hh
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
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
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
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
#include "NodeList/FluidNodeList.hh"
#include "NodeList/NodeListRegistrar.hh"
#include <algorithm>
namespace Spheral {
//------------------------------------------------------------------------------
// Constructor.
// The input iterators must dereference to const NodeList*, and must be
// const FluidNodeLists underneath.
//------------------------------------------------------------------------------
template<typename Dimension>
template<typename NodeListIterator>
inline
ConnectivityMap<Dimension>::
ConnectivityMap(const NodeListIterator& begin,
const NodeListIterator& end,
const bool buildGhostConnectivity,
const bool buildOverlapConnectivity,
const bool buildIntersectionConnectivity):
mNodeLists(),
mBuildGhostConnectivity(buildGhostConnectivity or buildIntersectionConnectivity),
mBuildOverlapConnectivity(buildOverlapConnectivity),
mBuildIntersectionConnectivity(buildIntersectionConnectivity),
mOffsets(),
mConnectivity(),
mNodeTraversalIndices(),
mKeys(FieldStorageType::CopyFields),
mCouplingPtr(std::make_shared<NodeCoupling>()) {
// The private method does the grunt work of filling in the connectivity once we have
// established the set of NodeLists.
this->rebuild(begin, end, mBuildGhostConnectivity, mBuildOverlapConnectivity, mBuildIntersectionConnectivity);
// We'd better be valid after the constructor is finished!
ENSURE(valid());
}
//------------------------------------------------------------------------------
// Rebuild for a given set of NodeLists.
//------------------------------------------------------------------------------
template<typename Dimension>
template<typename NodeListIterator>
inline
void
ConnectivityMap<Dimension>::
rebuild(const NodeListIterator& begin,
const NodeListIterator& end,
const bool buildGhostConnectivity,
const bool buildOverlapConnectivity,
const bool buildIntersectionConnectivity) {
mBuildGhostConnectivity = buildGhostConnectivity or buildIntersectionConnectivity;
mBuildOverlapConnectivity = buildOverlapConnectivity;
mBuildIntersectionConnectivity = buildIntersectionConnectivity;
// Copy the set of NodeLists in the order prescribed by the NodeListRegistrar.
NodeListRegistrar<Dimension>& registrar = NodeListRegistrar<Dimension>::instance();
const bool domainDecompIndependent = registrar.domainDecompositionIndependent();
const unsigned numNodeLists = std::distance(begin, end);
mNodeLists.clear();
mOffsets.resize(numNodeLists);
std::vector<unsigned> numNodes(numNodeLists);
for (NodeListIterator itr = begin; itr != end; ++itr) {
typename std::vector<const NodeList<Dimension>*>::iterator posItr =
registrar.findInsertionPoint(*itr, mNodeLists.begin(), mNodeLists.end());
const unsigned i = std::distance(mNodeLists.begin(), posItr);
CHECK(i < numNodeLists);
mNodeLists.insert(posItr, *itr);
numNodes[i] = ((domainDecompIndependent or mBuildGhostConnectivity or mBuildOverlapConnectivity) ?
(*itr)->numNodes() :
(*itr)->numInternalNodes());
}
// Construct the offsets.
mOffsets[0] = 0;
for (unsigned i = 1; i != numNodeLists; ++i) mOffsets[i] = mOffsets[i - 1] + numNodes[i - 1];
CHECK(mOffsets.size() == mNodeLists.size());
this->computeConnectivity();
ENSURE(valid());
}
//------------------------------------------------------------------------------
// Are we computing ghost connectivity?
//------------------------------------------------------------------------------
template<typename Dimension>
inline
bool
ConnectivityMap<Dimension>::
buildGhostConnectivity() const {
return mBuildGhostConnectivity;
}
//------------------------------------------------------------------------------
// Are we computing overlap connectivity?
//------------------------------------------------------------------------------
template<typename Dimension>
inline
bool
ConnectivityMap<Dimension>::
buildOverlapConnectivity() const {
return mBuildOverlapConnectivity;
}
//------------------------------------------------------------------------------
// Are we computing intersection connectivity?
//------------------------------------------------------------------------------
template<typename Dimension>
inline
bool
ConnectivityMap<Dimension>::
buildIntersectionConnectivity() const {
return mBuildIntersectionConnectivity;
}
//------------------------------------------------------------------------------
// Get the set of NodeLists.
//------------------------------------------------------------------------------
template<typename Dimension>
inline
const std::vector<const NodeList<Dimension>*>&
ConnectivityMap<Dimension>::
nodeLists() const {
return mNodeLists;
}
template<typename Dimension>
inline
const NodePairList&
ConnectivityMap<Dimension>::
nodePairList() const {
return mNodePairList;
}
//------------------------------------------------------------------------------
// Get the set of neighbors for the given node in the given NodeList.
//------------------------------------------------------------------------------
template<typename Dimension>
inline
const std::vector< std::vector<int> >&
ConnectivityMap<Dimension>::
connectivityForNode(const NodeList<Dimension>* nodeListPtr,
const int nodeID) const {
const bool ghostValid = (mBuildGhostConnectivity or
NodeListRegistrar<Dimension>::instance().domainDecompositionIndependent());
CONTRACT_VAR(ghostValid);
REQUIRE(nodeID >= 0 and
((nodeID < (int)nodeListPtr->numInternalNodes()) or
(ghostValid and nodeID < (int)nodeListPtr->numNodes())));
const int nodeListID = std::distance(mNodeLists.begin(),
std::find(mNodeLists.begin(), mNodeLists.end(), nodeListPtr));
REQUIRE(nodeListID < (int)mConnectivity.size() and nodeListID < (int)mOffsets.size());
REQUIRE(mOffsets[nodeListID] + nodeID < (int)mConnectivity.size());
return mConnectivity[mOffsets[nodeListID] + nodeID];
}
//------------------------------------------------------------------------------
// Same as above, indicating the NodeList as an integer index.
//------------------------------------------------------------------------------
template<typename Dimension>
inline
const std::vector< std::vector<int> >&
ConnectivityMap<Dimension>::
connectivityForNode(const int nodeListID,
const int nodeID) const {
const bool ghostValid = (mBuildGhostConnectivity or
NodeListRegistrar<Dimension>::instance().domainDecompositionIndependent());
CONTRACT_VAR(ghostValid);
REQUIRE(nodeListID >= 0 and nodeListID < (int)mConnectivity.size());
REQUIRE(nodeID >= 0 and
((nodeID < (int)mNodeLists[nodeListID]->numInternalNodes()) or
(ghostValid and nodeID < (int)mNodeLists[nodeListID]->numNodes())));
REQUIRE(mOffsets[nodeListID] + nodeID < (int)mConnectivity.size());
return mConnectivity[mOffsets[nodeListID] + nodeID];
}
//------------------------------------------------------------------------------
// Get the set of neighbors we have some overlap with (common neighbors) for the
// given node in the given NodeList.
//------------------------------------------------------------------------------
template<typename Dimension>
inline
const std::vector< std::vector<int> >&
ConnectivityMap<Dimension>::
overlapConnectivityForNode(const NodeList<Dimension>* nodeListPtr,
const int nodeID) const {
const bool ghostValid = (mBuildGhostConnectivity or
NodeListRegistrar<Dimension>::instance().domainDecompositionIndependent());
CONTRACT_VAR(ghostValid);
REQUIRE(nodeID >= 0 and
((nodeID < (int)nodeListPtr->numInternalNodes()) or
(ghostValid and nodeID < (int)nodeListPtr->numNodes())));
const int nodeListID = std::distance(mNodeLists.begin(),
std::find(mNodeLists.begin(), mNodeLists.end(), nodeListPtr));
REQUIRE(nodeListID < (int)mConnectivity.size() and nodeListID < (int)mOffsets.size());
REQUIRE(mOffsets[nodeListID] + nodeID < (int)mConnectivity.size());
return mOverlapConnectivity[mOffsets[nodeListID] + nodeID];
}
//------------------------------------------------------------------------------
// Same as above, indicating the NodeList as an integer index.
//------------------------------------------------------------------------------
template<typename Dimension>
inline
const std::vector< std::vector<int> >&
ConnectivityMap<Dimension>::
overlapConnectivityForNode(const int nodeListID,
const int nodeID) const {
const bool ghostValid = (mBuildGhostConnectivity or
NodeListRegistrar<Dimension>::instance().domainDecompositionIndependent());
CONTRACT_VAR(ghostValid);
REQUIRE(nodeListID >= 0 and nodeListID < (int)mConnectivity.size());
REQUIRE(nodeID >= 0 and
((nodeID < (int)mNodeLists[nodeListID]->numInternalNodes()) or
(ghostValid and nodeID < (int)mNodeLists[nodeListID]->numNodes())));
REQUIRE(mOffsets[nodeListID] + nodeID < (int)mConnectivity.size());
return mOverlapConnectivity[mOffsets[nodeListID] + nodeID];
}
//------------------------------------------------------------------------------
// Compute the number of neighbors for the given node.
//------------------------------------------------------------------------------
template<typename Dimension>
inline
int
ConnectivityMap<Dimension>::
numNeighborsForNode(const NodeList<Dimension>* nodeListPtr,
const int nodeID) const {
const std::vector< std::vector<int> >& neighbors = connectivityForNode(nodeListPtr, nodeID);
int result = 0;
for (std::vector< std::vector<int> >::const_iterator itr = neighbors.begin();
itr != neighbors.end();
++itr) result += itr->size();
return result;
}
template<typename Dimension>
inline
int
ConnectivityMap<Dimension>::
numNeighborsForNode(const int nodeListID,
const int nodeID) const {
REQUIRE(nodeListID < (int)mNodeLists.size());
return this->numNeighborsForNode(mNodeLists[nodeListID], nodeID);
}
//------------------------------------------------------------------------------
// Compute the number of overlap neighbors for the given node.
//------------------------------------------------------------------------------
template<typename Dimension>
inline
int
ConnectivityMap<Dimension>::
numOverlapNeighborsForNode(const NodeList<Dimension>* nodeListPtr,
const int nodeID) const {
const std::vector< std::vector<int> >& neighbors = overlapConnectivityForNode(nodeListPtr, nodeID);
int result = 0;
for (std::vector< std::vector<int> >::const_iterator itr = neighbors.begin();
itr != neighbors.end();
++itr) result += itr->size();
return result;
}
template<typename Dimension>
inline
int
ConnectivityMap<Dimension>::
numOverlapNeighborsForNode(const int nodeListID,
const int nodeID) const {
REQUIRE(nodeListID < (int)mNodeLists.size());
return this->numOverlapNeighborsForNode(mNodeLists[nodeListID], nodeID);
}
//------------------------------------------------------------------------------
// A single point to determine if in looping over nodes and neighbors the given
// pair should be calculated or not when we are doing pairs simultaneously.
//------------------------------------------------------------------------------
template<typename Dimension>
inline
bool
ConnectivityMap<Dimension>::
calculatePairInteraction(const int nodeListi, const int i,
const int nodeListj, const int j,
const int firstGhostNodej) const {
// const bool domainDecompIndependent = NodeListRegistrar<Dimension>::instance().domainDecompositionIndependent();
// if (domainDecompIndependent) {
// return ((nodeListj > nodeListi) or
// (nodeListj == nodeListi and
// (mKeys(nodeListj, j) == mKeys(nodeListi, i) ? j > 1 : mKeys(nodeListj, j) > mKeys(nodeListi, i))));
// } else {
return ((nodeListj > nodeListi) or
(nodeListj == nodeListi and j > i) or
(nodeListj < nodeListi and j >= firstGhostNodej));
// }
}
//------------------------------------------------------------------------------
// Iterators for walking nodes in a prescribed order (domain decomposition
// independent when needed).
//------------------------------------------------------------------------------
template<typename Dimension>
inline
typename ConnectivityMap<Dimension>::const_iterator
ConnectivityMap<Dimension>::
begin(const int nodeList) const {
REQUIRE(nodeList >= 0 and nodeList < (int)mNodeTraversalIndices.size());
return mNodeTraversalIndices[nodeList].begin();
}
template<typename Dimension>
inline
typename ConnectivityMap<Dimension>::const_iterator
ConnectivityMap<Dimension>::
end(const int nodeList) const {
REQUIRE(nodeList >= 0 and nodeList < (int)mNodeTraversalIndices.size());
return mNodeTraversalIndices[nodeList].end();
}
//------------------------------------------------------------------------------
// The number of ordered nodes in the given NodeList.
//------------------------------------------------------------------------------
template<typename Dimension>
inline
int
ConnectivityMap<Dimension>::
numNodes(const int nodeList) const {
REQUIRE(nodeList >= 0 and nodeList < (int)mNodeLists.size());
return mNodeTraversalIndices[nodeList].size();
}
//------------------------------------------------------------------------------
// The ith ordered node in the given NodeList.
//------------------------------------------------------------------------------
template<typename Dimension>
inline
int
ConnectivityMap<Dimension>::
ithNode(const int nodeList, const int index) const {
REQUIRE(nodeList >= 0 and nodeList < (int)mNodeLists.size());
REQUIRE(index >= 0 and index < (int)mNodeTraversalIndices[nodeList].size());
return mNodeTraversalIndices[nodeList][index];
}
//------------------------------------------------------------------------------
// Get the ith NodeList/FluidNodeList.
//------------------------------------------------------------------------------
template<typename Dimension>
inline
const NodeList<Dimension>&
ConnectivityMap<Dimension>::
nodeList(const int index) const {
REQUIRE(index >= 0 and index < (int)mNodeLists.size());
return *(mNodeLists[index]);
}
//------------------------------------------------------------------------------
// The NodeCoupling functor
//------------------------------------------------------------------------------
template<typename Dimension>
NodeCoupling&
ConnectivityMap<Dimension>::
coupling() {
return *mCouplingPtr;
}
template<typename Dimension>
const NodeCoupling&
ConnectivityMap<Dimension>::
coupling() const {
return *mCouplingPtr;
}
template<typename Dimension>
void
ConnectivityMap<Dimension>::
coupling(typename ConnectivityMap<Dimension>::NodeCouplingPtr couplingPtr) {
mCouplingPtr = couplingPtr;
}
//------------------------------------------------------------------------------
// intersection connectivity, if available
//------------------------------------------------------------------------------
template<typename Dimension>
const std::vector<std::vector<int>>&
ConnectivityMap<Dimension>::
intersectionConnectivity(const NodePairIdxType& pair) const {
const auto itr = mIntersectionConnectivity.find(pair);
if (itr == mIntersectionConnectivity.end()) VERIFY2(false, "ERROR: attempt to lookup missing intersection connectivity for node pair " << pair);
return itr->second;
}
//------------------------------------------------------------------------------
// Set the function for excluding node pairs
//------------------------------------------------------------------------------
template<typename Dimension>
void
ConnectivityMap<Dimension>::
setNodePairExclusion(std::function<bool(int, int, int, int)> excludePairs)
{
mExcludePairs = excludePairs;
}
}