| /external/ceres-solver/internal/ceres/ |
| triplet_sparse_matrix.cc | 49 rows_(NULL),
62 rows_(NULL),
78 rows_(NULL),
98 if ((rows_[i] < 0) || (rows_[i] >= num_rows_) ||
118 new_rows[i] = rows_[i];
123 rows_.reset(new_rows);
142 rows_.reset(new int[max_num_nonzeros_]);
149 rows_[i] = orig.rows_[i]
[all...] |
| compressed_row_sparse_matrix.cc | 77 rows_.resize(num_rows + 1, 0);
95 rows_.resize(num_rows_ + 1, 0);
121 ++rows_[m.rows()[idx] + 1];
128 rows_[i] += rows_[i - 1];
140 rows_.resize(num_rows + 1);
144 rows_[0] = 0;
148 rows_[i + 1] = i + 1;
167 for (int idx = rows_[r]; idx < rows_[r + 1]; ++idx)
[all...] |
| triplet_sparse_matrix.h | 72 // of rows_, cols_ and values_. If new_max_num_nonzeros is smaller
91 const int* rows() const { return rows_.get(); }
93 int* mutable_rows() { return rows_.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_
121 scoped_array<int> rows_; member in class:ceres::internal::TripletSparseMatrix
|
| compressed_row_sparse_matrix.h | 91 virtual int num_nonzeros() const { return rows_[num_rows_]; }
109 const int* rows() const { return &rows_[0]; }
110 int* mutable_rows() { return &rows_[0]; }
163 vector<int> rows_; member in class:ceres::internal::CompressedRowSparseMatrix
|
| /external/webrtc/src/system_wrappers/source/ |
| data_log.cc | 98 RowList rows_[2]; member in class:webrtc::LogTable
144 rows_(),
145 rows_history_(&rows_[0]),
146 rows_flush_(&rows_[1]),
|
| /external/opencv/cxcore/src/ |
| cxsumpixels.cpp | 685 icv##name##Rows_##flavor##_C1R( const arrtype* src, int srcstep,\
[all...] |
