| /external/ceres-solver/internal/ceres/ |
| H A D | block_random_access_dense_matrix.cc | 45 num_rows_ = 0;
47 block_layout_[i] = num_rows_;
48 num_rows_ += blocks[i];
51 values_.reset(new double[num_rows_ * num_rows_]);
74 *row_stride = num_rows_;
75 *col_stride = num_rows_;
82 if (num_rows_) {
83 VectorRef(values_.get(), num_rows_ * num_rows_)
[all...] |
| H A D | block_jacobi_preconditioner.h | 63 virtual int num_rows() const { return num_rows_; }
64 virtual int num_cols() const { return num_rows_; }
71 int num_rows_; member in class:ceres::internal::BlockJacobiPreconditioner
|
| H A D | block_random_access_dense_matrix.h | 79 virtual int num_rows() const { return num_rows_; }
80 virtual int num_cols() const { return num_rows_; }
87 int num_rows_; member in class:ceres::internal::BlockRandomAccessDenseMatrix
|
| H A D | triplet_sparse_matrix.cc | 45 : num_rows_(0),
58 : num_rows_(num_rows),
74 num_rows_(orig.num_rows_),
87 num_rows_ = rhs.num_rows_;
98 if ((rows_[i] < 0) || (rows_[i] >= num_rows_) ||
183 dense_matrix->resize(num_rows_, num_cols_);
195 rows_.get()[num_nonzeros_] = B.rows()[i] + num_rows_;
199 num_rows_
[all...] |
| H A D | block_sparse_matrix.h | 78 virtual int num_rows() const { return num_rows_; }
88 int num_rows_; member in class:ceres::internal::BlockSparseMatrix
|
| H A D | compressed_row_sparse_matrix.h | 89 virtual int num_rows() const { return num_rows_; }
91 virtual int num_nonzeros() const { return rows_[num_rows_]; }
122 void set_num_rows(const int num_rows) { num_rows_ = num_rows; }
161 int num_rows_; member in class:ceres::internal::CompressedRowSparseMatrix
|
| H A D | compressed_row_sparse_matrix.cc | 75 num_rows_ = num_rows;
82 VLOG(1) << "# of rows: " << num_rows_
85 << ". Allocating " << (num_rows_ + 1) * sizeof(int) + // NOLINT
92 num_rows_ = m.num_rows();
95 rows_.resize(num_rows_ + 1, 0);
109 VLOG(1) << "# of rows: " << num_rows_
113 << ((num_rows_ + 1) * sizeof(int) + // NOLINT
127 for (int i = 1; i < num_rows_ + 1; ++i) {
138 num_rows_ = num_rows;
145 for (int i = 0; i < num_rows_;
[all...] |
| H A D | triplet_sparse_matrix.h | 64 virtual int num_rows() const { return num_rows_; }
83 // the same number of rows as num_rows_;
112 int num_rows_; member in class:ceres::internal::TripletSparseMatrix
|
| H A D | iterative_schur_complement_solver_test.cc | 71 num_rows_ = A_->num_rows();
111 int num_rows_; member in class:ceres::internal::IterativeSchurComplementSolverTest
|
| H A D | block_sparse_matrix.cc | 49 : num_rows_(0),
65 num_rows_ += row_block_size;
75 CHECK_GE(num_rows_, 0);
165 dense_matrix->resize(num_rows_, num_cols_);
189 matrix->Resize(num_rows_, num_cols_);
|
| H A D | implicit_schur_complement_test.cc | 67 num_rows_ = A_->num_rows();
178 int num_rows_; member in class:ceres::internal::ImplicitSchurComplementTest
|
| H A D | block_jacobi_preconditioner.cc | 45 : num_rows_(A.num_rows()),
|
| H A D | partitioned_matrix_view_test.cc | 59 num_rows_ = A_->num_rows();
68 int num_rows_; member in class:ceres::internal::PartitionedMatrixViewTest
|
| /external/chromium_org/skia/ext/ |
| H A D | convolver.cc | 53 num_rows_(max_y_filter_size),
57 row_addresses_.resize(num_rows_);
68 if (next_row_ == num_rows_)
90 *first_row_index = next_row_coordinate_ - num_rows_;
93 for (int i = 0; i < num_rows_; i++) {
98 if (cur_row == num_rows_)
112 int num_rows_; member in class:skia::__anon10668::CircularRowBuffer
|