OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:trials
(Results
1 - 11
of
11
) sorted by null
/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/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
...]
/external/valgrind/coregrind/
m_cache.c
120
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
);
/frameworks/av/services/audioflinger/
test-resample.cpp
392
* it is better to run a few
trials
with a shorter loop limit,
407
const int
trials
= 4;
local
412
for (int n = 0; n <
trials
; ++n) {
423
time = diff_ns; // save the best out of our
trials
.
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_random.py
86
trials
= 10000 # large num prevents false negatives without slowing normal case
92
for i in xrange(
trials
):
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_random.py
86
trials
= 10000 # large num prevents false negatives without slowing normal case
92
for i in xrange(
trials
):
/external/vogar/lib/
caliper.jar
/external/clang/tools/c-index-test/
c-index-test.c
4110
int
trials
= atoi(argv[2]);
local
[
all
...]
/libcore/benchmarks/libs/
caliper.jar
Completed in 254 milliseconds