| /external/webkit/JavaScriptCore/tests/mozilla/Getopt/ |
| Mixed.pm | 41 # The permissible settings for $order:
104 $order = $REQUIRE_ORDER;
106 $order = $PERMUTE;
268 # If $order is $RETURN_IN_ORDER, and this is a normal argument (not an
278 return ("", shift @ARGV) if $order == $RETURN_IN_ORDER;
286 return () if $order == $REQUIRE_ORDER;
287 return ("", shift @ARGV) if $order == $RETURN_IN_ORDER;
369 $order = $PERMUTE if $order == $RETURN_IN_ORDER;
553 is also the only method that lets you find out what order the option
[all...] |
| /hardware/ril/mock-ril/src/java/com/android/internal/communication/ |
| Msg.java | 45 lenBuffer.order(ByteOrder.LITTLE_ENDIAN);
63 lenBuffer.order(ByteOrder.LITTLE_ENDIAN);
|
| /libcore/luni/src/test/java/org/apache/harmony/nio/tests/java/nio/ |
| FloatBufferTest.java | 184 assertEquals(buf.order(), readonly.order());
323 assertEquals(buf.order(), duplicate.order());
594 method = "order",
598 buf.order();
600 assertEquals(ByteOrder.nativeOrder(), buf.order());
821 assertEquals(buf.order(), slice.order());
|
| DoubleBufferTest.java | 188 assertEquals(buf.order(), readonly.order());
327 assertEquals(buf.order(), duplicate.order());
599 method = "order",
603 assertEquals(ByteOrder.nativeOrder(), buf.order());
813 assertEquals(buf.order(), slice.order());
|
| IntBufferTest.java | 159 assertEquals(buf.order(), readonly.order());
279 assertEquals(buf.order(), duplicate.order());
550 method = "order",
554 assertEquals(ByteOrder.nativeOrder(), buf.order());
797 assertEquals(buf.order(), slice.order());
|
| LongBufferTest.java | 158 assertEquals(buf.order(), readonly.order());
278 assertEquals(buf.order(), duplicate.order());
549 method = "order",
553 assertEquals(ByteOrder.nativeOrder(), buf.order());
779 assertEquals(buf.order(), slice.order());
|
| ShortBufferTest.java | 158 assertEquals(buf.order(), readonly.order());
278 assertEquals(buf.order(), duplicate.order());
543 method = "order",
547 assertEquals(ByteOrder.nativeOrder(), buf.order());
790 assertEquals(buf.order(), slice.order());
|
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
| OpenWnnDictionaryImpl.java | 83 " from " + TABLE_NAME_DIC + " where %s order by " +
93 " from " + TABLE_NAME_DIC + " where %s = ? and %s = ? and %s order by " +
411 * @param order The type of sort order
413 protected void createQuery( String keyString, WnnWord wnnWord, int operation, int order) {
491 switch( order ) {
531 public int searchWord( int operation, int order, String keyString ) {
540 createQuery( keyString, null, operation, order );
563 int ret = OpenWnnDictionaryImplJni.searchWord( this.mWnnWork, operation, order, keyString );
576 public int searchWord( int operation, int order, String keyString, WnnWord wnnWord )
[all...] |
| /sdk/ddms/libs/ddmlib/src/com/android/ddmlib/ |
| HandleNativeHeap.java | 132 buffer.order(ByteOrder.LITTLE_ENDIAN);
203 buffer.order(ByteOrder.BIG_ENDIAN);
|
| HeapSegment.java | 254 hpsgData.order(ByteOrder.BIG_ENDIAN);
263 mUsageData.order(ByteOrder.BIG_ENDIAN); // doesn't actually matter
|
| /external/chromium/third_party/icu/source/i18n/ |
| ucol.cpp | 876 * a) collapse the 2 different Han ranges from UCA into one (in the right order), and
1355 uint32_t order = 0; local
2022 uint32_t order; local
4442 uint32_t order = UCOL_NO_MORE_CES; local
4890 uint32_t order = 0; local
5511 uint32_t order = 0; local
[all...] |
| ucal.cpp | 580 UResourceBundle *order = ures_getByKey(rb, prefRegion, NULL, status); local
583 order = ures_getByKey(rb, "001", NULL, status);
591 for (int i = 0; i < ures_getSize(order); i++) {
593 const UChar *type = ures_getStringByIndex(order, i, &len, status);
626 ures_close(order);
|
| /external/icu4c/i18n/ |
| ucal.cpp | 611 UResourceBundle *order = ures_getByKey(rb, prefRegion, NULL, status); local
614 order = ures_getByKey(rb, "001", NULL, status);
622 for (int i = 0; i < ures_getSize(order); i++) {
624 const UChar *type = ures_getStringByIndex(order, i, &len, status);
657 ures_close(order);
|
| ucol.cpp | 932 * a) collapse the 2 different Han ranges from UCA into one (in the right order), and
1387 uint32_t order = 0; local
4283 uint32_t order = UCOL_NO_MORE_CES; local
4713 uint32_t order = 0; local
5314 uint32_t order = 0; local
[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/chromium/third_party/icu/source/test/cintltst/ |
| callcoll.c | 445 int32_t order; local
454 while ((order=ucol_next(iter, &status)) != UCOL_NULLORDER)
467 orders[size].order = order;
509 if (o != orders[index].order) {
513 while (index > 0 && orders[-- index].order == 0) {
517 if (o != orders[index].order) {
518 log_err("Mismatched order at index %d: 0x%8.8X vs. 0x%8.8X\n", index,
519 orders[index].order, o);
535 while (index != 0 && orders[index - 1].order == 0)
[all...] |
| citertst.c | 804 uint32_t order; local
810 order = ucol_previous(iter, &status);
813 if (order == 0)
814 order = ucol_previous(iter, &status);
821 size = ucol_getMaxExpansion(iter, order);
831 uint32_t order; local
834 order = ucol_previous(iter, &status);
835 size = ucol_getMaxExpansion(iter, order);
986 if ((count > 250 && testorders[-- count].order != orders[1].order) ||
[all...] |
| /external/icu4c/test/cintltst/ |
| callcoll.c | 445 int32_t order; local
454 while ((order=ucol_next(iter, &status)) != UCOL_NULLORDER)
467 orders[size].order = order;
512 if (o != orders[index].order) {
516 while (index > 0 && orders[-- index].order == 0) {
520 if (o != orders[index].order) {
521 log_err("Mismatched order at index %d: 0x%8.8X vs. 0x%8.8X\n", index,
522 orders[index].order, o);
538 while (index != 0 && orders[index - 1].order == 0)
[all...] |
| citertst.c | 804 uint32_t order; local
810 order = ucol_previous(iter, &status);
813 if (order == 0)
814 order = ucol_previous(iter, &status);
821 size = ucol_getMaxExpansion(iter, order);
831 uint32_t order; local
834 order = ucol_previous(iter, &status);
835 size = ucol_getMaxExpansion(iter, order);
986 if ((count > 250 && testorders[-- count].order != orders[1].order) ||
[all...] |
| /build/tools/releasetools/ |
| check_target_files_signatures | 321 order = [(-len(v), k) for (k, v) in by_cert.iteritems()]
322 order.sort()
324 for _, cert in order:
|
| /external/zlib/contrib/infback9/ |
| infback9.c | 249 static const unsigned short order[19] = /* permutation of code lengths */ local
366 state->lens[order[state->have++]] = (unsigned short)BITS(3);
370 state->lens[order[state->have++]] = 0;
|
| /external/zlib/contrib/puff/ |
| puff.c | 20 * assumed to be 16 bits, for arrays in order to to conserve memory. The code
191 * each length, which for a canonical code are stepped through in order.
192 * symbol[] are the symbol values in canonical order, where the number of
212 * build the code value reversed from what is in the stream in order to
299 * sorted by length, retaining their original order within each length. The
324 * - Within a given code length, the symbols are kept in ascending order for
356 * put symbols in table sorted by length, by symbol order within each
572 * - The code lengths are stored in order for the symbols, so lengths are
621 * code. The code length code lengths are received in a permuted order (see
622 * the order[] array below) to make a short code length code length list mor
654 static const short order[19] = \/* permutation of code length codes *\/ local
[all...] |
| /bionic/libc/kernel/common/linux/ |
| msm_q6vdec.h | 95 u32 order; member in struct:vdec_config
|
| /development/samples/ApiDemos/src/com/example/android/apis/app/ |
| MenuInflateFromXml.java | 44 R.menu.checkable, R.menu.shortcuts, R.menu.order, R.menu.category_order,
53 "Checkable", "Shortcuts", "Order", "Category and Order",
|
| /development/samples/ApiDemos/src/com/example/android/apis/graphics/ |
| CompressedTextureActivity.java | 137 .order(ByteOrder.nativeOrder());
|
