172             if (rlRange->fIncludesSets->indexOf(usetNode) == -1) {  in buildRanges()
173                 rlRange->fIncludesSets->addElement(usetNode, *fStatus);  in buildRanges()
203             if (rlRange->fIncludesSets->equals(*rlSearchRange->fIncludesSets)) {  in buildRanges()
212             addValToSets(rlRange->fIncludesSets, fGroupCount+2);  in buildRanges()
432         for (i=0; i<rlRange->fIncludesSets->size(); i++) {  in printRanges()
433             RBBINode       *usetNode    = (RBBINode *)rlRange->fIncludesSets->elementAt(i);  in printRanges()
472             for (i=0; i<rlRange->fIncludesSets->size(); i++) {  in printRangeGroups()
473                 RBBINode       *usetNode    = (RBBINode *)rlRange->fIncludesSets->elementAt(i);  in printRangeGroups()
561     this->fIncludesSets = new UVector(status);  in RangeDescriptor()
569     if (this->fIncludesSets == 0) {  in RangeDescriptor()
574     for (i=0; i<other.fIncludesSets->size(); i++) {  in RangeDescriptor()
575         this->fIncludesSets->addElement(other.fIncludesSets->elementAt(i), status);  in RangeDescriptor()
591     this->fIncludesSets = new UVector(status);  in RangeDescriptor()
599     if(this->fIncludesSets == 0) {  in RangeDescriptor()
613     delete  fIncludesSets;  in ~RangeDescriptor()
614     fIncludesSets = NULL;  in ~RangeDescriptor()
664     for (i=0; i<fIncludesSets->size(); i++) {  in setDictionaryFlag()
665         RBBINode *usetNode  = (RBBINode *)fIncludesSets->elementAt(i);  in setDictionaryFlag()