Lines Matching defs:Order
681 struct Order
683 int32_t order;
696 void add(int32_t order, int32_t low, int32_t high);
697 const Order *get(int32_t index) const;
706 Order *list;
714 list = new Order[listMax];
723 int32_t order, low, high;
739 list = new Order[listMax];
745 order = ucol_next(elems, &status);
748 if (order != UCOL_NULLORDER) {
749 order &= strengthMask;
752 if (order != UCOL_IGNORABLE) {
753 add(order, low, high);
755 } while (order != UCOL_NULLORDER);
765 void OrderList::add(int32_t order, int32_t low, int32_t high)
770 Order *newList = new Order[listMax];
772 uprv_memcpy(newList, list, listSize * sizeof(Order));
777 list[listSize].order = order;
784 const Order *OrderList::get(int32_t index) const
795 const Order *order = get(index);
797 if (order != NULL) {
798 return order->lowOffset;
806 const Order *order = get(index);
808 if (order != NULL) {
809 return order->highOffset;
817 const Order *order = get(index);
819 if (order != NULL) {
820 return order->order;
834 Order swap = list[b];
848 if (list[i].order != other.list[i].order ||
882 const Order *order = list.get(i);
888 s += sprintf(s, "(%d, %d)", order->lowOffset, order->highOffset);
900 const Order *order = list.get(i);
906 s += sprintf(s, "%8.8X", order->order);
990 int32_t order, low, high;
994 order = iter->next(status);
997 forwardList.add(order, low, high);
998 } while (order != CollationElementIterator::NULLORDER);
1007 order = iter->previous(status);
1010 if (order == CollationElementIterator::NULLORDER) {
1014 backwardList.add(order, low, high);
1113 uint64_t order;
1121 order = ucol_nextProcessed(elems, &low, &high, &status);
1122 add(order, low, high);
1123 } while (order != UCOL_PROCESSED_NULLORDER);
1133 void PCEList::add(uint64_t order, int32_t low, int32_t high)
1140 uprv_memcpy(newList, list, listSize * sizeof(Order));
1145 list[listSize].ce = order;
