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

<<11121314151617181920>>

  /prebuilts/python/linux-x86/2.7.5/include/python2.7/
floatobject.h 73 * The struct and pickle (at least) modules need an efficient platform-
  /prebuilts/tools/common/proguard/proguard4.7/docs/
feedback.html 67 efficient way to stay abreast of the latest developments.</li>
  /system/core/include/cutils/
atomic.h 101 * Implementations that use the release CAS in a loop may be less efficient
  /system/core/include/utils/
Flattenable.h 130 * LightFlattenable is usually more size efficient than Flattenable.
  /system/core/libpixelflinger/codeflinger/
CodeCache.h 122 // KeyedVector uses compare_type(), which is more efficient, than
  /system/core/sh/
error.h 78 * much more efficient and portable. (But hacking the kernel is so much
  /external/mockito/src/org/mockito/internal/matchers/apachecommons/
EqualsBuilder.java 104 * not as efficient as testing explicitly.</p>
126 * not as efficient as testing explicitly.</p>
149 * not as efficient as testing explicitly.</p>
173 * not as efficient as testing explicitly.</p>
202 * not as efficient as testing explicitly.</p>
  /external/llvm/docs/
ProgrammersManual.rst 164 efficient to use the ``InstVisitor`` class to dispatch over the instruction
241 class is an efficient way for APIs to accept concatenated strings. For example,
514 * a :ref:`map-like <ds_map>` container if you need efficient look-up of a
515 value based on another value. Map-like containers also support efficient
517 generally do not support efficient reverse mapping (values to keys). If you
518 need that, use two maps. Some map-like containers also support efficient
524 containers support efficient iteration through the elements in sorted order.
527 * a :ref:`sequential <ds_sequential>` container provides the most efficient way
529 They permit duplicates and support efficient iteration, but do not support
530 efficient look-up based on a key
    [all...]
  /external/llvm/lib/Transforms/Utils/
PromoteMemoryToRegister.cpp 294 /// (BBNumbers), the DenseMap is more efficient (also supports removal).
378 // we can skip the triviality test and be more efficient.
518 // make it efficient to get the index of various operations in the block.
529 // Sort the stores by their index, making it efficient to do a lookup with a
797 // basic blocks. Start by sorting the incoming predecessors for efficient
    [all...]
  /dalvik/vm/mterp/
README.txt 280 over the portable interpreter through its efficient mechanism of
285 by the Dalvik opcode. To support efficient handling of special subModes,
  /external/antlr/antlr-3.4/runtime/C/include/
antlr3tokenstream.h 52 * efficient) and a pointer to an ANTLR3_INPUT_STREAM. This is slightly
206 * There might be more efficient ways to do this, such as referencing directly in to
  /external/chromium/base/
stl_util-inl.h 6 // STL functions with more efficient versions.
145 // function is the most efficient code that will work, taking into
  /external/chromium/googleurl/src/
gurl.h 219 // efficient than getting the scheme and comparing it because no copies or
326 // scheme). This call is more efficient than getting the host and check
  /external/chromium_org/sdch/open-vcdiff/
ChangeLog 125 encoder, but finds better string matches, producing a more efficient
184 the most efficient version of memcmp is used in the encoder's inner loop.
  /external/chromium_org/third_party/icu/source/common/unicode/
uchriter.h 159 * e.g., setToStart() or firstPostInc(), is more efficient.
254 * efficient than iteration with "post-increment" semantics
  /external/chromium_org/third_party/icu/source/i18n/
hebrwcal.h 309 * method if they can provide a more correct or more efficient
318 * provide a more correct or more efficient implementation than the
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/gallivm/
lp_bld_flow.c 135 * XXX this doesn't quite generate the most efficient code possible, if
138 * movmskps/pmovmskb would be more efficient to get the required value
lp_bld_format_aos.c 514 * This is definitely not the most efficient way of fetching pixels, as
617 * This is definitely not the most efficient way of fetching pixels, as
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/
lp_rast_tri.c 293 /* Adjust so we can just check the sign bit (< 0 comparison), instead of having to do a less efficient <= 0 comparison */
401 /* Adjust so we can just check the sign bit (< 0 comparison), instead of having to do a less efficient <= 0 comparison */
  /external/chromium_org/third_party/protobuf/src/google/protobuf/io/
zero_copy_stream_impl.h 214 // FileInputStream is more efficient.
258 // FileOutputStream is more efficient.
  /external/chromium_org/third_party/re2/util/
sparse_array.h 38 // Implemented with reference to Briggs & Torczon, An Efficient
86 // To make the sparse array as efficient as possible for non-primitive types,
  /external/chromium_org/url/
gurl.h 202 // efficient than getting the scheme and comparing it because no copies or
320 // scheme). This call is more efficient than getting the host and check
  /external/clang/include/clang/Rewrite/Core/
Rewriter.h 181 /// Note that this method is not particularly efficient.
270 /// want efficient low-level access to apis for scribbling on one specific
  /external/eigen/Eigen/src/SparseCore/
SparseSelfAdjointView.h 72 /** Efficient sparse self-adjoint matrix times dense vector/matrix product */
80 /** Efficient dense vector/matrix times sparse self-adjoint matrix product */
  /external/eigen/unsupported/Eigen/
FFT 30 * reasonably efficient default.
87 // internal::kissfft_impl: small, free, reasonably efficient default, derived from kissfft

Completed in 510 milliseconds

<<11121314151617181920>>