207             if (rlRange->fIncludesSets->indexOf(usetNode) == -1) {  in build()
208                 rlRange->fIncludesSets->addElement(usetNode, *fStatus);  in build()
238             if (rlRange->fIncludesSets->equals(*rlSearchRange->fIncludesSets)) {  in build()
247             addValToSets(rlRange->fIncludesSets, fGroupCount+2);  in build()
443         for (i=0; i<rlRange->fIncludesSets->size(); i++) {  in printRanges()
444             RBBINode       *usetNode    = (RBBINode *)rlRange->fIncludesSets->elementAt(i);  in printRanges()
483             for (i=0; i<rlRange->fIncludesSets->size(); i++) {  in printRangeGroups()
484                 RBBINode       *usetNode    = (RBBINode *)rlRange->fIncludesSets->elementAt(i);  in printRangeGroups()
572     this->fIncludesSets = new UVector(status);  in RangeDescriptor()
580     if (this->fIncludesSets == 0) {  in RangeDescriptor()
585     for (i=0; i<other.fIncludesSets->size(); i++) {  in RangeDescriptor()
586         this->fIncludesSets->addElement(other.fIncludesSets->elementAt(i), status);  in RangeDescriptor()
602     this->fIncludesSets = new UVector(status);  in RangeDescriptor()
610     if(this->fIncludesSets == 0) {  in RangeDescriptor()
624     delete  fIncludesSets;  in ~RangeDescriptor()
625     fIncludesSets = NULL;  in ~RangeDescriptor()
674     for (i=0; i<this->fIncludesSets->size(); i++) {  in setDictionaryFlag()
675         RBBINode       *usetNode    = (RBBINode *)fIncludesSets->elementAt(i);  in setDictionaryFlag()