Home
last modified time | relevance | path

Searched refs:fIncludesSets (Results 1 – 3 of 3) sorted by relevance

/external/icu/icu4c/source/common/
Drbbisetb.cpp207 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()
[all …]
Drbbisetb.h42 UVector *fIncludesSets; // vector of the the original variable
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
DRBBISetBuilder.java42 List<RBBINode> fIncludesSets; // vector of the the original field in RBBISetBuilder.RangeDescriptor
48 fIncludesSets = new ArrayList<RBBINode>(); in RangeDescriptor()
55 fIncludesSets = new ArrayList<RBBINode>(other.fIncludesSets); in RangeDescriptor()
101 for (i=0; i<this.fIncludesSets.size(); i++) { in setDictionaryFlag()
102 RBBINode usetNode = fIncludesSets.get(i); in setDictionaryFlag()
211 if (rlRange.fIncludesSets.indexOf(usetNode) == -1) { in build()
212 rlRange.fIncludesSets.add(usetNode); in build()
239 if (rlRange.fIncludesSets.equals(rlSearchRange.fIncludesSets)) { in build()
248 addValToSets(rlRange.fIncludesSets, fGroupCount+2); in build()
449 for (i=0; i<rlRange.fIncludesSets.size(); i++) { in printRanges()
[all …]