/external/libvpx/libvpx/vp9/encoder/ |
vp9_treewriter.c | 15 const vp9_prob prob = probs[i / 2]; local 19 const int cc = c + vp9_cost_bit(prob, b);
|
/ndk/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);
|
/external/libvpx/libvpx/vp8/common/ |
entropymv.h | 39 vp8_prob prob[MVPcount]; /* often come in row, col pairs */ member in struct:mv_context
|
entropy.h | 43 const vp8_prob *prob; member in struct:__anon21207
|
/external/libvpx/libvpx/vp9/common/ |
vp9_treecoder.h | 86 const vp9_prob prob = get_binary_prob(ct[0], ct[1]); local 89 return weighted_prob(pre_prob, prob, factor);
|
vp9_entropy.h | 55 const vp9_prob *prob; member in struct:__anon21265
|
/external/lzma/C/ |
Ppmd7Dec.c | 122 UInt16 *prob = Ppmd7_GetBinSumm(p);
local 123 if (rc->DecodeBit(rc, *prob) == 0)
126 *prob = (UInt16)PPMD_UPDATE_PROB_0(*prob);
131 *prob = (UInt16)PPMD_UPDATE_PROB_1(*prob);
132 p->InitEsc = PPMD7_kExpEscape[*prob >> 10];
|
Ppmd7Enc.c | 117 UInt16 *prob = Ppmd7_GetBinSumm(p);
local 121 RangeEnc_EncodeBit_0(rc, *prob);
122 *prob = (UInt16)PPMD_UPDATE_PROB_0(*prob);
129 RangeEnc_EncodeBit_1(rc, *prob);
130 *prob = (UInt16)PPMD_UPDATE_PROB_1(*prob);
131 p->InitEsc = PPMD7_kExpEscape[*prob >> 10];
|
Bcj2.c | 61 CProb *prob;
local 85 prob = p + prevByte;
87 prob = p + 256;
89 prob = p + 257;
91 IF_BIT_0(prob)
93 UPDATE_0(prob)
100 UPDATE_1(prob)
|
LzmaDec.c | 155 CLzmaProb *prob;
local 160 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
161 IF_BIT_0(prob)
164 UPDATE_0(prob);
165 prob = probs + Literal;
167 prob += (LZMA_LIT_SIZE * (((processedPos & lpMask) << lc) +
174 do { GET_BIT(prob + symbol, symbol) } while (symbol < 0x100);
188 probLit = prob + offs + bit + symbol;
199 UPDATE_1(prob);
200 prob = probs + IsRep + state; 497 CLzmaProb *prob; local 509 prob = probs + Literal; local [all...] |
/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/chromium_org/third_party/libwebp/dec/ |
tree.c | 358 const uint8_t* const prob = kBModesProba[top[x]][ymode]; local 363 i = kYModesIntra4[2 * i + VP8GetBit(br, prob[i])]; 368 ymode = !VP8GetBit(br, prob[0]) ? B_DC_PRED : 369 !VP8GetBit(br, prob[1]) ? B_TM_PRED : 370 !VP8GetBit(br, prob[2]) ? B_VE_PRED : 371 !VP8GetBit(br, prob[3]) ? 372 (!VP8GetBit(br, prob[4]) ? B_HE_PRED : 373 (!VP8GetBit(br, prob[5]) ? B_RD_PRED : B_VR_PRED)) : 374 (!VP8GetBit(br, prob[6]) ? B_LD_PRED : 375 (!VP8GetBit(br, prob[7]) ? B_VL_PRED [all...] |
/external/chromium_org/third_party/lzma_sdk/ |
Bcj2.c | 61 CProb *prob; local 85 prob = p + prevByte; 87 prob = p + 256; 89 prob = p + 257; 91 IF_BIT_0(prob) 93 UPDATE_0(prob) 100 UPDATE_1(prob)
|
LzmaDec.c | 155 CLzmaProb *prob; local 160 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState; 161 IF_BIT_0(prob) 164 UPDATE_0(prob); 165 prob = probs + Literal; 167 prob += (LZMA_LIT_SIZE * (((processedPos & lpMask) << lc) + 174 do { GET_BIT(prob + symbol, symbol) } while (symbol < 0x100); 188 probLit = prob + offs + bit + symbol; 199 UPDATE_1(prob); 200 prob = probs + IsRep + state 497 CLzmaProb *prob; local 509 prob = probs + Literal; local [all...] |
/external/webp/src/dec/ |
tree.c | 358 const uint8_t* const prob = kBModesProba[top[x]][ymode]; local 363 i = kYModesIntra4[2 * i + VP8GetBit(br, prob[i])]; 368 ymode = !VP8GetBit(br, prob[0]) ? B_DC_PRED : 369 !VP8GetBit(br, prob[1]) ? B_TM_PRED : 370 !VP8GetBit(br, prob[2]) ? B_VE_PRED : 371 !VP8GetBit(br, prob[3]) ? 372 (!VP8GetBit(br, prob[4]) ? B_HE_PRED : 373 (!VP8GetBit(br, prob[5]) ? B_RD_PRED : B_VR_PRED)) : 374 (!VP8GetBit(br, prob[6]) ? B_LD_PRED : 375 (!VP8GetBit(br, prob[7]) ? B_VL_PRED [all...] |
/external/libvpx/libvpx/vp9/decoder/ |
vp9_detokenize.c | 87 #define ADJUST_COEF(prob, bits_count) \ 89 val += (vp9_read(r, prob) << bits_count); \ 105 const vp9_prob *prob; local 120 prob = coef_probs[band][pt]; 123 if (!vp9_read(r, prob[EOB_CONTEXT_NODE])) 133 prob = coef_probs[band][pt]; 136 if (!vp9_read(r, prob[ZERO_CONTEXT_NODE])) { 144 if (!vp9_read(r, prob[ONE_CONTEXT_NODE])) { 153 prob = coef_probs_full[band][pt]; 155 if (!vp9_read(r, prob[LOW_VAL_CONTEXT_NODE])) [all...] |
/external/libvpx/libvpx/vp8/decoder/ |
decodemv.c | 124 const vp8_prob *up = vp8_mv_update_probs[i].prob; 221 const vp8_prob * prob; local 223 prob = vp8_sub_mv_ref_prob3[(aez << 2) | 227 return prob; 261 const vp8_prob *prob; local 286 prob = get_sub_mv_ref_prob(leftmv.as_int, abovemv.as_int); 288 if( vp8_read(bc, prob[0]) ) 290 if( vp8_read(bc, prob[1]) ) 293 if( vp8_read(bc, prob[2]) )
|
/external/opencv/ml/src/ |
mlem.cpp | 369 CvMat prob = cvMat( 1, nclusters, CV_64F ); local 376 prob.data.ptr = probs->data.ptr + probs->step*i; 378 labels->data.i[i*lstep] = cvRound(predict(&sample, &prob)); 414 CvMat prob; local 415 cvGetRow( params.probs, &prob, i ); 416 cvMaxS( &prob, 0., &prob ); 417 cvMinMaxLoc( &prob, 0, &maxval ); 419 cvSet( &prob, cvScalar(1./nclusters) ); 421 cvNormalize( &prob, &prob, 1., 0, CV_L1 ) [all...] |
ml_inner_functions.cpp | 1854 double prob, maxprob, sum; local 1930 double prob; local [all...] |
/external/openfst/src/include/fst/ |
randgen.h | 459 double prob = static_cast<double>(count)/rstate.nsamples; local 463 Weight weight = weighted_ ? to_weight_(-log(prob)) : Weight::One(); 473 to_weight_(-log(prob)) : to_weight_(-log(prob * npath_));
|
/external/chromium_org/third_party/libwebp/enc/ |
frame.c | 37 ProbaArray* prob; member in struct:__anon12118 263 res->prob = enc->proba_.coeffs_[coeff_type]; 287 // should be prob[VP8EncBands[n]], but it's equivalent for n=0 or 1 288 int p0 = res->prob[n][ctx0][0]; 311 p0 = res->prob[b][ctx][0]; 324 const int last_p0 = res->prob[b][ctx][0]; 398 // should be prob[VP8EncBands[n]], but it's equivalent for n=0 or 1 399 const uint8_t* p = res->prob[n][ctx]; 409 p = res->prob[VP8EncBands[n]][0]; 413 p = res->prob[VP8EncBands[n]][1] [all...] |
/external/chromium_org/third_party/ots/third_party/lzma_sdk/ |
LzmaDec.c | 156 CLzmaProb *prob; local 161 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState; 162 IF_BIT_0(prob) 165 UPDATE_0(prob); 166 prob = probs + Literal; 168 prob += (LZMA_LIT_SIZE * (((processedPos & lpMask) << lc) + 175 do { GET_BIT(prob + symbol, symbol) } while (symbol < 0x100); 189 probLit = prob + offs + bit + symbol; 200 UPDATE_1(prob); 201 prob = probs + IsRep + state 498 CLzmaProb *prob; local 510 prob = probs + Literal; local [all...] |
/external/opencv/cvaux/src/ |
cvhmm.cpp | 522 double prob; 524 prob = -log_var_val; 529 prob = prob - tmp * tmp; 531 //prob *= 0.5f; 533 return (float)prob; 561 double prob, l_prob; 563 prob = 0.0f; 581 prob = prob + weight[m]*exp((double)l_prob) 783 double prob = -state[l].log_var_val[m]; local [all...] |