Home
last modified time | relevance | path

Searched refs:trials (Results 1 – 11 of 11) sorted by relevance

/external/apache-commons-math/src/main/java/org/apache/commons/math/distribution/
DBinomialDistributionImpl.java51 public BinomialDistributionImpl(int trials, double p) { in BinomialDistributionImpl() argument
53 setNumberOfTrialsInternal(trials); in BinomialDistributionImpl()
84 public void setNumberOfTrials(int trials) { in setNumberOfTrials() argument
85 setNumberOfTrialsInternal(trials); in setNumberOfTrials()
95 private void setNumberOfTrialsInternal(int trials) { in setNumberOfTrialsInternal() argument
96 if (trials < 0) { in setNumberOfTrialsInternal()
98 LocalizedFormats.NEGATIVE_NUMBER_OF_TRIALS, trials); in setNumberOfTrialsInternal()
100 numberOfTrials = trials; in setNumberOfTrialsInternal()
DBinomialDistribution.java51 void setNumberOfTrials(int trials); in setNumberOfTrials() argument
/external/openssh/
Dmoduli.c576 prime_test(FILE *in, FILE *out, u_int32_t trials, u_int32_t generator_wanted, in prime_test() argument
588 if (trials < TRIAL_MINIMUM) { in prime_test()
608 ctime(&time_start), trials, generator_wanted); in prime_test()
710 in_tries += trials; in prime_test()
712 in_tries = trials; in prime_test()
770 if (!BN_is_prime_ex(p, trials, ctx, NULL)) { in prime_test()
777 if (!BN_is_prime_ex(q, trials - 1, ctx, NULL)) { in prime_test()
Dmoduli.050 trials Decimal number indicating the number of primality
51 trials that have been performed on the modulus.
/external/guava/guava-tests/test/com/google/common/hash/
DHashTestUtils.java288 static void checkAvalanche(HashFunction function, int trials, double epsilon) { in checkAvalanche() argument
296 for (int j = 0; j < trials; j++) { in checkAvalanche()
375 static void check2BitAvalanche(HashFunction function, int trials, double epsilon) { in check2BitAvalanche() argument
386 for (int j = 0; j < trials; j++) { in check2BitAvalanche()
478 private static void assertShortcutsAreEquivalent(HashFunction hashFunction, int trials) { in assertShortcutsAreEquivalent() argument
480 for (int i = 0; i < trials; i++) { in assertShortcutsAreEquivalent()
/external/valgrind/coregrind/
Dm_cache.c120 Int i, j, trials; in Intel_cache_info() local
136 trials = info[0] - 1; /* AL register - bits 0..7 of %eax */ in Intel_cache_info()
139 if (0 != trials) { in Intel_cache_info()
141 "processor (%d)\n", trials); in Intel_cache_info()
/external/vogar/lib/
Dcaliper.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/ ...
/external/clang/tools/c-index-test/
Dc-index-test.c1570 int perform_test_reparse_source(int argc, const char **argv, int trials, in perform_test_reparse_source() argument
1624 for (trial = 0; trial < trials; ++trial) { in perform_test_reparse_source()
4110 int trials = atoi(argv[2]); in cindextest_main() local
4111 return perform_test_reparse_source(argc - 4, argv + 4, trials, argv[3], I, in cindextest_main()
/external/ceres-solver/docs/source/
Dsolving.rst959 found within this number of trials, the line search will stop.
/external/guava/guava-tests/test/com/google/common/io/testdata/
Dalice_in_wonderland.txt3229 read in the newspapers, at the end of trials, "There was some
/external/icu/icu4j/main/shared/data/
DTransliterator_Han_Latin_Definition.txt3734 患難 < trials\-and\-tribulations;
26724 患難 > trials\-and\-tribulations;