Lines Matching +full:- +full:s
1 // Copyright (c) 2017-2026, Lawrence Livermore National Security, LLC and other CEED contributors.
2 // All Rights Reserved. See the top-level LICENSE and NOTICE files for details.
4 // SPDX-License-Identifier: BSD-2-Clause
11 // ----------------------------------------------------------------------------
13 // ----------------------------------------------------------------------------
14 pub fn cartesian_mesh_size(dim: usize, solution_degree: usize, problem_size: i64) -> [usize; 3] { in cartesian_mesh_size()
18 let mut s = 0; // find s: num_elem / 2 < 2^s <= num_elem localVariable
21 s += 1;
25 let mut r = s % dim;
27 .map(|_| -> usize {
28 let mut sd = s / dim;
31 r -= 1;
41 // ----------------------------------------------------------------------------
43 // ----------------------------------------------------------------------------
51 ) -> libceed::Result<(ElemRestriction, ElemRestriction)> {
62 num_d[d] = num_xyz[d] * (p - 1) + 1;
66 // elem: 0 1 n-1
67 // |---*-...-*---|---*-...-*---|- ... -|--...--|
68 // nodes: 0 1 p-1 p p+1 2*p n*p
83 global_nodes += (e_xyz[d] * (p - 1) + r_nodes % p) * global_nodes_stride;
113 // ----------------------------------------------------------------------------
115 // ----------------------------------------------------------------------------
122 ) -> libceed::Result<Vector> {
127 num_d[d] = num_xyz[d] * (p - 1) + 1;
154 coords[gs_nodes + scalar_size * d] = ((d_1d / (p - 1)) as libceed::Scalar
155 + nodes[d_1d % (p - 1)])
164 // ----------------------------------------------------------------------------