Lines Matching defs:Order
674 struct Order
676 int32_t order;
689 void add(int32_t order, int32_t low, int32_t high);
690 const Order *get(int32_t index) const;
699 Order *list;
707 list = new Order[listMax];
716 int32_t order, low, high;
732 list = new Order[listMax];
738 order = ucol_next(elems, &status);
741 if (order != UCOL_NULLORDER) {
742 order &= strengthMask;
745 if (order != UCOL_IGNORABLE) {
746 add(order, low, high);
748 } while (order != UCOL_NULLORDER);
758 void OrderList::add(int32_t order, int32_t low, int32_t high)
763 Order *newList = new Order[listMax];
765 uprv_memcpy(newList, list, listSize * sizeof(Order));
770 list[listSize].order = order;
777 const Order *OrderList::get(int32_t index) const
788 const Order *order = get(index);
790 if (order != NULL) {
791 return order->lowOffset;
799 const Order *order = get(index);
801 if (order != NULL) {
802 return order->highOffset;
810 const Order *order = get(index);
812 if (order != NULL) {
813 return order->order;
827 Order swap = list[b];
841 if (list[i].order != other.list[i].order ||
875 const Order *order = list.get(i);
881 s += sprintf(s, "(%d, %d)", order->lowOffset, order->highOffset);
893 const Order *order = list.get(i);
899 s += sprintf(s, "%8.8X", order->order);
983 int32_t order, low, high;
987 order = iter->next(status);
990 forwardList.add(order, low, high);
991 } while (order != CollationElementIterator::NULLORDER);
1000 order = iter->previous(status);
1003 if (order == CollationElementIterator::NULLORDER) {
1007 backwardList.add(order, low, high);
1108 uint64_t order;
1116 order = ucol_nextProcessed(elems, &low, &high, &status);
1117 add(order, low, high);
1118 } while (order != UCOL_PROCESSED_NULLORDER);
1128 void PCEList::add(uint64_t order, int32_t low, int32_t high)
1135 uprv_memcpy(newList, list, listSize * sizeof(Order));
1140 list[listSize].ce = order;
