HomeSort by relevance Sort by last modified time
    Searched full:smaller (Results 101 - 125 of 1362) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/bluetooth/glib/glib/
gqsort.c 101 smaller partition. This *guarantees* no more than log (total_elems)
203 bounds on the stack and continue sorting the smaller one. */
  /external/openssl/crypto/rand/
rand_egd.c 77 * the number of bytes requested or smaller, if the EGD pool is
90 * the number of bytes requested or smaller, if the EGD pool is
  /external/svox/pico/lib/
picokpdf.c 138 /* error: bigpow is smaller than input pow */
182 pdfmul->bigpow = PICOKPDF_BIG_POW; /* what we have to use is the smaller number! */
  /external/v8/test/mjsunit/
large-object-allocation.js 29 // instance_size field in the map resulting in an object that is smaller
285 // Meaning that the instance will be smaller than a minimal JSObject and we
  /external/webkit/WebCore/rendering/
RenderMarquee.cpp 215 m_currentLoop = 0; // When direction changes or our loopCount is a smaller number than our current loop, reset our loop.
239 // if it is smaller than the font size. If it is a vertical marquee and height is not specified, we default
  /external/webkit/WebCore/xml/
XSLTUnicodeSort.cpp 182 /* We make NaN smaller than number in accordance
235 /* We make NaN smaller than number in
  /libcore/luni/src/main/java/java/io/
ObjectStreamField.java 144 * the field with the primitive type is considered to be "smaller". If both
149 * @return -1 if this field is "smaller" than field {@code o}, 0 if both
  /libcore/luni/src/main/java/org/apache/xml/utils/
IntVector.java 248 * downward to have an index one smaller than the value it had
279 * index is shifted downward to have an index one smaller than
ObjectVector.java 245 * downward to have an index one smaller than the value it had
276 * index is shifted downward to have an index one smaller than
  /packages/apps/Gallery/src/com/android/camera/
Util.java 95 * generates a smaller bitmap, unless minSideLength = IImage.UNCONSTRAINED.
160 * In this case the bitmap is smaller, at least in one dimension,
  /dalvik/vm/arch/x86/
Call386ABI.S 134 cmpl $4,%ebx /* smaller than 32-bits? */
  /dalvik/vm/arch/x86-atom/
Call386ABI.S 154 * If a native function returns a result smaller than 8-bytes
  /development/samples/ApiDemos/src/com/example/android/apis/animation/
Transition3d.java 22 * list. The animation is made of two smaller animations: the first half
  /external/blktrace/btreplay/doc/
btreplay.tex 224 smaller than the recorded device.}.}
306 are to be processed. The smaller the value, the smaller the number of
318 option (section~\ref{sec:c-o-m}), smaller values \emph{may} or \emph{may not}
  /external/bluetooth/glib/gobject/
gvaluecollector.h 41 * smaller than an int is promoted to an integer and floats are
  /external/bouncycastle/src/main/java/org/bouncycastle/x509/
ExtendedPKIXBuilderParameters.java 101 * if smaller.
  /external/chromium/base/
scoped_variant_win.h 78 // greater than |var|, -1 if it is smaller.
  /external/chromium/net/tools/flip_server/
ring_buffer.h 32 // in here is smaller than the amount of data in the buffer, then the oldest
  /external/chromium/sdch/open-vcdiff/src/
blockhash.h 50 // Using (for example) kBlockSize = 4 guarantees that no match smaller
72 // If you change kBlockSize to a smaller value, please increase
324 // for block sizes smaller than 32.
476 // smaller index values and repeated index values.
  /external/chromium/third_party/icu/public/common/unicode/
uconfig.h 23 * Allows to build partial, smaller libraries for special purposes.
  /external/chromium/third_party/icu/source/common/
uarrsort.c 109 * It recurses for the smaller sub-array to shorten the recursion depth,
  /external/chromium/third_party/zlib/
adler32.c 11 #define BASE 65521UL /* largest prime smaller than 65536 */
  /external/dropbear/libtomcrypt/notes/
tech0004.txt 56 would be faster than many smaller calls]. This prevents too much data being encrypted under the same
  /external/dropbear/libtomcrypt/src/pk/pkcs1/
pkcs_1_pss_decode.c 114 /* now clear the first byte [make sure smaller than modulus] */
  /external/dropbear/libtommath/
bn_mp_prime_next_prime.c 43 /* ok we found a prime smaller or

Completed in 1860 milliseconds

1 2 3 45 6 7 8 91011>>