/external/eigen/doc/snippets/ |
MatrixBase_zero_int_int.cpp | 1 cout << MatrixXi::Zero(2,3) << endl;
|
MatrixBase_zero.cpp | 1 cout << Matrix2d::Zero() << endl; 2 cout << RowVector4i::Zero() << endl;
|
MatrixBase_zero_int.cpp | 1 cout << RowVectorXi::Zero(4) << endl; 2 cout << VectorXf::Zero(2) << endl;
|
MatrixBase_setIdentity.cpp | 1 Matrix4i m = Matrix4i::Zero();
|
MatrixBase_setRandom.cpp | 1 Matrix4i m = Matrix4i::Zero();
|
Tutorial_AdvancedInitialization_Zero.cpp | 2 Array33f a1 = Array33f::Zero(); 7 ArrayXf a2 = ArrayXf::Zero(3); 12 ArrayXXf a3 = ArrayXXf::Zero(3, 4);
|
Tutorial_commainit_02.cpp | 4 MatrixXf::Zero(3,cols-3), 5 MatrixXf::Zero(rows-3,3),
|
MatrixBase_isZero.cpp | 1 Matrix3d m = Matrix3d::Zero();
|
Tutorial_AdvancedInitialization_ThreeWays.cpp | 3 mat1.topLeftCorner(size/2, size/2) = MatrixXd::Zero(size/2, size/2); 6 mat1.bottomRightCorner(size/2, size/2) = MatrixXd::Zero(size/2, size/2); 17 mat3 << MatrixXd::Zero(size/2, size/2), MatrixXd::Identity(size/2, size/2), 18 MatrixXd::Identity(size/2, size/2), MatrixXd::Zero(size/2, size/2);
|
MatrixBase_all.cpp | 1 Vector3f boxMin(Vector3f::Zero()), boxMax(Vector3f::Ones());
|
/external/ceres-solver/internal/ceres/ |
block_sparse_matrix_test.cc | 73 Vector y_a = Vector::Zero(A_->num_rows()); 74 Vector y_b = Vector::Zero(A_->num_rows()); 76 Vector x = Vector::Zero(A_->num_cols()); 85 Vector y_a = Vector::Zero(A_->num_cols()); 86 Vector y_b = Vector::Zero(A_->num_cols()); 88 Vector x = Vector::Zero(A_->num_rows()); 97 Vector y_a = Vector::Zero(A_->num_cols()); 98 Vector y_b = Vector::Zero(A_->num_cols());
|
dense_sparse_matrix_test.cc | 56 Vector x = Vector::Zero(num_cols); 59 Vector y_a = Vector::Zero(num_rows); 60 Vector y_b = Vector::Zero(num_rows); 94 // Try with a not entirely zero vector to verify column interactions, which 100 Vector b1 = Vector::Zero(num_rows); 101 Vector b2 = Vector::Zero(num_rows); 111 Vector a = Vector::Zero(num_rows); 114 Vector b1 = Vector::Zero(num_cols); 115 Vector b2 = Vector::Zero(num_cols); 123 // Try with a not entirely zero vector to verify column interactions, whic [all...] |
partitioned_matrix_view_test.cc | 94 Vector y1 = Vector::Zero(m.num_rows()); 97 Vector y2 = Vector::Zero(m.num_rows()); 112 Vector x2 = Vector::Zero(m.num_cols()); 119 Vector y1 = Vector::Zero(m.num_rows()); 122 Vector y2 = Vector::Zero(m.num_rows()); 136 Vector x = Vector::Zero(m.num_rows()); 141 Vector y = Vector::Zero(m.num_cols()); 142 Vector y1 = Vector::Zero(m.num_cols_e()); 143 Vector y2 = Vector::Zero(m.num_cols_f());
|
compressed_row_sparse_matrix_test.cc | 53 Vector x = Vector::Zero(num_cols); 56 Vector y_a = Vector::Zero(num_rows); 57 Vector y_b = Vector::Zero(num_rows); 94 Vector a = Vector::Zero(num_rows); 97 Vector b1 = Vector::Zero(num_cols); 98 Vector b2 = Vector::Zero(num_cols); 108 Vector b1 = Vector::Zero(num_cols); 109 Vector b2 = Vector::Zero(num_cols);
|
/bionic/libm/upstream-freebsd/lib/msun/src/ |
e_fmodf.c | 28 static const float one = 1.0, Zero[] = {0.0, -0.0,}; 47 return Zero[(u_int32_t)sx>>31]; /* |x|=|y| return x*0*/ 80 return Zero[(u_int32_t)sx>>31]; 89 return Zero[(u_int32_t)sx>>31];
|
/external/openfst/src/include/fst/ |
lexicographic-weight.h | 23 // (for all a,b,c != Zero(): Times(c, a) = Times(c, b) => a = b, 46 using PairWeight<W1, W2>::Zero; 75 static const LexicographicWeight<W1, W2> &Zero() { 76 static const LexicographicWeight<W1, W2> zero(PairWeight<W1, W2>::Zero()); 77 return zero; 99 if (Value1() == W1::Zero() && Value2() == W2::Zero()) return true; 100 if (Value1() != W1::Zero() && Value2() != W2::Zero()) return true [all...] |
shortest-distance.h | 53 // weights in the FST are between One() and Zero() 150 distance_->push_back(Weight::Zero()); 151 rdistance_.push_back(Weight::Zero()); 169 distance_->push_back(Weight::Zero()); 170 rdistance_.push_back(Weight::Zero()); 173 if (first_path_ && (fst_.Final(s) != Weight::Zero())) 177 rdistance_[s] = Weight::Zero(); 185 distance_->push_back(Weight::Zero()); 186 rdistance_.push_back(Weight::Zero()); 193 (*distance_)[arc.nextstate] = Weight::Zero(); [all...] |
expectation-weight.h | 21 // One: <One, Zero> 22 // Zero: <Zero, Zero> 64 ExpectationWeight() : PairWeight<X1, X2>(Zero()) { } 75 static const ExpectationWeight<X1, X2> &Zero() { 76 static const ExpectationWeight<X1, X2> zero(X1::Zero(), X2::Zero()); 77 return zero; [all...] |
reweight.h | 74 if (weight != Weight::Zero()) { 82 if (nextweight == Weight::Zero()) 103 fst->SetFinal(state, Times(Weight::Zero(), fst->Final(state))); 107 potential[fst->Start()] : Weight::Zero(); 108 if ((startweight != Weight::One()) && (startweight != Weight::Zero())) {
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
reweight.h | 46 potential.push_back(Weight::Zero()); 66 if ((potential[state] == Weight::Zero()) || 67 (potential[arc.nextstate] == Weight::Zero())) 70 && (potential[state] != Weight::Zero())) 74 && (potential[arc.nextstate] != Weight::Zero())) 80 && (potential[state] != Weight::Zero())) 88 (potential[fst->Start()] != Weight::Zero())) {
|
prune.h | 37 // If non-zero, passes in pre-computed shortest distance from initial state 40 // If non-zero, passes in pre-computed shortest distance to final states 74 idistance = new vector<Weight>(ns, Weight::Zero()); 77 idistance->resize(ns, Weight::Zero()); 81 fdistance = new vector<Weight>(ns, Weight::Zero()); 84 fdistance->resize(ns, Weight::Zero()); 110 fst->SetFinal(state, Weight::Zero()); 174 fdistance->push_back(Weight::Zero()); 182 idistance->push_back(Weight::Zero()); 184 fdistance->push_back(Weight::Zero()); [all...] |
shortest-distance.h | 115 distance_->push_back(Weight::Zero()); 116 rdistance_.push_back(Weight::Zero()); 134 distance_->push_back(Weight::Zero()); 135 rdistance_.push_back(Weight::Zero()); 140 rdistance_[s] = Weight::Zero(); 145 if (!arc_filter_(arc) || arc.weight == Weight::Zero()) 148 distance_->push_back(Weight::Zero()); 149 rdistance_.push_back(Weight::Zero()); 156 (*distance_)[arc.nextstate] = Weight::Zero(); 157 rdistance_[arc.nextstate] = Weight::Zero(); [all...] |
/external/eigen/Eigen/src/Eigen2Support/ |
LeastSquares.h | 143 VectorType mean = VectorType::Zero(size); 149 CovMatrixType covMat = CovMatrixType::Zero(size, size); 150 VectorType remean = VectorType::Zero(size);
|
/external/eigen/test/eigen2/ |
eigen2_sparse_product.cpp | 25 DenseMatrix refMat2 = DenseMatrix::Zero(rows, rows); 26 DenseMatrix refMat3 = DenseMatrix::Zero(rows, rows); 27 DenseMatrix refMat4 = DenseMatrix::Zero(rows, rows); 28 DenseMatrix dm4 = DenseMatrix::Zero(rows, rows); 58 DenseMatrix refM2 = DenseMatrix::Zero(rows, rows); 59 DenseMatrix refM3 = DenseMatrix::Zero(rows, rows); 76 DenseMatrix refUp = DenseMatrix::Zero(rows, rows); 77 DenseMatrix refLo = DenseMatrix::Zero(rows, rows); 78 DenseMatrix refS = DenseMatrix::Zero(rows, rows);
|
/external/fdlibm/ |
e_fmod.c | 23 static const double one = 1.0, Zero[] = {0.0, -0.0,}; 25 static double one = 1.0, Zero[] = {0.0, -0.0,}; 53 return Zero[(unsigned)sx>>31]; /* |x|=|y| return x*0*/ 107 return Zero[(unsigned)sx>>31]; 116 return Zero[(unsigned)sx>>31];
|