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

1 2 3 4 5 6 7 8 91011>>

  /frameworks/base/tools/layoutlib/bridge/src/com/android/layoutlib/bridge/util/
SparseWeakArray.java 29 * are removed, making the array efficient at removing references that were reclaimed.
38 * there can be gaps in the indices. It is intended to be more efficient
  /libcore/luni/src/main/java/java/util/concurrent/atomic/
package-info.java 24 * employ efficient machine-level atomic instructions that are available
128 * platforms, the weak version may be more efficient than {@code
  /packages/apps/Gallery2/src/com/android/gallery3d/data/
MediaSet.java 185 // media sets), in an efficient order. ItemConsumer.consumer() will be
200 // Subclasses may override this and use more efficient implementations.
  /prebuilts/tools/common/proguard/proguard4.7/docs/manual/
introduction.html 29 code base smaller, more efficient, and harder to reverse-engineer. The final
36 efficient use in Java 6.
  /art/runtime/gc/accounting/
card_table-inl.h 82 // more efficient.
  /bionic/libc/private/
bionic_atomic_arm.h 102 * less efficient.
  /bionic/libm/upstream-freebsd/lib/msun/src/
e_log2.c 74 * This is fairly efficient since f-hfsq only depends on f, so can
s_cbrt.c 66 * division rounds towards minus infinity; this is also efficient.
  /dalvik/dx/src/com/android/dx/cf/code/
ConcreteMethod.java 92 * isn't particularly efficient for doing merges, but as far
  /dalvik/dx/src/com/android/dx/ssa/
DeadCodeRemover.java 28 * TODO this algorithm is more efficient if run in reverse from exit
Optimizer.java 118 * result will be much more efficient.
package-info.java 27 * reasonably efficient register machine representation can be produced from a
  /development/samples/ApiDemos/src/com/example/android/apis/graphics/
TouchRotateActivity.java 114 * the screen. The most efficient way of doing this is to use
  /development/samples/ApiDemos/src/com/example/android/apis/view/
List14.java 33 * Demonstrates how to write an efficient list adapter. The adapter used in this example binds
  /external/aac/
NOTICE 11 AAC's HE-AAC and HE-AAC v2 versions are regarded as today's most efficient general perceptual
  /external/aac/libAACdec/src/
aacdec_hcr_bit.h 13 AAC's HE-AAC and HE-AAC v2 versions are regarded as today's most efficient general perceptual
debug.h 13 AAC's HE-AAC and HE-AAC v2 versions are regarded as today's most efficient general perceptual
ldfiltbank.h 13 AAC's HE-AAC and HE-AAC v2 versions are regarded as today's most efficient general perceptual
overlapadd.h 13 AAC's HE-AAC and HE-AAC v2 versions are regarded as today's most efficient general perceptual
rvlcbit.h 13 AAC's HE-AAC and HE-AAC v2 versions are regarded as today's most efficient general perceptual
rvlcconceal.h 13 AAC's HE-AAC and HE-AAC v2 versions are regarded as today's most efficient general perceptual
  /external/aac/libAACenc/src/
aacenc_hcr.cpp 13 AAC's HE-AAC and HE-AAC v2 versions are regarded as today's most efficient general perceptual
aacenc_hcr.h 13 AAC's HE-AAC and HE-AAC v2 versions are regarded as today's most efficient general perceptual
aacenc_pns.h 13 AAC's HE-AAC and HE-AAC v2 versions are regarded as today's most efficient general perceptual
bandwidth.h 13 AAC's HE-AAC and HE-AAC v2 versions are regarded as today's most efficient general perceptual

Completed in 433 milliseconds

1 2 3 4 5 6 7 8 91011>>