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

<<21222324252627282930>>

  /external/chromium_org/sync/internal_api/
change_reorder_buffer.cc 107 // (parent, child) ordering of values enables efficient lookup of children
  /external/chromium_org/third_party/WebKit/Source/core/platform/
PODIntervalTree.h 70 // supports efficient (O(lg n)) insertion, removal and querying of
  /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/
ShadowBlur.cpp 139 // This is much more efficient than computing the sum of each pixels
  /external/chromium_org/third_party/WebKit/Source/core/rendering/
RenderEmbeddedObject.cpp 249 // instantiate LayoutStateDisabler. Since using a LayoutStateMaintainer is slightly more efficient,
RenderText.h 165 // will use the more efficient textLength() instead, while
  /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/mod_pywebsocket/
common.py 163 # TODO(tyoshino): Change the data structure to more efficient one such
  /external/chromium_org/third_party/cld/base/
casts.h 45 // if it's not). In normal mode, we do the efficient static_cast<>
  /external/chromium_org/third_party/harfbuzz-ng/src/
hb-set-private.hh 145 /* TODO Make this faster and memmory efficient. */
  /external/chromium_org/third_party/icu/source/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/chromium_org/third_party/icu/source/common/
uvectr64.h 47 * a memory failure occurred. This is more efficient than making a
  /external/chromium_org/third_party/mesa/src/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
  /external/chromium_org/third_party/mesa/src/src/gallium/docs/source/
resources.rst 30 coordinate normalization and wrap modes, and in fact efficient OpenCL
  /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i915/
i830_texstate.c 113 * efficient, but this has gotten complex enough that we need
  /external/chromium_org/third_party/openssl/openssl/crypto/des/asm/
readme 70 operating, but it is basically very efficient.
  /external/chromium_org/third_party/protobuf/java/src/main/java/com/google/protobuf/
Internal.java 59 * in each value. This is much less efficient than just embedding the bytes
SingleFieldBuilder.java 151 * or a message. It will return whatever is more efficient.
  /external/chromium_org/third_party/skia/src/core/
SkRTree.h 37 * an efficient and robust access method for points and rectangles"
SkShader.cpp 298 // if we had a asAColor method, that would be more efficient...
SkTDynamicHash.h 19 int kGrowPercent = 75, // Larger -> more memory efficient, but slower.
  /external/chromium_org/third_party/sqlite/src/test/
boundary1.tcl 71 # A simple selection sort. Not trying to be efficient.
  /external/chromium_org/tools/clang/empty_string/
EmptyStringConverter.cpp 6 // std::string(). The latter is more efficient (as std::string doesn't have to
  /external/chromium_org/tools/clang/rewrite_scoped_ptr_ctor_null/
RewriteScopedPtrCtorNull.cpp 6 // std::string(). The latter is more efficient (as std::string doesn't have to
  /external/chromium_org/v8/src/
lazy-instance.h 78 // - "Static mode" which is the default mode since it is the most efficient
  /external/clang/include/clang/AST/
RecordLayout.h 96 bool HasOwnVFPtr; // TODO: stash this somewhere more efficient
  /external/clang/include/clang/Sema/
IdentifierResolver.h 34 /// implements efficient decl lookup based on a declaration name.

Completed in 534 milliseconds

<<21222324252627282930>>