/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:__anon26275
|
/external/tensorflow/tensorflow/contrib/distributions/python/ops/ |
conditional_distribution.py | 48 def prob(self, value, name="prob", **condition_kwargs): member in class:ConditionalDistribution
|
/prebuilts/ndk/r16/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:__anon26112
|
/external/tensorflow/tensorflow/contrib/distributions/python/kernel_tests/ |
vector_student_t_test.py | 68 def prob(self, x): member in class:_FakeVectorStudentT 96 self.assertAllClose(expected_mst.prob(x), 97 actual_mst.prob(x).eval(), 125 self.assertAllClose(expected_mst.prob(x), 126 actual_mst.prob(x).eval(), 158 self.assertAllClose(expected_mst.prob(x), 159 actual_mst.prob(x).eval(feed_dict=feed_dict), 189 self.assertAllClose(expected_mst.prob(x), 190 actual_mst.prob(x).eval(), 224 self.assertAllClose(expected_mst.prob(x) [all...] |
/external/tensorflow/tensorflow/core/lib/random/ |
distribution_sampler.h | 56 if (r < prob(idx)) return idx; 65 float prob(int idx) const { function in class:tensorflow::random::DistributionSampler
|
/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/tensorflow/tensorflow/contrib/tensor_forest/hybrid/core/ops/ |
routing_function_op.cc | 126 float prob = out_probs(i, j); variable 131 out_probs(i, left_child) = prob * left_prob; 132 out_probs(i, right_child) = prob * (1.0 - left_prob);
|
k_feature_routing_function_op.cc | 146 float prob = out_probs(i, j); variable 151 out_probs(i, left_child) = prob * left_prob; 152 out_probs(i, right_child) = prob * (1.0f - left_prob);
|
/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 | 323 const uint8_t* const prob = kBModesProba[top[x]][ymode]; local 326 int i = kYModesIntra4[VP8GetBit(br, prob[0])]; 328 i = kYModesIntra4[2 * i + VP8GetBit(br, prob[i])]; 333 ymode = !VP8GetBit(br, prob[0]) ? B_DC_PRED : 334 !VP8GetBit(br, prob[1]) ? B_TM_PRED : 335 !VP8GetBit(br, prob[2]) ? B_VE_PRED : 336 !VP8GetBit(br, prob[3]) ? 337 (!VP8GetBit(br, prob[4]) ? B_HE_PRED : 338 (!VP8GetBit(br, prob[5]) ? B_RD_PRED : B_VR_PRED)) : 339 (!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...] |