HomeSort by relevance Sort by last modified time
    Searched refs:kEpsilon (Results 1 - 14 of 14) sorted by null

  /external/ceres-solver/internal/ceres/
iterative_schur_complement_solver_test.cc 57 const double kEpsilon = 1e-14;
102 if (diff < kEpsilon) {
107 << " solution by " << diff << " which is more than " << kEpsilon;
partitioned_matrix_view_test.cc 47 const double kEpsilon = 1e-14;
100 EXPECT_NEAR(y1(i), y2(i), kEpsilon);
120 EXPECT_NEAR(y1(i), y2(i), kEpsilon);
141 kEpsilon);
155 EXPECT_NEAR(block_diagonal_ee->values()[0], 10.0, kEpsilon);
156 EXPECT_NEAR(block_diagonal_ee->values()[1], 155.0, kEpsilon);
168 EXPECT_NEAR(block_diagonal_ff->values()[0], 70.0, kEpsilon);
169 EXPECT_NEAR(block_diagonal_ff->values()[1], 17.0, kEpsilon);
170 EXPECT_NEAR(block_diagonal_ff->values()[2], 37.0, kEpsilon);
polynomial_test.cc 46 const double kEpsilon = 1e-13;
142 RunPolynomialTestRealRoots(roots, true, true, kEpsilon);
147 RunPolynomialTestRealRoots(roots, true, true, kEpsilon);
152 RunPolynomialTestRealRoots(roots, true, true, kEpsilon);
157 RunPolynomialTestRealRoots(roots, true, true, kEpsilon);
162 RunPolynomialTestRealRoots(roots, true, true, kEpsilon);
181 ExpectClose(real(0), 42.42, kEpsilon);
182 ExpectClose(real(1), 42.42, kEpsilon);
183 ExpectClose(std::abs(imag(0)), 4.2, kEpsilon);
184 ExpectClose(std::abs(imag(1)), 4.2, kEpsilon);
    [all...]
implicit_schur_complement_test.cc 53 const double kEpsilon = 1e-14;
144 if ((y - z).norm() > kEpsilon) {
153 if ((isc.rhs() - rhs).norm() > kEpsilon) {
168 if ((sol - reference_solution).norm() > kEpsilon) {
dogleg_strategy_test.cc 122 const double kEpsilon = std::numeric_limits<double>::epsilon();
148 EXPECT_LE(x_.norm(), options_.initial_radius * (1.0 + 4.0 * kEpsilon));
168 EXPECT_LE(x_.norm(), options_.initial_radius * (1.0 + 4.0 * kEpsilon));
  /frameworks/ml/bordeaux/learning/multiclass_pa/native/
multiclass_pa.h 27 const float kEpsilon = 1.0e-4;
multiclass_pa.cpp 121 twice_norm_square = kEpsilon;
154 twice_norm_square = kEpsilon;
  /external/ceres-solver/google3/
jet_traits.h 40 static const Type kEpsilon;
75 template<typename T, int N> const ceres::Jet<T, N> MathLimits<ceres::Jet<T, N> >::kEpsilon = ceres::Jet<T, N>(MathLimits<T>::kEpsilon); // NOLINT
  /art/runtime/base/
hash_set_test.cc 202 static constexpr double kEpsilon = 0.01;
207 EXPECT_GE(hash_set.CalculateLoadFactor() + kEpsilon, hash_set.GetMinLoadFactor());
208 EXPECT_LE(hash_set.CalculateLoadFactor() - kEpsilon, hash_set.GetMaxLoadFactor());
212 EXPECT_LE(hash_set.CalculateLoadFactor() - kEpsilon, hash_set.GetMaxLoadFactor());
214 EXPECT_LE(hash_set.CalculateLoadFactor() - kEpsilon, hash_set.GetMaxLoadFactor());
  /external/webrtc/webrtc/common_audio/resampler/
sinc_resampler_unittest.cc 142 static const double kEpsilon = 0.00000005;
152 EXPECT_NEAR(result2, result, kEpsilon);
161 EXPECT_NEAR(result2, result, kEpsilon);
  /external/piex/src/
piex.cc 489 const float kEpsilon = 0.9f;
502 kEpsilon ||
505 kEpsilon) {
  /external/v8/test/cctest/
cctest.h 544 const double kEpsilon = 1e-10;
545 CHECK_LE(expected, actual + kEpsilon);
546 CHECK_GE(expected, actual - kEpsilon);
  /external/v8/src/
counters.h 422 const double kEpsilon = 1e-6;
424 if (current_ms < last_ms_ + kEpsilon) {
430 if (end_ms <= current_ms + kEpsilon) {
436 for (i = 0; i < kMaxSamples && end_ms <= current_ms + kEpsilon; i++) {
460 aggregate_value_ = current_ms > start_ms_ + kEpsilon
    [all...]
  /external/libchrome/base/metrics/
field_trial.cc 62 const double kEpsilon = 1e-8;
64 static_cast<FieldTrial::Probability>(divisor * entropy_value + kEpsilon);

Completed in 294 milliseconds