/external/caliper/caliper/src/test/java/com/google/caliper/runner/ |
InMemoryResultsUploader.java | 32 * 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);
|
CaliperTestWatcher.java | 108 ImmutableList<Trial> trials() { method in class:CaliperTestWatcher 109 return InMemoryResultsUploader.trials();
|
ArbitraryMeasurmentInstrumentTest.java | 45 Iterables.getOnlyElement(runner.trials()).measurements());
|
/external/fec/ |
rs_speedtest.c | 15 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);
|
sumsq_test.c | 29 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++){
|
vtest27.c | 40 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;tr++) [all...] |
vtest29.c | 40 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;tr++) [all...] |
vtest39.c | 40 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;tr++) [all...] |
dtest.c | 20 {"trials",0,NULL,'n'}, 28 int trials=1000,d; local 53 trials = atoi(optarg); 58 while(trials--){
|
vtest615.c | 42 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*framebits/extime) [all...] |
exercise.c | 41 int trials){ 55 while(trials-- != 0){
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/distribution/ |
BinomialDistribution.java | 34 * 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);
|
BinomialDistributionImpl.java | 38 /** 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) { 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 the new number of trials [all...] |
/external/caliper/caliper/src/main/java/com/google/caliper/options/ |
ParsedOptions.java | 122 // Trials 125 private int trials = 1; field in class:ParsedOptions 127 @Option({"-t", "--trials"}) 128 private void setTrials(int trials) throws InvalidCommandException { 129 dryRunIncompatible("trials"); 130 if (trials < 1) { 131 throw new InvalidCommandException("trials must be at least 1: " + trials); 133 this.trials = trials; [all...] |
/external/caliper/caliper/src/main/java/com/google/caliper/runner/ |
ExperimentingCaliperRun.java | 54 * An execution of each {@link Experiment} for the configured number of trials. 153 List<ScheduledTrial> trials = createScheduledTrials(experimentsToRun, totalTrials); local 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, 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 = Lists.newArrayListWithCapacity(totalTrials) local [all...] |
/libcore/ojluni/src/main/java/java/io/ |
PipedReader.java | 248 int trials = 2; local 254 if ((writeSide != null) && (!writeSide.isAlive()) && (--trials < 0)) {
|
PipedInputStream.java | 319 int trials = 2; local 325 if ((writeSide != null) && (!writeSide.isAlive()) && (--trials < 0)) {
|
/prebuilts/go/darwin-x86/src/math/cmplx/ |
sin.go | 47 // arithmetic domain # trials peak rms 69 // arithmetic domain # trials peak rms 93 // arithmetic domain # trials peak rms 113 // arithmetic domain # trials peak rms
|
asin.go | 44 // arithmetic domain # trials peak rms 89 // arithmetic domain # trials peak rms 134 // arithmetic domain # trials peak rms
|
tan.go | 53 // arithmetic domain # trials peak rms 79 // arithmetic domain # trials peak rms 171 // arithmetic domain # trials peak rms
|
/prebuilts/go/linux-x86/src/math/cmplx/ |
sin.go | 47 // arithmetic domain # trials peak rms 69 // arithmetic domain # trials peak rms 93 // arithmetic domain # trials peak rms 113 // arithmetic domain # trials peak rms
|
asin.go | 44 // arithmetic domain # trials peak rms 89 // arithmetic domain # trials peak rms 134 // arithmetic domain # trials peak rms
|
/device/linaro/hikey/wpan/uim/ |
uim.c | 475 int st_fd, err,trials; local 481 trials = 5; 502 while (trials > 0) { 506 if (trials == 3) 510 --trials;
|
/external/openssh/ |
moduli.c | 576 prime_test(FILE *in, FILE *out, u_int32_t trials, u_int32_t generator_wanted, 588 if (trials < TRIAL_MINIMUM) { 589 error("Minimum primality trials is %d", TRIAL_MINIMUM); 607 debug2("%.24s Final %u Miller-Rabin trials (%x generator)", 608 ctime(&time_start), trials, generator_wanted); 710 in_tries += trials; 712 in_tries = trials; 770 if (!BN_is_prime_ex(p, trials, ctx, NULL)) { 777 if (!BN_is_prime_ex(q, trials - 1, ctx, NULL)) {
|
/external/guava/guava-tests/test/com/google/common/hash/ |
HashTestUtils.java | 271 // likely number of trials to have proven no funneling 276 "determined after " + count + " trials."); 288 static void checkAvalanche(HashFunction function, int trials, double epsilon) { 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) { 385 // go through trials to compute probability 386 for (int j = 0; j < trials; j++) [all...] |