dolfinx.hpp

Go to the documentation of this file.

// SPDX-FileCopyrightText: 2022-2023 Dennis Gläser <dennis.glaeser@iws.uni-stuttgart.de>
// SPDX-License-Identifier: MIT
#ifndef GRIDFORMAT_TRAITS_DOLFINX_HPP_
#define GRIDFORMAT_TRAITS_DOLFINX_HPP_
 
#include <array>
#include <ranges>
#include <cstdint>
#include <utility>
#include <memory>
#include <algorithm>
 
#include <dolfinx/io/cells.h>
#include <dolfinx/io/vtk_utils.h>
#include <dolfinx/mesh/cell_types.h>
#include <dolfinx/mesh/Mesh.h>
#include <dolfinx/fem/Function.h>
#include <dolfinx/fem/FunctionSpace.h>
 
#include <gridformat/common/ranges.hpp>
#include <gridformat/common/exceptions.hpp>
#include <gridformat/common/precision.hpp>
#include <gridformat/grid/cell_type.hpp>
#include <gridformat/grid/traits.hpp>
#include <gridformat/grid/writer.hpp>
 
 
namespace GridFormat {
 
namespace DolfinX {
 
struct Cell { std::int32_t index; };
struct Point { std::int32_t index; };
 
#ifndef DOXYGEN
namespace Detail {
    CellType cell_type(dolfinx::mesh::CellType ct) {
        // since dolfinx supports higher-order cells, let's simply return the lagrange variants always
        switch (ct) {
            case dolfinx::mesh::CellType::point: return GridFormat::CellType::vertex;
            case dolfinx::mesh::CellType::interval: return GridFormat::CellType::lagrange_segment;
            case dolfinx::mesh::CellType::triangle: return GridFormat::CellType::lagrange_triangle;
            case dolfinx::mesh::CellType::quadrilateral: return GridFormat::CellType::lagrange_quadrilateral;
            case dolfinx::mesh::CellType::tetrahedron: return GridFormat::CellType::lagrange_tetrahedron;
            case dolfinx::mesh::CellType::pyramid: break;
            case dolfinx::mesh::CellType::prism: break;
            case dolfinx::mesh::CellType::hexahedron: return GridFormat::CellType::lagrange_hexahedron;
        }
        throw NotImplemented("Support for dolfinx cell type '" + dolfinx::mesh::to_string(ct) + "'");
    }
 
    bool is_cellwise_constant(const dolfinx::fem::FunctionSpace& space) {
        return space.dofmap()->element_dof_layout().num_dofs() == 1;
    }
 
