/external/apache-commons-math/src/main/java/org/apache/commons/math/distribution/ |
D | BinomialDistributionImpl.java | 51 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()
|
D | BinomialDistribution.java | 51 void setNumberOfTrials(int trials); in setNumberOfTrials() argument
|
/external/openssh/ |
D | moduli.c | 576 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()
|
D | moduli.0 | 50 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/ |
D | HashTestUtils.java | 288 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/ |
D | m_cache.c | 120 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/ |
D | caliper.jar | META-INF/
META-INF/MANIFEST.MF
com/
com/google/
com/ ... |
/external/clang/tools/c-index-test/ |
D | c-index-test.c | 1570 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/ |
D | solving.rst | 959 found within this number of trials, the line search will stop.
|
/external/guava/guava-tests/test/com/google/common/io/testdata/ |
D | alice_in_wonderland.txt | 3229 read in the newspapers, at the end of trials, "There was some
|
/external/icu/icu4j/main/shared/data/ |
D | Transliterator_Han_Latin_Definition.txt | 3734 患難 < trials\-and\-tribulations; 26724 患難 > trials\-and\-tribulations;
|