/external/elfutils/libcpu/defs/ |
i386 | 198 # ORDER 202 # ORDER END 203 # ORDER 207 # ORDER END 208 # ORDER 212 # ORDER END 213 # ORDER 217 # ORDER END 218 # ORDER 221 # ORDER EN [all...] |
/external/opencv/cv/src/ |
cvmoments.cpp | 43 /* The function calculates center of gravity and central second order moments */ 573 // x_order - x order of the moment 574 // y_order - y order of the moment 582 int order = x_order + y_order; local 591 if( (x_order | y_order) < 0 || order > 3 ) 594 moment = (&(moments->m00))[order + (order >> 1) + (order > 2) * 2 + y_order]; 611 // x_order - x order of the moment 612 // y_order - y order of the momen 620 int order = x_order + y_order; local 663 int order = x_order + y_order; local [all...] |
/development/samples/ApiDemos/src/com/example/android/apis/graphics/spritetext/ |
Grid.java | 49 .order(ByteOrder.nativeOrder()).asFloatBuffer(); 51 .order(ByteOrder.nativeOrder()).asFloatBuffer(); 59 .order(ByteOrder.nativeOrder()).asCharBuffer();
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
JavaScriptTarget.java | 49 * Note that the low order bits are first, followed by the high order bits. 51 * passed in in 32-bit chunks with low-order bits coming first.
|
/external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
CollationKeyTest.java | 107 * int order; while ((order = it.next()) != 109 * System.out.println(Integer.toHexString(order)); } for (int i=0; i<bytes.length;
|
/external/bison/m4/ |
exponentd.m4 | 81 dnl that they are stored in big-endian word order, while the words 82 dnl (like integer types) are stored in little-endian byte order. 83 dnl The newer VFP instructions assume little-endian order
|
/external/chromium/chrome/browser/net/ |
chrome_net_log.cc | 44 ChromeNetLog::Entry::Entry(uint32 order, 50 : order(order),
|
/external/chromium/testing/gmock/test/ |
gmock_leak_test_.cc | 65 // In order to test the leak detector, we deliberately leak foo. 77 // In order to test the leak detector, we deliberately leak foo. 92 // In order to test the leak detector, we deliberately leak foo1 and
|
/external/freetype/include/freetype/ |
ftsizes.h | 37 #error "Please fix the directory search order for header files" 63 /* mostly in order to manage several character pixel sizes of the */ 95 /* You need to call @FT_Activate_Size in order to select the new size */
|
/external/guava/guava/src/com/google/common/collect/ |
BstInOrderPath.java | 101 * Returns {@code true} if there is a next path in an in-order traversal in the given direction. 108 * Returns the next path in an in-order traversal in the given direction. 110 * @throws NoSuchElementException if this would be the last path in an in-order traversal
|
/external/kernel-headers/original/linux/ |
v4l2-mediabus.h | 22 * in two 8-bit samples, "BE" or "LE" specify in which order those samples are 29 * per pixel and order of subsamples. Numerical values are sorted using generic 30 * numerical sort order (8 thus comes before 10).
|
/external/llvm/include/llvm/MC/ |
MCAsmLayout.h | 37 /// List of sections in layout order. 41 /// out. Fragments are always laid out in order, so all fragments with a 73 /// @name Section Access (in layout order)
|
/external/openssh/ |
TODO | 19 - Link order is incorrect for some systems using Kerberos 4 and AFS. Result 22 generated link order from: 38 and order to try them in e.g. "ChallengeResponseAuthentication skey, pam"
|
/external/proguard/src/proguard/ |
MemberSpecification.java | 56 * in order for the class to apply. 58 * in order for the class to apply. 60 * annotation in order for the class member
|
/external/qemu/android/ |
multitouch-screen.h | 80 * ydir Indicates row order: 1 means top-to-bottom order, -1 means 81 * bottom-to-top order.
|
/external/skia/bench/ |
GrMemoryPoolBench.cpp | 34 * This benchmark creates and deletes objects in stack order 90 * This benchmark creates objects and deletes them in random order 127 * This benchmark creates objects and deletes them in queue order
|
/external/v8/test/mjsunit/compiler/ |
compare.js | 76 // Test non-primitive values and watch for valueOf call order. 77 function TestNonPrimitive(order, f) { 82 assertEquals(order, result);
|
/external/v8/test/mjsunit/ |
for-in-special-cases.js | 76 // We do not assume that for-in enumerates elements in order. 99 // If for-in returns elements in a different order on multiple calls, this 102 // We do not assume that for-in enumerates elements in order.
|
/external/v8/tools/gcmole/ |
README | 3 gcmole is a simple static analysis tool used to find possible evaluation order 16 includes receiver) in any order. That means it can dereference baz before 58 Such places are marked with a "Possible problem with evaluation order."
|
/external/valgrind/main/helgrind/tests/ |
hg02_deadlock.stderr.exp | 12 Thread #x: lock order "0x........ before 0x........" violated 14 Observed (incorrect) order is: acquisition of lock at 0x........ 26 Required order was established by acquisition of lock at 0x........
|
/external/webkit/LayoutTests/dom/html/level1/core/ |
hc_elementgetelementsbytagnameaccessnodelist.js | 79 of all descendant Elements in the order the children 80 were encountered in a pre order traversal of the element 86 "5" in the order the children were encountered.
|
/external/webkit/LayoutTests/dom/xhtml/level1/core/ |
hc_elementgetelementsbytagnameaccessnodelist.js | 79 of all descendant Elements in the order the children 80 were encountered in a pre order traversal of the element 86 "5" in the order the children were encountered.
|
/external/webkit/Source/WebKit/chromium/scripts/ |
concatenate_css_files.py | 32 # This script concatenates in place CSS files in the order specified 33 # using <link> tags in a given 'order.html' file. 79 print('usage: %s order.html input_source_dir_1 input_source_dir_2 ... '
|
concatenate_js_files.py | 32 # This script concatenates in place JS files in the order specified 33 # using <script> tags in a given 'order.html' file. 80 print('usage: %s order.html input_source_dir_1 input_source_dir_2 ... '
|
/external/webrtc/src/modules/audio_coding/codecs/isac/fix/source/ |
filters.c | 30 WebRtc_Word16 order, 54 for (i = 1; i < order + 1; i++) { 65 return(order + 1);
|