    template<typename T>
    bool is_cellwise_constant(const dolfinx::fem::Function<T>& f) {
        assert(f.function_space());
        return is_cellwise_constant(*f.function_space());
    }
}  // namespace Detail
#endif  // DOXYGEN
 
}  // namespace DolfinX
 
namespace Traits {
 
template<>
struct Cells<dolfinx::mesh::Mesh> {
    static std::ranges::range auto get(const dolfinx::mesh::Mesh& mesh) {
        auto map = mesh.topology().index_map(mesh.topology().dim());
        if (!map) throw GridFormat::ValueError("Cell index map not available");
        return std::views::iota(0, map->size_local()) | std::views::transform([] (std::int32_t i) {
            return DolfinX::Cell{i};
        });
    }
};
 
template<>
struct CellType<dolfinx::mesh::Mesh, DolfinX::Cell> {
    static GridFormat::CellType get(const dolfinx::mesh::Mesh& mesh, const DolfinX::Cell&) {
        return DolfinX::Detail::cell_type(mesh.topology().cell_type());
    }
};
 
template<>
struct CellPoints<dolfinx::mesh::Mesh, DolfinX::Cell> {
    static std::ranges::range auto get(const dolfinx::mesh::Mesh& mesh, const DolfinX::Cell& cell) {
        std::span links = mesh.geometry().dofmap().links(cell.index);
        auto permutation = dolfinx::io::cells::transpose(
            dolfinx::io::cells::perm_vtk(mesh.topology().cell_type(), links.size())
        );
        return std::views::iota(std::size_t{0}, links.size())
            | std::views::transform([perm = std::move(permutation), links=links] (std::size_t i) {
                return DolfinX::Point{links[perm[i]]};
            }
        );
    }
};
 
template<>
struct Points<dolfinx::mesh::Mesh> {
    static std::ranges::range auto get(const dolfinx::mesh::Mesh& mesh) {
        const auto num_points = mesh.geometry().x().size()/3;
        return std::views::iota(std::size_t{0}, num_points) | std::views::transform([] (std::size_t i) {
            return DolfinX::Point{static_cast<std::int32_t>(i)};
        });
    }
};
 
template<>
struct PointCoordinates<dolfinx::mesh::Mesh, DolfinX::Point> {
    static std::ranges::range auto get(const dolfinx::mesh::Mesh& mesh, const DolfinX::Point& point) {
        return std::array{
            mesh.geometry().x()[point.index*3],
            mesh.geometry().x()[point.index*3 + 1],
            mesh.geometry().x()[point.index*3 + 2]
        };
    }
};
 
template<>
struct PointId<dolfinx::mesh::Mesh, DolfinX::Point> {
    static std::integral auto get(const dolfinx::mesh::Mesh&, const DolfinX::Point& point) {
        return point.index;
    }
};
 
template<>
struct NumberOfPoints<dolfinx::mesh::Mesh> {
    static std::integral auto get(const dolfinx::mesh::Mesh& mesh) {
        return mesh.geometry().x().size()/3;
    }
};
 
template<>
struct NumberOfCells<dolfinx::mesh::Mesh> {
    static std::integral auto get(const dolfinx::mesh::Mesh& mesh) {
        auto map = mesh.topology().index_map(mesh.topology().dim());
        if (!map) throw GridFormat::ValueError("Cell index map not available");
        return map->size_local();
    }
};
 
template<>
struct NumberOfCellPoints<dolfinx::mesh::Mesh, DolfinX::Cell> {
    static std::integral auto get(const dolfinx::mesh::Mesh& mesh, const DolfinX::Cell& cell) {
        return mesh.geometry().dofmap().links(cell.index).size();
    }
};
 
}  // namespace Traits
 
namespace DolfinX {
 
class LagrangePolynomialGrid {
 public:
    LagrangePolynomialGrid() = default;
    LagrangePolynomialGrid(const dolfinx::fem::FunctionSpace& space) {
        if (!space.mesh() || !space.element())
            throw ValueError("Cannot construct mesh from space without mesh or element");
 
        _cell_type = space.mesh()->topology().cell_type();
        _mesh = space.mesh();
        _element = space.element();
 
        auto [x, xshape, xids, _ghosts, cells, cells_shape] = dolfinx::io::vtk_mesh_from_space(space);
        _node_coords = std::move(x);
        _node_coords_shape = std::move(xshape);
        _node_ids = std::move(xids);
        _cells = std::move(cells);
        _cells_shape = std::move(cells_shape);
        _set = true;
    }
 
    void update(const dolfinx::fem::FunctionSpace& space) {
        *this = LagrangePolynomialGrid{space};
    }
 
    void clear() {
        _mesh = nullptr;
        _element = nullptr;
        _node_coords.clear();
        _node_ids.clear();
        _cells.clear();
        _set = false;
    }
 
    static LagrangePolynomialGrid from(const dolfinx::fem::FunctionSpace& space) {
        return {space};
    }
 
    std::integral auto number_of_points() const { return _node_coords_shape[0]; }
    std::integral auto number_of_cells() const { return _cells_shape[0]; }
    std::integral auto number_of_cell_points() const { return _cells_shape[1]; }
 
    std::int64_t id(const Point& p) const {
        return _node_ids[p.index];
    }
 
    auto position(const Point& p) const {
        assert(_node_coords_shape[1] == 3);
        return std::array{
            _node_coords[p.index*3],
            _node_coords[p.index*3 + 1],
            _node_coords[p.index*3 + 2]
        };
    }
 
    std::ranges::range auto points() const {
        _check_built();
        return std::views::iota(std::size_t{0}, _node_coords_shape[0])
            | std::views::transform([] (std::size_t i) {
                return Point{static_cast<std::int32_t>(i)};
            });
    }
 
