/external/ceres-solver/include/ceres/ |
H A D | crs_matrix.h | 49 // rows, cols and values. 51 // rows is a num_rows + 1 sized array that points into the cols and 54 // cols[rows[i]] ... cols[rows[i + 1] - 1] are the indices of the 60 // cols and values contain as many entries as there are non-zeros in 74 // cols = [ 1, 3, 1, 2, 3, 0, 1] 77 vector<int> cols; member in struct:ceres::CRSMatrix
|
/external/ceres-solver/internal/ceres/ |
H A D | autodiff_test.cc | 40 T &RowMajorAccess(T *base, int rows, int cols, int i, int j) { argument 41 return base[cols * i + j];
|
H A D | block_random_access_diagonal_matrix.cc | 68 int* cols = tsm_->mutable_cols(); local 79 cols[pos] = block_begin + c;
|
H A D | block_random_access_sparse_matrix.cc | 82 int* cols = tsm_->mutable_cols(); local 109 cols[pos] = col_layout[col_block_id] + c; 112 DCHECK_LT(cols[pos], tsm_->num_rows());
|
H A D | block_structure.h | 81 vector<Block> cols; member in struct:ceres::internal::CompressedRowBlockStructure 87 vector<CompressedColumn> cols; member in struct:ceres::internal::CompressedColumnBlockStructure
|
H A D | compressed_col_sparse_matrix_utils.h | 72 const IntegerType* cols, 76 rhs_and_solution[c] /= values[cols[c + 1] - 1]; 77 for (IntegerType idx = cols[c]; idx < cols[c + 1] - 1; ++idx) { 93 const IntegerType* cols, 97 for (IntegerType idx = cols[c]; idx < cols[c + 1] - 1; ++idx) { 102 rhs_and_solution[c] = rhs_and_solution[c] / values[cols[c + 1] - 1]; 119 const IntegerType* cols, 124 solution[rhs_nonzero_index] = 1.0 / values[cols[rhs_nonzero_inde 70 SolveUpperTriangularInPlace(IntegerType num_cols, const IntegerType* rows, const IntegerType* cols, const double* values, double* rhs_and_solution) argument 91 SolveUpperTriangularTransposeInPlace(IntegerType num_cols, const IntegerType* rows, const IntegerType* cols, const double* values, double* rhs_and_solution) argument 117 SolveRTRWithSparseRHS(IntegerType num_cols, const IntegerType* rows, const IntegerType* cols, const double* values, const int rhs_nonzero_index, double* solution) argument [all...] |
H A D | compressed_col_sparse_matrix_utils_test.cc | 92 int* cols) { 107 cols[offset] = col_pos + c; 135 int* cols = tsm.mutable_cols(); local 142 rows + offset, cols + offset); 199 cols.resize(5); 203 cols[0] = 0; 207 cols[1] = 1; 211 cols[2] = 2; 217 cols[3] = 4; 225 cols[ 87 FillBlock(const vector<int>& row_blocks, const vector<int>& col_blocks, const int row_block_id, const int col_block_id, int* rows, int* cols) argument 228 vector<int> cols; member in class:ceres::internal::SolveUpperTriangularTest [all...] |
H A D | compressed_row_jacobian_writer.cc | 115 int* cols = jacobian->mutable_cols(); local 164 cols[column_block_begin + c] = parameter_block->delta_offset() + c;
|
H A D | compressed_row_sparse_matrix.cc | 47 // duplicates in the pair of arrays rows and cols, i.e., there is no 50 // rows[i] == rows[j] && cols[i] == cols[j] 54 RowColLessThan(const int* rows, const int* cols) argument 55 : rows(rows), cols(cols) { 60 return (cols[x] < cols[y]); 66 const int* cols; member in struct:ceres::internal::__anon1759::RowColLessThan 107 sort(index.begin(), index.end(), RowColLessThan(m.rows(), m.cols())); 330 int* cols = matrix->mutable_cols(); local [all...] |
H A D | compressed_row_sparse_matrix.h | 62 // as the rows and cols matrices do not match the values of 106 const int* cols() const { return &cols_[0]; } function in class:ceres::internal::CompressedRowSparseMatrix
|
H A D | compressed_row_sparse_matrix_test.cc | 224 EXPECT_EQ(crsm->num_nonzeros(), crs_matrix.cols.size()); 232 EXPECT_EQ(crsm->cols()[i], crs_matrix.cols[i]); 284 int* cols = matrix_->mutable_cols(); local 288 cols[0] = 0; 292 cols[1] = 1; 296 cols[2] = 1; 298 cols[3] = 2; 302 cols[4] = 0; 304 cols[ 351 int* cols = matrix.mutable_cols(); local 438 vector<int> cols; local [all...] |
H A D | covariance_impl.cc | 140 const int* cols = covariance_matrix_->cols(); local 142 const int* cols_begin = cols + rows[row_begin]; 323 int* cols = covariance_matrix_->mutable_cols(); local 367 cols[cursor++] = col_begin++; 425 transpose_rows[jacobian.cols[idx] + 1] += 1; 434 const int c = jacobian.cols[idx]; 510 const int* cols = covariance_matrix_->cols(); local 548 const int c = cols[id 642 const int* cols = covariance_matrix_->cols(); local 694 const int* cols = covariance_matrix_->cols(); local [all...] |
H A D | covariance_test.cc | 115 const int* cols = crsm->cols(); local 117 EXPECT_EQ(cols[c], expected_cols[c]) 119 << cols[c] << " " 353 << "cols: " << col_begin << " " << col_end << " "
|
H A D | dense_sparse_matrix.cc | 69 const int *cols = m.cols(); local 73 m_(rows[i], cols[i]) += values[i]; 112 m_.resize(m_.rows() + m_.cols(), m_.cols()); 114 m_.block(0, 0, tmp.rows(), tmp.cols()) = tmp; 118 m_.bottomLeftCorner(m_.cols(), m_.cols()) = 119 ConstVectorRef(d, m_.cols()).asDiagonal(); 131 return m_.rows() - m_.cols(); [all...] |
H A D | dynamic_compressed_row_sparse_matrix_test.cc | 85 std::vector<int> rows, cols; local 91 cols.push_back(c); 101 std::copy(cols.begin(), cols.end(), tsm->mutable_cols()); 134 EXPECT_EQ(dense_from_dcrsm.cols(), num_cols); 151 ConstIntVectorRef crsm_cols(crsm->cols(), crsm->num_nonzeros()); 152 ConstIntVectorRef dcrsm_cols(dcrsm->cols(), dcrsm->num_nonzeros());
|
H A D | incomplete_lq_factorization.cc | 70 const int* a_cols = a.cols(); 74 const int* b_cols = b.cols(); 120 int* cols = matrix->mutable_cols(); local 154 cols[num_nonzeros] = entry.first; 173 const int* cols = matrix.cols(); local 212 q_i(cols[idx]) = values[idx];
|
H A D | incomplete_lq_factorization_test.cc | 52 EXPECT_EQ(expected.cols()[i], actual.cols()[i]); 85 int* cols = matrix.mutable_cols(); local 94 cols[idx] = j; 141 EXPECT_EQ(matrix.cols()[0], 0); 149 EXPECT_EQ(matrix.cols()[idx], idx - matrix.rows()[1]); 159 EXPECT_EQ(matrix.cols()[matrix.rows()[2]], 0); 160 EXPECT_EQ(matrix.cols()[matrix.rows()[2] + 1], 3); 161 EXPECT_EQ(matrix.cols()[matrix.rows()[2] + 2], 5); 173 EXPECT_EQ(matrix.cols()[matri [all...] |
H A D | linear_least_squares_problems.cc | 193 int* cols = A->mutable_cols(); local 201 cols[nnz] = 0; 205 cols[nnz] = 2; 212 cols[nnz] = 0; 216 cols[nnz] = 3; 223 cols[nnz] = 1; 227 cols[nnz] = 4; 234 cols[nnz] = 1; 238 cols[nnz] = 2; 245 cols[nn [all...] |
H A D | program.cc | 393 int* cols = tsm->mutable_cols(); local 412 cols = tsm->mutable_cols(); 418 cols[num_nonzeros] = c;
|
H A D | program_test.cc | 273 int* cols = expected_block_sparse_jacobian.mutable_cols(); local 276 cols[0] = 0; 279 cols[1] = 1; 281 cols[2] = 1; 284 cols[3] = 2; 286 cols[4] = 2; 289 cols[5] = 3; 291 cols[6] = 3; 294 cols[7] = 4; 296 cols[ 370 int* cols = expected_block_sparse_jacobian.mutable_cols(); local [all...] |
H A D | triplet_sparse_matrix.h | 92 const int* cols() const { return cols_.get(); } function in class:ceres::internal::TripletSparseMatrix
|
/external/chromium_org/content/common/gpu/media/ |
H A D | rendering_helper.cc | 578 size_t cols = sqrt(videos_.size() - 1) + 1; local 579 size_t rows = (videos_.size() + cols - 1) / cols; 582 std::vector<int> widths(cols); 584 std::vector<int> offset_x(cols); 589 widths[i % cols] = std::max(widths[i % cols], size.width()); 590 heights[i / cols] = std::max(heights[i / cols], size.height()); 600 std::min(static_cast<float>(widths[i % cols]) / siz [all...] |
/external/chromium_org/native_client_sdk/src/libraries/ppapi_simple/ |
H A D | ps_instance.cc | 267 int cols = strtol(tty_cols, &end, 10); local 268 if (*end != '\0' || cols < 0) 271 HandleResize(cols, rows);
|
/external/chromium_org/third_party/WebKit/Source/core/html/ |
H A D | HTMLTextAreaElement.cpp | 167 int cols = value.toInt(); local 168 if (cols <= 0) 169 cols = defaultCols; 170 if (m_cols != cols) { 171 m_cols = cols; 536 void HTMLTextAreaElement::setCols(int cols) argument 538 setIntegralAttribute(colsAttr, cols);
|
H A D | HTMLTextAreaElement.h | 40 int cols() const { return m_cols; } function in class:blink::FINAL
|