HomeSort by relevance Sort by last modified time
    Searched full:probability (Results 1 - 25 of 853) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/chromium_org/components/rappor/
rappor_parameters.h 12 enum Probability {
37 // The probability that a bit will be redacted with fake data.
38 Probability fake_prob;
39 // The probability that a fake bit will be a one.
40 Probability fake_one_prob;
42 // The probability that a one bit in the redacted data reports as one.
43 Probability one_coin_prob;
44 // The probability that a zero bit in the redacted data reports as one.
45 Probability zero_coin_prob;
rappor_metric_unittest.cc 19 PROBABILITY_75 /* Fake data probability */,
20 PROBABILITY_50 /* Fake one probability */,
21 PROBABILITY_75 /* One coin probability */,
22 PROBABILITY_50 /* Zero coin probability */};
28 PROBABILITY_75 /* Fake data probability */,
29 PROBABILITY_50 /* Fake one probability */,
30 PROBABILITY_75 /* One coin probability */,
31 PROBABILITY_50 /* Zero coin probability */};
77 // The probability of a true bit being true after redaction =
82 // The probability of a bit reporting true
    [all...]
rappor_service_unittest.cc 52 PROBABILITY_75 /* Fake data probability */,
53 PROBABILITY_50 /* Fake one probability */,
54 PROBABILITY_75 /* One coin probability */,
55 PROBABILITY_50 /* Zero coin probability */};
  /external/llvm/test/Analysis/BranchProbabilityInfo/
noreturn.ll 1 ; Test the static branch probability heuristics for no-return functions.
11 ; CHECK: edge entry -> exit probability is 1048575 / 1048576
12 ; CHECK: edge entry -> abort probability is 1 / 1048576
29 ; CHECK: edge entry -> exit probability is 1048575 / 1048579
30 ; CHECK: edge entry -> case_a probability is 1 / 1048579
31 ; CHECK: edge entry -> case_b probability is 1 / 1048579
32 ; CHECK: edge entry -> case_c probability is 1 / 1048579
33 ; CHECK: edge entry -> case_d probability is 1 / 1048579
58 ; CHECK: edge entry -> exit probability is 1048575 / 1048576
59 ; CHECK: edge entry -> dom probability is 1 / 104857
    [all...]
basic.ll 7 ; CHECK: edge entry -> body probability is 16 / 16 = 100%
18 ; CHECK: edge body -> exit probability is 4 / 128
19 ; CHECK: edge body -> body probability is 124 / 128
30 ; CHECK: edge entry -> then probability is 64 / 68
31 ; CHECK: edge entry -> else probability is 4 / 68
35 ; CHECK: edge then -> exit probability is 16 / 16 = 100%
39 ; CHECK: edge else -> exit probability is 16 / 16 = 100%
55 ; CHECK: edge entry -> case_a probability is 4 / 80
56 ; CHECK: edge entry -> case_b probability is 4 / 80
57 ; CHECK: edge entry -> case_c probability is 64 / 8
    [all...]
loop.ll 1 ; Test the static branch probability heuristics for no-return functions.
12 ; CHECK: edge entry -> do.body probability is 16 / 16 = 100%
18 ; CHECK: edge do.body -> do.body1 probability is 16 / 16 = 100%
26 ; CHECK: edge do.body1 -> do.body1 probability is 124 / 128
27 ; CHECK: edge do.body1 -> do.end probability is 4 / 128
34 ; CHECK: edge do.end -> do.body probability is 124 / 128
35 ; CHECK: edge do.end -> do.end5 probability is 4 / 128
46 ; CHECK: edge entry -> for.body.lr.ph probability is 20 / 32
47 ; CHECK: edge entry -> for.end6 probability is 12 / 32
52 ; CHECK: edge for.body.lr.ph -> for.body probability is 16 / 16 = 100
    [all...]
  /frameworks/base/cmds/interrupter/
