overlaptypes.hh

Go to the documentation of this file.

// -*- mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*-
// vi: set et ts=4 sw=4 sts=4:
/*
  This file is part of the Open Porous Media project (OPM).
 
  OPM is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 2 of the License, or
  (at your option) any later version.
 
  OPM is distributed in the hope that it will be useful,
  but WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  GNU General Public License for more details.
 
  You should have received a copy of the GNU General Public License
  along with OPM.  If not, see <http://www.gnu.org/licenses/>.
 
  Consult the COPYING file in the top-level source directory of this
  module for the precise wording of the license and the list of
  copyright holders.
*/
#ifndef EWOMS_OVERLAP_TYPES_HH
#define EWOMS_OVERLAP_TYPES_HH
 
#include <cstddef>
#include <list>
#include <map>
#include <set>
#include <vector>
 
namespace Opm {
namespace Linear {
 
using Index = int;
 
using ProcessRank = unsigned;
 
using BorderDistance = unsigned;
 
struct IndexRank
{
    Index index;
    ProcessRank rank;
};
 
struct PeerIndexGlobalIndex
{
    Index peerIdx;
    Index globalIdx;
};
 
struct IndexRankDist
{
    Index index;
    ProcessRank peerRank;
    BorderDistance borderDistance;
};
 
struct IndexDistanceNpeers
{
    Index index;
    BorderDistance borderDistance;
    unsigned numPeers;
};
 
struct BorderIndex
{
    Index localIdx;
 
    Index peerIdx;
 
    ProcessRank peerRank;
 
    BorderDistance borderDistance;
};
 
using BorderList = std::list<BorderIndex>;
 
class SeedList : public std::list<IndexRankDist>
{
public:
    void update(const BorderList& borderList)
    {
        this->clear();
 
        auto it = borderList.begin();
        const auto& endIt = borderList.end();
        for (; it != endIt; ++it) {
            IndexRankDist ird;
            ird.index = it->localIdx;
            ird.peerRank = it->peerRank;
            ird.borderDistance = it->borderDistance;
 
            this->push_back(ird);
        }
    }
};
 
class PeerSet : public std::set<ProcessRank>
{
public:
    void update(const BorderList& borderList)
    {
        this->clear();
 
        auto it = borderList.begin();
        const auto& endIt = borderList.end();
        for (; it != endIt; ++it)
            this->insert(it->peerRank);
    }
};
 
using OverlapWithPeer = std::vector<IndexDistanceNpeers>;
 
using OverlapByRank = std::map<ProcessRank, OverlapWithPeer>;
 
using OverlapByIndex = std::vector<std::map<ProcessRank, BorderDistance> >;
 
using DomesticOverlapWithPeer = std::vector<Index>;
 
using DomesticOverlapByRank = std::map<ProcessRank, DomesticOverlapWithPeer>;
 
} // namespace Linear
} // namespace Opm
 
#endif