HomeSort by relevance Sort by last modified time
    Searched full:efficient (Results 626 - 650 of 2323) sorted by null

<<21222324252627282930>>

  /external/dexmaker/src/dx/java/com/android/dx/ssa/
DeadCodeRemover.java 35 * TODO this algorithm is more efficient if run in reverse from exit
  /external/dexmaker/src/dx/java/com/android/dx/ssa/back/
LivenessAnalyzer.java 124 * form. Obviously, that's not efficient in java, so this function
  /external/dropbear/
cli-session.c 46 /* Sorted in decreasing frequency will be more efficient - data and window
  /external/e2fsprogs/debugfs/
dump.c 247 /* There are more efficient ways to do this, but this method
  /external/e2fsprogs/e2fsck/
e2fsck.conf.5.in 146 higher, more efficient level. This relation defaults to 20
  /external/guava/guava/src/com/google/common/collect/
BstCountBasedBalancePolicies.java 31 * href="http://www.swiss.ai.mit.edu/~adams/BB/"> Stephen Adams, "Efficient sets: a balancing
ForwardingCollection.java 223 * to forward to this implementation. Alternately, it may be more efficient to
  /external/harfbuzz_ng/src/
hb-set-private.hh 134 /* TODO Make this faster and memmory efficient. */
  /external/icu4c/common/unicode/
normlzr.h 51 * (providing efficient random access).
77 * It is more efficient to call setIndexOnly() instead, which does not
488 * The C API unorm_next() is more efficient and does not have this ambiguity.
504 * The C API unorm_previous() is more efficient and does not have this ambiguity.
  /external/icu4c/common/
uvectr64.h 47 * a memory failure occurred. This is more efficient than making a
  /external/iproute2/man/man8/
tc-sfq.8 211 M. Shreedhar and George Varghese "Efficient Fair
  /external/jmonkeyengine/engine/src/core/com/jme3/font/
BitmapFont.java 181 // getting a text size. It's less efficient but at least it
  /external/jmonkeyengine/engine/src/core/com/jme3/util/
SkyFactory.java 174 // also consilidate efficient data
  /external/jpeg/
jdpostct.c 265 * an efficient number of rows for upsampling to return.
  /external/jsilver/src/com/google/streamhtmlparser/impl/
ParserStateTable.java 36 * U+00FF]. We use that property to design a more efficient state transition
  /external/kernel-headers/original/asm-mips/
local.h 187 * much more efficient than these naive implementations. Note they take
  /external/kernel-headers/original/linux/
ktime.h 42 * For architectures with efficient support for 64/32-bit conversions the
  /external/libvorbis/lib/modes/
residue_44u.h 52 only one submap (this would change for efficient 5.1 support for example)*/
  /external/llvm/include/llvm/ADT/
Optional.h 80 // could be made more efficient by passing by value, possibly unifying them
ScopedHashTable.h 10 // This file implements an efficient scoped hash table, which is useful for
  /external/llvm/include/llvm/Analysis/
LoopIterator.h 12 // Unfortunately we have no efficient way of summarizing loop exits which would
  /external/llvm/include/llvm/Support/
MemoryBuffer.h 35 /// be more efficient for clients which are reading all the data to stop
  /external/llvm/include/llvm/Transforms/Utils/
SSAUpdater.h 152 /// implement this with a more efficient version if possible.
  /external/llvm/lib/Transforms/ObjCARC/
ProvenanceAnalysis.cpp 50 // as efficient check: just check for relations between the values on
  /external/mesa3d/src/gallium/auxiliary/gallivm/
lp_bld_type.c 75 * XXX: I'm not sure if it wouldn't be easier/efficient to just recreate the

Completed in 407 milliseconds

<<21222324252627282930>>