interrupter.c 19 * The probability of a syscall failing from 0.0 to 1.0
21 #define PROBABILITY 0.9
41 static int probability = PROBABILITY * RAND_MAX; variable
44 if (rand() < probability) {
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/makedict/
WeightedString.java 24 * A string with a probability.
32 public WeightedString(final String word, final int probability) {
33 this(word, new ProbabilityInfo(probability));
46 public void setProbability(final int probability) {
47 mProbabilityInfo = new ProbabilityInfo(probability);
  /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/backward/v402/content/
probability_entry.h 46 ProbabilityEntry(const int flags, const int probability)
47 : mFlags(flags), mProbability(probability), mHistoricalInfo() {}
50 ProbabilityEntry(const int flags, const int probability,
52 : mFlags(flags), mProbability(probability), mHistoricalInfo(*historicalInfo) {}
54 const ProbabilityEntry createEntryWithUpdatedProbability(const int probability) const {
55 return ProbabilityEntry(mFlags, probability, &mHistoricalInfo);
bigram_entry.h 42 BigramEntry(const bool hasNext, const int probability, const int targetTerminalId)
43 : mHasNext(hasNext), mProbability(probability), mHistoricalInfo(),
47 BigramEntry(const bool hasNext, const int probability,
49 : mHasNext(hasNext), mProbability(probability), mHistoricalInfo(*historicalInfo),
64 const BigramEntry updateProbabilityAndGetEntry(const int probability) const {
65 return BigramEntry(mHasNext, probability, &mHistoricalInfo, mTargetTerminalId);
  /external/chromium_org/components/variations/
processed_study.h 18 // such as whether the study is expired and its total probability.
28 base::FieldTrial::Probability total_probability() const {
47 // Computed total group probability for the study.
48 base::FieldTrial::Probability total_probability_;
  /external/iptables/include/linux/netfilter/
xt_statistic.h 25 __u32 probability; member in struct:xt_statistic_info::__anon27226::__anon27227
  /external/kernel-headers/original/uapi/linux/netfilter/
xt_statistic.h 25 __u32 probability; member in struct:xt_statistic_info::__anon27853::__anon27854
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/sysroot/usr/include/linux/netfilter/
xt_statistic.h 25 __u32 probability; member in struct:xt_statistic_info::__anon46835::__anon46836
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/linux/netfilter/
xt_statistic.h 25 __u32 probability; member in struct:xt_statistic_info::__anon48571::__anon48572
  /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/v4/content/
bigram_entry.h 33 BigramEntry(const bool hasNext, const int probability, const int targetTerminalId)
34 : mHasNext(hasNext), mProbability(probability), mHistoricalInfo(),
38 BigramEntry(const bool hasNext, const int probability,
40 : mHasNext(hasNext), mProbability(probability), mHistoricalInfo(*historicalInfo),
55 const BigramEntry updateProbabilityAndGetEntry(const int probability) const {
56 return BigramEntry(mHasNext, probability, &mHistoricalInfo, mTargetTerminalId);
probability_entry.h 40 ProbabilityEntry(const int flags, const int probability)
41 : mFlags(flags), mProbability(probability), mHistoricalInfo() {}
44 ProbabilityEntry(const int flags, const int probability,
46 : mFlags(flags), mProbability(probability), mHistoricalInfo(*historicalInfo) {}
48 const ProbabilityEntry createEntryWithUpdatedProbability(const int probability) const {
49 return ProbabilityEntry(mFlags, probability, &mHistoricalInfo);
111 const int probability = readFromEncodedEntry(encodedEntry, local
113 return ProbabilityEntry(flags, probability);
  /packages/inputmethods/LatinIME/native/jni/tests/suggest/core/layout/
normal_distribution_2d_test.cpp 38 // The probability density of the point near the distribution center is larger than the
39 // probability density of the point that is far from distribution center.
42 // The probability density of the point shifted toward the direction that has larger standard
43 // deviation is larger than the probability density of the point shifted towards another
58 // The probability density of the rotated distribution at the point and the probability
  /external/llvm/include/llvm/CodeGen/
MachineBranchProbabilityInfo.h 1 //=- MachineBranchProbabilityInfo.h - Branch Probability Analysis -*- C++ -*-=//
62 // A 'Hot' edge is an edge which probability is >= 80%.
70 // Return a probability as a fraction between 0 (0% probability) and
71 // 1 (100% probability), however the value is never equal to 0, and can be 1
74 // Src. Querying sequentially for each successor's probability is a quadratic
79 // Print value between 0 (0% probability) and 1 (100% probability),
  /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/backward/v402/shortcut/
ver4_shortcut_list_policy.h 54 int probability = 0; local
56 outCodePoint, outCodePointCount, &probability, outHasNext, pos);
58 *outIsWhitelist = ShortcutListReadingUtils::isWhitelist(probability);
67 const int probability) {
76 return mShortcutDictContent->writeShortcutEntry(codePoints, codePointCount, probability,
90 codePointCount, probability, true /* hasNext */, &writingPos)) {
100 0 /* outCodePointCount */ , 0 /* probability */, &hasNext, entryPos);
102 codePointCount, probability, hasNext, entryPos)) {
  /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/structure/v4/shortcut/
ver4_shortcut_list_policy.h 44 int probability = 0; local
46 outCodePoint, outCodePointCount, &probability, outHasNext, pos);
48 *outIsWhitelist = ShortcutListReadingUtils::isWhitelist(probability);
57 const int probability) {
66 return mShortcutDictContent->writeShortcutEntry(codePoints, codePointCount, probability,
80 codePointCount, probability, true /* hasNext */, &writingPos)) {
90 0 /* outCodePointCount */ , 0 /* probability */, &hasNext, entryPos);
92 codePointCount, probability, hasNext, entryPos)) {
  /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/utils/
probability_utils.h 24 // TODO: Quit using bigram probability to indicate the delta.
30 // backoff weight, we divide the probability by 2, which in our storing format means
40 // the unigram probability to be the median value of the 17th step from the top. A value of
41 // 0 for the bigram probability represents the middle of the 16th step from the top,
  /external/chromium_org/third_party/webrtc/common_audio/vad/
vad_gmm.h 11 // Gaussian probability calculations internally used in vad_core.c.
18 // Calculates the probability for |input|, given that |input| comes from a
32 // (probability for |input|) =
  /external/libnl/include/netlink/
utils.h 23 * @name Probability Constants
28 * Lower probability limit
34 * Upper probability limit
  /external/webrtc/src/common_audio/vad/
vad_gmm.h 11 // Gaussian probability calculations internally used in vad_core.c.
18 // Calculates the probability for |input|, given that |input| comes from a
32 // (probability for |input|) =

Completed in 1112 milliseconds

1 2 3 4 5 6 7 8 91011>>