30#include <experimental/mdspan>
61 requires requires(
decltype(rho_dust) rd,
int j) {
62 { rd(j) } -> std::same_as<T>;
66 SHAM_ASSERT(massgrid.extent(0) == gij.extent(0) + 1);
68 for (std::size_t j = 0; j < gij.extent(0); ++j) {
69 T rho_d = rho_dust(j);
70 gij(j) = (rho_d > rho_eps) ? rho_d / (massgrid[j + 1] - massgrid[j]) : 0;
106 requires requires(Func f,
int a,
int b) {
118 SHAM_ASSERT(tensor_tabflux_coag.extent(0) == nbins);
119 SHAM_ASSERT(tensor_tabflux_coag.extent(1) == nbins);
120 SHAM_ASSERT(tensor_tabflux_coag.extent(2) == nbins);
123 for (
int j = 0; j < nbins; ++j) {
132 for (
int l = 0; l < nbins; ++l) {
133 for (
int m = 0; m < nbins; ++m) {
134 auto term = dv(l, m) * gij[l] * gij[m];
135 for (
int j = 0; j < nbins; ++j) {
136 flux[j] += tensor_tabflux_coag(j, l, m) * term;
155 template<
class T,
class T
idx = u32>
168 template<
class T,
class T
idx = u32>
171 const Tidx *pair_offset;
172 const Tidx *pair_jmin;
183 inline bool is_empty()
const {
return count == 0; }
188 for (Tidx k = 0; k < count; ++k) {
189 func(jmin + k, values[k]);
196 Tidx p = l * nbins + m;
197 Tidx beg = pair_offset[p];
198 return PairEntries{values + beg, pair_jmin[p], pair_offset[p + 1] - beg};
209 template<
class T,
class T
idx = u32>
213 SHAM_ASSERT(tensor_tabflux_coag.extent(0) == nbins);
214 SHAM_ASSERT(tensor_tabflux_coag.extent(1) == nbins);
215 SHAM_ASSERT(tensor_tabflux_coag.extent(2) == nbins);
220 for (
int l = 0; l < nbins; ++l) {
221 for (
int m = 0; m < nbins; ++m) {
222 auto tab = [&](
int j) -> T {
223 return tensor_tabflux_coag(j, l, m);
228 while (jmin < jend && tab(jmin) == 0) {
231 while (jend > jmin && tab(jend - 1) == 0) {
235 for (
int j = jmin; j < jend; ++j) {
236 ret.
values.push_back(tab(j));
258 template<
class T,
class T
idx,
class Func>
259 requires requires(Func f,
int a,
int b) {
272 for (
int j = 0; j < nbins; ++j) {
276 for (
int l = 0; l < nbins; ++l) {
277 for (
int m = 0; m < nbins; ++m) {
281 if (entries.is_empty()) {
285 auto term = dv(l, m) * gij[l] * gij[m];
287 flux[j] += val * term;
314 S_coag(0) = -flux(0);
315 for (
int j = 1; j < flux.extent(0); ++j) {
316 S_coag(j) = flux(j - 1) - flux(j);
320 template<
class T,
class FuncDv,
class FuncRhoDust>
321 void coala_k0_source_term(
325 FuncRhoDust &&rho_dust,
Shamrock assertion utility.
#define SHAM_ASSERT(x)
Shorthand for SHAM_ASSERT_NAMED without a message.
TabfluxCoagK0Sparse< T, Tidx > make_tabflux_coag_k0_sparse(int nbins, shambase::is_mdspan_rank< 3 > auto tensor_tabflux_coag)
Build the TabfluxCoagK0Sparse form of tensor_tabflux_coag.
void compute_flux_coag_k0_kdv(int nbins, shambase::is_mdspan_rank< 1 > auto gij, shambase::is_mdspan_rank< 3 > auto tensor_tabflux_coag, Func &&dv, shambase::is_mdspan_rank< 1 > auto flux)
Coagulation flux at bin right edges for a ballistic kernel ( ).
void coala_flux_diff(shambase::is_mdspan_rank< 1 > auto flux, shambase::is_mdspan_rank< 1 > auto S_coag)
Convert interface fluxes to a mass-bin coagulation source term.
void compute_gij_k0(auto &&rho_dust, T rho_eps, shambase::is_mdspan_rank< 1 > auto massgrid, shambase::is_mdspan_rank< 1 > auto gij)
Build coefficients on the piecewise-constant DG basis ( ).
void for_each_sparse(Func &&func) const
Call func(j, tensor_tabflux_coag[j,l,m]) for each stored entry of the pair.
bool is_empty() const
Whether the pair has no stored entry (it does not contribute to the flux).
Device view of a TabfluxCoagK0Sparse (see its documentation for the layout).
PairEntries get_entries(Tidx l, Tidx m) const
Stored entries of the pair .
Sparse storage of tensor_tabflux_coag ( ).
std::vector< T > values
Stored entries.
std::vector< Tidx > pair_offset
Offset in values of each pair, size nbins^2 + 1.
std::vector< Tidx > pair_jmin
First bin stored for each pair, size nbins^2.