| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/include/deal.II/lac/ |
| H A D | sparsity_pattern.h | 237 std::size_t linear_index; variable
1345 , linear_index(i) in Accessor()
1352 , linear_index(container->rowstart[container->rows]) in Accessor()
1359 , linear_index(numbers::invalid_size_type) in Accessor()
1382 linear_index); in row()
1393 return (container->colnums[linear_index]); in column()
1403 return linear_index - container->rowstart[row()]; in index()
1413 return linear_index; in global_index()
1421 return (container == other.container && linear_index == other.linear_index);
1433 return linear_index < other.linear_index;
[all …]
|
| H A D | chunk_sparsity_pattern.h | 931 return reduced_accessor.linear_index; in reduced_index()
955 if (reduced_accessor.linear_index ==
958 if (other.reduced_accessor.linear_index ==
975 reduced_accessor.linear_index < other.reduced_accessor.linear_index ||
976 (reduced_accessor.linear_index == other.reduced_accessor.linear_index &&
1007 if (reduced_accessor.linear_index + 1 == in advance()
1025 reduced_accessor.linear_index = in advance()
|
| H A D | sparse_matrix.h | 2125 return matrix->val[linear_index]; in value()
2149 AssertIndexRange(accessor->linear_index, in number()
2160 AssertIndexRange(accessor->linear_index,
2162 accessor->matrix->val[accessor->linear_index] = n;
2172 AssertIndexRange(accessor->linear_index,
2174 accessor->matrix->val[accessor->linear_index] += n;
2184 AssertIndexRange(accessor->linear_index,
2186 accessor->matrix->val[accessor->linear_index] -= n;
2196 AssertIndexRange(accessor->linear_index,
2208 AssertIndexRange(accessor->linear_index,
[all …]
|
| /dports/audio/libadplug/adplug-adplug-2.3.3/src/ |
| H A D | database.cpp | 37 : linear_index(0), linear_logic_length(0), linear_length(0) in CAdPlugDatabase()
126 linear_index = bucket->index; in lookup()
135 linear_index = bucket->index; in lookup()
187 DB_Bucket *bucket = db_linear[linear_index]; in wipe()
199 return db_linear[linear_index]->record; in get_record()
204 if(linear_index + 1 < linear_length) { in go_forward()
205 linear_index++; in go_forward()
213 if(!linear_index) return false; in go_backward()
214 linear_index--; in go_backward()
220 if(linear_length) linear_index = 0; in goto_begin()
[all …]
|
| /dports/science/InsightToolkit/ITK-5.0.1/Modules/Core/Common/include/ |
| H A D | itkZeroFluxNeumannBoundaryCondition.hxx | 31 int linear_index = 0; in operator ()() local
36 linear_index += ( point_index[i] + boundary_offset[i] ) * data->GetStride(i); in operator ()()
61 (*( reinterpret_cast< PixelType * >( ( data->operator[](linear_index) ) ) ) ); in operator ()()
71 int linear_index = 0; in operator ()() local
76 linear_index += ( point_index[i] + boundary_offset[i] ) * data->GetStride(i); in operator ()()
80 ( neighborhoodAccessorFunctor.Get( data->operator[](linear_index) ) ); in operator ()()
|
| H A D | itkPeriodicBoundaryCondition.hxx | 36 int linear_index = 0; in operator ()() local
44 linear_index += ( point_index[i] + boundary_offset[i] ) * data->GetStride(i); in operator ()()
49 ptr = reinterpret_cast< PixelType * >( ( data->operator[](linear_index) ) ); in operator ()()
92 int linear_index = 0; in operator ()() local
102 linear_index += ( point_index[i] + boundary_offset[i] ) * data->GetStride(i); in operator ()()
104 ptr = data->operator[](linear_index); in operator ()()
|
| /dports/math/xtensor/xtensor-0.24.0/include/xtensor/ |
| H A D | xmultiindex_iterator.hpp | 37 xmultiindex_iterator(B && begin, E && end, C && current, const std::size_t linear_index) in xmultiindex_iterator() argument
41 m_linear_index(linear_index) in xmultiindex_iterator()
119 std::size_t linear_index = 1; in multiindex_iterator_end() local
122 linear_index *= roi_end[i] - roi_begin[i]; in multiindex_iterator_end()
129 linear_index in multiindex_iterator_end()
|
| /dports/multimedia/librespot/librespot-0.1.3/cargo-crates/nalgebra-0.18.1/src/base/ |
| H A D | storage.rs | 66 fn linear_index(&self, irow: usize, icol: usize) -> usize { in linear_index() method
81 self.get_address_unchecked_linear(self.linear_index(irow, icol)) in get_address_unchecked()
93 self.get_unchecked_linear(self.linear_index(irow, icol)) in get_unchecked()
133 let lid = self.linear_index(irow, icol); in get_address_unchecked_mut()
160 let lid1 = self.linear_index(row_col1.0, row_col1.1); in swap_unchecked()
161 let lid2 = self.linear_index(row_col2.0, row_col2.1); in swap_unchecked()
|
| /dports/audio/spotifyd/spotifyd-0.3.0/cargo-crates/nalgebra-0.18.1/src/base/ |
| H A D | storage.rs | 66 fn linear_index(&self, irow: usize, icol: usize) -> usize {
81 self.get_address_unchecked_linear(self.linear_index(irow, icol))
93 self.get_unchecked_linear(self.linear_index(irow, icol))
133 let lid = self.linear_index(irow, icol);
160 let lid1 = self.linear_index(row_col1.0, row_col1.1);
161 let lid2 = self.linear_index(row_col2.0, row_col2.1);
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/include/deal.II/base/ |
| H A D | linear_index_iterator.h | 335 accessor.linear_index = it.linear_index;
410 accessor.linear_index += n;
435 return this->accessor.linear_index - other.accessor.linear_index;
486 return this->accessor.linear_index < other.accessor.linear_index;
|
| H A D | table.h | 911 left.linear_index == right.linear_index;
947 std::ptrdiff_t linear_index;
2837 , linear_index(std::numeric_limits<decltype(linear_index)>::max())
2846 , linear_index(container->values.size())
2855 , linear_index(a.linear_index)
2865 , linear_index(index)
2867 Assert(0 <= linear_index &&
2881 return this->container->values[linear_index];
2891 return this->container->values[linear_index];
2931 Assert(0 <= linear_index &&
[all …]
|
| /dports/graphics/librsvg2-rust/librsvg-2.52.8/vendor/nalgebra/src/base/ |
| H A D | storage.rs | 71 fn linear_index(&self, irow: usize, icol: usize) -> usize { in linear_index() method
92 self.get_address_unchecked_linear(self.linear_index(irow, icol)) in get_address_unchecked()
110 self.get_unchecked_linear(self.linear_index(irow, icol)) in get_unchecked()
172 let lid = self.linear_index(irow, icol); in get_address_unchecked_mut()
211 let lid1 = self.linear_index(row_col1.0, row_col1.1); in swap_unchecked()
212 let lid2 = self.linear_index(row_col2.0, row_col2.1); in swap_unchecked()
|
| /dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/bsta/ |
| H A D | bsta_spherical_histogram.h | 80 int linear_index(int azimuth_index, int elevation_index) const in linear_index() function
84 {return linear_index(azimuth_index(azimuth), elevation_index(elevation));} in lin_index()
108 void center(int linear_index, T& az_center, T& el_center);
120 int lidx = linear_index(azimuth_index,elevation_index); in counts()
132 T counts(int linear_index) {return counts_[linear_index];} in counts() argument
|
| H A D | bsta_spherical_histogram.hxx | 174 center(int linear_index, T& az_center, T& el_center) in center() argument
177 int el_index = linear_index/n_azimuth_; in center()
178 int az_index = linear_index%n_azimuth_; in center()
348 int lidx = linear_index(az_indx, el_indx); in upcount()
388 int lidx = linear_index(azimuth_index, elevation_index); in p()
495 ret.push_back(linear_index(az, el)); in bins_intersecting_cone()
505 int lidx = linear_index(azimuth_index,elevation_index); in write_counts_with_interval()
519 int lidx = linear_index(azimuth_index,elevation_index); in write_counts_with_center()
|
| /dports/devel/pthreadpool/pthreadpool-0.1-126-gb8374f8/src/ |
| H A D | fastpath.c | 184 const size_t linear_index = pthreadpool_decrement_fetch_relaxed_size_t(&other_thread->range_end); in pthreadpool_thread_parallelize_2d_fastpath() local
185 const struct fxdiv_result_size_t index_i_j = fxdiv_divide_size_t(linear_index, range_j); in pthreadpool_thread_parallelize_2d_fastpath()
233 const size_t linear_index = pthreadpool_decrement_fetch_relaxed_size_t(&other_thread->range_end); in pthreadpool_thread_parallelize_2d_tile_1d_fastpath() local
234 … const struct fxdiv_result_size_t tile_index_i_j = fxdiv_divide_size_t(linear_index, tile_range_j); in pthreadpool_thread_parallelize_2d_tile_1d_fastpath()
285 const size_t linear_index = pthreadpool_decrement_fetch_relaxed_size_t(&other_thread->range_end); in pthreadpool_thread_parallelize_2d_tile_2d_fastpath() local
347 const size_t linear_index = pthreadpool_decrement_fetch_relaxed_size_t(&other_thread->range_end); in pthreadpool_thread_parallelize_2d_tile_2d_with_uarch_fastpath() local
401 const size_t linear_index = pthreadpool_decrement_fetch_relaxed_size_t(&other_thread->range_end); in pthreadpool_thread_parallelize_3d_fastpath() local
402 const struct fxdiv_result_size_t index_ij_k = fxdiv_divide_size_t(linear_index, range_k); in pthreadpool_thread_parallelize_3d_fastpath()
650 const struct fxdiv_result_size_t index_ij_kl = fxdiv_divide_size_t(linear_index, range_kl); in pthreadpool_thread_parallelize_4d_fastpath()
927 const struct fxdiv_result_size_t index_ijk_lm = fxdiv_divide_size_t(linear_index, range_lm); in pthreadpool_thread_parallelize_5d_fastpath()
[all …]
|
| H A D | portable-api.c | 171 const size_t linear_index = pthreadpool_decrement_fetch_relaxed_size_t(&other_thread->range_end); in thread_parallelize_2d() local
172 const struct fxdiv_result_size_t index_i_j = fxdiv_divide_size_t(linear_index, range_j); in thread_parallelize_2d()
215 const size_t linear_index = pthreadpool_decrement_fetch_relaxed_size_t(&other_thread->range_end); in thread_parallelize_2d_tile_1d() local
216 … const struct fxdiv_result_size_t tile_index_i_j = fxdiv_divide_size_t(linear_index, tile_range_j); in thread_parallelize_2d_tile_1d()
262 const size_t linear_index = pthreadpool_decrement_fetch_relaxed_size_t(&other_thread->range_end); in thread_parallelize_2d_tile_2d() local
319 const size_t linear_index = pthreadpool_decrement_fetch_relaxed_size_t(&other_thread->range_end); in thread_parallelize_2d_tile_2d_with_uarch() local
368 const size_t linear_index = pthreadpool_decrement_fetch_relaxed_size_t(&other_thread->range_end); in thread_parallelize_3d() local
369 const struct fxdiv_result_size_t index_ij_k = fxdiv_divide_size_t(linear_index, range_k); in thread_parallelize_3d()
597 const struct fxdiv_result_size_t index_ij_kl = fxdiv_divide_size_t(linear_index, range_kl); in thread_parallelize_4d()
854 const struct fxdiv_result_size_t index_ijk_lm = fxdiv_divide_size_t(linear_index, range_lm); in thread_parallelize_5d()
[all …]
|
| H A D | legacy-api.c | 76 static void compute_3d_tiled(const struct compute_3d_tiled_context* context, size_t linear_index) { in compute_3d_tiled() argument
78 const struct fxdiv_result_size_t tile_index_ij_k = fxdiv_divide_size_t(linear_index, tile_range_k); in compute_3d_tiled()
153 static void compute_4d_tiled(const struct compute_4d_tiled_context* context, size_t linear_index) { in compute_4d_tiled() argument
155 …const struct fxdiv_result_size_t tile_index_ij_kl = fxdiv_divide_size_t(linear_index, tile_range_k… in compute_4d_tiled()
|
| /dports/devel/thrust/thrust-1.9.5/examples/ |
| H A D | summed_area_table.cu | 25 size_t operator()(size_t linear_index) in operator ()()
27 size_t i = linear_index / n; in operator ()()
28 size_t j = linear_index % n; in operator ()()
|
| /dports/graphics/rx/rx-0.4.0/cargo-crates/rendy-memory-0.5.0/src/allocator/ |
| H A D | linear.rs | 18 linear_index: u64, field
31 .field("linear_index", &self.linear_index) in fmt()
256 linear_index: self.offset + count - 1, in alloc()
295 linear_index: self.offset + count, in alloc()
307 let index = block.linear_index - self.offset; in free()
|
| /dports/lang/spidermonkey78/firefox-78.9.0/third_party/rust/gfx-memory/src/allocator/ |
| H A D | linear.rs | 15 linear_index: Size, field
222 linear_index: self.offset + count - 1, in alloc()
253 linear_index: self.offset + count, in alloc()
264 let index = (block.linear_index - self.offset) as usize; in free()
|
| /dports/math/stanmath/math-4.2.0/stan/math/opencl/kernels/ |
| H A D | matrix_multiply.hpp | 112 const int linear_index
147 for (int idx = linear_index, w = 0; idx < total_work_nm;
194 for (int idx = linear_index, w = 0; idx < total_work_nm;
230 for (int idx = linear_index, w = 0; idx < total_work_nm;
242 for (int idx = linear_index, w = 0; idx < total_work_nm;
|
| /dports/science/votca/votca-2021.2-18560-gfbe18d971/tools/include/votca/tools/ |
| H A D | NDimVector.h | 95 Index linear_index =
97 return storage_[linear_index];
|
| /dports/science/votca/votca-2021.2-18560-gfbe18d971/tools/tools-9c102e0/include/votca/tools/ |
| H A D | NDimVector.h | 95 Index linear_index = in operator() local
97 return storage_[linear_index]; in operator()
|
| /dports/math/octave-forge-mechanics/mechanics/inst/core/private/ |
| H A D | sub2ind_tril.m | 38 %% linear_index = sub2ind_tril (4, 3, 2)
39 %% => linear_index = 6
|
| /dports/graphics/nanort/nanort-b1feea8/examples/common/glm/test/external/gli/core/ |
| H A D | storage.inl | 127 …gli::size_t const OffsetSrc = linear_index(BlockIndexSrc + BlockIndex, this->extent(LevelSrc)) * t…
128 …gli::size_t const OffsetDst = linear_index(BlockIndexDst + BlockIndex, this->extent(LevelDst)) * t…
|