| /frameworks/opt/vcard/tests/src/com/android/vcard/tests/ |
| VCardParserTests.java | 37 private enum Order {
46 private final List<Order> mHistory = new ArrayList<Order>();
47 private final List<Order> mExpectedOrder = new ArrayList<Order>();
49 public MockVCardInterpreter addExpectedOrder(Order order) {
50 mExpectedOrder.add(order);
54 private void inspectOrder(Order order) {
[all...] |
| /ndk/sources/host-tools/sed-4.2.1/testsuite/ |
| head.good | 1 "...by imposing a tiny bit of order in a communication you are
2 translating, you are carving out a little bit of order in the
|
| head.inp | 1 "...by imposing a tiny bit of order in a communication you are
2 translating, you are carving out a little bit of order in the
5 of order and maybe even beauty out of the raw materials that
|
| middle.inp | 1 "...by imposing a tiny bit of order in a communication you are
2 translating, you are carving out a little bit of order in the
5 of order and maybe even beauty out of the raw materials that
|
| middle.good | 3 of order and maybe even beauty out of the raw materials that
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt.overlay/ |
| build.properties | 4 jars.compile.order =
|
| /external/bluetooth/glib/docs/reference/glib/tmpl/ |
| byte_order.sgml | 2 Byte Order Macros
9 These macros provide a portable way to determine the host byte order
13 The byte order is the order in which bytes are stored to create larger
15 The host byte order is the byte order used on the current machine.
28 a rather curious order known as PDP-endian. For a 4-byte word, the 3rd
36 They are typically used to convert values into a byte order
38 processors. The Internet uses what is known as 'network byte order'
39 as the standard byte order (which is in fact the big-endian byte order)
[all...] |
| /frameworks/compile/slang/tests/F_one_definition_rule5/ |
| def1.rs | 4 // expected-error: different order(POD)
|
| def2.rs | 4 // expected-error: different order(POD)
|
| /libcore/luni/src/main/java/libcore/icu/ |
| CollationElementIteratorICU.java | 82 * specified comparison order.
83 * @param order collation order returned by previous or next.
89 public int getMaxExpansion(int order) {
90 return NativeCollation.getMaxExpansion(address, order);
128 * Gets the primary order of a collation order.
129 * @param order the collation order
130 * @return the primary order of a collation order
[all...] |
| /external/valgrind/main/drd/tests/ |
| tc15_laog_lockdel.stderr.exp | 2 Establish order 1 -> 2
3 Try order 2 -> 1. This gives an error.
|
| /external/icu4c/i18n/unicode/ |
| coleitr.h | 66 * The key of a character, is an integer composed of primary order(short),
67 * secondary order(char), and tertiary order(char). Java strictly defines the
82 * int32_t order = c->next(success);
84 * order = c->previous(success);
91 * CollationElementIterator::next returns the collation order of the next
93 * CollationElementIterator::previous returns the collation order of the
103 * CollationElementIterator::next(), the first or last collation order will be
111 * Character based on the comparison level of the collator. A collation order
112 * consists of primary order, secondary order and tertiary order. The data
[all...] |
| /external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
| CollationElementIteratorTest.java | 62 int order = iterator.next(); local
64 while (order != CollationElementIterator.NULLORDER) {
65 orders[i++] = order;
66 order = iterator.next();
71 order = iterator.previous();
73 while (order != CollationElementIterator.NULLORDER) {
74 assertEquals(orders[--i], order);
75 order = iterator.previous();
86 int order = iterator.next(); local
88 while (order != CollationElementIterator.NULLORDER)
106 int order = iterator.next(); local
120 int order = iterator.next(); local
135 int order = iterator.next(); local
150 int order = iterator.next(); local
[all...] |
| /libcore/luni/src/test/java/libcore/java/nio/ |
| BufferTest.java | 56 b.order(ByteOrder.BIG_ENDIAN).asCharBuffer().get(chars, 1, 4);
58 b.order(ByteOrder.LITTLE_ENDIAN).asCharBuffer().get(chars, 1, 4);
62 b.order(ByteOrder.BIG_ENDIAN).asDoubleBuffer().get(doubles, 1, 1);
66 b.order(ByteOrder.LITTLE_ENDIAN).asDoubleBuffer().get(doubles, 1, 1);
72 b.order(ByteOrder.BIG_ENDIAN).asFloatBuffer().get(floats, 1, 2);
77 b.order(ByteOrder.LITTLE_ENDIAN).asFloatBuffer().get(floats, 1, 2);
84 b.order(ByteOrder.BIG_ENDIAN).asIntBuffer().get(ints, 1, 2);
89 b.order(ByteOrder.LITTLE_ENDIAN).asIntBuffer().get(ints, 1, 2);
96 b.order(ByteOrder.BIG_ENDIAN).asLongBuffer().get(longs, 1, 1);
100 b.order(ByteOrder.LITTLE_ENDIAN).asLongBuffer().get(longs, 1, 1)
[all...] |
| /external/speex/libspeex/ |
| quant_lsp.c | 71 static void compute_quant_weights(spx_lsp_t *qlsp, spx_word16_t *quant_weight, int order)
75 for (i=0;i<order;i++)
81 if (i==order-1)
159 void lsp_quant_nb(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits)
165 for (i=0;i<order;i++)
168 compute_quant_weights(qlsp, quant_weight, order);
170 for (i=0;i<order;i++)
174 for (i=0;i<order;i++)
177 id = lsp_quant(qlsp, cdbk_nb, NB_CDBK_SIZE, order);
180 for (i=0;i<order;i++
[all...] |
| /libcore/luni/src/main/java/java/security/spec/ |
| ECParameterSpec.java | 30 // Order of the generator
31 private final BigInteger order; field in class:ECParameterSpec
37 * the base point, the order of the generator (or base point) and the
44 * @param order
45 * the order of the generator.
49 * if {@code order <= zero} or {@code cofactor <= zero}.
52 BigInteger order, int cofactor) {
55 this.order = order;
57 // throw NullPointerException if curve, generator or order is nul
[all...] |
| /external/kernel-headers/original/linux/ |
| bitops.h | 13 int order; local
15 order = fls(count);
16 return order; /* We could be slightly more clever with -1 here... */
21 int order; local
23 order = fls(count) - 1;
25 order++;
26 return order;
|
| /external/dropbear/libtomcrypt/src/pk/ecc/ |
| ecc_test.c | 32 void *modulus, *order; local
36 if ((err = mp_init_multi(&modulus, &order, NULL)) != CRYPT_OK) {
43 mp_clear_multi(modulus, order, NULL);
54 if ((err = mp_read_radix(order, (char *)ltc_ecc_sets[i].order, 16)) != CRYPT_OK) { goto done; }
63 /* is order prime ? */
64 if ((err = mp_prime_is_prime(order, 8, &primality)) != CRYPT_OK) { goto done; }
74 /* then we should have G == (order + 1)G */
75 if ((err = mp_add_d(order, 1, order)) != CRYPT_OK) { goto done;
[all...] |
| /dalvik/tests/002-sleep/ |
| info.txt | 2 mostly meant as an easy thing to modify in order to test other things
|
| /external/chromium/net/tools/spdyshark/ |
| moduleinfo.h | 1 /* Included *after* config.h, in order to re-define these macros */
|
| /external/grub/ |
| Makefile.am | 1 # Do not change this order if you don't know what you are doing.
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/lib/ |
| libgomp.spec | 2 # standard libraries we need in order to link with -fopenmp.
|
| /dalvik/vm/mterp/c/ |
| OP_GOTO_32.cpp | 3 s4 offset = FETCH(1); /* low-order 16 bits */
4 offset |= ((s4) FETCH(2)) << 16; /* high-order 16 bits */
|
| /external/chromium/build/win/ |
| chrome_win.croc | 5 # List of rules, applied in order
7 # Specify inclusions before exclusions, since rules are in order.
|
| /libcore/luni/src/test/java/libcore/java/text/ |
| OldCollationElementIteratorTest.java | 34 int order = iterator.next(); local
36 while (order != CollationElementIterator.NULLORDER) {
37 orders[i++] = order;
38 order = iterator.next();
43 order = iterator.previous();
45 while (order != CollationElementIterator.NULLORDER) {
46 assertEquals(orders[--i], order);
47 order = iterator.previous();
|
