HomeSort by relevance Sort by last modified time
    Searched refs:sufficient (Results 1 - 22 of 22) sorted by null

  /external/chromium-trace/catapult/third_party/gsutil/third_party/protorpc/experimental/javascript/closure/debug/
error.js 20 * sufficient.
  /external/v8/test/webkit/
duplicate-param-gc-crash.js 33 for (var i = 0; i < 10000; ++i) // Allocate a sufficient number of objects to force a GC.
exception-try-finally-scope-error.js 31 for (var i = 0; i < 10000; ++i) // Allocate a sufficient number of objects to force a GC.
var-shadows-arg-gc-crash.js 33 for (var i = 0; i < 10000; ++i) // Allocate a sufficient number of objects to force a GC.
  /system/core/toolbox/
Android.mk 91 # and the original can't yet have been modified, so this is both sufficient and necessary.
  /external/curl/lib/
ldap.c 41 # error Your Platform SDK is NOT sufficient for LDAP support! \
  /development/samples/ApiDemos/src/com/example/android/apis/app/
DeviceAdminSample.java 210 // Show password-sufficient status under Set Password button
211 boolean sufficient = mDPM.isActivePasswordSufficient();
212 mSetPassword.setSummary(sufficient ?
    [all...]
  /external/v8/test/mjsunit/
object-freeze.js 309 // sufficient.
unicode-test.js     [all...]
  /external/libunwind/doc/
libunwind-dynamic.tex 98 contiguous pieces of code, so a single code-range is sufficient).
265 with the number of directives in a region. Instead, it is sufficient
  /external/llvm/lib/Support/
APInt.cpp 647 // Compute a sufficient number of bits that is always large enough but might
651 unsigned sufficient
656 APInt tmp(sufficient, StringRef(p, slen), radix);
    [all...]
  /external/ImageMagick/www/api/
quantize.php 71 <p>Classification begins by initializing a color description tree of sufficient depth to represent each possible input color in a leaf. However, it is impractical to generate a fully-formed color description tree in the storage_class phase for realistic values of Cmax. If colors components in the input image are quantized to k-bit precision, so that Cmax= 2k-1, the tree would need k levels below the root node to allow representing each possible input color in a leaf. This becomes prohibitive because the tree's total number of nodes is 1 + sum(i=1, k, 8k).</p>
  /external/libvorbis/doc/
01-introduction.tex 458 multiplication of the vectors is sufficient for acceptable spectral
04-codec.tex 546 multiplication of the vectors is sufficient for acceptable spectral
  /external/libvpx/libvpx/third_party/x86inc/
x86inc.asm 703 ; (SSSE3 is a sufficient condition to know that your cpu doesn't have this problem.)
    [all...]
  /external/bison/build-aux/
texinfo.tex     [all...]
  /external/libmicrohttpd/doc/
texinfo.tex     [all...]
  /toolchain/binutils/binutils-2.25/texinfo/
texinfo.tex     [all...]
  /prebuilts/gdb/darwin-x86/lib/python2.7/pydoc_data/
topics.py     [all...]
  /prebuilts/gdb/linux-x86/lib/python2.7/pydoc_data/
topics.py     [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/pydoc_data/
topics.py     [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/pydoc_data/
topics.py     [all...]

Completed in 6001 milliseconds