/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...] |
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/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...] |
citertst.c | 566 OrderAndOffset *orders; local 598 orders = getOrders(iter, &orderLength); 630 free(orders); 948 *orders; local 970 orders = getOrders(iter, &count); 987 if ((count > 250 && testorders[-- count].order != orders[1].order) || 988 (count <= 250 && testorders[-- count].order != orders[0].order)) { 995 free(orders); [all...] |
/external/jpeg/ |
jddctmgr.c | 234 static const char orders[DCTSIZE] = {4, 2, 5, 3, 6, 1, 7, 0}; local 237 int j = ((i & 7) << 3) + orders[i >> 3];
|
/external/v8/test/mjsunit/ |
array-sort.js | 36 // Default sort converts each element to string and orders
|
debug-listbreakpoints.js | 153 // Set some more breakpoints, and clear them in various orders:
|
/external/iproute2/doc/ |
ip-tunnels.tex | 62 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
|