/external/ceres-solver/include/ceres/ |
crs_matrix.h | 42 CRSMatrix() : num_rows(0), num_cols(0) {} 44 int num_rows; member in struct:ceres::CRSMatrix 50 // rows is a num_rows + 1 sized array that points into the cols and
|
/external/ceres-solver/internal/ceres/ |
block_jacobi_preconditioner.h | 63 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::BlockJacobiPreconditioner
|
evaluator_test_utils.h | 39 int num_rows; member in struct:ceres::internal::ExpectedEvaluation
|
preconditioner.cc | 58 int SparseMatrixPreconditionerWrapper::num_rows() const { function in class:ceres::internal::SparseMatrixPreconditionerWrapper 59 return matrix_->num_rows();
|
block_random_access_crs_matrix.h | 76 // Since the matrix is square, num_rows() == num_cols(). 77 virtual int num_rows() const { return crsm_->num_rows(); } function in class:ceres::internal::BlockRandomAccessCRSMatrix
|
block_random_access_dense_matrix.h | 48 // num_rows x num_cols. 78 // structure, num_rows() = num_cols(). 79 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::BlockRandomAccessDenseMatrix
|
block_random_access_dense_matrix_test.cc | 44 const int num_rows = 3 + 4 + 5; local 46 EXPECT_EQ(m.num_rows(), num_rows); 47 EXPECT_EQ(m.num_cols(), num_rows); 76 const int num_rows = 3 + 4 + 5; local 104 int pos = row_idx * num_rows + col_idx;
|
block_random_access_sparse_matrix.h | 78 // Since the matrix is square, num_rows() == num_cols(). 79 virtual int num_rows() const { return tsm_->num_rows(); } function in class:ceres::internal::BlockRandomAccessSparseMatrix
|
block_sparse_matrix.h | 78 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::BlockSparseMatrix
|
cgnr_linear_operator.h | 83 : A_(A), D_(D), z_(new double[A.num_rows()]) { 88 std::fill(z_.get(), z_.get() + A_.num_rows(), 0.0); 108 virtual int num_rows() const { return A_.num_cols(); } function in class:ceres::internal::CgnrLinearOperator
|
dense_normal_cholesky_solver.cc | 71 const int num_rows = A->num_rows(); local 88 Vector rhs = Aref.transpose() * ConstVectorRef(b, num_rows); 126 BLAS::SymmetricRankKUpdate(A->num_rows(), 142 A->matrix().transpose() * ConstVectorRef(b, A->num_rows());
|
dense_qr_solver.cc | 70 const int num_rows = A->num_rows(); local 93 rhs_.head(num_rows) = ConstVectorRef(b, num_rows); 131 const int num_rows = A->num_rows(); local 142 num_rows + ((per_solve_options.D != NULL) ? num_cols : 0); 147 rhs_.head(num_rows) = ConstVectorRef(b, num_rows);
|
partitioned_matrix_view.h | 103 int num_rows() const { return matrix_.num_rows(); } function in class:ceres::internal::PartitionedMatrixView
|
dense_sparse_matrix_test.cc | 49 EXPECT_EQ(a->num_rows(), b->num_rows()); 52 int num_rows = a->num_rows(); local 59 Vector y_a = Vector::Zero(num_rows); 60 Vector y_b = Vector::Zero(num_rows); 80 num_rows = tsm->num_rows(); 84 int num_rows; member in class:ceres::internal::DenseSparseMatrixTest 100 Vector b1 = Vector::Zero(num_rows); [all...] |
implicit_schur_complement.cc | 79 tmp_rows_.resize(A_->num_rows()); 175 const int num_rows = A_->num_rows(); local 182 tmp_rows_ = ConstVectorRef(b_, num_rows) - tmp_rows_; 220 tmp_rows_ = ConstVectorRef(b_, A_->num_rows()) - tmp_rows_;
|
low_rank_inverse_hessian.h | 89 virtual int num_rows() const { return num_parameters_; } function in class:ceres::internal::LowRankInverseHessian
|
schur_complement_solver_test.cc | 59 num_rows = A->num_rows(); 71 TripletSparseMatrix triplet_A(A->num_rows(), 126 int num_rows; member in class:ceres::internal::SchurComplementSolverTest
|
schur_jacobi_preconditioner.cc | 96 const int num_rows = m_->num_rows(); local 97 CHECK_GT(num_rows, 0); 107 Vector rhs = Vector::Zero(m_->num_rows()); 108 Vector b = Vector::Zero(A.num_rows()); 140 int SchurJacobiPreconditioner::num_rows() const { function in class:ceres::internal::SchurJacobiPreconditioner 141 return m_->num_rows();
|
block_random_access_crs_matrix_test.cc | 46 const int num_rows = 3 + 4 + 5; local 63 EXPECT_EQ(m.num_rows(), num_rows); 64 EXPECT_EQ(m.num_cols(), num_rows);
|
block_random_access_sparse_matrix_test.cc | 46 const int num_rows = 3 + 4 + 5; local 63 EXPECT_EQ(m.num_rows(), num_rows); 64 EXPECT_EQ(m.num_cols(), num_rows);
|
compressed_row_sparse_matrix.h | 63 // num_rows, num_cols and max_num_nonzeros. 70 CompressedRowSparseMatrix(int num_rows, 74 // Build a square sparse diagonal matrix with num_rows rows and 76 CompressedRowSparseMatrix(const double* diagonal, int num_rows); 89 virtual int num_rows() const { return num_rows_; } function in class:ceres::internal::CompressedRowSparseMatrix 96 // num_rows -= delta_rows 119 void set_num_rows(const int num_rows) { num_rows_ = num_rows; }
|
/external/chromium_org/third_party/angle_dx11/tests/compiler_tests/ |
VariablePacker_test.cpp | 40 int num_rows = VariablePacker::GetNumRows(type); local 48 int num_vars = kMaxRows / num_rows; 59 num_vars = kMaxRows / num_rows *
|
/external/chromium_org/chrome/browser/ui/cocoa/autofill/ |
simple_grid_layout.h | 81 int num_rows() const { return static_cast<int>(rows_.size()); } function in class:SimpleGridLayout
|
/external/jpeg/ |
jdpostct.c | 133 JDIMENSION num_rows, max_rows; local 140 num_rows = 0; 143 post->buffer, &num_rows, max_rows); 146 post->buffer, output_buf + *out_row_ctr, (int) num_rows); 147 *out_row_ctr += num_rows; 165 JDIMENSION old_next_row, num_rows; local 183 num_rows = post->next_row - old_next_row; 185 (JSAMPARRAY) NULL, (int) num_rows); 186 *out_row_ctr += num_rows; 209 JDIMENSION num_rows, max_rows local [all...] |
/external/qemu/distrib/jpeg-6b/ |
jdpostct.c | 133 JDIMENSION num_rows, max_rows; local 140 num_rows = 0; 143 post->buffer, &num_rows, max_rows); 146 post->buffer, output_buf + *out_row_ctr, (int) num_rows); 147 *out_row_ctr += num_rows; 165 JDIMENSION old_next_row, num_rows; local 183 num_rows = post->next_row - old_next_row; 185 (JSAMPARRAY) NULL, (int) num_rows); 186 *out_row_ctr += num_rows; 209 JDIMENSION num_rows, max_rows local [all...] |