| /external/jpeg/ |
| jddctmgr.c | 234 static const char orders[DCTSIZE] = {4, 2, 5, 3, 6, 1, 7, 0}; local
237 int j = ((i & 7) << 3) + orders[i >> 3];
|
| /bionic/libm/src/ |
| s_fma.c | 79 * If x * y and z are many orders of magnitude apart, the scaling
|
| s_fmal.c | 74 * If x * y and z are many orders of magnitude apart, the scaling
|
| /external/bluetooth/glib/docs/reference/glib/tmpl/ |
| trees-binary.sgml | 193 this is less efficient than the other orders.
|
| /external/chromium/chrome/browser/ui/views/extensions/ |
| extension_view.cc | 118 // actually been created. These can happen in different orders.
|
| /external/flac/libFLAC/ia32/ |
| stream_encoder_asm.nasm | 119 ; now merge partitions for lower orders
|
| /external/llvm/lib/Transforms/Scalar/ |
| BasicBlockPlacement.cpp | 14 // function, this pass basically orders blocks in depth-first order
|
| /external/v8/test/mjsunit/ |
| debug-listbreakpoints.js | 153 // Set some more breakpoints, and clear them in various orders:
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/ |
| printf.h | 130 /* Print floating point value using using abbreviations for the orders
|
| /external/icu4c/test/intltest/ |
| apicoll.cpp | 719 CollationElementIterator::primaryOrder(order3)), "The primary orders should be the same");
721 CollationElementIterator::secondaryOrder(order3)), "The secondary orders should be the same");
723 CollationElementIterator::tertiaryOrder(order3)), "The tertiary orders should be the same");
733 CollationElementIterator::primaryOrder(order3)), "The primary orders should be identical");
735 CollationElementIterator::tertiaryOrder(order3)), "The tertiary orders should be different");
739 /* NO! Secondary orders of two CEs are not related, especially in the case of '_' vs 'I' */
742 CollationElementIterator::secondaryOrder(order3)), "The secondary orders should not be the same");
774 CollationElementIterator::primaryOrder(order3)), "The primary orders should be the same");
776 CollationElementIterator::secondaryOrder(order3)), "The secondary orders should be the same");
778 CollationElementIterator::tertiaryOrder(order3)), "The tertiary orders should be the same")
[all...] |
| /external/bison/ |
| TODO | 220 move to partial orders (sounds like series/parallel orders to me).
|
| /external/icu4c/test/cintltst/ |
| citertst.c | 566 OrderAndOffset *orders; local
598 orders = getOrders(iter, &orderLength);
630 free(orders);
948 *orders; local
970 orders = getOrders(iter, &count);
987 if ((count > 250 && testorders[-- count].order != orders[1].order) ||
988 (count <= 250 && testorders[-- count].order != orders[0].order)) {
995 free(orders);
[all...] |
| /frameworks/base/core/java/android/net/http/ |
| RequestQueue.java | 191 * requests. It orders them, makes the requests against HTTP
204 * requests. It orders them, makes the requests against HTTP
|
| /dalvik/vm/compiler/ |
| Compiler.h | 162 /* Customized node traversal orders for different needs */
|
| /external/bluetooth/glib/glib/ |
| gnode.h | 51 /* Tree traverse orders */
|
| /external/chromium/chrome/browser/autofill/ |
| credit_card_field.cc | 57 // Credit card fields can appear in many different orders.
|
| /external/guava/src/com/google/common/collect/ |
| TreeMultimap.java | 152 * Returns the comparator that orders the multimap keys.
|
| /external/protobuf/src/google/protobuf/stubs/ |
| substitute.h | 82 // large strings, it may be orders of magnitude faster.
|
| /external/webkit/Source/WebCore/platform/ |
| Timer.cpp | 112 // We need to look at the difference of the insertion orders instead of comparing the two
|
| /frameworks/base/core/java/android/preference/ |
| PreferenceGroup.java | 86 * @return Whether this group orders based on the order the children are added.
|
| /external/icu4c/i18n/ |
| tblcoll.cpp | 423 * To account for this, we put all of the primary orders at the beginning of
424 * the string, followed by the secondary and tertiary orders. Each set of
425 * orders is terminated by nulls so that a key for a string which is a initial
|
| /external/zlib/examples/ |
| enough.c | 62 In order to speed up the examination (by about ten orders of magnitude for
78 identifying the reachable nodes, accounts for about six of the orders of
80 orders of magnitude come from not revisiting previous states. Out of
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| PriorityBlockingQueue.java | 146 * initial capacity (11) that orders its elements according to
155 * initial capacity that orders its elements according to their
168 * capacity that orders its elements according to the specified
[all...] |
| /cts/tests/tests/view/src/android/view/cts/ |
| MenuInflaterTest.java | 136 // the orders and categories
|
| /external/bluetooth/glib/tests/ |
| hash-test.c | 150 * implicit. IT MUST ALSO BE THE CASE that the coefficients of orders
|
