509             U_ASSERT(curAndConstraint->rangeList == NULL);  in parse()
523             curAndConstraint->rangeList = new UVector32(status);  in parse()
524             curAndConstraint->rangeList->addElement(-1, status);  // range Low  in parse()
525             curAndConstraint->rangeList->addElement(-1, status);  // range Hi  in parse()
538                 if (curAndConstraint->rangeList == NULL) {  in parse()
543                     if (curAndConstraint->rangeList->elementAti(rangeLowIdx) == -1) {  in parse()
544 …                     curAndConstraint->rangeList->setElementAt(getNumberValue(token), rangeLowIdx);  in parse()
545 …                      curAndConstraint->rangeList->setElementAt(getNumberValue(token), rangeHiIdx);  in parse()
548 …                      curAndConstraint->rangeList->setElementAt(getNumberValue(token), rangeHiIdx);  in parse()
549                         if (curAndConstraint->rangeList->elementAti(rangeLowIdx) >   in parse()
550                                 curAndConstraint->rangeList->elementAti(rangeHiIdx)) {  in parse()
564             if (curAndConstraint == NULL || curAndConstraint->rangeList == NULL) {  in parse()
568             U_ASSERT(curAndConstraint->rangeList->size() >= 2);  in parse()
569             rangeLowIdx = curAndConstraint->rangeList->size();  in parse()
570             curAndConstraint->rangeList->addElement(-1, status);  // range Low  in parse()
571             rangeHiIdx = curAndConstraint->rangeList->size();  in parse()
572             curAndConstraint->rangeList->addElement(-1, status);  // range Hi  in parse()
748     rangeList = NULL;  in AndConstraint()
760     this->rangeList=NULL;  in AndConstraint()
761     if (other.rangeList != NULL) {  in AndConstraint()
763         this->rangeList = new UVector32(status);  in AndConstraint()
764         this->rangeList->assign(*other.rangeList, status);  in AndConstraint()
778     delete rangeList;  in ~AndConstraint()
806         if (rangeList == NULL) {  in isFulfilled()
812         for (int32_t r=0; r<rangeList->size(); r+=2) {  in isFulfilled()
813             if (rangeList->elementAti(r) <= n && n <= rangeList->elementAti(r+1)) {  in isFulfilled()
961 … if ((andRule->op==AndConstraint::NONE) &&  (andRule->rangeList==NULL) && (andRule->value == -1)) {  in dumpRules()
963                 } else if ( (andRule->op==AndConstraint::NONE) && (andRule->rangeList==NULL) ) {  in dumpRules()
980                     if (andRule->rangeList==NULL) {  in dumpRules()
1009                         for (int32_t r=0; r<andRule->rangeList->size(); r+=2) {  in dumpRules()
1010                             int32_t rangeLo = andRule->rangeList->elementAti(r);  in dumpRules()
1011                             int32_t rangeHi = andRule->rangeList->elementAti(r+1);  in dumpRules()
1017                             if (r+2 < andRule->rangeList->size()) {  in dumpRules()