Searched refs:fIncludesSets (Results 1 – 4 of 4) sorted by relevance
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()[all …]
46 UVector *fIncludesSets; // vector of the the original variable
47 List<RBBINode> fIncludesSets; // vector of the the original field in RBBISetBuilder.RangeDescriptor53 fIncludesSets = new ArrayList<RBBINode>(); in RangeDescriptor()60 fIncludesSets = new ArrayList<RBBINode>(other.fIncludesSets); in RangeDescriptor()106 for (i=0; i<this.fIncludesSets.size(); i++) { in setDictionaryFlag()107 RBBINode usetNode = fIncludesSets.get(i); in setDictionaryFlag()219 if (rlRange.fIncludesSets.indexOf(usetNode) == -1) { in buildRanges()220 rlRange.fIncludesSets.add(usetNode); in buildRanges()247 if (rlRange.fIncludesSets.equals(rlSearchRange.fIncludesSets)) { in buildRanges()256 addValToSets(rlRange.fIncludesSets, fGroupCount+2); in buildRanges()453 for (i=0; i<rlRange.fIncludesSets.size(); i++) { in printRanges()[all …]
46 List<RBBINode> fIncludesSets; // vector of the the original field in RBBISetBuilder.RangeDescriptor52 fIncludesSets = new ArrayList<RBBINode>(); in RangeDescriptor()59 fIncludesSets = new ArrayList<RBBINode>(other.fIncludesSets); in RangeDescriptor()105 for (i=0; i<this.fIncludesSets.size(); i++) { in setDictionaryFlag()106 RBBINode usetNode = fIncludesSets.get(i); in setDictionaryFlag()218 if (rlRange.fIncludesSets.indexOf(usetNode) == -1) { in buildRanges()219 rlRange.fIncludesSets.add(usetNode); in buildRanges()246 if (rlRange.fIncludesSets.equals(rlSearchRange.fIncludesSets)) { in buildRanges()255 addValToSets(rlRange.fIncludesSets, fGroupCount+2); in buildRanges()452 for (i=0; i<rlRange.fIncludesSets.size(); i++) { in printRanges()[all …]