dirichletconstraints.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:
//
// SPDX-FileCopyrightText: Copyright © DuMux Project contributors, see AUTHORS.md in root folder
// SPDX-License-Identifier: GPL-3.0-or-later
//
#ifndef DUMUX_DIRICHLET_CONSTRAINTS_HH
#define DUMUX_DIRICHLET_CONSTRAINTS_HH
 
#include <concepts>
#include <unordered_map>
 
#include <dumux/common/indextraits.hh>
 
namespace Dumux {
 
template<class Info, class Values>
struct ConstraintData
{
    using ConstraintInfo = Info;
    using ConstraintValues = Values;
 
    const ConstraintInfo& constraintInfo() const
    { return info_; }
 
    const ConstraintValues& values() const
    { return values_; }
 
    ConstraintInfo info_;
    ConstraintValues values_;
};
 
template<class DirichletConstraintInfo, class DirichletValues, class IndexType>
struct DirichletConstraintData : public ConstraintData<DirichletConstraintInfo, DirichletValues>
{
    using GridIndexType = IndexType;
 
    GridIndexType dofIndex() const
    { return dofIdx_; }
 
    GridIndexType dofIdx_;
};
 
template<class Data>
class DirichletConstraints
{
    using GridIndexType = typename Data::GridIndexType;
    using DirichletConstraintInfo = typename Data::ConstraintInfo;
    using DirichletValues = typename Data::ConstraintValues;
 
public:
    template<class Problem, typename DirichletFunction>
    void update(const Problem& problem, const DirichletFunction& dirichletFunction)
    {
        constraints_.clear();
 
        auto fvGeometry = localView(problem.gridGeometry());
        for (const auto& element : elements(problem.gridGeometry().gridView()))
        {
            fvGeometry.bind(element);
            for (const auto& intersection : intersections(problem.gridGeometry().gridView(), element))
            {
                if(!intersection.boundary() || intersection.neighbor())
                    continue;
 
                const auto& bcTypes = problem.boundaryTypes(fvGeometry, intersection);
                if (bcTypes.hasDirichlet())
                {
                    for (const auto& localDof : localDofs(fvGeometry, intersection))
                    {
                        DirichletConstraintInfo info;
                        // set the Dirichlet constraints
                        for (int eqIdx = 0; eqIdx < DirichletValues::size(); ++eqIdx)
                            if (bcTypes.isDirichlet(eqIdx))
                                info.set(bcTypes.eqToDirichletIndex(eqIdx), eqIdx);
 
                        auto dirichletValues = dirichletFunction(fvGeometry, intersection, localDof);
                        constraints_.push_back(Data{std::move(info), std::move(dirichletValues), localDof.dofIndex()});
                    }
                }
            }
        }
    }
 
    auto begin() const
    { return constraints_.cbegin(); }
 
    auto end() const
    { return constraints_.cend(); }
 
private:
    std::vector<Data> constraints_;
};
 
static_assert(std::ranges::range<DirichletConstraints<DirichletConstraintData<int, int, int>>>);
 
} // namespace Dumux
 
#endif