HomeSort by relevance Sort by last modified time
    Searched defs:prob (Results 1 - 25 of 71) sorted by null

1 2 3

  /external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.discrete/
eval.pass.cpp 38 std::vector<double> prob = d.probabilities(); local
40 assert((double)u[i]/N == prob[i]);
56 std::vector<double> prob = d.probabilities(); local
58 assert((double)u[i]/N == prob[i]);
74 std::vector<double> prob = d.probabilities(); local
76 assert(std::abs((double)u[i]/N - prob[i]) / prob[i] < 0.001);
92 std::vector<double> prob = d.probabilities();
93 assert((double)u[0]/N == prob[0]);
94 assert((double)u[1]/N == prob[1])
    [all...]
eval_param.pass.cpp 41 std::vector<double> prob = p.probabilities(); local
43 assert(std::abs((double)u[i]/N - prob[i]) / prob[i] < 0.001);
  /external/libvpx/libvpx/vp9/encoder/
vp9_cost.c 41 const vpx_prob prob = probs[i / 2]; local
44 assert(prob != 0);
46 const int cc = c + vp9_cost_bit(prob, b);
vp9_tokenize.h 57 const vpx_prob *prob; member in struct:__anon24830
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.discrete/
eval.pass.cpp 36 std::vector<double> prob = d.probabilities(); local
38 assert((double)u[i]/N == prob[i]);
54 std::vector<double> prob = d.probabilities(); local
56 assert((double)u[i]/N == prob[i]);
72 std::vector<double> prob = d.probabilities(); local
74 assert(std::abs((double)u[i]/N - prob[i]) / prob[i] < 0.001);
90 std::vector<double> prob = d.probabilities();
91 assert((double)u[0]/N == prob[0]);
92 assert((double)u[1]/N == prob[1])
    [all...]
eval_param.pass.cpp 39 std::vector<double> prob = p.probabilities(); local
41 assert(std::abs((double)u[i]/N - prob[i]) / prob[i] < 0.001);
  /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.discrete/
eval.pass.cpp 38 std::vector<double> prob = d.probabilities(); local
40 assert((double)u[i]/N == prob[i]);
56 std::vector<double> prob = d.probabilities(); local
58 assert((double)u[i]/N == prob[i]);
74 std::vector<double> prob = d.probabilities(); local
76 assert(std::abs((double)u[i]/N - prob[i]) / prob[i] < 0.001);
92 std::vector<double> prob = d.probabilities();
93 assert((double)u[0]/N == prob[0]);
94 assert((double)u[1]/N == prob[1])
    [all...]
eval_param.pass.cpp 41 std::vector<double> prob = p.probabilities(); local
43 assert(std::abs((double)u[i]/N - prob[i]) / prob[i] < 0.001);
  /external/libvpx/libvpx/vp8/common/
entropymv.h 40 vp8_prob prob[MVPcount]; /* often come in row, col pairs */ member in struct:mv_context
entropy.h 45 const vp8_prob *prob; member in struct:__anon24667
  /external/webp/src/enc/
cost_enc.h 34 ProbaArray* prob; member in struct:VP8Residual
  /external/lzma/Java/Tukaani/src/org/tukaani/xz/rangecoder/
RangeDecoder.java 25 int prob = probs[index]; local
26 int bound = (range >>> BIT_MODEL_TOTAL_BITS) * prob;
33 prob + ((BIT_MODEL_TOTAL - prob) >>> MOVE_BITS));
38 probs[index] = (short)(prob - (prob >>> MOVE_BITS));
RangeEncoder.java 105 int prob = probs[index]; local
106 int bound = (range >>> BIT_MODEL_TOTAL_BITS) * prob;
112 prob + ((BIT_MODEL_TOTAL - prob) >>> MOVE_BITS));
116 probs[index] = (short)(prob - (prob >>> MOVE_BITS));
125 public static int getBitPrice(int prob, int bit) {
128 return prices[(prob ^ ((-bit) & (BIT_MODEL_TOTAL - 1)))
  /external/libvpx/libvpx/vpx_dsp/
prob.h 72 const vpx_prob prob = get_binary_prob(ct[0], ct[1]); local
75 return weighted_prob(pre_prob, prob, factor);
92 const vpx_prob prob = get_prob(ct[0], den); local
93 return weighted_prob(pre_prob, prob, factor);
  /external/lzma/C/
Bcj2.c 16 #define _IF_BIT_0 ttt = *prob; bound = (p->range >> kNumModelBits) * ttt; if (p->code < bound)
17 #define _UPDATE_0 p->range = bound; *prob = (CProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits));
18 #define _UPDATE_1 p->range -= bound; p->code -= bound; *prob = (CProb)(ttt - (ttt >> kNumMoveBits));
188 CProb *prob; local
198 prob = p->probs + (unsigned)(b == 0xE8 ? 2 + (unsigned)prev : (b == 0xE9 ? 1 : 0));
Ppmd7Dec.c 124 UInt16 *prob = Ppmd7_GetBinSumm(p); local
125 if (rc->DecodeBit(rc, *prob) == 0)
128 *prob = (UInt16)PPMD_UPDATE_PROB_0(*prob);
133 *prob = (UInt16)PPMD_UPDATE_PROB_1(*prob);
134 p->InitEsc = PPMD7_kExpEscape[*prob >> 10];
Ppmd7Enc.c 119 UInt16 *prob = Ppmd7_GetBinSumm(p); local
123 RangeEnc_EncodeBit_0(rc, *prob);
124 *prob = (UInt16)PPMD_UPDATE_PROB_0(*prob);
131 RangeEnc_EncodeBit_1(rc, *prob);
132 *prob = (UInt16)PPMD_UPDATE_PROB_1(*prob);
133 p->InitEsc = PPMD7_kExpEscape[*prob >> 10];
Bcj2Enc.c 189 CProb *prob = p->probs + (unsigned)(b == 0xE8 ? 2 + (unsigned)context : (b == 0xE9 ? 1 : 0)); local
191 ttt = *prob;
197 *prob = (CProb)(ttt + ((kBitModelTotal - ttt) >> kNumMoveBits));
205 *prob = (CProb)(ttt - (ttt >> kNumMoveBits));
  /external/lzma/Java/SevenZip/Compression/RangeCoder/
Decoder.java 56 int prob = probs[index]; local
57 int newBound = (Range >>> kNumBitModelTotalBits) * prob;
61 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits));
73 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits));
Encoder.java 104 int prob = probs[index]; local
105 int newBound = (Range >>> kNumBitModelTotalBits) * prob;
109 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits));
115 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits));
139 static public int GetPrice(int Prob, int symbol)
141 return ProbPrices[(((Prob - symbol) ^ ((-symbol))) & (kBitModelTotal - 1)) >>> kNumMoveReducingBits];
143 static public int GetPrice0(int Prob)
145 return ProbPrices[Prob >>> kNumMoveReducingBits];
    [all...]
  /external/webp/src/dec/
