/external/libvpx/libvpx/vp9/encoder/ |
vp9_cost.h | 14 #include "vpx_dsp/prob.h" 22 #define vp9_cost_zero(prob) (vp9_prob_cost[prob]) 24 #define vp9_cost_one(prob) vp9_cost_zero(vpx_complement(prob)) 26 #define vp9_cost_bit(prob, bit) vp9_cost_zero((bit) ? vpx_complement(prob) \ 27 : (prob))
|
/hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/encoder/ |
vp9_cost.h | 22 #define vp9_cost_zero(prob) (vp9_prob_cost[prob]) 24 #define vp9_cost_one(prob) vp9_cost_zero(vp9_complement(prob)) 26 #define vp9_cost_bit(prob, bit) vp9_cost_zero((bit) ? vp9_complement(prob) \ 27 : (prob))
|
/prebuilts/go/darwin-x86/test/bench/shootout/ |
fasta.go | 81 prob float64 90 p += acid[i].prob 140 {prob: 0.27, sym: 'a'}, 141 {prob: 0.12, sym: 'c'}, 142 {prob: 0.12, sym: 'g'}, 143 {prob: 0.27, sym: 't'}, 144 {prob: 0.02, sym: 'B'}, 145 {prob: 0.02, sym: 'D'}, 146 {prob: 0.02, sym: 'H'}, 147 {prob: 0.02, sym: 'K'} [all...] |
/prebuilts/go/linux-x86/test/bench/shootout/ |
fasta.go | 81 prob float64 90 p += acid[i].prob 140 {prob: 0.27, sym: 'a'}, 141 {prob: 0.12, sym: 'c'}, 142 {prob: 0.12, sym: 'g'}, 143 {prob: 0.27, sym: 't'}, 144 {prob: 0.02, sym: 'B'}, 145 {prob: 0.02, sym: 'D'}, 146 {prob: 0.02, sym: 'H'}, 147 {prob: 0.02, sym: 'K'} [all...] |
/external/iproute2/tc/ |
tc_red.h | 4 extern int tc_red_eval_P(unsigned qmin, unsigned qmax, double prob);
|
tc_red.c | 28 Plog = log(prob/(qmax - qmin)) 30 int tc_red_eval_P(unsigned qmin, unsigned qmax, double prob) 37 prob /= i; 40 if (prob > 1.0) 42 prob *= 2;
|
/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);
|
/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/libgdx/gdx/src/com/badlogic/gdx/utils/compression/rangecoder/ |
Decoder.java | 65 int prob = probs[index];
local 66 int newBound = (Range >>> kNumBitModelTotalBits) * prob;
69 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits));
78 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits));
|
/external/lzma/C/ |
Ppmd.h | 22 #define PPMD_UPDATE_PROB_0(prob) ((prob) + (1 << PPMD_INT_BITS) - PPMD_GET_MEAN(prob))
23 #define PPMD_UPDATE_PROB_1(prob) ((prob) - PPMD_GET_MEAN(prob))
|
LzmaDec.c | 49 #define NORMAL_LITER_DEC GET_BIT(prob + symbol, symbol)
53 probLit = prob + offs + bit + symbol; \
164 CLzmaProb *prob;
local 169 prob = probs + IsMatch + (state << kNumPosBitsMax) + posState;
170 IF_BIT_0(prob)
173 UPDATE_0(prob);
174 prob = probs + Literal;
176 prob += (LZMA_LIT_SIZE * (((processedPos & lpMask) << lc) +
231 UPDATE_1(prob);
232 prob = probs + IsRep + state; 530 CLzmaProb *prob; local 542 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));
|
/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));
|
/prebuilts/go/darwin-x86/test/bench/go1/ |
fasta_test.go | 30 {prob: 0.27, sym: 'a'}, 31 {prob: 0.12, sym: 'c'}, 32 {prob: 0.12, sym: 'g'}, 33 {prob: 0.27, sym: 't'}, 34 {prob: 0.02, sym: 'B'}, 35 {prob: 0.02, sym: 'D'}, 36 {prob: 0.02, sym: 'H'}, 37 {prob: 0.02, sym: 'K'}, 38 {prob: 0.02, sym: 'M'}, 39 {prob: 0.02, sym: 'N'} [all...] |
/prebuilts/go/linux-x86/test/bench/go1/ |
fasta_test.go | 30 {prob: 0.27, sym: 'a'}, 31 {prob: 0.12, sym: 'c'}, 32 {prob: 0.12, sym: 'g'}, 33 {prob: 0.27, sym: 't'}, 34 {prob: 0.02, sym: 'B'}, 35 {prob: 0.02, sym: 'D'}, 36 {prob: 0.02, sym: 'H'}, 37 {prob: 0.02, sym: 'K'}, 38 {prob: 0.02, sym: 'M'}, 39 {prob: 0.02, sym: 'N'} [all...] |
/external/deqp/modules/glshared/ |
glsLongStressCase.hpp | 236 FeatureProbabilities& pRebuildProgram (const float prob) { rebuildProgram = prob; return *this; } 237 FeatureProbabilities& pReuploadTexture (const float prob) { reuploadTexture = prob; return *this; } 238 FeatureProbabilities& pReuploadBuffer (const float prob) { reuploadBuffer = prob; return *this; } 239 FeatureProbabilities& pReuploadWithTexImage (const float prob) { reuploadWithTexImage = prob; return *this; } 240 FeatureProbabilities& pReuploadWithBufferData (const float prob) { reuploadWithBufferData = prob; return *this; [all...] |
/external/opencv3/modules/videostab/include/opencv2/videostab/ |
motion_core.hpp | 78 float prob; //!< probability of success member in struct:cv::videostab::RansacParams 80 RansacParams() : size(0), thresh(0), eps(0), prob(0) {} 85 @param prob Required success probability. 87 RansacParams(int size, float thresh, float eps, float prob); 95 std::ceil(std::log(1 - prob) / std::log(1 - std::pow(1 - eps, size)))); 122 : size(_size), thresh(_thresh), eps(_eps), prob(_prob) {}
|
/external/webp/src/dec/ |
tree.c | 316 const uint8_t* const prob = kBModesProba[top[x]][ymode]; local 319 int i = kYModesIntra4[VP8GetBit(br, prob[0])]; 321 i = kYModesIntra4[2 * i + VP8GetBit(br, prob[i])]; 326 ymode = !VP8GetBit(br, prob[0]) ? B_DC_PRED : 327 !VP8GetBit(br, prob[1]) ? B_TM_PRED : 328 !VP8GetBit(br, prob[2]) ? B_VE_PRED : 329 !VP8GetBit(br, prob[3]) ? 330 (!VP8GetBit(br, prob[4]) ? B_HE_PRED : 331 (!VP8GetBit(br, prob[5]) ? B_RD_PRED : B_VR_PRED)) : 332 (!VP8GetBit(br, prob[6]) ? B_LD_PRED [all...] |
/external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.pconst/ |
eval_param.pass.cpp | 53 std::vector<double> prob(std::begin(p), std::end(p)); 54 double s = std::accumulate(prob.begin(), prob.end(), 0.0); 55 for (int i = 0; i < prob.size(); ++i) 56 prob[i] /= s; 64 if (prob[i] == 0) 68 assert(std::abs((double)Ni/N - prob[i]) / prob[i] < .01);
|
eval.pass.cpp | 51 std::vector<double> prob(std::begin(p), std::end(p)); 52 double s = std::accumulate(prob.begin(), prob.end(), 0.0); 53 for (int i = 0; i < prob.size(); ++i) 54 prob[i] /= s; 62 if (prob[i] == 0) 66 assert(std::abs((double)Ni/N - prob[i]) / prob[i] < .01); 111 std::vector<double> prob(std::begin(p), std::end(p)); 112 double s = std::accumulate(prob.begin(), prob.end(), 0.0) [all...] |
/hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/decoder/ |
vp9_detokenize.c | 77 #define ADJUST_COEF(prob, bits_count) \ 79 val += (vp9_read(r, prob) << bits_count); \ 93 const vp9_prob *prob; local 108 prob = coef_probs[band][ctx]; 111 if (!vp9_read(r, prob[EOB_CONTEXT_NODE])) { 116 while (!vp9_read(r, prob[ZERO_CONTEXT_NODE])) { 125 prob = coef_probs[band][ctx]; 129 if (!vp9_read(r, prob[ONE_CONTEXT_NODE])) { 136 prob = vp9_pareto8_full[prob[PIVOT_NODE] - 1] [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.pconst/ |
eval_param.pass.cpp | 51 std::vector<double> prob(std::begin(p), std::end(p)); 52 double s = std::accumulate(prob.begin(), prob.end(), 0.0); 53 for (int i = 0; i < prob.size(); ++i) 54 prob[i] /= s; 62 if (prob[i] == 0) 66 assert(std::abs((double)Ni/N - prob[i]) / prob[i] < .01);
|
eval.pass.cpp | 49 std::vector<double> prob(std::begin(p), std::end(p)); 50 double s = std::accumulate(prob.begin(), prob.end(), 0.0); 51 for (int i = 0; i < prob.size(); ++i) 52 prob[i] /= s; 60 if (prob[i] == 0) 64 assert(std::abs((double)Ni/N - prob[i]) / prob[i] < .01); 109 std::vector<double> prob(std::begin(p), std::end(p)); 110 double s = std::accumulate(prob.begin(), prob.end(), 0.0) [all...] |