Searched
full:large (Results
1701 -
1725 of
7141) sorted by null
<<61626364656667686970>>
/external/chromium_org/v8/test/webkit/ |
dfg-mul-big-integers-expected.txt | 24 Tests what happens when you multiply large integers in an integer context.
|
/external/chromium_org/webkit/browser/appcache/ |
appcache_url_request_job_unittest.cc | 582 // "Large" enough to require multiple calls to request->Read to complete. 586 // 1. Write a large response to response storage. 698 // 1. Write a large response to response storage. 727 // 1. Write a large response to response storage.
|
/external/chromium_org/webkit/child/ |
touch_fling_gesture_curve.cc | 47 // curve, which starts at a large velocity and smoothly decreases to
|
/external/clang/docs/ |
ThreadSanitizer.rst | 125 ThreadSanitizer is in beta stage. It is known to work on large C++ programs
|
/external/clang/docs/analyzer/ |
DebugChecks.rst | 36 that these graphs may grow very large, even for small functions.
|
Makefile | 25 @echo " singlehtml to make a single large HTML file"
|
/external/clang/include/clang/Basic/ |
LangOptions.h | 36 /// this large collection of bitfields is a trivial class type.
|
/external/clang/include/clang/Frontend/ |
CodeGenOptions.h | 23 /// that this large collection of bitfields is a trivial class type.
|
/external/clang/lib/StaticAnalyzer/Core/ |
CheckerRegistry.cpp | 64 // See how large the package is.
|
/external/clang/test/CXX/dcl.dcl/dcl.spec/dcl.constexpr/ |
p1.cpp | 119 constexpr pixel large(4);
|
/external/clang/test/CodeGenCXX/ |
x86_64-arguments.cpp | 156 // Large enough to be passed indirectly.
|
/external/clang/test/CodeGenObjC/ |
exceptions.m | 110 // This loop is large enough to dissuade the optimizer from just
|
/external/compiler-rt/include/sanitizer/ |
msan_interface.h | 113 lists a large number of chunks of size X to use them for future requests.
|
/external/compiler-rt/lib/ |
CMakeLists.txt | 22 # The top-level lib directory contains a large amount of C code which provides
|
extendsfdf2.c | 25 // It also requires that integer types at least as large as both formats
|
/external/compiler-rt/lib/asan/ |
asan_fake_stack.h | 93 // Each size class should be large enough to hold all frames.
|
asan_stats.cc | 53 Printf("Stats: malloc large: %zu small slow: %zu\n",
|
/external/droiddriver/samples/testapp/src/com/google/android/apps/common/testing/ui/testapp/ |
GestureActivity.java | 15 * Displays a large touchable area and logs the events it receives.
|
/external/e2fsprogs/misc/ |
e2image.8.in | 106 how to create sparse files; the file will become as large as the
|
mke2fs.8.in | 315 stored in large inodes are not visible with older kernels, and such 485 Use hashed b-trees to speed up lookups in large directories. 491 large files. 537 (saves space on large filesystems).
|
/external/e2fsprogs/util/ |
copy_sparse.c | 2 * copy_sparse.c -- copy a very large sparse files efficiently
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/doc/ |
help.html | 11 .indextop { font-size: x-large;; font-family: Verdana, Arial, Helvetica, sans-serif; font-weight: bold}
|
/external/eclipse-windowbuilder/propertysheet/src/org/eclipse/wb/internal/core/model/property/editor/ |
AbstractComboBoxPropertyEditor.java | 33 * properties with large lists of value items.
|
/external/eigen/doc/ |
I01_TopicLazyEvaluation.dox | 21 Expression-templates-based libraries can avoid evaluating sub-expressions into temporaries, which in many cases results in large speed improvements. This is called <i>lazy evaluation</i> as an expression is getting evaluated as late as possible, instead of immediately. However, most other expression-templates-based libraries <i>always</i> choose lazy evaluation. There are two problems with that: first, lazy evaluation is not always a good choice for performance; second, lazy evaluation can be very dangerous, for example with matrix products: doing <tt>matrix = matrix*matrix</tt> gives a wrong result if the matrix product is lazy-evaluated, because of the way matrix product works.
|
I02_HiPerformance.dox | 8 for small fixed size matrices. For large matrices, however, it might be useful to
|
Completed in 1908 milliseconds
<<61626364656667686970>>