| /libcore/luni/src/test/java/libcore/java/text/ |
| OldCollationElementIteratorTest.java | 33 int[] orders = new int[text.length()]; local
37 orders[i++] = order;
46 assertEquals(orders[--i], order);
|
| /external/icu4c/test/intltest/ |
| tscoll.cpp | 404 LocalArray<Order> orders(getOrders(iter, orderLength));
421 } else { // this is an error, orders exhausted but there are non-ignorable CEs from
423 errln("Backward iteration returned a non ignorable after orders are exhausted");
429 if (o != orders[index].order) {
433 while (index > 0 && orders[--index].order == 0) {
437 if (o != orders[index].order) {
439 orders[index].order, o);
447 if (offset != orders[index].offset) {
449 orders[index].offset, offset);
457 while (index != 0 && orders[index - 1].order == 0
[all...] |
| tscoll.h | 48 * Return an integer array containing all of the collation orders
|
| itercoll.h | 104 * Return a string containing all of the collation orders
|
| itercoll.cpp | 191 Order *orders = getOrders(*iter, orderLength); local
220 delete[] orders;
581 * Return a string containing all of the collation orders
|
| /external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
| CollationElementIteratorTest.java | 61 int[] orders = new int[text.length()]; local
65 orders[i++] = order;
74 assertEquals(orders[--i], order);
85 int[] orders = new int[text.length()]; local
89 orders[i++] = order;
|
| /external/quake/quake/src/WinQuake/data/ |
| ORDER.TXT | 21 INTERNATIONAL ORDERS
47 International phone orders will NOT be accepted. Unfortunately, due
48 to international shipping costs, all international orders are sent
95 Shipping: US orders-$5.00 first product/$2.00 each additional
98 International shipping for prepaid orders are via US Mail, and
|
| /external/icu4c/test/cintltst/ |
| callcoll.c | 439 * Return an integer array containing all of the collation orders
450 OrderAndOffset *orders =(OrderAndOffset *)malloc(sizeof(OrderAndOffset) * maxSize); local
461 memcpy(temp, orders, size * sizeof(OrderAndOffset));
462 free(orders);
463 orders = temp;
467 orders[size].order = order;
468 orders[size].offset = offset;
478 memcpy(temp, orders, size * sizeof(OrderAndOffset));
479 free(orders);
480 orders = temp
497 OrderAndOffset *orders = getOrders(iter, &orderLength); local
[all...] |
| /external/libffi/testsuite/libffi.call/ |
| float3.c | 2 Purpose: Check float arguments with different orders.
|
| /external/llvm/test/CodeGen/ARM/ |
| 2011-08-29-SchedCycle.ll | 13 ; entry), legalizer can serialize them in arbitrary orders. If it's
|
| /packages/apps/QuickSearchBox/src/com/android/quicksearchbox/ |
| CorpusRanker.java | 24 * Orders corpora by importance.
|
| /external/guava/src/com/google/common/collect/ |
| ByFunctionOrdering.java | 29 * An ordering that orders elements by applying an order to the result of a
|
| LinkedHashMultiset.java | 29 * iterator orders elements according to when the first occurrence of the
|
| SortedSetMultimap.java | 97 * Returns the comparator that orders the multimap values, with a {@code null}
|
| /external/llvm/test/Transforms/DeadArgElim/ |
| deadretval2.ll | 39 ; different orders (ie, first the caller, than the callee and first the callee
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGSDNodes.cpp | 636 SmallVector<std::pair<unsigned, MachineInstr*>, 32> &Orders,
654 Orders.push_back(std::make_pair(DVOrder, DbgMI));
668 SmallVector<std::pair<unsigned, MachineInstr*>, 32> &Orders,
674 ProcessSDDbgValues(N, DAG, Emitter, Orders, VRBaseMap, 0);
681 Orders.push_back(std::make_pair(Order, (MachineInstr*)0));
685 Orders.push_back(std::make_pair(Order, prior(Emitter.getInsertPos())));
686 ProcessSDDbgValues(N, DAG, Emitter, Orders, VRBaseMap, Order);
695 SmallVector<std::pair<unsigned, MachineInstr*>, 32> Orders;
736 ProcessSourceNode(N, DAG, Emitter, VRBaseMap, Orders, Seen);
743 ProcessSourceNode(SU->getNode(), DAG, Emitter, VRBaseMap, Orders,
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeGenRegisters.h | 90 // Allocation orders. Order[0] always contains all registers in Members.
91 std::vector<SmallVector<Record*, 16> > Orders;
176 return Orders[No];
179 // Return the total number of allocation orders available.
180 unsigned getNumOrders() const { return Orders.size(); }
|
| CodeGenRegisters.cpp | 279 Orders.resize(1 + AltOrders->size());
283 Orders[0].push_back((*Elements)[i]);
287 // Alternative allocation orders may be subsets.
291 Orders[1 + i].append(Order.begin(), Order.end());
366 // Copy all allocation orders, filter out foreign registers from the larger
368 Orders.resize(Super.Orders.size());
369 for (unsigned i = 0, ie = Super.Orders.size(); i != ie; ++i)
370 for (unsigned j = 0, je = Super.Orders[i].size(); j != je; ++j)
371 if (contains(RegBank.getReg(Super.Orders[i][j]))
[all...] |
| /cts/tests/res/menu/ |
| category_order.xml | 38 (Furthermore, notice how the orders in each category are independent from the other
|
| /development/samples/ApiDemos/res/menu/ |
| category_order.xml | 38 (Furthermore, notice how the orders in each category are independent from the other
|
| /external/clang/test/Analysis/ |
| pthreadlock.c | 3 // Tests performing normal locking patterns and wrong locking orders
|
| /external/llvm/test/MC/MachO/ |
| zerofill-3.s | 4 // orders the symbols, then assigns addresses. :(
|
| /libcore/luni/src/main/java/java/text/ |
| CollationKey.java | 25 * Since the rule set of collators can differ, the sort orders of the same
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/formatting/ |
| XmlQuickAssistManager.java | 45 /** Constructs a new {@link XmlQuickAssistManager} which orders the quick fixes */
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentSkipListSet.java | 68 * Constructs a new, empty set that orders its elements according to
76 * Constructs a new, empty set that orders its elements according to
89 * collection, that orders its elements according to their
|
