Searched refs:trials (Results 1 - 8 of 8) sorted by relevance

/external/chromium_org/components/variations/
H A Dentropy_provider_unittest.cc137 // Number of buckets in the simulated field trials.
186 // Simply asserts that two trials using one-time randomization
194 scoped_refptr<base::FieldTrial> trials[] = { local
203 for (size_t i = 0; i < arraysize(trials); ++i) {
205 trials[i]->AppendGroup(std::string(), 1);
208 // The trials are most likely to give different results since they have
210 EXPECT_NE(trials[0]->group(), trials[1]->group());
211 EXPECT_NE(trials[0]->group_name(), trials[
224 scoped_refptr<base::FieldTrial> trials[] = { local
251 scoped_refptr<base::FieldTrial> trials[] = { local
[all...]
/external/chromium_org/third_party/smhasher/src/
H A DTypes.cpp71 int trials = 0; local
82 trials++;
145 printf("%d %d %d %d %d %d\n",trials,popfail,bitfail,matchfail,primefail,count);
H A DSpeedTest.cpp168 double SpeedTest ( pfHash hash, uint32_t seed, const int trials, const int blocksize, const int align ) argument
186 times.reserve(trials);
188 for(int itrial = 0; itrial < trials; itrial++)
213 const int trials = 2999; local
220 double cycles = SpeedTest(hash,seed,trials,blocksize,align);
233 const int trials = 999999; local
237 double cycles = SpeedTest(hash,seed,trials,keysize,0);
H A DDifferentialTest.h189 void DiffDistTest ( pfHash hash, const int diffbits, int trials, double & worst, double & avg ) argument
191 std::vector<keytype> keys(trials);
192 std::vector<hashtype> A(trials),B(trials);
194 for(int i = 0; i < trials; i++)
220 for(int i = 0; i < trials; i++)
/external/chromium_org/chrome/common/extensions/docs/examples/extensions/ttsdebug/
H A Dttsdebug.js8 var trials = 3; variable
55 trials: 3,
103 trials: 3,
138 trials: 3,
175 trials: 1,
219 trials: 1,
241 trials: 1,
263 trials: 1,
285 trials: 1,
400 trials
[all...]
/external/chromium_org/net/url_request/
H A Durl_request_throttler_simulation_unittest.cc667 VerboseOut(" Test result after %d trials.\n", num_runs);
695 Trial trials[] = { local
718 // If things don't converge by the time we've done 100K trials, then
721 for (size_t i = 0; i < ARRAYSIZE_UNSAFE(trials); ++i) {
723 ++trials[i].stats.num_runs;
725 trials[i].duration, trials[i].average_client_interval, false);
727 trials[i].duration, trials[i].average_client_interval, true);
730 trials[
[all...]
/external/valgrind/main/coregrind/
H A Dm_cache.c120 Int i, j, trials; local
136 trials = info[0] - 1; /* AL register - bits 0..7 of %eax */
139 if (0 != trials) {
140 VG_(debugLog)(1, "cache", "warning: non-zero CPUID trials for Intel "
141 "processor (%d)\n", trials);
/external/clang/tools/c-index-test/
H A Dc-index-test.c1506 int perform_test_reparse_source(int argc, const char **argv, int trials, argument
1560 for (trial = 0; trial < trials; ++trial) {
3978 " c-index-test -test-load-source-reparse <trials> <symbol filter> "
4045 int trials = atoi(argv[2]); local
4046 return perform_test_reparse_source(argc - 4, argv + 4, trials, argv[3], I,

Completed in 819 milliseconds