DOLFINx 0.12.0.0
DOLFINx C++
Loading...
Searching...
No Matches
sparsitybuild.h
1// Copyright (C) 2007-2026 Garth N. Wells
2//
3// This file is part of DOLFINx (https://www.fenicsproject.org)
4//
5// SPDX-License-Identifier: LGPL-3.0-or-later
6
7#pragma once
8
9#include "DofMap.h"
10#include <array>
11#include <cstdint>
12#include <dolfinx/la/SparsityPattern.h>
13#include <functional>
14#include <ranges>
15#include <span>
16
17namespace dolfinx::fem
18{
19class DofMap;
20
23{
36template <std::ranges::input_range R0, std::ranges::input_range R1>
37void cells(la::SparsityPattern& pattern, const std::pair<R0, R1>& cells,
38 std::array<std::reference_wrapper<const DofMap>, 2> dofmaps)
39{
40 assert(cells.first.size() == cells.second.size());
41 const DofMap& map0 = dofmaps[0].get();
42 const DofMap& map1 = dofmaps[1].get();
43
44 // Reserve entries for all cell-wise outer products.
45 if constexpr (std::ranges::sized_range<R0> and std::ranges::sized_range<R1>)
46 {
47 if (std::size_t num_cells = std::ranges::size(cells.first); num_cells > 0)
48 {
49 std::size_t n0 = map0.cell_dofs(*cells.first.begin()).size();
50 std::size_t n1 = map1.cell_dofs(*cells.second.begin()).size();
51 pattern.reserve_blocks(num_cells, num_cells * n0, num_cells * n1);
52 }
53 }
54
55 for (auto cell0 = cells.first.begin(), cell1 = cells.second.begin();
56 cell0 != cells.first.end() and cell1 != cells.second.end();
57 ++cell0, ++cell1)
58 {
59 pattern.insert(map0.cell_dofs(*cell0), map1.cell_dofs(*cell1));
60 }
61}
62
80 la::SparsityPattern& pattern,
81 std::array<std::span<const std::int32_t>, 2> cells,
82 std::array<std::reference_wrapper<const DofMap>, 2> dofmaps);
83
84} // namespace sparsitybuild
85} // namespace dolfinx::fem
Degree-of-freedom map representations and tools.
Degree-of-freedom map.
Definition DofMap.h:73
std::span< const std::int32_t > cell_dofs(std::int32_t c) const
Local-to-global mapping of dofs on a cell.
Definition DofMap.h:127
Definition SparsityPattern.h:28
void reserve_blocks(std::size_t num_blocks, std::size_t num_rows, std::size_t num_cols)
Reserve storage for additional insert(rows, cols) calls.
Definition SparsityPattern.cpp:368
void insert(std::int32_t row, std::int32_t col)
Insert non-zero locations using local (process-wise) indices.
Definition SparsityPattern.cpp:396
Support for building sparsity patterns from degree-of-freedom maps.
Definition sparsitybuild.h:23
void interior_facets(la::SparsityPattern &pattern, std::array< std::span< const std::int32_t >, 2 > cells, std::array< std::reference_wrapper< const DofMap >, 2 > dofmaps)
Iterate over interior facets and insert entries into sparsity pattern.
Definition sparsitybuild.cpp:16
void cells(la::SparsityPattern &pattern, const std::pair< R0, R1 > &cells, std::array< std::reference_wrapper< const DofMap >, 2 > dofmaps)
Iterate over cells and insert entries into sparsity pattern.
Definition sparsitybuild.h:37
Finite element method functionality.
Definition assemble_expression_impl.h:22