| /external/chromium/third_party/icu/public/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/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...] |
| /libcore/luni/src/main/java/java/text/ |
| CollationElementIterator.java | 66 * @param order
73 public int getMaxExpansion(int order) {
74 return this.icuIterator.getMaxExpansion(order);
125 * Obtains the primary order of the specified collation element, i.e. the
128 * @param order
130 * @return the element's 16 bit primary order.
132 public static final int primaryOrder(int order) {
133 return com.ibm.icu4jni.text.CollationElementIterator.primaryOrder(order);
150 * Obtains the secondary order of the specified collation element, i.e. the
153 * @param order
[all...] |
| /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();
|
| /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;
|
| gfp.h | 102 static inline void arch_free_page(struct page *page, int order) { }
109 unsigned int order)
111 if (unlikely(order >= MAX_ORDER))
118 return __alloc_pages(gfp_mask, order,
123 extern struct page *alloc_pages_current(gfp_t gfp_mask, unsigned order);
126 alloc_pages(gfp_t gfp_mask, unsigned int order)
128 if (unlikely(order >= MAX_ORDER))
131 return alloc_pages_current(gfp_mask, order);
136 #define alloc_pages(gfp_mask, order) \
137 alloc_pages_node(numa_node_id(), gfp_mask, order)
[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/speex/libspeex/ |
| quant_lsp.h | 57 void lsp_quant_nb(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits);
60 void lsp_unquant_nb(spx_lsp_t *lsp, int order, SpeexBits *bits);
63 void lsp_quant_lbr(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits);
66 void lsp_unquant_lbr(spx_lsp_t *lsp, int order, SpeexBits *bits);
69 void lsp_quant_high(spx_lsp_t *lsp, spx_lsp_t *qlsp, int order, SpeexBits *bits);
72 void lsp_unquant_high(spx_lsp_t *lsp, int order, SpeexBits *bits);
|
| 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...] |
| /frameworks/base/media/libstagefright/codecs/aacdec/ |
| tns_ar_filter.cpp | 44 - Include log2(order) as a scaling down parameter.
74 Description: Changed the order of the unsigned * signed multiply so the
112 order = order of the TNS filter (Range of 1 - TNS_MAX_ORDER)
143 y(n) = x(n) - lpc(2)*y(n-1) - ... - lpc(order+1)*y(n-order)
148 The filter's order is defined by the variable (const Int order)
192 FOR (i=0; i<order; i++)
205 FOR (j=0; j<order; j++
[all...] |
| tns_decode_coef.h | 106 const Int order,
|
| s_tnsfilt.h | 35 Description: Had to add "start_coef" and "stop_coef" in order to preserve
117 UInt order; member in struct:__anon9275
|
| tns_ar_filter.h | 95 const Int order);
|
| tns_inv_filter.cpp | 68 order = order of the TNS filter (Range of 1 : TNS_MAX_ORDER)
103 y(n) = x(n) + lpc(2)*x(n-1) + ... + lpc(order+1)*x(n-order)
108 In order to avoid overflow, the filter input (Int32 coef[]) must utilize
111 The filter's order is defined by the variable (const Int order)
125 This function should not be called for order <= 0.
167 FOR (i = order; i > 0; i--)
198 FOR (j = (order - wrap_point); j>0; j--
[all...] |
| tns_inv_filter.h | 91 const Int order,
|
| /libcore/luni/src/main/java/com/ibm/icu4jni/text/ |
| CollationElementIterator.java | 84 * specified comparison order.
85 * @param order collation order returned by previous or next.
91 public int getMaxExpansion(int order) {
92 return NativeCollation.getMaxExpansion(m_collelemiterator_, order);
132 * Gets the primary order of a collation order.
133 * @param order the collation order
134 * @return the primary order of a collation order
[all...] |
| /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...] |
| /external/webkit/WebKit/chromium/src/linux/ |
| WebFontRendering.cpp | 59 void WebFontRendering::setLCDOrder(SkFontHost::LCDOrder order)
61 SkFontHost::SetSubpixelOrder(order);
|
| /external/chromium/base/ |
| message_loop_unittest.cc | 212 // Test that two tasks with different delays run in the right order.
233 // Test that two tasks with the same delay run in the order in which they
608 // Saves the order in which the tasks executed.
652 // Saves the order the tasks ran.
655 OrderedTasks(TaskList* order, int cookie)
656 : order_(order),
660 OrderedTasks(TaskList* order, TaskType type, int cookie)
661 : order_(order),
683 TaskList* order() const { function in class:OrderedTasks
704 MessageBoxTask(TaskList* order, int cookie, bool is_reentrant
864 TaskList order; local
894 TaskList order; local
934 TaskList order; local
977 TaskList order; local
1038 TaskList order; local
1061 TaskList order; local
[all...] |
| /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...] |
| /external/openssl/crypto/ec/ |
| ec_check.c | 62 BIGNUM *order; local
76 if ((order = BN_CTX_get(ctx)) == NULL) goto err;
97 /* check the order of the generator */
99 if (!EC_GROUP_get_order(group, order, ctx)) goto err;
100 if (BN_is_zero(order))
106 if (!EC_POINT_mul(group, point, order, NULL, NULL, ctx)) goto err;
|
| /frameworks/base/core/java/android/view/ |
| Menu.java | 48 * This is the part of an order integer that the user can provide.
53 * Bit shift of the user portion of the order integer.
59 * This is the part of an order integer that supplies the category of the
65 * Bit shift of the category portion of the order integer.
85 * Category code for the order integer for items/groups that are part of a
91 * Category code for the order integer for items/groups that are provided by
97 * Category code for the order integer for items/groups that are
104 * Category code for the order integer for items/groups that are
157 * @param order The order for the item. Use {@link #NONE} if you do not car
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/luni/platform/ |
| PlatformAddress.java | 163 public final void setShort(int offset, short value, ByteOrder order) {
165 OSMemory.setShort(osaddr + offset, value, order);
173 public final short getShort(int offset, ByteOrder order) {
175 return OSMemory.getShort(osaddr + offset, order);
183 public final void setInt(int offset, int value, ByteOrder order) {
185 OSMemory.setInt(osaddr + offset, value, order);
193 public final int getInt(int offset, ByteOrder order) {
195 return OSMemory.getInt(osaddr + offset, order);
203 public final void setLong(int offset, long value, ByteOrder order) {
205 OSMemory.setLong(osaddr + offset, value, order);
[all...] |
| /libcore/luni/src/test/java/org/apache/harmony/nio/tests/java/nio/ |
| ByteBufferTest.java | 211 assertEquals(buf.order(), readonly.order());
346 assertEquals(buf.order(), duplicate.order());
635 method = "order",
639 // BIG_ENDIAN is the default byte order
640 assertEquals(ByteOrder.BIG_ENDIAN, buf.order());
642 buf.order(ByteOrder.LITTLE_ENDIAN);
643 assertEquals(ByteOrder.LITTLE_ENDIAN, buf.order());
645 buf.order(ByteOrder.BIG_ENDIAN)
[all...] |
