HomeSort by relevance Sort by last modified time
    Searched refs:med (Results 1 - 13 of 13) sorted by null

  /external/libvpx/libvpx/test/
bench.cc 31 const int med = times_[VPX_BENCH_ROBUST_ITER >> 1]; local
34 sad += abs(times_[t] - med);
36 printf("[%10s] %s %.1f ms ( ±%.1f ms )\n", "BENCH ", title, med / 1000.0,
  /external/ltp/testcases/network/
generate.sh 29 medium_file=ascii.med
75 genfile bin.sm bin.med
76 genfile bin.med bin.lg
Makefile 33 INSTALL_TARGETS := $(addprefix $(DIR)/ascii.,sm med lg jmb)
34 INSTALL_TARGETS += $(addprefix $(DIR)/bin.,sm med lg jmb)
  /external/ltp/lib/
random_range.c 549 long long med, half, diff; local
572 med = min + half; /* med way point between min and max */
577 printf(" diff = %lld, half = %lld, med = %lld\n", diff, half, med);
583 * to pick the number within the min to med or med to max
587 return med + rand;
596 return divider(med, max, cnt + 1, rand);
598 return divider(min, med, cnt + 1, rand)
    [all...]
  /cts/tools/cts-media/
get_achievable_rates.py 129 Result = namedtuple('Result', 'mn mx p95 med geo p5')
156 p95, med, p5 = perc(data, P, math.floor), perc(data, 50, round), perc(data, 100 - P, math.ceil)
160 if pub_lo > med:
161 if pub_lo > med * 1.1:
164 pub_lo = int(med)
177 pub_lo_, pub_hi_ = min(int(data[N / 2 - i - 1] * T), round(geo), int(med)), max(math.ceil(data[N / 2 + i] / T), round(geo))
194 mn, 100-P, p95, pub_lo / T, pub_hi * T, med, P, p5, mx)
213 comment = ' <!-- measured %d%%:%d-%d med:%d%s -->' % (round(100 - 2 * P), int(p95), math.ceil(p5), int(round(med)), comment)
  /external/bzip2/
blocksort.c 100 UInt32 med, r, r3; local
128 if (r3 == 0) med = eclass[fmap[lo]]; else
129 if (r3 == 1) med = eclass[fmap[(lo+hi)>>1]]; else
130 med = eclass[fmap[hi]];
138 n = (Int32)eclass[fmap[unLo]] - (Int32)med;
149 n = (Int32)eclass[fmap[unHi]] - (Int32)med;
630 Int32 unLo, unHi, ltLo, gtHi, n, m, med; local
656 med = (Int32)
667 n = ((Int32)block[ptr[unLo]+d]) - med;
677 n = ((Int32)block[ptr[unHi]+d]) - med;
    [all...]
  /external/u-boot/lib/bzip2/
bzlib_blocksort.c 140 UInt32 med, r, r3; local
168 if (r3 == 0) med = eclass[fmap[lo]]; else
169 if (r3 == 1) med = eclass[fmap[(lo+hi)>>1]]; else
170 med = eclass[fmap[hi]];
178 n = (Int32)eclass[fmap[unLo]] - (Int32)med;
189 n = (Int32)eclass[fmap[unHi]] - (Int32)med;
670 Int32 unLo, unHi, ltLo, gtHi, n, m, med; local
696 med = (Int32)
707 n = ((Int32)block[ptr[unLo]+d]) - med;
717 n = ((Int32)block[ptr[unHi]+d]) - med;
    [all...]
  /external/apache-commons-compress/src/main/java/org/apache/commons/compress/compressors/bzip2/
BlockSort.java 370 long med;
372 med = eclass[fmap[lo]];
374 med = eclass[fmap[(lo + hi) >>> 1]];
376 med = eclass[fmap[hi]];
389 n = eclass[fmap[unLo]] - (int) med;
404 n = eclass[fmap[unHi]] - (int) med;
831 final int med = med3(block[fmap[lo] + d1], local
    [all...]
  /external/python/cpython3/Lib/test/
test_signal.py     [all...]
  /external/scapy/scapy/contrib/
bgp.uts 456 raw(BGPPAMultiExitDisc(med = 4)) == b'\x00\x00\x00\x04'
460 a.med == 0
    [all...]
  /external/jarjar/lib/
apache-ant-1.9.4.jar 
  /external/guice/extensions/struts2/lib/
ant-1.6.5.jar 
  /external/owasp/sanitizer/tools/findbugs/lib/
ant.jar 

Completed in 2863 milliseconds