| /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...] |
| /development/ide/eclipse/ |
| android.importorder | 1 #Organize Import Order
|
| /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...] |
| ucoleitr.h | 71 * . t_int32 order, primaryOrder;
79 * . order = ucol_next(c, &success);
81 * . order = ucol_prev(c, &success);
88 * ucol_next() returns the collation order of the next.
89 * ucol_prev() returns the collation order of the previous character.
95 * ucol_prev or ucol_next, the first or last collation order will be returned.
101 * Character based on the comparison level of the collator. A collation order
102 * consists of primary order, secondary order and tertiary order. The data
[all...] |
| /dalvik/libcore/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
| CollationElementIteratorTest.java | 78 int order = iterator.next(); local
80 while (order != CollationElementIterator.NULLORDER) {
81 orders[i++] = order;
82 order = iterator.next();
87 order = iterator.previous();
89 while (order != CollationElementIterator.NULLORDER) {
90 assertEquals(orders[--i], order);
91 order = iterator.previous();
112 int order = iterator.next(); local
114 while (order != CollationElementIterator.NULLORDER)
141 int order = iterator.next(); local
166 int order = iterator.next(); local
185 int order = iterator.next(); local
205 int order = iterator.next(); local
225 int order = iterator.next(); local
[all...] |
| /dalvik/libcore/security/src/main/java/java/security/spec/ |
| ECParameterSpec.java | 32 // Order of the generator
33 private final BigInteger order; field in class:ECParameterSpec
39 * the base point, the order of the generator (or base point) and the
46 * @param order
47 * the order of the generator.
51 * if {@code order <= zero} or {@code cofactor <= zero}.
54 BigInteger order, int cofactor) {
57 this.order = order;
59 // throw NullPointerException if curve, generator or order is nul
[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...] |
| /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/libcore/icu/src/main/java/com/ibm/icu4jni/text/ |
| CollationElementIterator.java | 88 * specified comparison order.
89 * @param order collation order returned by previous or next.
95 public int getMaxExpansion(int order)
97 return NativeCollation.getMaxExpansion(m_collelemiterator_, order);
141 * Gets the primary order of a collation order.
142 * @param order the collation order
143 * @return the primary order of a collation order
[all...] |
| /dalvik/tests/002-sleep/ |
| info.txt | 2 mostly meant as an easy thing to modify in order to test other things
|
| /external/grub/ |
| Makefile.am | 1 # Do not change this order if you don't know what you are doing.
|
| /dalvik/vm/mterp/c/ |
| OP_GOTO_32.c | 3 s4 offset = FETCH(1); /* low-order 16 bits */
4 offset |= ((s4) FETCH(2)) << 16; /* high-order 16 bits */
|
| /external/webkit/WebCore/icu/unicode/ |
| ucoleitr.h | 63 * . t_int32 order, primaryOrder;
71 * . order = ucol_next(c, &success);
73 * . order = ucol_prev(c, &success);
80 * ucol_next() returns the collation order of the next.
81 * ucol_prev() returns the collation order of the previous character.
87 * ucol_prev or ucol_next, the first or last collation order will be returned.
93 * Character based on the comparison level of the collator. A collation order
94 * consists of primary order, secondary order and tertiary order. The data
[all...] |
| /packages/apps/Contacts/res/values-ja/ |
| donottranslate_config.xml | 21 <!-- If true, an option is shown in Display Options UI to choose a sort order -->
24 <!-- If true, the default sort order is primary (i.e. by given name) -->
27 <!-- If true, an option is shown in Display Options UI to choose a name display order -->
30 <!-- If true, the default sort order is primary (i.e. by given name) -->
33 <!-- If true, the order of name fields in the editor is primary (i.e. given name first) -->
|
| /packages/apps/Contacts/res/values-ko/ |
| donottranslate_config.xml | 21 <!-- If true, an option is shown in Display Options UI to choose a sort order -->
24 <!-- If true, the default sort order is primary (i.e. by given name) -->
27 <!-- If true, an option is shown in Display Options UI to choose a name display order -->
30 <!-- If true, the default sort order is primary (i.e. by given name) -->
33 <!-- If true, the order of name fields in the editor is primary (i.e. given name first) -->
|
| /packages/apps/Contacts/res/values-zh-rCN/ |
| donottranslate_config.xml | 21 <!-- If true, an option is shown in Display Options UI to choose a sort order -->
24 <!-- If true, the default sort order is primary (i.e. by given name) -->
27 <!-- If true, an option is shown in Display Options UI to choose a name display order -->
30 <!-- If true, the default sort order is primary (i.e. by given name) -->
33 <!-- If true, the order of name fields in the editor is primary (i.e. given name first) -->
|
| /packages/apps/Contacts/res/values-zh-rTW/ |
| donottranslate_config.xml | 21 <!-- If true, an option is shown in Display Options UI to choose a sort order -->
24 <!-- If true, the default sort order is primary (i.e. by given name) -->
27 <!-- If true, an option is shown in Display Options UI to choose a name display order -->
30 <!-- If true, the default sort order is primary (i.e. by given name) -->
33 <!-- If true, the order of name fields in the editor is primary (i.e. given name first) -->
|
| /external/dnsmasq/contrib/try-all-ns/ |
| README-2.47 | 6 as it doesn't add new switch, rather it binds itself to "strict-order".
8 What it does is: if you have strict-order in the
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| statesort.h | 28 // Sorts the input states of an FST, modifying it. ORDER[i] gives the
30 // sorting. ORDER must be a permutation of FST's states ID sequence:
34 const vector<typename Arc::StateId> &order) {
38 CHECK_EQ(order.size(), fst->NumStates());
45 vector<bool> done(order.size(), false);
49 fst->SetStart(order[fst->Start()]);
64 s2 = order[s1];
77 arc.nextstate = order[arc.nextstate];
|
| /external/openssl/crypto/ecdsa/ |
| ecs_ossl.c | 93 BIGNUM *k = NULL, *r = NULL, *order = NULL, *X = NULL; local
117 order = BN_new();
119 if (!k || !r || !order || !X)
129 if (!EC_GROUP_get_order(group, order, ctx))
139 if (!BN_rand_range(k, order))
171 if (!BN_nnmod(r, X, order, ctx))
180 if (!BN_mod_inverse(k, k, order, ctx))
202 if (order != NULL)
203 BN_free(order);
216 BIGNUM *kinv=NULL, *s, *m=NULL,*tmp=NULL,*order=NULL local
348 BIGNUM *order, *u1, *u2, *m, *X; local
[all...] |
| /external/icu4c/layout/ |
| LookupProcessor.cpp | 67 for (le_uint16 order = 0; order < lookupOrderCount; order += 1) {
68 le_uint16 lookup = lookupOrderArray[order];
106 le_int32 LookupProcessor::selectLookups(const FeatureTable *featureTable, FeatureMask featureMask, le_int32 order)
109 le_int32 store = order;
118 return store - order;
173 le_int32 count, order = 0; local
209 count += selectLookups(requiredFeatureTable, fm.mask, order);
215 OpenTypeUtilities::sort(lookupOrderArray, order);
[all...] |
| /dalvik/libcore/sql/src/main/java/SQLite/ |
| ProgressHandler.java | 12 * current query, or false in order
|
| /external/dnsmasq/contrib/dns-loc/ |
| README | 4 entries in order to assign location information to dns records
|
| /external/iptables/include/linux/netfilter_ipv4/ |
| ipt_iprange.h | 10 /* Inclusive: network order. */
|
