Searched refs:Zero (Results 1 - 25 of 300) sorted by relevance

1234567891011>>

/external/eigen/doc/snippets/
H A DMatrixBase_zero_int_int.cpp1 cout << MatrixXi::Zero(2,3) << endl;
H A DMatrixBase_zero.cpp1 cout << Matrix2d::Zero() << endl;
2 cout << RowVector4i::Zero() << endl;
H A DMatrixBase_zero_int.cpp1 cout << RowVectorXi::Zero(4) << endl;
2 cout << VectorXf::Zero(2) << endl;
H A DMatrixBase_setIdentity.cpp1 Matrix4i m = Matrix4i::Zero();
H A DMatrixBase_setRandom.cpp1 Matrix4i m = Matrix4i::Zero();
H A DTutorial_AdvancedInitialization_Zero.cpp2 Array33f a1 = Array33f::Zero();
7 ArrayXf a2 = ArrayXf::Zero(3);
12 ArrayXXf a3 = ArrayXXf::Zero(3, 4);
H A DTutorial_commainit_02.cpp4 MatrixXf::Zero(3,cols-3),
5 MatrixXf::Zero(rows-3,3),
H A DMatrixBase_isZero.cpp1 Matrix3d m = Matrix3d::Zero();
H A DTutorial_AdvancedInitialization_ThreeWays.cpp3 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);
H A DMatrixBase_all.cpp1 Vector3f boxMin(Vector3f::Zero()), boxMax(Vector3f::Ones());
/external/clang/test/Analysis/
H A Denum.cpp6 Zero
10 return Foo::Zero == (Foo)x; // don't crash
18 clang_analyzer_eval(f == Foo::Zero); // expected-warning{{TRUE}}
23 clang_analyzer_eval(f == Foo::Zero); // expected-warning{{FALSE}}
/external/libcxx/test/std/utilities/memory/util.smartptr/util.smartptr.shared/util.smartptr.shared.create/
H A Dallocate_shared_no_variadics.pass.cpp25 struct Zero struct
28 Zero() {++count;} function in struct:Zero
29 Zero(Zero const &) {++count;} function in struct:Zero
30 ~Zero() {--count;}
33 int Zero::count = 0;
74 std::shared_ptr<Zero> p = std::allocate_shared<Zero>(Alloc());
75 assert(Zero::count == 1);
77 assert(Zero
[all...]
/external/ceres-solver/internal/ceres/
H A Ddense_sparse_matrix_test.cc56 Vector x = Vector::Zero(num_cols);
59 Vector y_a = Vector::Zero(num_rows);
60 Vector y_b = Vector::Zero(num_rows);
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);
129 Vector b1 = Vector::Zero(num_cols);
130 Vector b2 = Vector::Zero(num_col
[all...]
H A Dblock_sparse_matrix_test.cc72 Vector y_a = Vector::Zero(A_->num_rows());
73 Vector y_b = Vector::Zero(A_->num_rows());
75 Vector x = Vector::Zero(A_->num_cols());
84 Vector y_a = Vector::Zero(A_->num_cols());
85 Vector y_b = Vector::Zero(A_->num_cols());
87 Vector x = Vector::Zero(A_->num_rows());
96 Vector y_a = Vector::Zero(A_->num_cols());
97 Vector y_b = Vector::Zero(A_->num_cols());
H A Dpartitioned_matrix_view_test.cc93 Vector y1 = Vector::Zero(pmv_->num_rows());
96 Vector y2 = Vector::Zero(pmv_->num_rows());
106 Vector x2 = Vector::Zero(pmv_->num_cols());
113 Vector y1 = Vector::Zero(pmv_->num_rows());
116 Vector y2 = Vector::Zero(pmv_->num_rows());
125 Vector x = Vector::Zero(pmv_->num_rows());
130 Vector y = Vector::Zero(pmv_->num_cols());
131 Vector y1 = Vector::Zero(pmv_->num_cols_e());
132 Vector y2 = Vector::Zero(pmv_->num_cols_f());
/external/openfst/src/include/fst/
H A Dshortest-distance.h53 // 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...]
H A Dexpectation-weight.h21 // One: <One, Zero>
22 // Zero: <Zero, Zero>
64 ExpectationWeight() : PairWeight<X1, X2>(Zero()) { }
75 static const ExpectationWeight<X1, X2> &Zero() { function in class:fst::ExpectationWeight
76 static const ExpectationWeight<X1, X2> zero(X1::Zero(), X2::Zero());
81 static const ExpectationWeight<X1, X2> one(X1::One(), X2::Zero());
H A Dreweight.h74 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())) {
H A Dstring-weight.h86 static const StringWeight<L, S> &Zero() { function in class:fst::StringWeight
347 w = StringWeight<L, S>::Zero();
367 // equality is required (for non-Zero() input. This restriction
374 if (w1 == StringWeight<L, S>::Zero())
376 if (w2 == StringWeight<L, S>::Zero())
397 if (w1 == StringWeight<L, STRING_LEFT>::Zero())
399 if (w2 == StringWeight<L, STRING_LEFT>::Zero())
418 if (w1 == StringWeight<L, STRING_RIGHT>::Zero())
420 if (w2 == StringWeight<L, STRING_RIGHT>::Zero())
438 if (w1 == StringWeight<L, S>::Zero() || w
[all...]
H A Dprune.h75 Weight wx = Times(x < idistance_.size() ? idistance_[x] : Weight::Zero(),
76 x < fdistance_.size() ? fdistance_[x] : Weight::Zero());
77 Weight wy = Times(y < idistance_.size() ? idistance_[y] : Weight::Zero(),
78 y < fdistance_.size() ? fdistance_[y] : Weight::Zero());
115 vector<Weight> idistance(ns, Weight::Zero());
125 ((*fdistance)[fst->Start()] == Weight::Zero())) {
152 fst->SetFinal(s, Weight::Zero());
161 : Weight::Zero());
247 ((*fdistance)[ifst.Start()] == Weight::Zero())) {
257 Weight limit = Times(s < fdistance->size() ? (*fdistance)[s] : Weight::Zero(),
[all...]
H A Dshortest-path.h52 // One() and Zero() according to NaturalLess.
58 bool fp = false, Weight w = Weight::Zero(),
100 Weight f_distance = Weight::Zero();
111 if (opts.weight_threshold != Weight::Zero() ||
126 distance->push_back(Weight::Zero());
129 arc_parent.push_back(Arc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId));
133 arc_parent.push_back(Arc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId));
142 if (ifst.Final(s) != Weight::Zero()) {
160 distance->push_back(Weight::Zero());
163 arc_parent.push_back(Arc(kNoLabel, kNoLabel, Weight::Zero(),
[all...]
H A Dlexicographic-weight.h23 // (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() { function in class:fst::LexicographicWeight
76 static const LexicographicWeight<W1, W2> zero(PairWeight<W1, W2>::Zero());
99 if (Value1() == W1::Zero() && Value2() == W2::Zero()) return true;
100 if (Value1() != W1::Zero() && Value2() != W2::Zero()) return true;
/external/eigen/test/eigen2/
H A Deigen2_sparse_product.cpp25 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/clang/test/SemaTemplate/
H A Dalias-church-numerals.cpp9 template<template<typename> class, typename X> using Zero = X;
12 template<template<typename> class F, typename X> using One = Succ<Zero, F, X>;
/external/fdlibm/
H A De_fmod.c23 static const double one = 1.0, Zero[] = {0.0, -0.0,}; variable
25 static double one = 1.0, Zero[] = {0.0, -0.0,}; variable
53 return Zero[(unsigned)sx>>31]; /* |x|=|y| return x*0*/
107 return Zero[(unsigned)sx>>31];
116 return Zero[(unsigned)sx>>31];

Completed in 472 milliseconds

1234567891011>>