| /external/chromium_org/third_party/icu/source/i18n/ |
| ucal.cpp | 621 UResourceBundle *order = ures_getByKey(rb, prefRegion, NULL, status); local
624 order = ures_getByKey(rb, "001", NULL, status);
632 for (int i = 0; i < ures_getSize(order); i++) {
634 const UChar *type = ures_getStringByIndex(order, i, &len, status);
667 ures_close(order);
|
| /external/chromium_org/third_party/openssl/openssl/crypto/ec/ |
| ec_lcl.h | 193 BIGNUM order, cofactor; member in struct:ec_group_st
|
| ecp_smpl.c | 290 BIGNUM *a,*b,*order,*tmp_1,*tmp_2; local
308 order = BN_CTX_get(ctx);
309 if (order == NULL) goto err;
[all...] |
| ectest.c | 195 /* test multiplication with group order, long and negative scalars */
198 BIGNUM *n1, *n2, *order; local
203 n1 = BN_new(); n2 = BN_new(); order = BN_new();
204 fprintf(stdout, "verify group order ...");
206 if (!EC_GROUP_get_order(group, order, ctx)) ABORT;
207 if (!EC_POINT_mul(group, Q, order, NULL, NULL, ctx)) ABORT;
212 if (!EC_POINT_mul(group, Q, order, NULL, NULL, ctx)) ABORT;
217 /* n1 = 1 - order */
218 if (!BN_sub(n1, n1, order)) ABORT;
221 /* n2 = 1 + order */
1284 const char *p, *a, *b, *Qx, *Qy, *Gx, *Gy, *order, *d; member in struct:nistp_test_params
1336 BIGNUM *p, *a, *b, *x, *y, *n, *m, *order; local
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/ |
| mem_dbg.c | 136 static unsigned long order = 0; /* number of memory requests */ variable
179 unsigned long order; member in struct:mem_st
248 * appropriate order (long-time lock first).
525 if (order == break_order_num)
528 m->order=order;
530 m->order=order++;
533 m->order,
589 mp->order, mp->addr, mp->num)
[all...] |
| /external/emma/core/java12/com/vladium/emma/report/lcov/ |
| ReportGenerator.java | 122 final ItemComparator order = local
124 for (Iterator packages = item.getChildren(order); packages.hasNext(); )
147 final ItemComparator order = m_typeSortComparators[id]; local
148 for (Iterator srcORclsFiles = item.getChildren(order);
208 final ItemComparator order = m_typeSortComparators[ local
211 for (Iterator classes = item.getChildren(order);
|
| /external/emma/core/java12/com/vladium/emma/report/txt/ |
| ReportGenerator.java | 176 final ItemComparator order = m_typeSortComparators [PackageItem.getTypeMetadata ().getTypeID ()]; local
177 for (Iterator packages = item.getChildren (order); packages.hasNext (); )
225 final ItemComparator order = m_typeSortComparators [m_srcView ? SrcFileItem.getTypeMetadata ().getTypeID () : ClassItem.getTypeMetadata ().getTypeID ()]; local
226 for (Iterator srcORclsFiles = item.getChildren (order); srcORclsFiles.hasNext (); )
267 final ItemComparator order = m_typeSortComparators [ClassItem.getTypeMetadata ().getTypeID ()]; local
268 for (Iterator classes = item.getChildren (order); classes.hasNext (); )
317 final ItemComparator order = m_typeSortComparators [MethodItem.getTypeMetadata ().getTypeID ()]; local
318 for (Iterator methods = item.getChildren (order); methods.hasNext (); )
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| TableCollectionTest.java | 154 @Override public List<String> order(List<String> insertionOrder) {
172 @Override public List<String> order(List<String> insertionOrder) {
190 @Override public List<String> order(List<String> insertionOrder) {
209 @Override public List<String> order(List<String> insertionOrder) {
236 @Override public List<String> order(List<String> insertionOrder) {
280 @Override public List<String> order(List<String> insertionOrder) {
309 @Override public List<String> order(List<String> insertionOrder) {
585 @Override public List<String> order(List<String> insertionOrder) {
625 @Override public List<String> order(List<String> insertionOrder) {
695 public List<Cell<String, Integer, Character>> order( method in class:TableCollectionTest.TestCellSetGenerator
[all...] |
| /external/icu4c/i18n/ |
| ucal.cpp | 680 UResourceBundle *order = ures_getByKey(rb, prefRegion, NULL, status); local
683 order = ures_getByKey(rb, "001", NULL, status);
691 for (int i = 0; i < ures_getSize(order); i++) {
693 const UChar *type = ures_getStringByIndex(order, i, &len, status);
726 ures_close(order);
|
| /external/icu4c/test/intltest/ |
| colldata.cpp | 46 int32_t order; local
71 while ((order = ucol_next(elems, &status)) != UCOL_NULLORDER) {
72 UBool cont = isContinuation(order);
74 order &= strengthMask;
76 if (toShift && variableTop > (uint32_t)order && (order & UCOL_PRIMARYORDERMASK) != 0) {
78 order &= UCOL_PRIMARYORDERMASK;
80 order = UCOL_IGNORABLE;
84 if (order == UCOL_IGNORABLE) {
89 order |= UCOL_CONTINUATION_MARKER
[all...] |
| /external/iproute2/tc/ |
| f_u32.c | 987 __u32 order = 0; local
1045 } else if (matches(*argv, "order") == 0) {
1047 if (get_u32(&order, *argv, 0)) {
1048 fprintf(stderr, "Illegal \"order\"\n");
1156 if (order) {
1157 if (TC_U32_NODE(t->tcm_handle) && order != TC_U32_NODE(t->tcm_handle)) {
1158 fprintf(stderr, "\"order\" contradicts \"handle\"\n");
1161 t->tcm_handle |= order;
1190 fprintf(f, "order %d ", TC_U32_NODE(handle));
|
| /external/openfst/src/include/fst/ |
| replace-util.h | 111 // 'nnonterm' non-terminals (updating in reverse dependency order).
120 // (updating in dependency order).
170 // Get topological order of dependencies. Returns false with cyclic input.
405 // Finds topological order of dependencies.
406 vector<StateId> order; local
409 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
416 toporder->resize(order.size());
417 for (Label i = 0; i < order.size(); ++i)
418 (*toporder)[order[i]] = i;
454 // Visits Fsts in reverse topological order of dependencies an
[all...] |
| rmepsilon.h | 252 // States sorted in topological order when (acyclic) or generic
253 // topological order (cyclic).
261 vector<StateId> order; local
263 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
271 states.resize(order.size());
272 for (StateId i = 0; i < order.size(); i++)
273 states[order[i]] = i;
|
| /external/openssl/crypto/ec/ |
| ec_lcl.h | 193 BIGNUM order, cofactor; member in struct:ec_group_st
|
| ecp_smpl.c | 290 BIGNUM *a,*b,*order,*tmp_1,*tmp_2; local
308 order = BN_CTX_get(ctx);
309 if (order == NULL) goto err;
[all...] |
| ectest.c | 195 /* test multiplication with group order, long and negative scalars */
198 BIGNUM *n1, *n2, *order; local
203 n1 = BN_new(); n2 = BN_new(); order = BN_new();
204 fprintf(stdout, "verify group order ...");
206 if (!EC_GROUP_get_order(group, order, ctx)) ABORT;
207 if (!EC_POINT_mul(group, Q, order, NULL, NULL, ctx)) ABORT;
212 if (!EC_POINT_mul(group, Q, order, NULL, NULL, ctx)) ABORT;
217 /* n1 = 1 - order */
218 if (!BN_sub(n1, n1, order)) ABORT;
221 /* n2 = 1 + order */
1284 const char *p, *a, *b, *Qx, *Qy, *Gx, *Gy, *order, *d; member in struct:nistp_test_params
1336 BIGNUM *p, *a, *b, *x, *y, *n, *m, *order; local
[all...] |
| /external/openssl/crypto/ |
| mem_dbg.c | 136 static unsigned long order = 0; /* number of memory requests */ variable
179 unsigned long order; member in struct:mem_st
248 * appropriate order (long-time lock first).
525 if (order == break_order_num)
528 m->order=order;
530 m->order=order++;
533 m->order,
589 mp->order, mp->addr, mp->num)
[all...] |
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| rmepsilon.h | 209 // States sorted in topological order when (acyclic) or generic
210 // topological order (cyclic).
217 vector<StateId> order; local
219 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
223 states.resize(order.size());
224 for (StateId i = 0; i < (StateId)order.size(); i++)
225 states[order[i]] = i;
|
| /external/tremolo/Tremolo/ |
| codec_internal.h | 96 int order; member in struct:__anon26914
|
| /hardware/qcom/display/msm8974/libexternal/ |
| external.cpp | 560 int order = getModeOrder(mode); local
561 if (order > bestOrder) {
562 bestOrder = order;
|
| /packages/apps/LegacyCamera/src/com/android/camera/ |
| Thumbnail.java | 203 String order = ImageColumns.DATE_TAKEN + " DESC," + ImageColumns._ID + " DESC"; local
207 cursor = resolver.query(query, projection, selection, null, order);
228 String order = VideoColumns.DATE_TAKEN + " DESC," + VideoColumns._ID + " DESC"; local
232 cursor = resolver.query(query, projection, selection, null, order);
|
| /system/core/libpixelflinger/codeflinger/tinyutils/ |
| VectorImpl.cpp | 459 ssize_t SortedVectorImpl::_indexOrderOf(const void* item, size_t* order) const
481 if (order) *order = l;
487 size_t order; local
488 ssize_t index = _indexOrderOf(item, &order);
490 index = VectorImpl::insertAt(item, order, 1);
|
| /system/extras/librank/ |
| librank.c | 69 static int order; variable
228 order = -1;
302 order *= -1;
432 " (Default sort order is PSS.)\n"
435 " -R Reverse sort order (default is descending).\n"
463 return order * numcmp(
471 return order * compfn( \
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/nio/tests/java/nio/ |
| ByteBufferTest.java | 142 assertEquals(buf.order(), readonly.order());
255 assertEquals(buf.order(), duplicate.order());
485 // BIG_ENDIAN is the default byte order
486 assertEquals(ByteOrder.BIG_ENDIAN, buf.order());
488 buf.order(ByteOrder.LITTLE_ENDIAN);
489 assertEquals(ByteOrder.LITTLE_ENDIAN, buf.order());
491 buf.order(ByteOrder.BIG_ENDIAN);
492 assertEquals(ByteOrder.BIG_ENDIAN, buf.order());
[all...] |
| CharBufferTest.java | 99 assertEquals(buf.order(), readonly.order());
124 assertEquals(buf.order(), readonly.order());
227 assertEquals(buf.order(), duplicate.order());
254 assertEquals(buf.order(), duplicate.order());
630 assertEquals(buf.order(), slice.order());
[all...] |
