HomeSort by relevance Sort by last modified time
    Searched refs:cols_ (Results 1 - 4 of 4) sorted by null

  /external/ceres-solver/internal/ceres/
triplet_sparse_matrix.cc 50 cols_(NULL),
63 cols_(NULL),
79 cols_(NULL),
99 (cols_[i] < 0) || (cols_[i] >= num_cols_))
119 new_cols[i] = cols_[i];
124 cols_.reset(new_cols);
143 cols_.reset(new int[max_num_nonzeros_]);
150 cols_[i] = orig.cols_[i]
    [all...]
compressed_row_sparse_matrix.h 106 const int* cols() const { return &cols_[0]; }
107 int* mutable_cols() { return &cols_[0]; }
164 vector<int> cols_; member in class:ceres::internal::CompressedRowSparseMatrix
triplet_sparse_matrix.h 72 // of rows_, cols_ and values_. If new_max_num_nonzeros is smaller
92 const int* cols() const { return cols_.get(); }
94 int* mutable_cols() { return cols_.get(); }
118 // stored at the location (rows_[i], cols_[i]). If the there are
119 // multiple entries with the same (rows_[i], cols_[i]), the values_
122 scoped_array<int> cols_; member in class:ceres::internal::TripletSparseMatrix
compressed_row_sparse_matrix.cc 78 cols_.resize(max_num_nonzeros, 0);
84 << " max_num_nonzeros: " << cols_.size()
86 cols_.size() * sizeof(int) + // NOLINT
87 cols_.size() * sizeof(double); // NOLINT
96 cols_.resize(m.num_nonzeros(), 0);
111 << " max_num_nonzeros: " << cols_.size()
114 cols_.size() * sizeof(int) + // NOLINT
115 cols_.size() * sizeof(double)); // NOLINT
122 cols_[i] = m.cols()[idx];
141 cols_.resize(num_rows)
    [all...]

Completed in 352 milliseconds