HomeSort by relevance Sort by last modified time
    Searched full:efficient (Results 201 - 225 of 2346) sorted by null

1 2 3 4 5 6 7 891011>>

  /external/proguard/docs/manual/
introduction.html 18 code base smaller, more efficient, and harder to reverse-engineer. The final
25 efficient use in Java 6.
  /external/skia/src/core/
SkTSort.h 96 * specialize SkTSwap if T has an efficient swap operation.
185 * sure to specialize SkTSwap if T has an efficient swap operation.
  /frameworks/base/graphics/java/android/renderscript/
Font.java 43 * are transparent to the user, they do happen internally, and it is more efficient to
44 * render large batches of text in sequence. It is also more efficient to render multiple
  /frameworks/base/docs/html/training/articles/
perf-tips.jd 34 <p>There are two basic rules for writing efficient code:</p>
53 your code is efficient at all levels and agressively optimize your performance.</p>
90 are also a <strong>lot</strong> more efficient than an array of {@code (int,int)}
99 code, you should try and be as efficient as possible.)</li>
354 isn't necessarily more efficient than programming with the
385 efficient. (So, for example, it was cheaper to invoke methods on a
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
heapq.py 44 The strange invariant above is meant to be an efficient memory
63 To be more memory efficient, when a winner is promoted, we try to
90 are more efficient overall, yet the worst cases might be terrible.
159 This is more efficient than heappop() followed by heappush(), and can be
287 # 2198, 2148, and 2219 compares: heapify() is more efficient, when
292 # heappop() compares): list.sort() is (unsurprisingly!) more efficient
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
heapq.py 44 The strange invariant above is meant to be an efficient memory
63 To be more memory efficient, when a winner is promoted, we try to
90 are more efficient overall, yet the worst cases might be terrible.
159 This is more efficient than heappop() followed by heappush(), and can be
287 # 2198, 2148, and 2219 compares: heapify() is more efficient, when
292 # heappop() compares): list.sort() is (unsurprisingly!) more efficient
  /external/jpeg/
jcsample.c 156 * efficient.
223 * efficient.
260 * efficient.
303 * efficient.
404 * efficient.
  /external/qemu/distrib/jpeg-6b/
jcsample.c 156 * efficient.
223 * efficient.
260 * efficient.
303 * efficient.
404 * efficient.
  /external/llvm/include/llvm/ADT/
EquivalenceClasses.h 11 // efficient union-find algorithm.
25 /// supports three efficient operations: insert an element into a class of its
30 /// This implementation is an efficient implementation that only stores one copy
DepthFirstIterator.h 22 // it to be more efficient, and allows external clients to use the set for
28 // it to be more efficient, and allows external clients to use the set for
  /external/srec/srec/include/
sp_fft.h 50 and implemented. Unfortuantely, it is also the least efficient among the
53 efficient than the radix-2 FFT, but it requires a power-of-four as the data length.
56 obtains the most efficient power-of-two FFT algorithm.
  /frameworks/base/docs/html/design/patterns/
app-structure.jd 94 A calendar is about productivity, so an efficient, easy-to-skim view with higher data density works
264 allows for efficient scanning and quick access of phone numbers, email addresses and other
272 <h4>Make navigation between detail views efficient</h4>
  /libcore/luni/src/main/java/org/xml/sax/helpers/
AttributesImpl.java 39 * AttributeList} interface, it also includes a much more efficient
191 * <p>In many cases, it will be more efficient to look up the name once and
343 * <p>It may be more efficient to reuse an existing object
  /external/ceres-solver/internal/ceres/
line_search_direction.cc 158 << ", consider using the L-BFGS memory-efficient line search direction "
222 // Efficient O(num_parameters^2) BFGS update [2].
  /external/chromium_org/third_party/WebKit/Source/wtf/
RefPtrHashMap.h 104 MappedPassOutType take(const KeyType&); // efficient combination of get with remove
105 MappedPassOutType take(RawKeyType); // efficient combination of get with remove
  /external/chromium_org/third_party/WebKit/Source/wtf/text/
TextCodecLatin1.cpp 226 // Do an efficient check to detect characters other than 00-7F and A0-FF.
255 // Convert the string a fast way and simultaneously do an efficient check to see if it's all ASCII.
  /external/chromium_org/third_party/mesa/src/src/glsl/
lower_clip_distance.cpp 159 * shift because that's likely to be more efficient.
166 * AND because that's likely to be more efficient.
  /external/chromium_org/third_party/ply/
README 51 - Parsing is based on LR-parsing which is fast, memory efficient,
66 parser are also reasonably efficient when parsing typically
  /external/chromium_org/v8/src/
global-handles.h 297 // efficient representation (object_groups_ and implicit_ref_groups_).
329 // Object groups and implicit references, public and more efficient
  /external/eigen/Eigen/src/Core/
SelfAdjointView.h 104 /** Efficient self-adjoint matrix times vector/matrix product */
114 /** Efficient vector/matrix times self-adjoint matrix product */
  /external/guava/guava/src/com/google/common/collect/
Queues.java 214 // we could rely solely on #poll, but #drainTo might be more efficient when there are multiple
250 // we could rely solely on #poll, but #drainTo might be more efficient when there are
  /external/libvorbis/doc/
vorbis.html 122 the encoder then packs an efficient representation of the signal, as
154 represent the original signal in a more efficient form that codes into
  /external/llvm/include/llvm/Support/
SourceMgr.h 179 // FIXME: Twine.str() is not very efficient.
185 // FIXME: Twine.str() is not very efficient.
StreamableMemoryObject.h 78 /// A pointer to it. More efficient than using readBytes if the
133 /// be made more efficient, so this method should be called before reading
  /external/mesa3d/src/glsl/
lower_clip_distance.cpp 159 * shift because that's likely to be more efficient.
166 * AND because that's likely to be more efficient.

Completed in 433 milliseconds

1 2 3 4 5 6 7 891011>>