70 for (
int iC = 0; iC < _loadBalancer.size(); ++iC) {
71 neighborhood[iC]->forNeighbors([&](
int jC) {
72 if (!_loadBalancer.isLocal(jC)) {
73 _tags[_loadBalancer.rank(jC)][{_loadBalancer.glob(iC),jC}] = -1;
78 for (
auto& [rank, tags] : _tags) {
80 for (
auto tag=tags.begin(); tag != tags.end(); ++tag, ++i) {
89 if (_loadBalancer.isLocal(iC) && _loadBalancer.isLocal(jC)) {
90 return iGroup*_loadBalancer.size()*_loadBalancer.size()
91 + _loadBalancer.loc(iC)*_loadBalancer.size() + _loadBalancer.loc(jC);
93 int kC = _loadBalancer.isLocal(iC) ? jC : iC;
94 auto& tags = _tags[_loadBalancer.rank(kC)];
95 return iGroup*tags.size() + tags[{iC,jC}];