HomeSort by relevance Sort by last modified time
    Searched full:worst (Results 1 - 25 of 452) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/clang/test/CodeGen/
union-init.c 12 long double dummy; /* force worst-case alignment */
  /external/icu4c/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...)
IndicLayoutEngine.cpp 117 // (probably better than doing the worst case stuff here...)
  /external/skia/src/gpu/
GrPathUtils.h 27 /// Since we divide by tol if we're computing exact worst-case bounds,
33 /// Since we divide by tol if we're computing exact worst-case bounds,
44 /// Since we divide by tol if we're computing exact worst-case bounds,
  /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.
calloc.m4 39 # If we don't know, assume the worst.
malloc.m4 35 # If we don't know, assume the worst.
stat.m4 53 # 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/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
  /external/skia/include/core/
SkPackBits.h 18 returns the worst-case size needed for the dst[] buffer.
23 returns the worst-case size needed for the dst[] buffer.
  /external/skia/legacy/include/core/
SkPackBits.h 18 returns the worst-case size needed for the dst[] buffer.
23 returns the worst-case size needed for the dst[] buffer.
  /dalvik/vm/compiler/template/armv5te/
TEMPLATE_CMP_LONG.S 19 * in the worst case (the 64-bit values are equal).
  /external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/crypto/cipher/
CBCMode.java 59 /* Assume the worst, src and dst are overlapping... */
  /external/kernel-headers/original/asm-mips/
smp.h 49 * anything. Worst case is that we lose a reschedule ...
  /external/oprofile/libdb/
db_stat.c 23 odb_node_nr_t max_list_length; /**< worst case */
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/netfilter_bridge/
ebt_among.h 24 * number comparisons in worst case. Further, we take advantage of
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/netfilter_bridge/
ebt_among.h 24 * number comparisons in worst case. Further, we take advantage of
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/netfilter_bridge/
ebt_among.h 24 * number comparisons in worst case. Further, we take advantage of
  /external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
Briggs.h 103 unsigned worst, reverseWorst; member in struct:PBQP::Heuristics::Briggs::EdgeData
107 EdgeData() : worst(0), reverseWorst(0), isUpToDate(false) {}
321 ed.worst = 0;
337 if (colInfCounts[j] > ed.worst) {
338 ed.worst = colInfCounts[j];
366 nd.numDenied += nIsNode1 ? ed.worst : ed.reverseWorst;
393 nd.numDenied -= nIsNode1 ? ed.worst : ed.reverseWorst;
  /bionic/tests/
string_benchmark.cpp 72 memmove(buf, buf + 1, nbytes); // Worst-case overlap.
  /external/guava/guava-tests/test/com/google/common/eventbus/
AsyncEventBusTest.java 65 * Arguably the Worst Executor Ever.

Completed in 607 milliseconds

1 2 3 4 5 6 7 8 91011>>