adaption.hpp

/*---------------------------------------------------------------------------*\
 *
 *  bitpit
 *
 *  Copyright (C) 2015-2021 OPTIMAD engineering Srl
 *
 *  -------------------------------------------------------------------------
 *  License
 *  This file is part of bitpit.
 *
 *  bitpit is free software: you can redistribute it and/or modify it
 *  under the terms of the GNU Lesser General Public License v3 (LGPL)
 *  as published by the Free Software Foundation.
 *
 *  bitpit 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 Lesser General Public
 *  License for more details.
 *
 *  You should have received a copy of the GNU Lesser General Public License
 *  along with bitpit. If not, see <http://www.gnu.org/licenses/>.
 *
\*---------------------------------------------------------------------------*/
 
#ifndef __BITPIT_ADAPTION_HPP__
#define __BITPIT_ADAPTION_HPP__
 
#include <vector>
#include <unordered_map>
#include <unordered_set>
 
namespace bitpit {
 
namespace adaption
{
    enum Marker {
        MARKER_REFINE,
        MARKER_NONE,
        MARKER_COARSEN,
        MARKER_UNDEFINED
    };
 
    enum Type {
        TYPE_UNKNOWN  = -2,
        TYPE_NONE     = -1,
        TYPE_CREATION = 0,
        TYPE_DELETION,
        TYPE_REFINEMENT,
        TYPE_COARSENING,
        TYPE_RENUMBERING,
        TYPE_PARTITION_SEND,
        TYPE_PARTITION_RECV,
        TYPE_PARTITION_NOTICE
    };
 
    enum Entity {
        ENTITY_UNKNOWN = -1,
        ENTITY_CELL,
        ENTITY_INTERFACE
    };
 
    struct Info
    {
        Info()
            : type(TYPE_UNKNOWN), entity(ENTITY_UNKNOWN), rank(-1)
        {
        }
 
        Info(Type user_type, Entity user_entity, int user_rank = -1)
            : type(user_type), entity(user_entity), rank(user_rank)
        {
        }
 
        Type type;
        Entity entity;
        int rank;
        std::vector<long> previous;
        std::vector<long> current;
    };
 
    class InfoCollection
    {
 
    public:
        InfoCollection();
 
        std::size_t create();
        std::size_t create(Type type, Entity entity, int rank = -1);
 
        Info & at(std::size_t id);
        const Info & at(std::size_t id) const;
 
        const std::vector<Info> & data() const noexcept;
        std::vector<Info> & data() noexcept;
 
        Info & operator[](std::size_t id);
        const Info & operator[](std::size_t id) const;
 
        std::vector<Info> dump();
 
    private:
        typedef std::tuple<int, int, int> infoData_t;
 
        std::unordered_map<infoData_t, std::size_t, utils::hashing::hash<infoData_t>> m_cache;
        std::unordered_set<int> m_cachedTypes;
        std::vector<Info> m_collection;
    };
}
 
class PatchKernel;
 
class FlatMapping
{
 
public:
    FlatMapping();
    FlatMapping(PatchKernel *patch);
 
    virtual ~FlatMapping() = default;
 
    virtual void update(const std::vector<adaption::Info> &adaptionData) = 0;
 
    const std::vector<long> & getNumbering() const;
    const std::vector<long> & getMapping() const;
 
protected:
    PatchKernel *m_patch;
    std::vector<long> m_numbering;
    std::vector<long> m_mapping;
 
};
 
 
class CellFlatMapping : public FlatMapping
{
 
public:
    CellFlatMapping();
    CellFlatMapping(PatchKernel *patch);
 
    void update(const std::vector<adaption::Info> &adaptionData) override;
 
};
 
}
 
#endif