| /external/chromium_org/third_party/icu/source/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...] |
| /external/chromium_org/third_party/opus/src/silk/float/ |
| schur_FLP.c | 35 silk_float refl_coef[], /* O reflection coefficients (length order) */
36 const silk_float auto_corr[], /* I autocorrelation sequence (length order+1) */
37 opus_int order /* I order */
44 silk_assert( order==6||order==8||order==10||order==12||order==14||order==16 )
[all...] |
| warped_autocorrelation_FLP.c | 36 silk_float *corr, /* O Result [order + 1] */
40 const opus_int order /* I Correlation order (even) */
48 /* Order must be even */
49 silk_assert( ( order & 1 ) == 0 );
55 for( i = 0; i < order; i += 2 ) {
65 state[ order ] = tmp1;
66 C[ order ] += state[ 0 ] * tmp1;
70 for( i = 0; i < order + 1; i++ ) {
|
| /libcore/luni/src/main/java/java/security/spec/ |
| ECParameterSpec.java | 30 // Order of the generator
31 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) {
55 this(curve, generator, order, cofactor, null);
66 BigInteger order, int cofactor, String curveName) {
69 this.order = order
[all...] |
| /libcore/luni/src/main/java/java/text/ |
| CollationElementIterator.java | 68 * @param order
75 public int getMaxExpansion(int order) {
76 return this.icuIterator.getMaxExpansion(order);
127 * Obtains the primary order of the specified collation element, i.e. the
130 * @param order
132 * @return the element's 16 bit primary order.
134 public static final int primaryOrder(int order) {
135 return CollationElementIteratorICU.primaryOrder(order);
152 * Obtains the secondary order of the specified collation element, i.e. the
155 * @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();
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/tests/data/fixers/ |
| bad_order.py | 5 order = "crazy" variable in class:FixBadOrder
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/tests/data/fixers/ |
| bad_order.py | 5 order = "crazy" variable in class:FixBadOrder
|
| /external/chromium_org/third_party/opus/src/silk/fixed/ |
| schur_FIX.c | 37 opus_int16 *rc_Q15, /* O reflection coefficients [order] Q15 */
38 const opus_int32 *c, /* I correlations [order+1] */
39 const opus_int32 order /* I prediction order */
46 silk_assert( order==6||order==8||order==10||order==12||order==14||order==16 )
[all...] |
| schur64_FIX.c | 37 opus_int32 rc_Q16[], /* O Reflection coefficients [order] Q16 */
38 const opus_int32 c[], /* I Correlations [order+1] */
39 opus_int32 order /* I Prediction order */
46 silk_assert( order==6||order==8||order==10||order==12||order==14||order==16 )
[all...] |
| corrMatrix_FIX.c | 40 const opus_int16 *x, /* I x vector [L + order - 1] used to form data matrix X */
43 const opus_int order, /* I Max lag for correlation */
44 opus_int32 *Xt, /* O Pointer to X'*t correlation vector [order] */
52 ptr1 = &x[ order - 1 ]; /* Points to first sample of column 0 of X: X[:,0] */
57 for( lag = 0; lag < order; lag++ ) {
67 for( lag = 0; lag < order; lag++ ) {
76 const opus_int16 *x, /* I x vector [L + order - 1] used to form data matrix X */
78 const opus_int order, /* I Max lag for correlation */
80 opus_int32 *XX, /* O Pointer to X'*X correlation matrix [ order x order ] */
[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/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...] |
| /libcore/luni/src/main/java/libcore/io/ |
| HeapBufferIterator.java | 31 private final ByteOrder order; field in class:HeapBufferIterator
35 HeapBufferIterator(byte[] buffer, int offset, int byteCount, ByteOrder order) {
39 this.order = order;
62 int result = Memory.peekInt(buffer, offset + position, order);
69 Memory.unsafeBulkGet(dst, dstOffset, byteCount, buffer, offset + position, SizeOf.INT, order.needsSwap);
74 short result = Memory.peekShort(buffer, offset + position, order);
81 * {@code byteCount} bytes. Items larger than a byte are interpreted using the given byte order.
83 public static BufferIterator iterator(byte[] buffer, int offset, int byteCount, ByteOrder order) {
84 return new HeapBufferIterator(buffer, offset, byteCount, order);
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/tests/data/fixers/myfixes/ |
| fix_preorder.py | 4 order = "pre" variable in class:FixPreorder
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/tests/data/fixers/myfixes/ |
| fix_preorder.py | 4 order = "pre" variable in class:FixPreorder
|
| /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/chromium_org/net/dns/ |
| address_sorter_posix_unittest.cc | 158 // Verify that NULL-terminated |addresses| matches (-1)-terminated |order|
160 void Verify(const char* addresses[], const int order[]) {
164 for (size_t i = 0; order[i] >= 0; ++i)
165 CHECK_LT(order[i], static_cast<int>(list.size()));
173 for (size_t i = 0; (i < result.size()) || (order[i] >= 0); ++i) {
174 IPEndPoint expected = order[i] >= 0 ? list[order[i]] : IPEndPoint();
177 "Address out of order at position " << i << "\n" <<
191 const int order[] = { 1, -1 };
192 Verify(addresses, 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/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 | 113 b.order(ByteOrder.BIG_ENDIAN).asCharBuffer().get(chars, 1, 4);
115 b.order(ByteOrder.LITTLE_ENDIAN).asCharBuffer().get(chars, 1, 4);
119 b.order(ByteOrder.BIG_ENDIAN).asDoubleBuffer().get(doubles, 1, 1);
123 b.order(ByteOrder.LITTLE_ENDIAN).asDoubleBuffer().get(doubles, 1, 1);
129 b.order(ByteOrder.BIG_ENDIAN).asFloatBuffer().get(floats, 1, 2);
134 b.order(ByteOrder.LITTLE_ENDIAN).asFloatBuffer().get(floats, 1, 2);
141 b.order(ByteOrder.BIG_ENDIAN).asIntBuffer().get(ints, 1, 2);
146 b.order(ByteOrder.LITTLE_ENDIAN).asIntBuffer().get(ints, 1, 2);
153 b.order(ByteOrder.BIG_ENDIAN).asLongBuffer().get(longs, 1, 1);
157 b.order(ByteOrder.LITTLE_ENDIAN).asLongBuffer().get(longs, 1, 1)
[all...] |
| /external/skia/tests/ |
| PathOpsQuadReduceOrderTest.cpp | 32 int order; local
51 order = reducer.reduce(quad, SkReduceOrder::kFill_Style);
52 if (order != 2) {
53 printf("[%d] line quad order=%d\n", (int) index, order);
58 order = reducer.reduce(quad, SkReduceOrder::kFill_Style);
59 if (order != 3) {
60 printf("[%d] line mod quad order=%d\n", (int) index, order);
|
| /external/chromium_org/base/message_loop/ |
| message_loop_unittest.cc | 209 // Test that two tasks with different delays run in the right order.
234 // Test that two tasks with the same delay run in the order in which they
626 // Saves the order in which the tasks executed.
694 // Saves the order the tasks ran.
695 void OrderedFunc(TaskList* order, int cookie) {
696 order->RecordStart(ORDERED, cookie);
697 order->RecordEnd(ORDERED, cookie);
705 void MessageBoxFunc(TaskList* order, int cookie, bool is_reentrant) {
706 order->RecordStart(MESSAGEBOX, cookie);
710 order->RecordEnd(MESSAGEBOX, cookie)
810 TaskList order; local
845 TaskList order; local
884 TaskList order; local
924 TaskList order; local
968 TaskList order; local
1037 TaskList order; local
1063 TaskList order; local
1118 TaskList order; local
1152 TaskList order; local
1172 TaskList order; local
1198 TaskList order; local
1237 TaskList order; local
1266 TaskList order; local
1295 TaskList order; local
1327 TaskList order; local
[all...] |
