Home
last modified time | relevance | path

Searched refs:num_cols (Results 1 – 25 of 2901) sorted by relevance

12345678910>>...117

/dports/devel/libfirm/libfirm-1.21.0/ir/adt/
H A Dhungarian.c67 for (c = 0; c < num_cols; c++) { in hungarian_dump_f()
92 num_cols = num_rows; in hungarian_new()
95 p->num_cols = num_cols; in hungarian_new()
120 unsigned num_cols = p->num_cols; in hungarian_prepare_cost_matrix() local
125 cost[r*num_cols + c] = max_cost - cost[r*num_cols + c]; in hungarian_prepare_cost_matrix()
176 unsigned num_cols = p->num_cols; in hungarian_solve() local
196 for (c = 0; c < num_cols; ++c) { in hungarian_solve()
215 for (c = 0; c < num_cols; ++c) { in hungarian_solve()
225 for (c = 1; c < num_cols; ++c) { in hungarian_solve()
411 cost[r*num_cols + c] = cost[r*num_cols + c] - row_dec[r] + col_inc[c]; in hungarian_solve()
[all …]
/dports/graphics/filmulator/filmulator-gui-0.11.1/filmulator-gui/core/
H A Dmatrix.hpp50 int num_cols; member in matrix
179 num_cols = ncols; in matrix()
207 num_cols = toCopy.num_cols; in matrix()
245 num_cols = ncols; in set_size()
281 return num_cols; in nc()
321 num_cols = toMove.num_cols; in operator =()
344 num_cols = swapTarget.num_cols; in swap()
363 assert(num_rows == rhs.num_rows && num_cols == rhs.num_cols); in add()
408 assert(num_rows == rhs.num_rows && num_cols == rhs.num_cols); in subtract()
494 assert(target.num_rows == num_cols && target.num_cols == num_rows); in slow_transpose_to()
[all …]
/dports/science/py-scipy/scipy-1.7.1/scipy/spatial/src/
H A Ddistance_impl.h42 for (j = 0; j < num_cols; ++j, ++X) { in _row_norms()
532 dimbuf2 = dimbuf1 + num_cols;
535 const double *u = X + (num_cols * i);
552 const double *u = X + (num_cols * i); in pdist_weighted_chebyshev()
563 const npy_intp num_cols) in pdist_cosine() argument
644 for (i = 0; i < num_cols; ++i) { in pdist_old_weighted_minkowski()
702 const char *u = X + (num_cols * i); in pdist_hamming_char()
827 dimbuf2 = dimbuf1 + num_cols; in cdist_mahalanobis()
843 const npy_intp num_cols) in cdist_seuclidean() argument
899 for (i = 0; i < num_cols; ++i) { in cdist_old_weighted_minkowski()
[all …]
/dports/misc/openmvg/openMVG-2.0/src/third_party/ceres-solver/internal/ceres/
H A Dnormal_prior_test.cc59 for (int num_cols = 1; num_cols < 5; ++num_cols) { in TEST() local
60 Vector b(num_cols); in TEST()
63 Matrix A(num_rows, num_cols); in TEST()
66 double * x = new double[num_cols]; in TEST()
67 for (int i = 0; i < num_cols; ++i) in TEST()
82 MatrixRef J(jacobian, num_rows, num_cols); in TEST()
96 for (int num_cols = 1; num_cols < 5; ++num_cols) { in TEST() local
97 Vector b(num_cols); in TEST()
100 Matrix A(num_rows, num_cols); in TEST()
103 double * x = new double[num_cols]; in TEST()
[all …]
H A Dblock_sparse_matrix_test.cc58 CHECK_EQ(A_->num_cols(), B_->num_cols()); in SetUp()
118 EXPECT_EQ(A_->num_cols(), m->num_cols()); in TEST_F()
141 const int num_cols = in TEST_F() local
143 Vector diagonal(num_cols); in TEST_F()
144 for (int i = 0; i < num_cols; ++i) { in TEST_F()
171 EXPECT_EQ(A_->num_cols(), B_->num_cols()); in TEST_F()
192 const int num_cols = in TEST() local
194 Vector diagonal(num_cols); in TEST()
195 for (int i = 0; i < num_cols; ++i) { in TEST()
208 Vector x = Vector::Ones(num_cols); in TEST()
[all …]
H A Ddense_sparse_matrix_test.cc50 EXPECT_EQ(a->num_cols(), b->num_cols()); in CompareMatrices()
53 int num_cols = a->num_cols(); in CompareMatrices() local
55 for (int i = 0; i < num_cols; ++i) { in CompareMatrices()
56 Vector x = Vector::Zero(num_cols); in CompareMatrices()
81 num_cols = tsm->num_cols(); in SetUp()
85 int num_cols; member in ceres::internal::DenseSparseMatrixTest
96 Vector a(num_cols); in TEST_F()
129 Vector b1 = Vector::Zero(num_cols); in TEST_F()
130 Vector b2 = Vector::Zero(num_cols); in TEST_F()
139 Vector b1 = Vector::Zero(num_cols); in TEST_F()
[all …]
H A Ddynamic_compressed_row_sparse_matrix_test.cc51 num_cols = 4; in SetUp()
58 expected_num_nonzeros = num_rows * num_cols - std::min(num_rows, num_cols); in SetUp()
73 dense.resize(num_rows, num_cols); in InitialiseDenseReference()
77 const int r = i / num_cols, c = i % num_cols; in InitialiseDenseReference()
90 const int r = i / num_cols, c = i % num_cols; in InitialiseSparseMatrixReferences()
100 num_cols, in InitialiseSparseMatrixReferences()
119 for (int c = 0; c < num_cols; ++c) { in InsertNonZeroEntriesFromDenseReference()
130 EXPECT_EQ(dcrsm->num_cols(), num_cols); in ExpectEmpty()
136 EXPECT_EQ(dense_from_dcrsm.cols(), num_cols); in ExpectEmpty()
163 int num_cols; member in ceres::internal::DynamicCompressedRowSparseMatrixTest
[all …]
/dports/math/ceres-solver/ceres-solver-2.0.0/internal/ceres/
H A Dnormal_prior_test.cc62 for (int num_cols = 1; num_cols < 5; ++num_cols) { in TEST() local
63 Vector b(num_cols); in TEST()
66 Matrix A(num_rows, num_cols); in TEST()
69 double* x = new double[num_cols]; in TEST()
70 for (int i = 0; i < num_cols; ++i) x[i] = 2 * RandDouble() - 1; in TEST()
72 double* jacobian = new double[num_rows * num_cols]; in TEST()
84 MatrixRef J(jacobian, num_rows, num_cols); in TEST()
98 for (int num_cols = 1; num_cols < 5; ++num_cols) { in TEST() local
99 Vector b(num_cols); in TEST()
102 Matrix A(num_rows, num_cols); in TEST()
[all …]
H A Dblock_sparse_matrix_test.cc59 CHECK_EQ(A_->num_cols(), B_->num_cols()); in SetUp()
119 EXPECT_EQ(A_->num_cols(), m->num_cols()); in TEST_F()
142 const int num_cols = in TEST_F() local
144 Vector diagonal(num_cols); in TEST_F()
145 for (int i = 0; i < num_cols; ++i) { in TEST_F()
172 EXPECT_EQ(A_->num_cols(), B_->num_cols()); in TEST_F()
193 const int num_cols = in TEST() local
195 Vector diagonal(num_cols); in TEST()
196 for (int i = 0; i < num_cols; ++i) { in TEST()
209 Vector x = Vector::Ones(num_cols); in TEST()
[all …]
H A Ddense_sparse_matrix_test.cc51 EXPECT_EQ(a->num_cols(), b->num_cols()); in CompareMatrices()
54 int num_cols = a->num_cols(); in CompareMatrices() local
56 for (int i = 0; i < num_cols; ++i) { in CompareMatrices()
57 Vector x = Vector::Zero(num_cols); in CompareMatrices()
82 num_cols = tsm->num_cols(); in SetUp()
86 int num_cols; member in ceres::internal::DenseSparseMatrixTest
97 Vector a(num_cols); in TEST_F()
130 Vector b1 = Vector::Zero(num_cols); in TEST_F()
131 Vector b2 = Vector::Zero(num_cols); in TEST_F()
140 Vector b1 = Vector::Zero(num_cols); in TEST_F()
[all …]
H A Ddynamic_compressed_row_sparse_matrix_test.cc52 num_cols = 4; in SetUp()
59 expected_num_nonzeros = num_rows * num_cols - std::min(num_rows, num_cols); in SetUp()
70 dense.resize(num_rows, num_cols); in InitialiseDenseReference()
73 for (int i = 0; i < (num_rows * num_cols); ++i) { in InitialiseDenseReference()
74 const int r = i / num_cols, c = i % num_cols; in InitialiseDenseReference()
87 const int r = i / num_cols, c = i % num_cols; in InitialiseSparseMatrixReferences()
115 for (int c = 0; c < num_cols; ++c) { in InsertNonZeroEntriesFromDenseReference()
126 EXPECT_EQ(dcrsm->num_cols(), num_cols); in ExpectEmpty()
132 EXPECT_EQ(dense_from_dcrsm.cols(), num_cols); in ExpectEmpty()
159 int num_cols; member in ceres::internal::DynamicCompressedRowSparseMatrixTest
[all …]
/dports/graphics/py-glooey/glooey-0.3.3/tests/drawing/
H A Dtest_grid.py17 num_cols=1,
27 num_cols=1,
37 num_cols=2,
48 num_cols=1,
58 num_cols=1,
69 num_cols=2,
81 num_cols=1,
91 num_cols=1,
102 num_cols=2,
114 num_cols=1,
[all …]
/dports/science/InsightToolkit/ITK-5.0.1/Modules/ThirdParty/VNL/src/vxl/core/vnl/
H A Dvnl_matrix.hxx216 : num_rows(from.num_rows), num_cols(from.num_cols) in vnl_matrix()
235 : num_rows(A.num_rows), num_cols(A.num_cols) in vnl_matrix()
238 if (A.num_rows != B.num_rows || A.num_cols != B.num_cols) in vnl_matrix()
256 : num_rows(A.num_rows), num_cols(A.num_cols) in vnl_matrix()
277 : num_rows(M.num_rows), num_cols(M.num_cols) in vnl_matrix()
292 : num_rows(M.num_rows), num_cols(M.num_cols) in vnl_matrix()
307 : num_rows(M.num_rows), num_cols(M.num_cols) in vnl_matrix()
322 : num_rows(M.num_rows), num_cols(M.num_cols) in vnl_matrix()
337 : num_rows(A.num_rows), num_cols(B.num_cols) in vnl_matrix()
603 this->num_cols != rhs.num_cols) // Size? in operator -=()
[all …]
H A Dvnl_matrix_fixed_ref.h190 vnl_vector<T> v(num_cols); in get_row()
228 return *(data_ + num_cols * r + c); in operator()
240 unsigned columns() const { return num_cols; } in columns()
244 unsigned cols() const { return num_cols; } in cols()
385 … vnl_matrix_fixed_ref_const<T,num_rows,num_cols> & operator=(const vnl_matrix_fixed_ref_const<T,nu…
444 return *(this->data_block() + num_cols * r + c); in operator()
571 vnl_matrix_fixed<T,num_rows,num_cols> r;
577 …vnl_matrix_fixed_ref const& operator*= (vnl_matrix_fixed_ref_const<T,num_cols,num_cols> const& s) …
579 vnl_matrix_fixed<T, num_rows, num_cols> out;
581 for (unsigned j = 0; j < num_cols; ++j)
[all …]
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libigl/igl/
H A DreadDMAT.cpp36 if(num_cols < 0) in readDMAT_read_header()
69 int num_rows,num_cols; in readDMAT() local
84 bool empty = num_rows == 0 || num_cols == 0; in readDMAT()
87 W.resize(num_rows,num_cols); in readDMAT()
91 for(int j = 0;j < num_cols;j++) in readDMAT()
116 W.resize(num_rows,num_cols); in readDMAT()
120 for(int j = 0;j < num_cols;j++) in readDMAT()
134 W.resize(num_rows,num_cols); in readDMAT()
154 int num_rows,num_cols; in readDMAT() local
171 for(int j = 0;j < num_cols;j++) in readDMAT()
[all …]
/dports/graphics/wings/libigl-2.1.0/include/igl/
H A DreadDMAT.cpp37 if(num_cols < 0) in readDMAT_read_header()
70 int num_rows,num_cols; in readDMAT() local
85 bool empty = num_rows == 0 || num_cols == 0; in readDMAT()
88 W.resize(num_rows,num_cols); in readDMAT()
92 for(int j = 0;j < num_cols;j++) in readDMAT()
117 W.resize(num_rows,num_cols); in readDMAT()
121 for(int j = 0;j < num_cols;j++) in readDMAT()
135 W.resize(num_rows,num_cols); in readDMAT()
155 int num_rows,num_cols; in readDMAT() local
172 for(int j = 0;j < num_cols;j++) in readDMAT()
[all …]
/dports/science/py-dlib/dlib-19.22/dlib/matrix/
H A Dmatrix_data_layout.h107 long num_cols,
132 long num_cols,
203 long num_cols,
275 long num_cols,
366 long num_cols,
459 long num_cols,
579 long num_cols,
604 long num_cols,
675 long num_cols,
1025 long num_cols
[all …]
/dports/science/dlib-cpp/dlib-19.22/dlib/matrix/
H A Dmatrix_data_layout.h107 long num_cols,
132 long num_cols,
203 long num_cols,
275 long num_cols,
366 long num_cols,
459 long num_cols,
579 long num_cols,
604 long num_cols,
675 long num_cols,
1025 long num_cols
[all …]
/dports/math/py-or-tools/or-tools-9.2/ortools/glop/
H A Dvariables_info.cc24 const ColIndex num_cols = matrix_.num_cols(); in LoadBoundsAndReturnTrueIfUnchanged() local
47 const ColIndex num_cols = matrix_.num_cols(); in LoadBoundsAndReturnTrueIfUnchanged() local
53 lower_bounds_.resize(num_cols, 0.0); in LoadBoundsAndReturnTrueIfUnchanged()
54 upper_bounds_.resize(num_cols, 0.0); in LoadBoundsAndReturnTrueIfUnchanged()
84 const ColIndex num_cols = matrix_.num_cols(); in ResetStatusInfo() local
95 is_basic_.ClearAndResize(num_cols); in ResetStatusInfo()
96 not_basic_.ClearAndResize(num_cols); in ResetStatusInfo()
102 relevance_.ClearAndResize(num_cols); in ResetStatusInfo()
166 is_basic_.ClearAndResize(num_cols); in ChangeUnusedBasicVariablesToFree()
396 const ColIndex num_cols = matrix_.num_cols(); in TransformToDualPhaseIProblem() local
[all …]
/dports/misc/vxl/vxl-3.3.2/core/vnl/
H A Dvnl_matrix.hxx124 , num_cols( 0 ) in vnl_matrix()
197 : num_rows(from.num_rows), num_cols(from.num_cols) in vnl_matrix()
206 num_cols = 0; in vnl_matrix()
239 && ( rhs.num_cols == this->num_cols ) ); in operator =()
250 num_cols = rhs.num_cols; in operator =()
308 num_cols = 0; in clear()
504 this->num_cols != rhs.num_cols) // Size match? in operator +=()
525 this->num_cols != rhs.num_cols) // Size? in operator -=()
1076 if (this->num_rows != rhs.num_rows || this->num_cols != rhs.num_cols) in operator_eq()
1093 if (this->num_rows != rhs.num_rows || this->num_cols != rhs.num_cols) in is_equal()
[all …]
H A Dvnl_matrix_fixed_ref.h190 vnl_vector<T> v(num_cols); in get_row()
228 return *(data_ + num_cols * r + c); in operator()
240 unsigned columns() const { return num_cols; } in columns()
244 unsigned cols() const { return num_cols; } in cols()
385 … vnl_matrix_fixed_ref_const<T,num_rows,num_cols> & operator=(const vnl_matrix_fixed_ref_const<T,nu…
444 return *(this->data_block() + num_cols * r + c); in operator()
571 vnl_matrix_fixed<T,num_rows,num_cols> r;
577 …vnl_matrix_fixed_ref const& operator*= (vnl_matrix_fixed_ref_const<T,num_cols,num_cols> const& s) …
579 vnl_matrix_fixed<T, num_rows, num_cols> out;
581 for (unsigned j = 0; j < num_cols; ++j)
[all …]
/dports/math/blocksolve95/BlockSolve95/src/
H A DBSpar_bcg.c61 for (i=0;i<num_cols*nBS;i++) { in BSpar_bcg()
72 t_z = &(z[j*num_cols]); in BSpar_bcg()
73 t_p = &(p[j*num_cols]); in BSpar_bcg()
76 for (i=0;i<num_cols;i++) { in BSpar_bcg()
81 for (i=0;i<num_cols;i++) { in BSpar_bcg()
92 BSpar_bip(num_cols,p,z,nBS,cg_alpha,procinfo); CHKERRN(0); in BSpar_bcg()
94 t_z = &(z[j*num_cols]); in BSpar_bcg()
95 t_resid = &(resid[j*num_cols]); in BSpar_bcg()
96 t_p = &(p[j*num_cols]); in BSpar_bcg()
97 t_x = &(x[j*num_cols]); in BSpar_bcg()
[all …]
H A DBSpar_symmlq.c64 for (i=0;i<num_cols;i++) { in BSpar_symmlq()
77 for (i=0;i<num_cols;i++) { in BSpar_symmlq()
87 for (i=0;i<num_cols;i++) { in BSpar_symmlq()
93 for (i=0;i<num_cols;i++) { in BSpar_symmlq()
96 for (i=0;i<num_cols;i++) { in BSpar_symmlq()
118 for (i=0;i<num_cols;i++) { in BSpar_symmlq()
143 for (i=0;i<num_cols;i++) { in BSpar_symmlq()
167 for (i=0;i<num_cols;i++) { in BSpar_symmlq()
198 for (i=0;i<num_cols;i++) { in BSpar_symmlq()
217 for (i=0;i<num_cols;i++) { in BSpar_symmlq()
[all …]
H A DBSback_solve.c26 int count, size, ind, num_cols; in BSback_solve() local
107 num_cols = inodes[in_ind].num_cols; in BSback_solve()
110 if (num_cols > DGEMV_UNROLL_LVL) { in BSback_solve()
124 count += num_cols; in BSback_solve()
142 num_cols = inodes[in_ind].num_cols; in BSback_solve()
148 if (num_cols > DGEMV_UNROLL_LVL) { in BSback_solve()
181 if (num_cols > DGEMV_UNROLL_LVL) { in BSback_solve()
196 ind += num_cols; in BSback_solve()
219 num_cols = inodes[in_ind].num_cols; in BSback_solve()
236 if (num_cols > DGEMV_UNROLL_LVL) { in BSback_solve()
[all …]
/dports/cad/atlc/atlc-4.6.1/src/
H A Dfinite_difference_mpi.c94 int start_col, num_cols; in mpi_worker() local
142 num_cols = strip_params[1]; in mpi_worker()
148 Er=dmatrix(0,num_cols+4,0,height); in mpi_worker()
153 (num_cols+4)*height, in mpi_worker()
163 (num_cols+4)*height, in mpi_worker()
195 (num_cols+2)*height, in mpi_worker()
217 num_cols*height, in mpi_worker()
239 do_columns(2, num_cols, 0); in mpi_worker()
243 MPI_Isend(Vij[num_cols+1], in mpi_worker()
263 MPI_Irecv(Vij[num_cols + 3], in mpi_worker()
[all …]

12345678910>>...117