| /external/webrtc/webrtc/modules/audio_processing/beamformer/ |
| D | matrix.h | 67 Matrix() : num_rows_(0), num_columns_(0) {} in Matrix()
71 : num_rows_(num_rows), num_columns_(num_columns) { in Matrix()
73 scratch_data_.resize(num_rows_ * num_columns_); in Matrix()
74 scratch_elements_.resize(num_rows_); in Matrix()
79 : num_rows_(0), num_columns_(0) { in Matrix()
81 scratch_data_.resize(num_rows_ * num_columns_); in Matrix()
82 scratch_elements_.resize(num_rows_); in Matrix()
89 CopyFrom(&other.data_[0], other.num_rows_, other.num_columns_); in CopyFrom()
95 memcpy(&data_[0], data, num_rows_ * num_columns_ * sizeof(data_[0])); in CopyFrom()
110 if (num_rows != num_rows_ || num_columns != num_columns_) { in Resize()
[all …]
|
| /external/ceres-solver/internal/ceres/ |
| D | block_random_access_dense_matrix.cc | 45 num_rows_ = 0; in BlockRandomAccessDenseMatrix()
47 block_layout_[i] = num_rows_; in BlockRandomAccessDenseMatrix()
48 num_rows_ += blocks[i]; in BlockRandomAccessDenseMatrix()
51 values_.reset(new double[num_rows_ * num_rows_]); in BlockRandomAccessDenseMatrix()
74 *row_stride = num_rows_; in GetCell()
75 *col_stride = num_rows_; in GetCell()
82 if (num_rows_) { in SetZero()
83 VectorRef(values_.get(), num_rows_ * num_rows_).setZero(); in SetZero()
|
| D | compressed_row_sparse_matrix.cc | 75 num_rows_ = num_rows; in CompressedRowSparseMatrix()
82 VLOG(1) << "# of rows: " << num_rows_ in CompressedRowSparseMatrix()
85 << ". Allocating " << (num_rows_ + 1) * sizeof(int) + // NOLINT in CompressedRowSparseMatrix()
92 num_rows_ = m.num_rows(); in CompressedRowSparseMatrix()
95 rows_.resize(num_rows_ + 1, 0); in CompressedRowSparseMatrix()
109 VLOG(1) << "# of rows: " << num_rows_ in CompressedRowSparseMatrix()
113 << ((num_rows_ + 1) * sizeof(int) + // NOLINT in CompressedRowSparseMatrix()
127 for (int i = 1; i < num_rows_ + 1; ++i) { in CompressedRowSparseMatrix()
138 num_rows_ = num_rows; in CompressedRowSparseMatrix()
145 for (int i = 0; i < num_rows_; ++i) { in CompressedRowSparseMatrix()
[all …]
|
| D | triplet_sparse_matrix.cc | 45 : num_rows_(0), in TripletSparseMatrix()
58 : num_rows_(num_rows), in TripletSparseMatrix()
74 num_rows_(orig.num_rows_), in TripletSparseMatrix()
87 num_rows_ = rhs.num_rows_; in operator =()
98 if ((rows_[i] < 0) || (rows_[i] >= num_rows_) || in AllTripletsWithinBounds()
183 dense_matrix->resize(num_rows_, num_cols_); in ToDenseMatrix()
195 rows_.get()[num_nonzeros_] = B.rows()[i] + num_rows_; in AppendRows()
199 num_rows_ = num_rows_ + B.num_rows(); in AppendRows()
203 CHECK_EQ(B.num_rows(), num_rows_); in AppendCols()
215 if ((new_num_rows >= num_rows_) && (new_num_cols >= num_cols_)) { in Resize()
[all …]
|
| D | block_random_access_dense_matrix.h | 79 virtual int num_rows() const { return num_rows_; } in num_rows()
80 virtual int num_cols() const { return num_rows_; } in num_cols()
87 int num_rows_;
|
| D | block_jacobi_preconditioner.h | 63 virtual int num_rows() const { return num_rows_; } in num_rows()
64 virtual int num_cols() const { return num_rows_; } in num_cols()
71 int num_rows_; variable
|
| D | compressed_row_sparse_matrix.h | 89 virtual int num_rows() const { return num_rows_; } in num_rows()
91 virtual int num_nonzeros() const { return rows_[num_rows_]; } in num_nonzeros()
122 void set_num_rows(const int num_rows) { num_rows_ = num_rows; } in set_num_rows()
161 int num_rows_;
|
| D | block_sparse_matrix.cc | 49 : num_rows_(0), in BlockSparseMatrix()
65 num_rows_ += row_block_size; in BlockSparseMatrix()
75 CHECK_GE(num_rows_, 0); in BlockSparseMatrix()
165 dense_matrix->resize(num_rows_, num_cols_); in ToDenseMatrix()
189 matrix->Resize(num_rows_, num_cols_); in ToTripletSparseMatrix()
|
| D | block_sparse_matrix.h | 78 virtual int num_rows() const { return num_rows_; } in num_rows()
88 int num_rows_;
|
| D | triplet_sparse_matrix.h | 64 virtual int num_rows() const { return num_rows_; } in num_rows()
112 int num_rows_; variable
|
| D | iterative_schur_complement_solver_test.cc | 71 num_rows_ = A_->num_rows(); in SetUpProblem()
111 int num_rows_; member in ceres::internal::IterativeSchurComplementSolverTest
|
| D | implicit_schur_complement_test.cc | 67 num_rows_ = A_->num_rows(); in SetUp()
178 int num_rows_; member in ceres::internal::ImplicitSchurComplementTest
|
| D | partitioned_matrix_view_test.cc | 59 num_rows_ = A_->num_rows(); in SetUp()
68 int num_rows_; member in ceres::internal::PartitionedMatrixViewTest
|
| D | block_jacobi_preconditioner.cc | 45 : num_rows_(A.num_rows()), in BlockJacobiPreconditioner()
|