| /external/clang/test/CodeGen/ |
| union-init.c | 12 long double dummy; /* force worst-case alignment */
|
| /toolchain/binutils/binutils-2.25/include/ |
| fibheap.h | 34 Amortized and real worst case time for operations:
36 ExtractMin: O(lg n) amortized. O(n) worst case.
37 DecreaseKey: O(1) amortized. O(lg n) worst case.
|
| /external/opencv3/3rdparty/tbb/ |
| android_additional.h | 9 char buf[2000]; //big enough for 1000 CPUs in worst possible configuration
|
| /external/icu/icu4c/source/layout/ |
| KhmerLayoutEngine.cpp | 56 le_int32 worstCase = count * 3; // worst case is 3 for Khmer TODO check if 2 is enough
74 // (probably better than doing the worst case stuff here...)
|
| TibetanLayoutEngine.cpp | 62 le_int32 worstCase = count * 3; // worst case is 3 for Khmer TODO check if 2 is enough
80 // (probably better than doing the worst case stuff here...)
|
| /system/core/logd/ |
| LogBuffer.cpp | 364 // pruning for worst UID.
453 // the worst offender by logging source. Thus the logs slowly loose content
458 // The first loop performs blacklisting and worst offender pruning. Falling
459 // through when there are no notable worst offenders and have not hit the
460 // region lock preventing further worst offender pruning. This loop also looks
543 // prune by worst offenders; by blacklist, UID, and by PID of system UID
546 // recalculate the worst offender on every batched pass
547 uid_t worst = (uid_t) -1; local
565 worst = sorted[0]->getKey();
574 if ((worst == AID_SYSTEM) && mPrune.worstPidOfSystemEnabled())
[all...] |
| LogBuffer.h | 88 // watermark of any worst/chatty uid processing
93 // watermark of any worst/chatty pid of system processing
|
| /external/autotest/client/tests/monotonic_time/src/ |
| time_test.c | 144 int64_t worst; /* worst backward time jump */ member in struct:test_info
152 INFO("new %s-warp maximum: %9"PRId64, test->name, test->worst);
174 if (delta < test->worst) { \
175 test->worst = delta; \
298 printf("FAIL: %s-worst-warp=%"PRId64"\n",
299 test->name, test->worst);
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/ |
| NelderMead.java | 85 final RealPointValuePair worst = simplex[n]; local
86 final double[] xWorst = worst.getPointRef();
89 // (dismissing the worst point at index n)
134 if (comparator.compare(reflected, worst) < 0) {
158 if (comparator.compare(inContracted, worst) < 0) {
|
| /external/bison/m4/ |
| strerror.m4 | 29 # If we don't know, assume the worst.
83 # If we don't know, assume the worst.
|
| setenv.m4 | 40 # If we don't know, assume the worst.
132 # If we don't know, assume the worst.
|
| realloc.m4 | 35 # If we don't know, assume the worst.
|
| /external/fdlibm/ |
| changes | 65 5.2: Worst error at least 1.45 ulp at
67 5.3: Worst error 0.96 ulp
|
| /external/harfbuzz_ng/test/fuzzing/ |
| README | 6 - With various defines that limit worst case exponential behavior.
|
| /external/skia/src/effects/ |
| SkPackBits.h | 18 returns the worst-case size needed for the dst[] buffer.
|
| /external/vboot_reference/firmware/2lib/include/ |
| 2common.h | 182 /* Size of work buffer sufficient for vb2_verify_digest() worst case. */
185 /* Size of work buffer sufficient for vb2_verify_data() worst case. */
191 /* Size of work buffer sufficient for vb2_verify_keyblock() worst case. */
194 /* Size of work buffer sufficient for vb2_verify_fw_preamble() worst case. */
|
| /prebuilts/tools/common/m2/repository/org/ccil/cowan/tagsoup/tagsoup/1.2/ |
| tagsoup-1.2.pom | 8 <description>TagSoup is a SAX-compliant parser written in Java that, instead of parsing well-formed or valid XML, parses HTML as it is found in the wild: poor, nasty and brutish, though quite often far from short. TagSoup is designed for people who have to process this stuff using some semblance of a rational application design. By providing a SAX interface, it allows standard XML tools to be applied to even the worst HTML. TagSoup also includes a command-line processor that reads HTML files and can generate either clean HTML or well-formed XML that is a close approximation to XHTML.</description>
|
| /system/bt/osi/test/ |
| future_test.cpp | 30 static const char *pass_back_data1 = "what kind of ice cream truck plays the worst christmas song of all time?";
|
| /external/llvm/lib/Target/Mips/ |
| MipsScheduleP5600.td | 122 // Estimated worst case
127 // Estimated worst case
197 // Best/Common/Worst case = 7 / 23 / 27
202 // Best/Common/Worst case = 7 / 31 / 35
207 // Best/Common/Worst case = 7 / 19 / 23
212 // Best/Common/Worst case = 7 / 27 / 31
217 // Best/Common/Worst case = 7 / 27 / 27
222 // Best/Common/Worst case = 7 / 27 / 31
227 // Best/Common/Worst case = 7 / 27 / 31
232 // Best/Common/Worst case = 7 / 35 / 3
[all...] |
| /external/eigen/bench/ |
| BenchTimer.h | 105 /** Return the worst elapsed time in seconds
107 inline double worst(int TIMER = CPU_TIMER) const function in class:Eigen::BenchTimer
|
| /system/connectivity/shill/ |
| resolver.cc | 91 // - For glibc, the worst case number of queries will be
93 // - For Chrome, the worst case number of queries will be
|
| /bionic/libc/upstream-openbsd/lib/libc/crypt/ |
| arc4random_uniform.c | 45 * p > 0.5 (worst case, usually far better) of selecting a
|
| /external/dhcpcd-6.8.2/compat/ |
| arc4random_uniform.c | 47 * p > 0.5 (worst case, usually far better) of selecting a
|
| /external/kernel-headers/original/uapi/linux/netfilter_bridge/ |
| ebt_among.h | 26 * number comparisons in worst case. Further, we take advantage of
|
| /external/llvm/utils/ |
| create_ladder_graph.py | 5 CFGs that are ladder graphs. Ladder graphs are generally the worst case
|
