Home
last modified time | relevance | path

Searched refs:fReverseTree (Results 1 – 7 of 7) sorted by relevance

/external/icu/android_icu4j/src/main/java/android/icu/text/
DRBBIRuleScanner.java295 int destRules = (fReverseRule ? RBBIRuleBuilder.fReverseTree : fRB.fDefaultTree); in doParseActions()
444 fRB.fDefaultTree = RBBIRuleBuilder.fReverseTree; in doParseActions()
975 if (fRB.fTreeRoots[RBBIRuleBuilder.fReverseTree] == null) { in parse()
976 fRB.fTreeRoots[RBBIRuleBuilder.fReverseTree] = pushNewNode(RBBINode.opStar); in parse()
979 fRB.fTreeRoots[RBBIRuleBuilder.fReverseTree].fLeftChild = operand; in parse()
980 operand.fParent = fRB.fTreeRoots[RBBIRuleBuilder.fReverseTree]; in parse()
996 fRB.fTreeRoots[RBBIRuleBuilder.fReverseTree].printTree(true); in parse()
DRBBIRuleBuilder.java42 static final int fReverseTree = 1; // for each of the trees. field in RBBIRuleBuilder
352 builder.fReverseTables = new RBBITableBuilder(builder, fReverseTree); in compileRules()
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
DRBBIRuleScanner.java294 int destRules = (fReverseRule ? RBBIRuleBuilder.fReverseTree : fRB.fDefaultTree); in doParseActions()
443 fRB.fDefaultTree = RBBIRuleBuilder.fReverseTree; in doParseActions()
974 if (fRB.fTreeRoots[RBBIRuleBuilder.fReverseTree] == null) { in parse()
975 fRB.fTreeRoots[RBBIRuleBuilder.fReverseTree] = pushNewNode(RBBINode.opStar); in parse()
978 fRB.fTreeRoots[RBBIRuleBuilder.fReverseTree].fLeftChild = operand; in parse()
979 operand.fParent = fRB.fTreeRoots[RBBIRuleBuilder.fReverseTree]; in parse()
995 fRB.fTreeRoots[RBBIRuleBuilder.fReverseTree].printTree(true); in parse()
DRBBIRuleBuilder.java41 static final int fReverseTree = 1; // for each of the trees. field in RBBIRuleBuilder
351 builder.fReverseTables = new RBBITableBuilder(builder, fReverseTree); in compileRules()
/external/icu/icu4c/source/common/
Drbbirb.cpp61 fReverseTree = NULL; in RBBIRuleBuilder()
123 delete fReverseTree; in ~RBBIRuleBuilder()
294 builder.fReverseTables = new RBBITableBuilder(&builder, &builder.fReverseTree); in createRuleBasedBreakIterator()
Drbbiscan.cpp375 RBBINode **destRules = (fReverseRule? &fRB->fReverseTree : fRB->fDefaultTree); in doParseActions()
555 fRB->fDefaultTree = &fRB->fReverseTree; in doParseActions()
1127 if (fRB->fReverseTree == NULL) { in parse()
1128 fRB->fReverseTree = pushNewNode(RBBINode::opStar); in parse()
1134 fRB->fReverseTree->fLeftChild = operand; in parse()
1135 operand->fParent = fRB->fReverseTree; in parse()
1151 RBBINode::printTree(fRB->fReverseTree, TRUE); in parse()
Drbbirb.h136 RBBINode *fReverseTree; // then manipulated by subsequent steps. variable