tree_dec.c 319 const uint8_t* const prob = kBModesProba[top[x]][ymode]; local
322 int i = kYModesIntra4[VP8GetBit(br, prob[0])];
324 i = kYModesIntra4[2 * i + VP8GetBit(br, prob[i])];
329 ymode = !VP8GetBit(br, prob[0]) ? B_DC_PRED :
330 !VP8GetBit(br, prob[1]) ? B_TM_PRED :
331 !VP8GetBit(br, prob[2]) ? B_VE_PRED :
332 !VP8GetBit(br, prob[3]) ?
333 (!VP8GetBit(br, prob[4]) ? B_HE_PRED :
334 (!VP8GetBit(br, prob[5]) ? B_RD_PRED : B_VR_PRED)) :
335 (!VP8GetBit(br, prob[6]) ? B_LD_PRED
    [all...]
  /external/guava/guava-tests/benchmark/com/google/common/base/
CharMatcherBenchmark.java 169 int r = prob.length - 1;
170 int c = prob.length / 2;
171 int lv = prob[l];
172 int rv = prob[r];
173 int cv = prob[c];
186 cv = prob[c];
193 cv = prob[c];
199 private static int[] prob; field in class:CharMatcherBenchmark.CharSamples
202 prob = new int[10003];
    [all...]
  /external/libvpx/libvpx/vp9/decoder/
vp9_detokenize.c 32 static INLINE int read_bool(vpx_reader *r, int prob, BD_VALUE *value,
34 const unsigned int split = (*range * prob + (256 - prob)) >> CHAR_BIT;
85 const vpx_prob *prob; local
120 prob = coef_probs[band][ctx];
122 if (!read_bool(r, prob[EOB_CONTEXT_NODE], &value, &count, &range)) {
127 while (!read_bool(r, prob[ZERO_CONTEXT_NODE], &value, &count, &range)) {
140 prob = coef_probs[band][ctx];
143 if (read_bool(r, prob[ONE_CONTEXT_NODE], &value, &count, &range)) {
144 const vpx_prob *p = vp9_pareto8_full[prob[PIVOT_NODE] - 1]
    [all...]
  /external/v4l2_codec2/vda/
vp8_parser.cc 25 #define BD_READ_BOOL_WITH_PROB_OR_RETURN(out, prob) \
27 if (!bd_.ReadBool(out, prob)) \
813 uint8_t prob; local
814 BD_READ_UNSIGNED_OR_RETURN(7, &prob);
815 ehdr->mv_probs[mv_ctx][p] = prob ? (prob << 1) : 1;
  /external/libvpx/libvpx/vp8/decoder/
decodemv.c 100 const vp8_prob *up = vp8_mv_update_probs[i].prob;
180 const vp8_prob *prob; local
182 prob = vp8_sub_mv_ref_prob3[(aez << 2) | (lez << 1) | (lea)];
184 return prob;
215 const vp8_prob *prob; local
240 prob = get_sub_mv_ref_prob(leftmv.as_int, abovemv.as_int);
242 if (vp8_read(bc, prob[0])) {
243 if (vp8_read(bc, prob[1])) {
245 if (vp8_read(bc, prob[2])) {

Completed in 870 milliseconds

1 2 3