HomeSort by relevance Sort by last modified time
    Searched full:worst (Results 51 - 75 of 761) sorted by null

1 23 4 5 6 7 8 91011>>

  /packages/apps/Email/provider_src/com/android/email/provider/
AccountBackupRestore.java 31 * email data for IMAP/EAS to be re-synced and prevent the worst outcomes from occurring.
  /cts/tests/tests/hardware/src/android/hardware/cts/helpers/sensorverification/
EventBasicVerification.java 125 // The worst scenario happens when the sensor batch time being just above half of the
154 // the worst case is possible
  /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/
MultiStartMultivariateRealOptimizer.java 101 * runs that did converge first, sorted from best to worst
190 // sort the optima from best to worst, followed by null elements
MultiStartUnivariateRealOptimizer.java 179 * runs that did converge first, sorted from best to worst
205 * runs that did converge first, sorted from best to worst
261 // sort the optima from best to worst, followed by NaN elements
  /external/webrtc/webrtc/system_wrappers/source/spreadsortlib/
spreadsort.hpp 42 //Gets the maximum size which we'll call spread_sort on to control worst-case performance
133 //This step is roughly 10% of runtime, but it helps avoid worst-case behavior and improve behavior with real data
199 //using std::sort if its worst-case is better
    [all...]
  /external/lz4/lib/
lz4frame.h 93 * The most important rule is that dstBuffer MUST be large enough (dstMaxSize) to ensure compression completion even in worst case.
141 * Provides the minimum size of Dst buffer given srcSize to handle worst case situations.
149 * The most important rule is that dstBuffer MUST be large enough (dstMaxSize) to ensure compression completion even in worst case.
lz4.h 79 and must be sized to handle worst cases situations (input data not compressible)
80 Worst case size evaluation is provided by function LZ4_compressBound()
105 Provides the maximum size that LZ4 compression may output in a "worst case" scenario (input data not compressible)
110 return : maximum output size in a "worst case" scenario
  /bionic/benchmarks/
string_benchmark.cpp 68 memmove(buf, buf + 1, nbytes); // Worst-case overlap.
  /cts/tests/tests/textureview/src/android/textureview/cts/
TextureViewTestActivity.java 58 /* Worst case is 2 * actual refresh rate, in case when the delay pushes the frame off
  /external/autotest/client/site_tests/hardware_StorageWearoutDetect/
hardware_StorageWearoutDetect.py 33 # ID# ATTRIBUTE_NAME FLAGS VALUE WORST THRESH FAIL RAW_VALUE
  /external/compiler-rt/lib/tsan/benchmarks/
vts_many_threads_bench.cc 1 // Mini-benchmark for tsan VTS worst case performance
  /external/fio/lib/
flist_sort.c 67 * In worst cases this loop may run many iterations.
  /external/glide/library/src/main/java/com/bumptech/glide/load/engine/cache/
DiskLruCacheWrapper.java 88 // Editor will be null if there are two concurrent puts. In the worst case we will just silently fail.
  /external/iproute2/man/man8/
tc-fq_codel.8 57 It should be set on the order of the worst-case RTT through the bottleneck to
  /external/libchrome/sandbox/win/src/sidestep/
preamble_patcher.h 15 // bytes of the function. Considering the worst case scenario, we need 4
  /external/libjpeg-turbo/
jutils.c 51 * The worst case would be a run-length of 15, which means we need 16
  /external/libopus/celt/
entcode.c 71 state, we compute the worst-case number of bits of val that must be
  /external/libopus/silk/float/
sort_FLP.c 34 /* Worst case: O(n^2) for an inversely sorted array */
  /external/libpng/contrib/tools/
intgamma.sh 75 * The worst case is the 16-bit distinction between 65535 and 65534; this
  /external/llvm/docs/
SegmentedStacks.rst 12 monolithic chunk (of some worst case size) at thread initialization. This is
  /external/mesa3d/src/mesa/drivers/dri/intel/
intel_resolve_map.h 68 * In the worst case, this would require 2^16 iterations: 16 texture
  /external/regex-re2/util/
arena.h 35 // This should be the worst-case alignment for any type. This is
  /external/toybox/toys/posix/
cal.c 67 // Worst case scenario toybuf usage: sizeof(struct tm) plus 21 bytes/line
  /external/v8/src/
bignum.h 45 // In the worst case this function is in O(this/other).
  /external/webrtc/webrtc/modules/audio_coding/neteq/
delay_peak_detector.cc 22 // the worst peak height.

Completed in 4232 milliseconds

1 23 4 5 6 7 8 91011>>