| /external/llvm/unittests/VMCore/ |
| ConstantsTest.cpp | 21 Constant* Zero = ConstantInt::get(Int1, 0);
28 EXPECT_EQ(Zero, ConstantExpr::getAdd(One, One));
32 EXPECT_EQ(Zero, ConstantExpr::getAdd(NegOne, One));
36 EXPECT_EQ(Zero, ConstantExpr::getAdd(NegOne, NegOne));
40 EXPECT_EQ(Zero, ConstantExpr::getSub(NegOne, One));
44 EXPECT_EQ(Zero, ConstantExpr::getSub(One, NegOne));
48 EXPECT_EQ(Zero, ConstantExpr::getSub(One, One));
56 EXPECT_EQ(One, ConstantExpr::getShl(One, Zero));
88 EXPECT_EQ(Zero, ConstantExpr::getSRem(NegOne, One));
92 EXPECT_EQ(Zero, ConstantExpr::getURem(NegOne, One))
[all...] |
| /bionic/libm/src/ |
| e_fmodf.c | 29 static const float one = 1.0, Zero[] = {0.0, -0.0,};
48 return Zero[(u_int32_t)sx>>31]; /* |x|=|y| return x*0*/
81 return Zero[(u_int32_t)sx>>31];
90 return Zero[(u_int32_t)sx>>31];
|
| s_remquof.c | 19 static const float Zero[] = {0.0, -0.0,};
50 return Zero[(u_int32_t)sx>>31]; /* |x|=|y| return x*0*/
93 return Zero[(u_int32_t)sx>>31];
|
| e_fmod.c | 27 static const double one = 1.0, Zero[] = {0.0, -0.0,};
48 return Zero[(u_int32_t)sx>>31]; /* |x|=|y| return x*0*/
102 return Zero[(u_int32_t)sx>>31];
111 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 | 52 // weights in the FST are between One() and Zero()
149 distance_->push_back(Weight::Zero());
150 rdistance_.push_back(Weight::Zero());
168 distance_->push_back(Weight::Zero());
169 rdistance_.push_back(Weight::Zero());
172 if (first_path_ && (fst_.Final(s) != Weight::Zero()))
176 rdistance_[s] = Weight::Zero();
181 if (!arc_filter_(arc) || arc.weight == Weight::Zero())
184 distance_->push_back(Weight::Zero());
185 rdistance_.push_back(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())) {
|
| string-weight.h | 86 static const StringWeight<L, S> &Zero() {
87 static const StringWeight<L, S> zero(kStringInfinity);
88 return zero;
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())
[all...] |
| prune.h | 46 // If non-zero, passes in pre-computed shortest distance to final states.
75 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())) {
[all...] |
| shortest-path.h | 52 // 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...] |
| random-weight.h | 42 // The boolean 'allow_zero' below determines whether Zero() and zero
60 return Weight::Zero();
69 bool allow_zero_; // permit Zero() and zero divisors
92 return Weight::Zero();
101 bool allow_zero_; // permit Zero() and zero divisors
111 // One(), and Zero() if zero is allowed
[all...] |
| pair-weight.h | 56 static const PairWeight<W1, W2> &Zero() {
57 static const PairWeight<W1, W2> zero(W1::Zero(), W2::Zero());
58 return zero;
132 W1 w1 = W1::Zero();
136 W2 w2 = W2::Zero();
181 W1 w1 = W1::Zero();
199 W2 w2 = W2::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...] |
| string-weight.h | 83 static const StringWeight<L, S> &Zero() {
84 static const StringWeight<L, S> zero(kStringInfinity);
85 return zero;
339 w = StringWeight<L, S>::Zero();
359 // equality is required (for non-Zero() input. This restriction
364 if (w1 == StringWeight<L, S>::Zero())
366 if (w2 == StringWeight<L, S>::Zero())
381 if (w1 == StringWeight<L, STRING_LEFT>::Zero())
383 if (w2 == StringWeight<L, STRING_LEFT>::Zero())
400 if (w1 == StringWeight<L, STRING_RIGHT>::Zero())
[all...] |
| random-weight.h | 32 // The boolean 'allow_zero' below determines whether Zero() and zero
49 return Weight::Zero();
58 bool allow_zero_; // permit Zero() and zero divisors
76 return Weight::Zero();
85 bool allow_zero_; // permit Zero() and zero divisors
90 // strings chosen from {1,...,kAlphabetSize}^{0,kMaxStringLength} U { Zero }
104 return Weight::Zero();
[all...] |
| shortest-path.h | 82 Weight f_distance = Weight::Zero();
96 distance->push_back(Weight::Zero());
99 arc_parent.push_back(Arc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId));
103 arc_parent.push_back(Arc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId));
117 distance->push_back(Weight::Zero());
120 arc_parent.push_back(Arc(kNoLabel, kNoLabel, Weight::Zero(),
137 if (ifst.Final(s) != Weight::Zero()) {
265 distance->push_back(Weight::Zero());
289 pairs.push_back(Pair(kNoStateId, Weight::Zero()));
322 if (finalw != Weight::Zero()) {
[all...] |
| /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];
|
| /external/chromium/testing/gtest/samples/ |
| sample1_unittest.cc | 103 TEST(FactorialTest, Zero) {
|
| /external/gtest/samples/ |
| sample1_unittest.cc | 103 TEST(FactorialTest, Zero) {
|
| /external/protobuf/gtest/samples/ |
| sample1_unittest.cc | 103 TEST(FactorialTest, Zero) {
|
| /external/clang/test/SemaTemplate/ |
| alias-church-numerals.cpp | 8 template<template<typename> class, typename X> using Zero = X;
11 template<template<typename> class F, typename X> using One = Succ<Zero, F, X>;
|
| /external/openfst/src/test/ |
| weight-tester.h | 65 // Tests (Plus, Times, Zero, One) defines a commutative semiring.
76 CHECK(Plus(w1, Weight::Zero()) == w1);
77 CHECK(Plus(Weight::Zero(), w1) == w1);
93 // Checks Zero() is the annihilator.
94 CHECK(Times(w1, Weight::Zero()) == Weight::Zero());
95 CHECK(Times(Weight::Zero(), w1) == Weight::Zero());
|
