Searched refs:trials (Results 1 - 11 of 11) sorted by relevance
| /third_party/python/Tools/scripts/ |
| H A D | var_access_benchmark.py | 10 trials = [None] * 500 variable
26 def read_local(trials=trials):
28 for t in trials:
37 def inner(trials=trials):
38 for t in trials:
50 def read_global(trials=trials):
51 for t in trials
[all...] |
| /third_party/skia/third_party/externals/abseil-cpp/absl/random/ |
| H A D | bernoulli_distribution_test.cc | 60 // is very, very hard to measure, the improvements come as trials approach the in TEST_P()
64 size_t trials = para.second; in TEST_P() local
74 for (size_t i = 0; i < trials; ++i) { in TEST_P()
80 // large number of trials that the central limit theorem applies. in TEST_P()
81 const double stddev_p = std::sqrt((p * (1.0 - p)) / trials); in TEST_P()
82 const double expected = trials * p; in TEST_P()
83 const double stddev = trials * stddev_p; in TEST_P()
91 // There must be many more trials to make the mean approximately normal for `p`
|
| H A D | zipf_distribution_test.cc | 227 size_t trials = 10000; in TEST_P() local
261 trials = static_cast<size_t>(8.0 / min_p); in TEST_P()
271 for (size_t i = 0; i < trials; i++) { in TEST_P()
280 avg = avg / static_cast<double>(trials); in TEST_P()
285 e *= trials; in TEST_P()
311 ABSL_INTERNAL_LOG(INFO, absl::StrCat("trials ", trials)); in TEST_P()
|
| H A D | log_uniform_int_distribution_test.cc | 156 const size_t trials = 15 + (max_bucket + 1) * 10; in ChiSquaredTestImpl() local
161 for (size_t i = 0; i < trials; ++i) { in ChiSquaredTestImpl()
175 const double expected = trials / static_cast<double>(buckets.size()); in ChiSquaredTestImpl()
190 absl::StrFormat("trials=%d\n" in ChiSquaredTestImpl()
193 trials, kChiSquared, dof, chi_square, p, in ChiSquaredTestImpl()
|
| H A D | gaussian_distribution_test.cc | 182 int trials; // Z-Test trials.
320 std::max(1, static_cast<int>(std::ceil(param.trials * param.p_fail)));
322 param.p_fail, param.trials);
325 for (int i = 0; i < param.trials; i++) {
|
| H A D | exponential_distribution_test.cc | 180 int trials;
295 std::max(1, static_cast<int>(std::ceil(param.trials * param.p_fail)));
297 param.p_fail, param.trials);
300 for (int i = 0; i < param.trials; i++) {
|
| H A D | poisson_distribution_test.cc | 247 int trials; // Z-Test trials. member
306 std::max(1, static_cast<int>(std::ceil(param.trials * param.p_fail))); in TEST_P()
308 param.p_fail, param.trials); in TEST_P()
311 for (int i = 0; i < param.trials; i++) { in TEST_P()
|
| /third_party/node/deps/v8/tools/clusterfuzz/trials/ |
| H A D | PRESUBMIT.py | 23 trials = json.load(j)
24 for trial in trials:
|
| /third_party/qrcodegen/c/ |
| H A D | qrcodegen-test.c | 507 long trials = 100000; in testGetSetModuleRandomly() local
508 for (long i = 0; i < trials; i++) { in testGetSetModuleRandomly()
|
| /third_party/python/Lib/test/ |
| H A D | test_random.py | 150 trials = 10000 # large num prevents false negatives without slowing normal case
154 for i in range(trials):
|
| /third_party/typescript/tests/baselines/reference/ |
| H A D | parserharness.js | 71 trials: number[];
670 trials: b.results[prop].data
2644 trials: b.results[prop].data
|
Completed in 12 milliseconds