Searched defs:trials (Results 1 - 18 of 18) sorted by relevance

/external/caliper/caliper/src/test/java/com/google/caliper/runner/
H A DInMemoryResultsUploader.java32 * A {@link ResultProcessor} that collects all trials in a static list for easy inspection by tests.
35 static ImmutableList<Trial> trials() { method in class:InMemoryResultsUploader
36 return ImmutableList.copyOf(trials);
39 private static List<Trial> trials; field in class:InMemoryResultsUploader
43 trials = Lists.newArrayList();
53 trials.add(trial);
H A DCaliperTestWatcher.java108 ImmutableList<Trial> trials() { method in class:CaliperTestWatcher
109 return InMemoryResultsUploader.trials();
/external/fec/
H A Drs_speedtest.c15 int trials = 10000; local
24 for(i=0;i<trials;i++){
34 printf("Execution time for %d Reed-Solomon blocks using general decoder: %.2f sec\n",trials,extime);
35 printf("decoder speed: %g bits/s\n",trials*223*8/extime);
40 for(i=0;i<trials;i++){
49 printf("Execution time for %d Reed-Solomon blocks using CCSDS decoder: %.2f sec\n",trials,extime);
50 printf("decoder speed: %g bits/s\n",trials*223*8/extime);
H A Ddtest.c20 {"trials",0,NULL,'n'},
28 int trials=1000,d; local
53 trials = atoi(optarg);
58 while(trials--){
H A Dexercise.c41 int trials){
55 while(trials-- != 0){
37 EXERCISE( void *p, int trials) argument
H A Dsumsq_test.c29 int i,d,trial,trials=10000; local
64 trials = atoi(optarg);
77 for(trial=0;trial<trials;trial++){
81 for(trial=0;trial<trials;trial++){
H A Dvtest27.c40 int sr=0,trials = 10000,errcnt,framebits=2048; local
82 trials = atoi(optarg);
111 printf("nframes = %d framesize = %d ebn0 = %.2f dB gain = %g\n",trials,framebits,ebn0,Gain);
113 for(tr=0;tr<trials;tr++){
154 printf("nframes = %d framesize = %d ebn0 = %.2f dB gain = %g\n",trials,framebits,ebn0,Gain);
157 tot_errs,(long long)framebits*trials,tot_errs/((double)framebits*trials),
163 /* Do time trials */
165 printf("Starting time trials\n");
167 for(tr=0;tr < trials;t
[all...]
H A Dvtest29.c40 int sr=0,trials = 10000,errcnt,framebits=2048; local
82 trials = atoi(optarg);
111 printf("nframes = %d framesize = %d ebn0 = %.2f dB gain = %g\n",trials,framebits,ebn0,Gain);
113 for(tr=0;tr<trials;tr++){
154 printf("nframes = %d framesize = %d ebn0 = %.2f dB gain = %g\n",trials,framebits,ebn0,Gain);
157 tot_errs,(long long)framebits*trials,tot_errs/((double)framebits*trials),
162 /* Do time trials */
164 printf("Starting time trials\n");
166 for(tr=0;tr < trials;t
[all...]
H A Dvtest39.c40 int sr=0,trials = 10000,errcnt,framebits=2048; local
82 trials = atoi(optarg);
111 printf("nframes = %d framesize = %d ebn0 = %.2f dB gain = %g\n",trials,framebits,ebn0,Gain);
113 for(tr=0;tr<trials;tr++){
155 printf("nframes = %d framesize = %d ebn0 = %.2f dB gain = %g\n",trials,framebits,ebn0,Gain);
158 tot_errs,(long long)framebits*trials,tot_errs/((double)framebits*trials),
163 /* Do time trials */
165 printf("Starting time trials\n");
167 for(tr=0;tr < trials;t
[all...]
H A Dvtest615.c42 int sr=0,trials = 10,errcnt,framebits=2048; local
84 trials = atoi(optarg);
113 printf("nframes = %d framesize = %d ebn0 = %.2f dB gain = %g\n",trials,framebits,ebn0,Gain);
115 for(tr=0;tr<trials;tr++){
162 printf("nframes = %d framesize = %d ebn0 = %.2f dB gain = %g\n",trials,framebits,ebn0,Gain);
170 /* Do time trials */
172 printf("Starting time trials\n");
174 for(tr=0;tr < trials;tr++){
186 printf("Execution time for %d %d-bit frames: %.2f sec\n",trials,
188 printf("decoder speed: %g bits/s\n",trials*framebit
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/distribution/
H A DBinomialDistribution.java34 * Access the number of trials for this distribution.
35 * @return the number of trials.
46 * Change the number of trials for this distribution.
47 * @param trials the new number of trials.
51 void setNumberOfTrials(int trials); argument
H A DBinomialDistributionImpl.java38 /** The number of trials. */
45 * Create a binomial distribution with the given number of trials and
48 * @param trials the number of trials.
51 public BinomialDistributionImpl(int trials, double p) { argument
53 setNumberOfTrialsInternal(trials);
58 * Access the number of trials for this distribution.
60 * @return the number of trials.
76 * Change the number of trials for this distribution.
78 * @param trials th
84 setNumberOfTrials(int trials) argument
95 setNumberOfTrialsInternal(int trials) argument
[all...]
/external/caliper/caliper/src/main/java/com/google/caliper/runner/
H A DExperimentingCaliperRun.java54 * An execution of each {@link Experiment} for the configured number of trials.
153 List<ScheduledTrial> trials = createScheduledTrials(experimentsToRun, totalTrials);
156 List<ListenableFuture<TrialResult>> pendingTrials = scheduleTrials(trials, executor);
200 * Schedule all the trials.
202 * <p>This method arranges all the {@link ScheduledTrial trials} to run according to their
205 private List<ListenableFuture<TrialResult>> scheduleTrials(List<ScheduledTrial> trials, argument
209 for (final ScheduledTrial scheduledTrial : trials) {
220 // each of these trials can only start after all prior trials have finished, so we use
240 List<ScheduledTrial> trials
[all...]
/external/caliper/caliper/src/main/java/com/google/caliper/options/
H A DParsedOptions.java125 private int trials = 1; field in class:ParsedOptions
127 @Option({"-t", "--trials"})
128 private void setTrials(int trials) throws InvalidCommandException { argument
129 dryRunIncompatible("trials");
130 if (trials < 1) {
131 throw new InvalidCommandException("trials must be at least 1: " + trials);
133 this.trials = trials;
137 return trials;
[all...]
/external/guava/guava-tests/test/com/google/common/hash/
H A DHashTestUtils.java271 // likely number of trials to have proven no funneling
276 "determined after " + count + " trials.");
288 static void checkAvalanche(HashFunction function, int trials, double epsilon) { argument
295 // go through trials to compute probability
296 for (int j = 0; j < trials; j++) {
358 // likely number of trials to have proven 2-bit candidate
364 "determined after " + count + " trials");
375 static void check2BitAvalanche(HashFunction function, int trials, double epsilon) { argument
385 // go through trials to compute probability
386 for (int j = 0; j < trials;
478 assertShortcutsAreEquivalent(HashFunction hashFunction, int trials) argument
[all...]
/external/opencv3/modules/core/src/
H A Dkmeans.cpp102 int K, RNG& rng, int trials)
126 for( j = 0; j < trials; j++ )
101 generateCentersPP(const Mat& _data, Mat& _out_centers, int K, RNG& rng, int trials) argument
/external/valgrind/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.c1632 int perform_test_reparse_source(int argc, const char **argv, int trials, argument
1686 for (trial = 0; trial < trials; ++trial) {
4105 " c-index-test -test-load-source-reparse <trials> <symbol filter> "
4173 int trials = atoi(argv[2]); local
4174 return perform_test_reparse_source(argc - 4, argv + 4, trials, argv[3], I,

Completed in 478 milliseconds