Searched refs:orders (Results 1 - 12 of 12) sorted by relevance

/external/icu/icu4c/source/test/intltest/
H A Dtscoll.cpp392 LocalArray<Order> orders(getOrders(iter, orderLength));
409 } else { // this is an error, orders exhausted but there are non-ignorable CEs from
411 errln("Backward iteration returned a non ignorable after orders are exhausted");
417 if (o != orders[index].order) {
421 while (index > 0 && orders[--index].order == 0) {
425 if (o != orders[index].order) {
427 orders[index].order, o);
435 if (offset != orders[index].offset) {
437 orders[index].offset, offset);
445 while (index != 0 && orders[inde
[all...]
H A Ditercoll.cpp191 Order *orders = getOrders(*iter, orderLength); local
218 delete[] orders;
636 * Return a string containing all of the collation orders
/external/webrtc/webrtc/base/
H A Dbytebuffer_unittest.cc116 ByteBuffer::ByteOrder orders[2] = { ByteBuffer::ORDER_HOST, local
118 for (size_t i = 0; i < arraysize(orders); i++) {
119 ByteBuffer buffer(orders[i]);
120 EXPECT_EQ(orders[i], buffer.Order());
/external/libcups/cups/
H A Dppd-emit.c86 float *orders; /* Collected order values */ local
112 if ((orders = calloc(sizeof(float), (size_t)cupsArrayCount(ppd->marked))) == NULL)
175 orders[count] = corder;
190 if (orders[i] > orders[j])
193 corder = orders[i];
195 orders[i] = orders[j];
197 orders[j] = corder;
201 free(orders);
[all...]
/external/icu/icu4c/source/test/cintltst/
H A Dcallcoll.c470 * Return an integer array containing all of the collation orders
481 OrderAndOffset *orders =(OrderAndOffset *)malloc(sizeof(OrderAndOffset) * maxSize); local
492 memcpy(temp, orders, size * sizeof(OrderAndOffset));
493 free(orders);
494 orders = temp;
498 orders[size].order = order;
499 orders[size].offset = offset;
509 memcpy(temp, orders, size * sizeof(OrderAndOffset));
510 free(orders);
511 orders
528 OrderAndOffset *orders = getOrders(iter, &orderLength); local
[all...]
H A Dcitertst.c565 OrderAndOffset *orders; local
597 orders = getOrders(iter, &orderLength);
629 free(orders);
943 *orders; local
965 orders = getOrders(iter, &count);
982 if ((count > 250 && testorders[-- count].order != orders[1].order) ||
983 (count <= 250 && testorders[-- count].order != orders[0].order)) {
990 free(orders);
/external/deqp/external/vulkancts/modules/vulkan/memory/
H A DvktMemoryAllocationTests.cpp538 } orders[] =
554 for (size_t orderNdx = 0; orderNdx < DE_LENGTH_OF_ARRAY(orders); orderNdx++)
556 const TestConfig::Order order = orders[orderNdx].order;
557 const char* const orderName = orders[orderNdx].str;
604 for (size_t orderNdx = 0; orderNdx < DE_LENGTH_OF_ARRAY(orders); orderNdx++)
606 const TestConfig::Order order = orders[orderNdx].order;
607 const char* const orderName = orders[orderNdx].str;
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/
H A DCollationTest.java88 * Return an integer array containing all of the collation orders
95 int[] orders = new int[maxSize];
102 System.arraycopy(orders, 0, temp, 0, size);
103 orders = temp;
105 orders[size++] = order;
110 System.arraycopy(orders, 0, temp, 0, size);
111 orders = temp;
113 return orders;
120 int[] orders = getOrders(iter);
123 int index = orders
[all...]
H A DCollationIteratorTest.java235 int[] orders = CollationTest.getOrders(iter);
236 logln("orders.length = " + orders.length);
/external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/
H A DCollationTest.java87 * Return an integer array containing all of the collation orders
94 int[] orders = new int[maxSize];
101 System.arraycopy(orders, 0, temp, 0, size);
102 orders = temp;
104 orders[size++] = order;
109 System.arraycopy(orders, 0, temp, 0, size);
110 orders = temp;
112 return orders;
119 int[] orders = getOrders(iter);
122 int index = orders
[all...]
H A DCollationIteratorTest.java234 int[] orders = CollationTest.getOrders(iter);
235 logln("orders.length = " + orders.length);
/external/iproute2/doc/
H A Dip-tunnels.tex62 Note keyword \verb|onlink|, it is the magic key that orders kernel
276 \verb|i| or \verb|o|. F.e.\ \verb|icsum| orders to accept only

Completed in 686 milliseconds