    std::ranges::range auto points(const Cell& cell) const {
        return std::views::iota(std::size_t{0}, _cells_shape[1])
            | std::views::transform([&, i=cell.index, ncorners=_cells_shape[1]] (std::size_t local_point_index) {
                return Point{static_cast<std::int32_t>(_cells[i*ncorners + local_point_index])};
            });
    }
 
    std::ranges::range auto cells() const {
        _check_built();
        return std::views::iota(std::size_t{0}, _cells_shape[0])
            | std::views::transform([] (std::size_t i) {
                return Cell{static_cast<std::int32_t>(i)};
            });
    }
 
    template<int rank = 0, int dim = 3, Concepts::Scalar T>
    auto evaluate(const dolfinx::fem::Function<T>& f, const Cell& c) const {
        assert(is_compatible(f));
        return _evaluate<rank, dim>(f, c.index);
    }
 
    template<int rank = 0, int dim = 3, Concepts::Scalar T>
    auto evaluate(const dolfinx::fem::Function<T>& f, const Point& p) const {
        assert(is_compatible(f));
        return _evaluate<rank, dim>(f, p.index);
    }
 
    auto cell_type() const {
        return _cell_type;
    }
 
    template<Concepts::Scalar T>
    bool is_compatible(const dolfinx::fem::Function<T>& f) const {
        if (!_set) return false;
        if (!f.function_space()->mesh()) return false;
        if (f.function_space()->mesh() != _mesh) return false;
        if (!Detail::is_cellwise_constant(f)) {
            if (!f.function_space()->element()) return false;
            if (*f.function_space()->element() != *_element) return false;
        }
        return true;
    }
 
 private:
    void _check_built() const {
        if (!_set)
            throw InvalidState("Mesh has not been built");
    }
 
    template<int rank = 0, int dim = 3, Concepts::Scalar T>
    auto _evaluate(const dolfinx::fem::Function<T>& f, const std::integral auto i) const {
        const auto f_components = f.function_space()->element()->block_size();
        assert(f.function_space()->element()->value_shape().size() == rank);
        assert(f.x()->array().size() >= static_cast<std::size_t>(i*f_components + f_components));
 
        if constexpr (rank == 0)
            return f.x()->array()[i*f_components];
        else if constexpr (rank == 1) {
            auto result = Ranges::filled_array<dim>(T{0});
            std::copy_n(
                f.x()->array().data() + i*f_components,
                std::min(dim, f_components),
                result.begin()
            );
            return result;
        } else {
            throw NotImplemented("Tensor evaluation");
            return std::array<std::array<T, dim>, dim>{};  // for return type deduction
        }
    }
 
    dolfinx::mesh::CellType _cell_type;
    std::shared_ptr<const dolfinx::mesh::Mesh> _mesh{nullptr};
    std::shared_ptr<const dolfinx::fem::FiniteElement> _element{nullptr};
 
