/external/ceres-solver/include/ceres/ |
H A D | normal_prior.h | 69 Matrix A_; member in class:ceres::NormalPrior
|
/external/ceres-solver/internal/ceres/ |
H A D | block_sparse_matrix_test.cc | 51 A_.reset(down_cast<BlockSparseMatrix*>(problem->A.release())); 57 CHECK_EQ(A_->num_rows(), B_->num_rows()); 58 CHECK_EQ(A_->num_cols(), B_->num_cols()); 59 CHECK_EQ(A_->num_nonzeros(), B_->num_nonzeros()); 62 scoped_ptr<BlockSparseMatrix> A_; member in class:ceres::internal::BlockSparseMatrixTest 67 A_->SetZero(); 68 EXPECT_EQ(13, A_->num_nonzeros()); 72 Vector y_a = Vector::Zero(A_->num_rows()); 73 Vector y_b = Vector::Zero(A_->num_rows()); 74 for (int i = 0; i < A_ [all...] |
H A D | partitioned_matrix_view_test.cc | 55 A_.reset(problem->A.release()); 57 num_cols_ = A_->num_cols(); 58 num_rows_ = A_->num_rows(); 66 scoped_ptr<SparseMatrix> A_; member in class:ceres::internal::PartitionedMatrixViewTest 70 PartitionedMatrixView m(*down_cast<BlockSparseMatrix*>(A_.get()), 76 EXPECT_EQ(m.num_cols(), A_->num_cols()); 77 EXPECT_EQ(m.num_rows(), A_->num_rows()); 81 PartitionedMatrixView m(*down_cast<BlockSparseMatrix*>(A_.get()), 98 A_->RightMultiply(x2.data(), y2.data()); 106 PartitionedMatrixView m(*down_cast<BlockSparseMatrix*>(A_ [all...] |
H A D | cgnr_linear_operator.h | 83 : A_(A), D_(D), z_(new double[A.num_rows()]) { 88 std::fill(z_.get(), z_.get() + A_.num_rows(), 0.0); 91 A_.RightMultiply(x, z_.get()); 94 A_.LeftMultiply(z_.get(), y); 98 int n = A_.num_cols(); 108 virtual int num_rows() const { return A_.num_cols(); } 109 virtual int num_cols() const { return A_.num_cols(); } 112 const LinearOperator& A_; member in class:ceres::internal::CgnrLinearOperator
|
H A D | iterative_schur_complement_solver_test.cc | 66 A_.reset(down_cast<BlockSparseMatrix*>(problem->A.release())); 70 num_cols_ = A_->num_cols(); 71 num_rows_ = A_->num_rows(); 76 TripletSparseMatrix triplet_A(A_->num_rows(), 77 A_->num_cols(), 78 A_->num_nonzeros()); 79 A_->ToTripletSparseMatrix(&triplet_A); 100 isc.Solve(A_.get(), b_.get(), per_solve_options, isc_sol.data()); 114 scoped_ptr<BlockSparseMatrix> A_; member in class:ceres::internal::IterativeSchurComplementSolverTest
|
H A D | unsymmetric_linear_solver_test.cc | 52 A_.reset(down_cast<TripletSparseMatrix*>(problem->A.release())); 65 Vector x_unregularized(A_->num_cols()); 66 Vector x_regularized(A_->num_cols()); 72 transformed_A.reset(new DenseSparseMatrix(*A_)); 74 CompressedRowSparseMatrix* crsm = new CompressedRowSparseMatrix(*A_); 76 for (int i = 0; i < A_->num_rows(); ++i) { 80 for (int i = 0; i < A_->num_cols(); ++i) { 104 for (int i = 0; i < A_->num_cols(); ++i) { 109 for (int i = 0; i < A_->num_cols(); ++i) { 114 scoped_ptr<TripletSparseMatrix> A_; member in class:ceres::internal::UnsymmetricLinearSolverTest [all...] |
H A D | implicit_schur_complement.h | 129 virtual int num_rows() const { return A_->num_cols_f(); } 130 virtual int num_cols() const { return A_->num_cols_f(); } 148 scoped_ptr<PartitionedMatrixView> A_; member in class:ceres::internal::ImplicitSchurComplement
|
H A D | implicit_schur_complement_test.cc | 62 A_.reset(down_cast<BlockSparseMatrix*>(problem->A.release())); 66 num_cols_ = A_->num_cols(); 67 num_rows_ = A_->num_rows(); 75 const CompressedRowBlockStructure* bs = A_->block_structure(); 97 eliminator->Eliminate(A_.get(), b_.get(), D, &blhs, rhs->data()); 113 eliminator->BackSubstitute(A_.get(), b_.get(), D, 124 isc.Init(*A_, D, b_.get()); 179 scoped_ptr<BlockSparseMatrix> A_; member in class:ceres::internal::ImplicitSchurComplementTest
|
/external/openfst/src/include/fst/ |
H A D | heap.h | 66 if (size_ < A_.size()) { 67 A_[size_] = val; 70 A_.push_back(val); 85 if (Better(val, A_[Parent(i)])) { 88 A_[i] = val; 96 T top = A_[0]; 107 return A_[0]; 150 T val = A_[j]; 151 A_[j] = A_[ 198 vector<T> A_; member in class:fst::Heap [all...] |
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | heap.h | 60 if (size_ < (int)A_.size()) { 61 A_[size_] = val; 64 A_.push_back(val); 79 if (comp_(val, A_[Parent(i)])) { 82 A_[i] = val; 89 T max = A_[0]; 99 return A_[0]; 142 T val = A_[j]; 143 A_[j] = A_[ 186 vector<T> A_; member in class:fst::Heap [all...] |
/external/chromium_org/third_party/openssl/openssl/crypto/md5/asm/ |
H A D | md5-ia64.S | 90 #define A_ out24 define 320 mov A_ = AccumA 338 add AccumA = AccumA, A_ 381 mov A_ = AccumA ; \ 400 add AccumA = AccumA, A_ ; \
|
/external/openssl/crypto/md5/asm/ |
H A D | md5-ia64.S | 90 #define A_ out24 define 320 mov A_ = AccumA 338 add AccumA = AccumA, A_ 381 mov A_ = AccumA ; \ 400 add AccumA = AccumA, A_ ; \
|