/dports/math/gap/gap-4.11.0/pkg/semigroups-3.2.3/libsemigroups/src/ |
H A D | bmat8.cpp | 278 std::vector<uint8_t> row_vec = row_space_basis().rows(); in row_space_size() local 279 auto last = std::remove(row_vec.begin(), row_vec.end(), 0); in row_space_size() 280 row_vec.erase(last, row_vec.end()); in row_space_size() 281 for (uint8_t x : row_vec) { in row_space_size() 284 std::vector<uint8_t> row_space(row_vec.begin(), row_vec.end()); in row_space_size() 286 for (uint8_t row : row_vec) { in row_space_size()
|
/dports/math/libsemigroups/libsemigroups-1.3.7/src/ |
H A D | bmat8.cpp | 278 std::vector<uint8_t> row_vec = row_space_basis().rows(); in row_space_size() local 279 auto last = std::remove(row_vec.begin(), row_vec.end(), 0); in row_space_size() 280 row_vec.erase(last, row_vec.end()); in row_space_size() 281 for (uint8_t x : row_vec) { in row_space_size() 284 std::vector<uint8_t> row_space(row_vec.begin(), row_vec.end()); in row_space_size() 286 for (uint8_t row : row_vec) { in row_space_size()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/ |
H A D | Cartesian_matrix.h | 41 : row_vec(r_f), in Cartesian_matrix() 52 : row_vec(r_f), in Cartesian_matrix() 72 return op(row_vec[r], column_vec[c]); in operator() 76 RandomAccessIC_row row_vec;
|
/dports/devel/caf/actor-framework-0.18.5/examples/message_passing/ |
H A D | fan_out_request.cpp | 73 auto& row_vec = self->state.rows[row]; in matrix_actor() local 74 row_vec.resize(columns); in matrix_actor() 76 row_vec[column] = self->spawn(cell_actor); in matrix_actor() 90 auto& row_vec = self->state.rows[row]; in matrix_actor() local 91 self->fan_out_request<policy::select_all>(row_vec, infinite, get) in matrix_actor()
|
/dports/math/stan/stan-2.28.2/src/test/test-models/good/function-signatures/math/matrix/ |
H A D | add_diag.stan | 7 row_vector[N] row_vec; 15 K1 = add_diag(K, row_vec); 32 matrix[N, N] K10 = add_diag(Kp, row_vec);
|
/dports/math/gap/gap-4.11.0/pkg/semigroups-3.2.3/libsemigroups/extern/HPCombi/include/ |
H A D | bmat8_impl.hpp | 333 std::vector<uint8_t> row_vec = row_space_basis().rows(); in row_space_bitset_ref() local 334 auto last = std::remove(row_vec.begin(), row_vec.end(), 0); in row_space_bitset_ref() 335 row_vec.erase(last, row_vec.end()); in row_space_bitset_ref() 336 for (uint8_t x : row_vec) { in row_space_bitset_ref() 340 std::vector<uint8_t> row_space(row_vec.begin(), row_vec.end()); in row_space_bitset_ref() 342 for (uint8_t row : row_vec) { in row_space_bitset_ref()
|
/dports/math/topcom/topcom-0.17.8/lib-src-reg/ |
H A D | SPXinterface.cc | 47 soplex::DSVector row_vec; in SPXinterface() local 55 row_vec.add(j, m(j, i)); in SPXinterface() 70 soplex::LPRow new_row(soplex::Real(1), row_vec, soplex::infinity); in SPXinterface()
|
/dports/math/hpcombi/HPCombi-0.0.6/include/ |
H A D | bmat8_impl.hpp | 361 std::vector<uint8_t> row_vec = row_space_basis().rows(); in row_space_bitset_ref() local 362 auto last = std::remove(row_vec.begin(), row_vec.end(), 0); in row_space_bitset_ref() 363 row_vec.erase(last, row_vec.end()); in row_space_bitset_ref() 364 for (uint8_t x : row_vec) { in row_space_bitset_ref() 368 std::vector<uint8_t> row_space(row_vec.begin(), row_vec.end()); in row_space_bitset_ref() 370 for (uint8_t row : row_vec) { in row_space_bitset_ref()
|
/dports/math/libsemigroups/libsemigroups-1.3.7/extern/HPCombi/include/ |
H A D | bmat8_impl.hpp | 361 std::vector<uint8_t> row_vec = row_space_basis().rows(); in row_space_bitset_ref() local 362 auto last = std::remove(row_vec.begin(), row_vec.end(), 0); in row_space_bitset_ref() 363 row_vec.erase(last, row_vec.end()); in row_space_bitset_ref() 364 for (uint8_t x : row_vec) { in row_space_bitset_ref() 368 std::vector<uint8_t> row_space(row_vec.begin(), row_vec.end()); in row_space_bitset_ref() 370 for (uint8_t row : row_vec) { in row_space_bitset_ref()
|
/dports/math/stan/stan-2.28.2/src/test/unit/io/ |
H A D | writer_test.cpp | 117 stan::math::row_vector_d row_vec(size); in TEST() local 119 row_vec(n) = n; in TEST() 121 writer.row_vector_lb_unconstrain(lb, row_vec); in TEST() 164 stan::math::row_vector_d row_vec(size); in TEST() local 166 row_vec(n) = n; in TEST() 168 writer.row_vector_ub_unconstrain(ub, row_vec); in TEST() 214 stan::math::row_vector_d row_vec(size); in TEST() local 216 row_vec(n) = n; in TEST() 218 writer.row_vector_lub_unconstrain(lb, ub, row_vec); in TEST() 267 stan::math::row_vector_d row_vec(size); in TEST() local [all …]
|
/dports/math/reduce/Reduce-svn5758-src/packages/linalg/ |
H A D | ludecom.red | 175 y := innerprod(1,1,n,0,row_vec(in_mat,i,n),row_vec(in_mat,i,n)); 187 row_vec(in_mat,i,n),col_vec(in_mat,k,n)); 226 row_vec(in_mat,k,n),col_vec(in_mat,j,n)); 259 symbolic procedure row_vec(in_mat,row_no,length_of); 264 scalar row_vec; 266 row_vec := mkvect(length_of); 267 for i:=1:length_of do putv(row_vec,i,getmat(in_mat,row_no,i)); 268 return row_vec; 341 putv(int_vec,i-1,innerprod(1,1,n+n,0,row_vec(in_mat,i,n+n), 342 row_vec(in_mat,i,n+n)));
|
H A D | cholesky.red | 77 row_vec(in_mat,i,n),row_vec(in_mat,j,n));
|
/dports/graphics/png++/png++-0.2.10/ |
H A D | pixel_buffer.hpp | 112 for (typename row_vec::iterator r = m_rows.begin(); in resize() 188 typedef std::vector< row_type > row_vec; typedef in png::basic_pixel_buffer 189 row_vec m_rows;
|
/dports/graphics/gnash/gnash-2b3bdede0305c4fc3ad21a0a4197330606c9b880/extensions/mysql/ |
H A D | mysql_db.cpp | 271 std::vector<const char *> row_vec; in getData() local 274 row_vec.push_back(_row[i]); in getData() 276 qresult.push_back(row_vec); in getData()
|
/dports/math/lidia/lidia-2.3.0+latte-patches-2014-10-04/src/number_fields/quadratic_order/matrix/ |
H A D | bigint_matrix_qo.cc | 531 row_vec.set_size(actual_row); in pre_reduction() 533 row_vec[i] = i; in pre_reduction() 555 LiDIA::swap(row_vec[actual_row-1], row_vec[i]); in pre_reduction() 571 LiDIA::swap(row_vec[row-1], row_vec[i]); in pre_reduction() 596 row_vec.set_size(actual_row); in pre_reduction() 598 row_vec[i] = i; in pre_reduction() 621 LiDIA::swap(row_vec[actual_row-1], row_vec[i]); in pre_reduction() 639 LiDIA::swap(row_vec[row], row_vec[i]); in pre_reduction() 661 RET[i] = row_vec[RET[i]]; in post_reduction() 666 if (row_vec[i] != i) { in post_reduction() [all …]
|
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libigl/igl/ |
H A D | cat.cpp | 240 for(const auto & row_vec : A) in cat() local 245 for(const auto & element : row_vec) in cat()
|
/dports/science/getdp/getdp-3.4.0-source/Kernel/ |
H A D | Operation_Optimizer.cpp | 91 PetscInt row_vec[1] = {row}; in UpdateMatrixRowFromVector() local 92 MatSetValues(Matrix,1,row_vec,vecsize,nonzeroadresses,nonzerovalues, in UpdateMatrixRowFromVector()
|
/dports/science/qmcpack/qmcpack-3.11.0/src/QMCDrivers/Optimizers/ |
H A D | DescentEngine.cpp | 925 std::vector<ValueType> row_vec(current_params.size(), 0.0); in storeVectors() local 934 row_vec[i] = current_params[i] - params_for_diff_[i]; in storeVectors() 942 hybrid_blm_input_.push_back(row_vec); in storeVectors() 946 hybrid_blm_input_.push_back(row_vec); in storeVectors()
|
/dports/graphics/wings/libigl-2.1.0/include/igl/ |
H A D | cat.cpp | 240 for(const auto & row_vec : A) in cat() local 245 for(const auto & element : row_vec) in cat()
|
/dports/www/grafana8/grafana-8.3.6/vendor/github.com/apache/arrow/rust/benchmarks/src/bin/ |
H A D | tpch.rs | 1418 let row_vec = batch in result_vec() localVariable 1423 result.push(row_vec); in result_vec()
|
/dports/math/py-numpy/numpy-1.20.3/numpy/core/tests/ |
H A D | test_ufunc.py | 1015 row_vec = single_vec[np.newaxis, :] 1018 mm_row_vec = umt.matrix_multiply(row_vec, mat) 1019 matmul_row_vec = umt.matmul(row_vec, mat) 1031 col_vec = row_vec.T 1033 mm_row_col_vec = umt.matrix_multiply(row_vec, col_vec) 1034 matmul_row_col_vec = umt.matmul(row_vec, col_vec)
|
/dports/math/py-z3-solver/z3-z3-4.8.10/src/math/lp/ |
H A D | square_sparse_matrix_def.h | 105 vector<indexed_value<T>> & row_vec = m_rows[row]; in set_with_no_adjusting_for_row() local 106 for (auto & iv : row_vec) { in set_with_no_adjusting_for_row() 113 row_vec.push_back(indexed_value<T>(val, col, -1)); in set_with_no_adjusting_for_row()
|
/dports/math/z3/z3-z3-4.8.13/src/math/lp/ |
H A D | square_sparse_matrix_def.h | 105 vector<indexed_value<T>> & row_vec = m_rows[row]; in set_with_no_adjusting_for_row() local 106 for (auto & iv : row_vec) { in set_with_no_adjusting_for_row() 113 row_vec.push_back(indexed_value<T>(val, col, -1)); in set_with_no_adjusting_for_row()
|
/dports/biology/py-biom-format/biom-format-2.1.10/biom/tests/ |
H A D | test_table.py | 535 self.row_vec = Table(h, ids(1), ids(3)) 1856 obs = self.row_vec._to_dense(input_row) 1863 obs = self.row_vec._to_dense(input_row) 1878 npt.assert_array_equal(self.row_vec.length(axis='observation'), 1) 1879 npt.assert_array_equal(self.row_vec.length(axis='sample'), 3) 1891 npt.assert_array_equal(self.row_vec.shape, (1, 3)) 1901 self.assertEqual(self.row_vec.dtype, float)
|
/dports/math/linbox/linbox-1.6.3/linbox/algorithms/ |
H A D | block-lanczos.inl | 994 typename Matrix::Row row_vec; local 997 row_vec = *(_matM.rowBegin () + indices[row]); 1003 std::swap_ranges (row_vec.begin (), row_vec.end (), row1.begin ());
|