Home
last modified time | relevance | path

Searched refs:Zero (Results 1 – 25 of 537) sorted by relevance

12345678910>>...22

/external/chromium_org/net/quic/congestion_control/
Drtt_stats_test.cc31 QuicTime::Delta::Zero(), in TEST_F()
32 QuicTime::Zero()); in TEST_F()
37 QuicTime::Delta::Zero(), in TEST_F()
38 QuicTime::Zero().Add( in TEST_F()
43 QuicTime::Delta::Zero(), in TEST_F()
44 QuicTime::Zero().Add( in TEST_F()
49 QuicTime::Delta::Zero(), in TEST_F()
50 QuicTime::Zero().Add( in TEST_F()
55 QuicTime::Delta::Zero(), in TEST_F()
56 QuicTime::Zero().Add( in TEST_F()
[all …]
Dtime_loss_algorithm_test.cc23 QuicTime::Delta::Zero(), in TimeLossAlgorithmTest()
75 EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout()); in TEST_F()
88 EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout()); in TEST_F()
99 EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout()); in TEST_F()
104 EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout()); in TEST_F()
110 EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout()); in TEST_F()
121 EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout()); in TEST_F()
134 EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout()); in TEST_F()
Dpacing_sender.cc16 last_delayed_packet_sent_time_(QuicTime::Zero()), in PacingSender()
17 next_packet_send_time_(QuicTime::Zero()), in PacingSender()
64 last_delayed_packet_sent_time_ = QuicTime::Zero(); in OnPacketSent()
65 next_packet_send_time_ = QuicTime::Zero(); in OnPacketSent()
92 last_delayed_packet_sent_time_ = QuicTime::Zero(); in OnPacketSent()
138 return QuicTime::Delta::Zero(); in TimeUntilSend()
150 return QuicTime::Delta::Zero(); in TimeUntilSend()
Dtcp_loss_algorithm_test.cc23 QuicTime::Delta::Zero(), in TcpLossAlgorithmTest()
71 EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout()); in TEST_F()
90 EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout()); in TEST_F()
108 EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout()); in TEST_F()
127 EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout()); in TEST_F()
162 EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout()); in TEST_F()
179 EXPECT_EQ(QuicTime::Zero(), loss_algorithm_.GetLossTimeout()); in TEST_F()
/external/chromium_org/net/quic/
Dquic_alarm_test.cc54 deadline_(QuicTime::Zero().Add(QuicTime::Delta::FromSeconds(7))), in QuicAlarmTest()
55 deadline2_(QuicTime::Zero().Add(QuicTime::Delta::FromSeconds(14))), in QuicAlarmTest()
56 new_deadline_(QuicTime::Zero()) { in QuicAlarmTest()
75 QuicTime deadline = QuicTime::Zero().Add(QuicTime::Delta::FromSeconds(7)); in TEST_F()
83 QuicTime deadline = QuicTime::Zero().Add(QuicTime::Delta::FromSeconds(7)); in TEST_F()
88 EXPECT_EQ(QuicTime::Zero(), alarm_.deadline()); in TEST_F()
92 QuicTime deadline = QuicTime::Zero().Add(QuicTime::Delta::FromSeconds(7)); in TEST_F()
94 QuicTime new_deadline = QuicTime::Zero().Add(QuicTime::Delta::FromSeconds(8)); in TEST_F()
95 alarm_.Update(new_deadline, QuicTime::Delta::Zero()); in TEST_F()
102 QuicTime deadline = QuicTime::Zero().Add(QuicTime::Delta::FromSeconds(7)); in TEST_F()
[all …]
Dquic_time_test.cc12 TEST(QuicTimeDeltaTest, Zero) { in TEST() argument
13 EXPECT_TRUE(QuicTime::Delta::Zero().IsZero()); in TEST()
14 EXPECT_FALSE(QuicTime::Delta::Zero().IsInfinite()); in TEST()
20 EXPECT_FALSE(QuicTime::Delta::Zero().IsInfinite()); in TEST()
42 QuicTime::Delta::Zero().Add(QuicTime::Delta::FromMilliseconds(2))); in TEST()
79 EXPECT_FALSE(QuicTime::Zero().IsInitialized()); in TEST_F()
80 EXPECT_TRUE(QuicTime::Zero().Add( in TEST_F()
85 QuicTime time_1 = QuicTime::Zero().Add( in TEST_F()
87 QuicTime time_2 = QuicTime::Zero().Add( in TEST_F()
98 QuicTime time_1 = QuicTime::Zero().Add( in TEST_F()
[all …]
Dquic_connection_helper_test.cc22 return QuicTime::Zero(); in OnAlarm()
66 EXPECT_EQ(QuicTime::Zero().Add(delta), clock_.Now()); in TEST_F()
84 EXPECT_EQ(QuicTime::Zero().Add(delta), clock_.Now()); in TEST_F()
104 EXPECT_EQ(QuicTime::Zero().Add(delta), clock_.Now()); in TEST_F()
111 EXPECT_EQ(QuicTime::Zero().Add(new_delta), clock_.Now()); in TEST_F()
130 EXPECT_EQ(QuicTime::Zero().Add(new_delta), clock_.Now()); in TEST_F()
140 EXPECT_EQ(QuicTime::Zero().Add(delta), clock_.Now()); in TEST_F()
162 EXPECT_EQ(QuicTime::Zero().Add(delta), clock->Now()); in TEST_F()
185 alarm->Update(QuicTime::Zero(), QuicTime::Delta::FromMicroseconds(1)); in TEST_F()
/external/ceres-solver/internal/ceres/
Ddense_sparse_matrix_test.cc56 Vector x = Vector::Zero(num_cols); in CompareMatrices()
59 Vector y_a = Vector::Zero(num_rows); in CompareMatrices()
60 Vector y_b = Vector::Zero(num_rows); in CompareMatrices()
100 Vector b1 = Vector::Zero(num_rows); in TEST_F()
101 Vector b2 = Vector::Zero(num_rows); in TEST_F()
111 Vector a = Vector::Zero(num_rows); in TEST_F()
114 Vector b1 = Vector::Zero(num_cols); in TEST_F()
115 Vector b2 = Vector::Zero(num_cols); in TEST_F()
129 Vector b1 = Vector::Zero(num_cols); in TEST_F()
130 Vector b2 = Vector::Zero(num_cols); in TEST_F()
[all …]
Dblock_sparse_matrix_test.cc72 Vector y_a = Vector::Zero(A_->num_rows()); in TEST_F()
73 Vector y_b = Vector::Zero(A_->num_rows()); in TEST_F()
75 Vector x = Vector::Zero(A_->num_cols()); in TEST_F()
84 Vector y_a = Vector::Zero(A_->num_cols()); in TEST_F()
85 Vector y_b = Vector::Zero(A_->num_cols()); in TEST_F()
87 Vector x = Vector::Zero(A_->num_rows()); in TEST_F()
96 Vector y_a = Vector::Zero(A_->num_cols()); in TEST_F()
97 Vector y_b = Vector::Zero(A_->num_cols()); in TEST_F()
Dpartitioned_matrix_view_test.cc93 Vector y1 = Vector::Zero(pmv_->num_rows()); in TEST_F()
96 Vector y2 = Vector::Zero(pmv_->num_rows()); in TEST_F()
106 Vector x2 = Vector::Zero(pmv_->num_cols()); in TEST_F()
113 Vector y1 = Vector::Zero(pmv_->num_rows()); in TEST_F()
116 Vector y2 = Vector::Zero(pmv_->num_rows()); in TEST_F()
125 Vector x = Vector::Zero(pmv_->num_rows()); in TEST_F()
130 Vector y = Vector::Zero(pmv_->num_cols()); in TEST_F()
131 Vector y1 = Vector::Zero(pmv_->num_cols_e()); in TEST_F()
132 Vector y2 = Vector::Zero(pmv_->num_cols_f()); in TEST_F()
/external/clang/test/Analysis/
Denum.cpp6 Zero enumerator
10 return Foo::Zero == (Foo)x; // don't crash in pr15703()
18 clang_analyzer_eval(f == Foo::Zero); // expected-warning{{TRUE}} in testCasting()
23 clang_analyzer_eval(f == Foo::Zero); // expected-warning{{FALSE}} in testCasting()
/external/srec/tools/thirdparty/OpenFst/fst/lib/
Dstring-weight.h83 static const StringWeight<L, S> &Zero() { in Zero() function
339 w = StringWeight<L, S>::Zero();
364 if (w1 == StringWeight<L, S>::Zero()) in Plus()
366 if (w2 == StringWeight<L, S>::Zero()) in Plus()
381 if (w1 == StringWeight<L, STRING_LEFT>::Zero()) in Plus()
383 if (w2 == StringWeight<L, STRING_LEFT>::Zero()) in Plus()
400 if (w1 == StringWeight<L, STRING_RIGHT>::Zero()) in Plus()
402 if (w2 == StringWeight<L, STRING_RIGHT>::Zero()) in Plus()
418 if (w1 == StringWeight<L, S>::Zero() || w2 == StringWeight<L, S>::Zero()) in Times()
419 return StringWeight<L, S>::Zero(); in Times()
[all …]
Dshortest-distance.h115 distance_->push_back(Weight::Zero()); in ShortestDistance()
116 rdistance_.push_back(Weight::Zero()); in ShortestDistance()
134 distance_->push_back(Weight::Zero()); in ShortestDistance()
135 rdistance_.push_back(Weight::Zero()); in ShortestDistance()
140 rdistance_[s] = Weight::Zero(); in ShortestDistance()
145 if (!arc_filter_(arc) || arc.weight == Weight::Zero()) in ShortestDistance()
148 distance_->push_back(Weight::Zero()); in ShortestDistance()
149 rdistance_.push_back(Weight::Zero()); in ShortestDistance()
156 (*distance_)[arc.nextstate] = Weight::Zero(); in ShortestDistance()
157 rdistance_[arc.nextstate] = Weight::Zero(); in ShortestDistance()
Dprune.h74 idistance = new vector<Weight>(ns, Weight::Zero()); in Prune()
77 idistance->resize(ns, Weight::Zero()); in Prune()
81 fdistance = new vector<Weight>(ns, Weight::Zero()); in Prune()
84 fdistance->resize(ns, Weight::Zero()); in Prune()
110 fst->SetFinal(state, Weight::Zero()); in Prune()
174 fdistance->push_back(Weight::Zero()); in Prune()
182 idistance->push_back(Weight::Zero()); in Prune()
184 fdistance->push_back(Weight::Zero()); in Prune()
204 idistance->push_back(Weight::Zero()); in Prune()
206 fdistance->push_back(Weight::Zero()); in Prune()
Dreweight.h46 potential.push_back(Weight::Zero()); in Reweight()
66 if ((potential[state] == Weight::Zero()) || in Reweight()
67 (potential[arc.nextstate] == Weight::Zero())) in Reweight()
70 && (potential[state] != Weight::Zero())) in Reweight()
74 && (potential[arc.nextstate] != Weight::Zero())) in Reweight()
80 && (potential[state] != Weight::Zero())) in Reweight()
88 (potential[fst->Start()] != Weight::Zero())) { in Reweight()
/external/openfst/src/include/fst/
Dshortest-distance.h150 distance_->push_back(Weight::Zero()); in ShortestDistance()
151 rdistance_.push_back(Weight::Zero()); in ShortestDistance()
169 distance_->push_back(Weight::Zero()); in ShortestDistance()
170 rdistance_.push_back(Weight::Zero()); in ShortestDistance()
173 if (first_path_ && (fst_.Final(s) != Weight::Zero())) in ShortestDistance()
177 rdistance_[s] = Weight::Zero(); in ShortestDistance()
185 distance_->push_back(Weight::Zero()); in ShortestDistance()
186 rdistance_.push_back(Weight::Zero()); in ShortestDistance()
193 (*distance_)[arc.nextstate] = Weight::Zero(); in ShortestDistance()
194 rdistance_[arc.nextstate] = Weight::Zero(); in ShortestDistance()
[all …]
Dstring-weight.h86 static const StringWeight<L, S> &Zero() { in Zero() function
347 w = StringWeight<L, S>::Zero();
374 if (w1 == StringWeight<L, S>::Zero()) in Plus()
376 if (w2 == StringWeight<L, S>::Zero()) in Plus()
397 if (w1 == StringWeight<L, STRING_LEFT>::Zero()) in Plus()
399 if (w2 == StringWeight<L, STRING_LEFT>::Zero()) in Plus()
418 if (w1 == StringWeight<L, STRING_RIGHT>::Zero()) in Plus()
420 if (w2 == StringWeight<L, STRING_RIGHT>::Zero()) in Plus()
438 if (w1 == StringWeight<L, S>::Zero() || w2 == StringWeight<L, S>::Zero()) in Times()
439 return StringWeight<L, S>::Zero(); in Times()
[all …]
Dshortest-path.h58 bool fp = false, Weight w = Weight::Zero(),
100 Weight f_distance = Weight::Zero(); in SingleShortestPath()
111 if (opts.weight_threshold != Weight::Zero() || in SingleShortestPath()
126 distance->push_back(Weight::Zero()); in SingleShortestPath()
129 arc_parent.push_back(Arc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId)); in SingleShortestPath()
133 arc_parent.push_back(Arc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId)); in SingleShortestPath()
142 if (ifst.Final(s) != Weight::Zero()) { in SingleShortestPath()
160 distance->push_back(Weight::Zero()); in SingleShortestPath()
163 arc_parent.push_back(Arc(kNoLabel, kNoLabel, Weight::Zero(), in SingleShortestPath()
223 px.first < distance_.size() ? distance_[px.first] : Weight::Zero(); in operator()
[all …]
Dprune.h75 Weight wx = Times(x < idistance_.size() ? idistance_[x] : Weight::Zero(), in operator()
76 x < fdistance_.size() ? fdistance_[x] : Weight::Zero()); in operator()
77 Weight wy = Times(y < idistance_.size() ? idistance_[y] : Weight::Zero(), in operator()
78 y < fdistance_.size() ? fdistance_[y] : Weight::Zero()); in operator()
115 vector<Weight> idistance(ns, Weight::Zero()); in Prune()
125 ((*fdistance)[fst->Start()] == Weight::Zero())) { in Prune()
152 fst->SetFinal(s, Weight::Zero()); in Prune()
161 : Weight::Zero()); in Prune()
247 ((*fdistance)[ifst.Start()] == Weight::Zero())) { in Prune()
257 Weight limit = Times(s < fdistance->size() ? (*fdistance)[s] : Weight::Zero(), in Prune()
[all …]
Dlexicographic-weight.h46 using PairWeight<W1, W2>::Zero;
75 static const LexicographicWeight<W1, W2> &Zero() { in Zero() function
76 static const LexicographicWeight<W1, W2> zero(PairWeight<W1, W2>::Zero()); in Zero()
99 if (Value1() == W1::Zero() && Value2() == W2::Zero()) return true; in Member()
100 if (Value1() != W1::Zero() && Value2() != W2::Zero()) return true; in Member()
/external/eigen/test/eigen2/
Deigen2_sparse_product.cpp25 DenseMatrix refMat2 = DenseMatrix::Zero(rows, rows); in sparse_product()
26 DenseMatrix refMat3 = DenseMatrix::Zero(rows, rows); in sparse_product()
27 DenseMatrix refMat4 = DenseMatrix::Zero(rows, rows); in sparse_product()
28 DenseMatrix dm4 = DenseMatrix::Zero(rows, rows); in sparse_product()
58 DenseMatrix refM2 = DenseMatrix::Zero(rows, rows); in sparse_product()
59 DenseMatrix refM3 = DenseMatrix::Zero(rows, rows); in sparse_product()
76 DenseMatrix refUp = DenseMatrix::Zero(rows, rows); in sparse_product()
77 DenseMatrix refLo = DenseMatrix::Zero(rows, rows); in sparse_product()
78 DenseMatrix refS = DenseMatrix::Zero(rows, rows); in sparse_product()
/external/chromium_org/net/tools/quic/
Dquic_epoll_clock_test.cc20 clock.ApproximateNow().Subtract(QuicTime::Zero()).ToMicroseconds()); in TEST()
24 clock.ApproximateNow().Subtract(QuicTime::Zero()).ToMicroseconds()); in TEST()
33 clock.Now().Subtract(QuicTime::Zero()).ToMicroseconds()); in TEST()
37 clock.Now().Subtract(QuicTime::Zero()).ToMicroseconds()); in TEST()
/external/eigen/doc/snippets/
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);
/external/chromium_org/v8/test/webkit/
Dcomparison-operators-less-expected.txt1085 PASS return (Zero<letter0); is false
1086 PASS if ((Zero<letter0)) return true; return false; is false
1087 PASS var k = 0; while ((Zero<letter0)) if (k++) return true; return false; is false
1088 PASS var k = 0; for (; (Zero<letter0); ) if (k++) return true; return false; is false
1089 PASS return (Zero<=letter0); is true
1090 PASS if ((Zero<=letter0)) return true; return false; is true
1091 PASS var k = 0; while ((Zero<=letter0)) if (k++) return true; return false; is true
1092 PASS var k = 0; for (; (Zero<=letter0); ) if (k++) return true; return false; is true
1093 PASS return (Zero<letter0) || 1; is true
1094 PASS if ((Zero<letter0) || 1) return true; return false; is true
[all …]
Dcomparison-operators-greater-expected.txt749 PASS return (Zero>letter0); is false
750 PASS if ((Zero>letter0)) return true; return false; is false
751 PASS var k = 0; while ((Zero>letter0)) if (k++) return true; return false; is false
752 PASS var k = 0; for (; (Zero>letter0); ) if (k++) return true; return false; is false
753 PASS return (Zero>=letter0); is true
754 PASS if ((Zero>=letter0)) return true; return false; is true
755 PASS var k = 0; while ((Zero>=letter0)) if (k++) return true; return false; is true
756 PASS var k = 0; for (; (Zero>=letter0); ) if (k++) return true; return false; is true
757 PASS return (Zero>letter0) || 1; is true
758 PASS if ((Zero>letter0) || 1) return true; return false; is true
[all …]

12345678910>>...22