Lines Matching refs:order
323 struct Order
325 int32_t order;
338 void add(int32_t order, int32_t low, int32_t high);
339 const Order *get(int32_t index) const;
348 Order *list;
356 list = new Order[listMax];
365 int32_t order, low, high;
381 list = new Order[listMax];
387 order = ucol_next(elems, &status);
390 if (order != UCOL_NULLORDER) {
391 order &= strengthMask;
394 if (order != UCOL_IGNORABLE) {
395 add(order, low, high);
397 } while (order != UCOL_NULLORDER);
407 void OrderList::add(int32_t order, int32_t low, int32_t high)
412 Order *newList = new Order[listMax];
414 uprv_memcpy(newList, list, listSize * sizeof(Order));
419 list[listSize].order = order;
426 const Order *OrderList::get(int32_t index) const
437 const Order *order = get(index);
439 if (order != NULL) {
440 return order->lowOffset;
448 const Order *order = get(index);
450 if (order != NULL) {
451 return order->highOffset;
459 const Order *order = get(index);
461 if (order != NULL) {
462 return order->order;
476 Order swap = list[b];
490 if (list[i].order != other.list[i].order ||
524 const Order *order = list.get(i);
530 s += sprintf(s, "(%d, %d)", order->lowOffset, order->highOffset);
542 const Order *order = list.get(i);
548 s += sprintf(s, "%8.8X", order->order);
639 int32_t order, low, high;
643 order = iter->next(status);
646 forwardList.add(order, low, high);
647 } while (order != CollationElementIterator::NULLORDER);
656 order = iter->previous(status);
659 if (order == CollationElementIterator::NULLORDER) {
663 backwardList.add(order, low, high);