    std::vector<double> _node_coords;
    std::array<std::size_t, 2> _node_coords_shape;
    std::vector<std::int64_t> _node_ids;
    std::vector<std::int64_t> _cells;
    std::array<std::size_t, 2> _cells_shape;
    bool _set = false;
};
 
template<typename Writer, Concepts::Scalar T, Concepts::Scalar P = T>
void set_point_function(const dolfinx::fem::Function<T>& f,
                        Writer& writer,
                        std::string name = "",
                        const Precision<P>& prec = {}) {
    if (!writer.grid().is_compatible(f))
        throw ValueError("Grid passed to writer is incompatible with the given function");
    if (Detail::is_cellwise_constant(f))
        throw ValueError("Given function is not node-based");
    if (name.empty())
        name = f.name;
    const auto block_size = f.function_space()->element()->block_size();
    const auto dim = f.function_space()->mesh()->geometry().dim();
    if (block_size == 1)
        writer.set_point_field(name, [&] (const auto p) { return writer.grid().template evaluate<0>(f, p); }, prec);
    else if (dim >= block_size)
        writer.set_point_field(name, [&] (const auto p) { return writer.grid().template evaluate<1>(f, p); }, prec);
    else
        writer.set_point_field(name, [&] (const auto p) { return writer.grid().template evaluate<2>(f, p); }, prec);
}
 
template<typename Writer, Concepts::Scalar T, Concepts::Scalar P = T>
void set_cell_function(const dolfinx::fem::Function<T>& f,
                       Writer& writer,
                       std::string name = "",
                       const Precision<P>& prec = {}) {
    if (!writer.grid().is_compatible(f))
        throw ValueError("Grid passed to writer is incompatible with the given function");
    if (!Detail::is_cellwise_constant(f))
        throw ValueError("Given function is not constant per grid cell");
    if (name.empty())
        name = f.name;
    const auto block_size = f.function_space()->element()->block_size();
    const auto dim = f.function_space()->mesh()->geometry().dim();
    if (block_size == 1)
        writer.set_cell_field(name, [&] (const auto p) { return writer.grid().template evaluate<0>(f, p); }, prec);
    else if (dim >= block_size)
        writer.set_cell_field(name, [&] (const auto p) { return writer.grid().template evaluate<1>(f, p); }, prec);
    else
        writer.set_cell_field(name, [&] (const auto p) { return writer.grid().template evaluate<2>(f, p); }, prec);
}
 
template<typename Writer, Concepts::Scalar T, Concepts::Scalar P = T>
void set_function(const dolfinx::fem::Function<T>& f,
                  Writer& writer,
                  const std::string& name = "",
                  const Precision<P>& prec = {}) {
    if (Detail::is_cellwise_constant(f))
        set_cell_function(f, writer, name, prec);
    else
        set_point_function(f, writer, name, prec);
}
 
}  // namespace DolfinX
 
namespace Traits {
 
template<>
struct Cells<DolfinX::LagrangePolynomialGrid> {
    static std::ranges::range auto get(const DolfinX::LagrangePolynomialGrid& mesh) {
        return mesh.cells();
    }
};
 
template<>
struct CellType<DolfinX::LagrangePolynomialGrid, DolfinX::Cell> {
    static GridFormat::CellType get(const DolfinX::LagrangePolynomialGrid& mesh, const DolfinX::Cell&) {
        return DolfinX::Detail::cell_type(mesh.cell_type());
    }
};
 
template<>
struct CellPoints<DolfinX::LagrangePolynomialGrid, DolfinX::Cell> {
    static std::ranges::range auto get(const DolfinX::LagrangePolynomialGrid& mesh, const DolfinX::Cell& cell) {
        return mesh.points(cell);
    }
};
 
template<>
struct Points<DolfinX::LagrangePolynomialGrid> {
    static std::ranges::range auto get(const DolfinX::LagrangePolynomialGrid& mesh) {
        return mesh.points();
    }
};
 
template<>
struct PointCoordinates<DolfinX::LagrangePolynomialGrid, DolfinX::Point> {
    static std::ranges::range auto get(const DolfinX::LagrangePolynomialGrid& mesh, const DolfinX::Point& point) {
        return mesh.position(point);
    }
};
 
template<>
struct PointId<DolfinX::LagrangePolynomialGrid, DolfinX::Point> {
    static std::integral auto get(const DolfinX::LagrangePolynomialGrid& mesh, const DolfinX::Point& point) {
        return mesh.id(point);
    }
};
 
template<>
struct NumberOfPoints<DolfinX::LagrangePolynomialGrid> {
    static std::integral auto get(const DolfinX::LagrangePolynomialGrid& mesh) {
        return mesh.number_of_points();
    }
};
 
template<>
struct NumberOfCells<DolfinX::LagrangePolynomialGrid> {
    static std::integral auto get(const DolfinX::LagrangePolynomialGrid& mesh) {
        return mesh.number_of_cells();
    }
};
 
template<>
struct NumberOfCellPoints<DolfinX::LagrangePolynomialGrid, DolfinX::Cell> {
    static std::integral auto get(const DolfinX::LagrangePolynomialGrid& mesh, const DolfinX::Cell&) {
        return mesh.number_of_cell_points();
    }
};
 
}  // namespace Traits
}  // namespace GridFormat
 
#endif  // GRIDFORMAT_TRAITS_DOLFINX_HPP_