| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| D | RBBINode.java | 20 class RBBINode { class
69 RBBINode fParent;
70 RBBINode fLeftChild;
71 RBBINode fRightChild;
101 Set<RBBINode> fFirstPosSet; // See Aho DFA table generation algorithm
102 Set<RBBINode> fLastPosSet; // See Aho.
103 Set<RBBINode> fFollowPos; // See Aho.
108 RBBINode(int t) { in RBBINode() method in RBBINode
113 fFirstPosSet = new HashSet<RBBINode>(); in RBBINode()
114 fLastPosSet = new HashSet<RBBINode>(); in RBBINode()
[all …]
|
| D | RBBITableBuilder.java | 46 Set<RBBINode> fPositions; // Set of parse tree positions associated
57 fPositions = new HashSet<RBBINode>(); in RBBIStateDescriptor()
123 RBBINode bofTop = new RBBINode(RBBINode.opCat); in buildForwardTable()
124 RBBINode bofLeaf = new RBBINode(RBBINode.leafChar); in buildForwardTable()
137 RBBINode cn = new RBBINode(RBBINode.opCat); in buildForwardTable()
140 cn.fRightChild = new RBBINode(RBBINode.endMark); in buildForwardTable()
208 void calcNullable(RBBINode n) { in calcNullable()
212 if (n.fType == RBBINode.setRef || in calcNullable()
213 n.fType == RBBINode.endMark ) { in calcNullable()
219 if (n.fType == RBBINode.lookAhead || n.fType == RBBINode.tag) { in calcNullable()
[all …]
|
| D | RBBIRuleScanner.java | 58 RBBINode fNodeStack[] = new RBBINode[kStackSize]; // Node stack, holds nodes created
135 RBBINode n = null; in doParseActions()
142 pushNewNode(RBBINode.opStart); in doParseActions()
153 fixOpStack(RBBINode.precOpCat); in doParseActions()
154 RBBINode operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()
155 RBBINode orNode = pushNewNode(RBBINode.opOr); in doParseActions()
168 fixOpStack(RBBINode.precOpCat); in doParseActions()
169 RBBINode operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()
170 RBBINode catNode = pushNewNode(RBBINode.opCat); in doParseActions()
183 pushNewNode(RBBINode.opLParen); in doParseActions()
[all …]
|
| D | RBBISetBuilder.java | 46 List<RBBINode> fIncludesSets; // vector of the the original
52 fIncludesSets = new ArrayList<RBBINode>(); in RangeDescriptor()
59 fIncludesSets = new ArrayList<RBBINode>(other.fIncludesSets); in RangeDescriptor()
106 RBBINode usetNode = fIncludesSets.get(i); in setDictionaryFlag()
108 RBBINode setRef = usetNode.fParent; in setDictionaryFlag()
110 RBBINode varRef = setRef.fParent; in setDictionaryFlag()
111 if (varRef != null && varRef.fType == RBBINode.varRef) { in setDictionaryFlag()
177 for (RBBINode usetNode : fRB.fUSetNodes) { in buildRanges()
272 for (RBBINode usetNode : fRB.fUSetNodes) { in buildRanges()
370 void addValToSets(List<RBBINode> sets, int val) { in addValToSets()
[all …]
|
| D | RBBISymbolTable.java | 31 RBBINode val;
50 RBBINode varRefNode; in lookup()
51 RBBINode exprNode; in lookup()
53 RBBINode usetNode; in lookup()
63 while (varRefNode.fLeftChild.fType == RBBINode.varRef) { in lookup()
68 if (exprNode.fType == RBBINode.setRef) { in lookup()
138 RBBINode lookupNode(String key) { in lookupNode()
140 RBBINode retNode = null; in lookupNode()
156 void addEntry(String key, RBBINode val) { in addEntry()
|
| D | RBBIRuleBuilder.java | 44 RBBINode[] fTreeRoots = new RBBINode[4];
63 List<RBBINode> fUSetNodes; // Vector of all used nodes.
148 fUSetNodes = new ArrayList<RBBINode>(); in RBBIRuleBuilder()
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| D | RBBINode.java | 21 class RBBINode { class
70 RBBINode fParent;
71 RBBINode fLeftChild;
72 RBBINode fRightChild;
102 Set<RBBINode> fFirstPosSet; // See Aho DFA table generation algorithm
103 Set<RBBINode> fLastPosSet; // See Aho.
104 Set<RBBINode> fFollowPos; // See Aho.
109 RBBINode(int t) { in RBBINode() method in RBBINode
114 fFirstPosSet = new HashSet<RBBINode>(); in RBBINode()
115 fLastPosSet = new HashSet<RBBINode>(); in RBBINode()
[all …]
|
| D | RBBITableBuilder.java | 47 Set<RBBINode> fPositions; // Set of parse tree positions associated
58 fPositions = new HashSet<RBBINode>(); in RBBIStateDescriptor()
124 RBBINode bofTop = new RBBINode(RBBINode.opCat); in buildForwardTable()
125 RBBINode bofLeaf = new RBBINode(RBBINode.leafChar); in buildForwardTable()
138 RBBINode cn = new RBBINode(RBBINode.opCat); in buildForwardTable()
141 cn.fRightChild = new RBBINode(RBBINode.endMark); in buildForwardTable()
209 void calcNullable(RBBINode n) { in calcNullable()
213 if (n.fType == RBBINode.setRef || in calcNullable()
214 n.fType == RBBINode.endMark ) { in calcNullable()
220 if (n.fType == RBBINode.lookAhead || n.fType == RBBINode.tag) { in calcNullable()
[all …]
|
| D | RBBIRuleScanner.java | 59 RBBINode fNodeStack[] = new RBBINode[kStackSize]; // Node stack, holds nodes created
136 RBBINode n = null; in doParseActions()
143 pushNewNode(RBBINode.opStart); in doParseActions()
154 fixOpStack(RBBINode.precOpCat); in doParseActions()
155 RBBINode operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()
156 RBBINode orNode = pushNewNode(RBBINode.opOr); in doParseActions()
169 fixOpStack(RBBINode.precOpCat); in doParseActions()
170 RBBINode operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()
171 RBBINode catNode = pushNewNode(RBBINode.opCat); in doParseActions()
184 pushNewNode(RBBINode.opLParen); in doParseActions()
[all …]
|
| D | RBBISetBuilder.java | 47 List<RBBINode> fIncludesSets; // vector of the the original
53 fIncludesSets = new ArrayList<RBBINode>(); in RangeDescriptor()
60 fIncludesSets = new ArrayList<RBBINode>(other.fIncludesSets); in RangeDescriptor()
107 RBBINode usetNode = fIncludesSets.get(i); in setDictionaryFlag()
109 RBBINode setRef = usetNode.fParent; in setDictionaryFlag()
111 RBBINode varRef = setRef.fParent; in setDictionaryFlag()
112 if (varRef != null && varRef.fType == RBBINode.varRef) { in setDictionaryFlag()
178 for (RBBINode usetNode : fRB.fUSetNodes) { in buildRanges()
273 for (RBBINode usetNode : fRB.fUSetNodes) { in buildRanges()
371 void addValToSets(List<RBBINode> sets, int val) { in addValToSets()
[all …]
|
| D | RBBISymbolTable.java | 32 RBBINode val;
51 RBBINode varRefNode; in lookup()
52 RBBINode exprNode; in lookup()
54 RBBINode usetNode; in lookup()
64 while (varRefNode.fLeftChild.fType == RBBINode.varRef) { in lookup()
69 if (exprNode.fType == RBBINode.setRef) { in lookup()
139 RBBINode lookupNode(String key) { in lookupNode()
141 RBBINode retNode = null; in lookupNode()
157 void addEntry(String key, RBBINode val) { in addEntry()
|
| D | RBBIRuleBuilder.java | 45 RBBINode[] fTreeRoots = new RBBINode[4];
64 List<RBBINode> fUSetNodes; // Vector of all used nodes.
149 fUSetNodes = new ArrayList<RBBINode>(); in RBBIRuleBuilder()
|
| /external/icu/icu4c/source/common/ |
| D | rbbinode.cpp | 50 RBBINode::RBBINode(NodeType t) : UMemory() { in RBBINode() function in RBBINode
80 RBBINode::RBBINode(const RBBINode &other) : UMemory(other) { in RBBINode() function in RBBINode
113 RBBINode::~RBBINode() { in ~RBBINode()
149 RBBINode *RBBINode::cloneTree() { in cloneTree()
150 RBBINode *n; in cloneTree()
152 if (fType == RBBINode::varRef) { in cloneTree()
156 } else if (fType == RBBINode::uset) { in cloneTree()
159 n = new RBBINode(*this); in cloneTree()
195 RBBINode *RBBINode::flattenVariables() { in flattenVariables()
197 RBBINode *retNode = fLeftChild->cloneTree(); in flattenVariables()
[all …]
|
| D | rbbinode.h | 28 class RBBINode : public UMemory {
58 RBBINode *fParent;
59 RBBINode *fLeftChild;
60 RBBINode *fRightChild;
94 RBBINode(NodeType t);
95 RBBINode(const RBBINode &other);
96 ~RBBINode();
98 RBBINode *cloneTree();
99 RBBINode *flattenVariables();
101 void findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status);
[all …]
|
| D | rbbiscan.cpp | 202 RBBINode *n = NULL; in doParseActions()
209 pushNewNode(RBBINode::opStart); in doParseActions()
222 fixOpStack(RBBINode::precOpCat); in doParseActions()
223 RBBINode *operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()
224 RBBINode *orNode = pushNewNode(RBBINode::opOr); in doParseActions()
239 fixOpStack(RBBINode::precOpCat); in doParseActions()
240 RBBINode *operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()
241 RBBINode *catNode = pushNewNode(RBBINode::opCat); in doParseActions()
256 pushNewNode(RBBINode::opLParen); in doParseActions()
260 fixOpStack(RBBINode::precLParen); in doParseActions()
[all …]
|
| D | rbbitblb.cpp | 30 RBBITableBuilder::RBBITableBuilder(RBBIRuleBuilder *rb, RBBINode **rootNode, UErrorCode &status) : in RBBITableBuilder()
84 RBBINode::printTree(fTree, TRUE); in buildForwardTable()
95 RBBINode *bofTop = new RBBINode(RBBINode::opCat); in buildForwardTable()
96 RBBINode *bofLeaf = new RBBINode(RBBINode::leafChar); in buildForwardTable()
116 RBBINode *cn = new RBBINode(RBBINode::opCat); in buildForwardTable()
124 cn->fRightChild = new RBBINode(RBBINode::endMark); in buildForwardTable()
142 RBBINode::printTree(fTree, TRUE); in buildForwardTable()
200 void RBBITableBuilder::calcNullable(RBBINode *n) { in calcNullable()
204 if (n->fType == RBBINode::setRef || in calcNullable()
205 n->fType == RBBINode::endMark ) { in calcNullable()
[all …]
|
| D | rbbisetb.cpp | 95 RBBINode *usetNode; in buildRanges()
121 usetNode = (RBBINode *)this->fRB->fUSetNodes->elementAt(ni); in buildRanges()
231 usetNode = (RBBINode *)this->fRB->fUSetNodes->elementAt(ni); in buildRanges()
343 RBBINode *usetNode = (RBBINode *)sets->elementAt(ix); in addValToSets()
348 void RBBISetBuilder::addValToSet(RBBINode *usetNode, uint32_t val) { in addValToSet()
349 RBBINode *leafNode = new RBBINode(RBBINode::leafChar); in addValToSet()
362 RBBINode *orNode = new RBBINode(RBBINode::opOr); in addValToSet()
433 RBBINode *usetNode = (RBBINode *)rlRange->fIncludesSets->elementAt(i); in printRanges()
435 RBBINode *setRef = usetNode->fParent; in printRanges()
437 RBBINode *varRef = setRef->fParent; in printRanges()
[all …]
|
| D | rbbirb.h | 38 class RBBINode; variable
53 RBBINode *val;
85 virtual RBBINode *lookupNode(const UnicodeString &key) const;
86 virtual void addEntry (const UnicodeString &key, RBBINode *val, UErrorCode &err);
151 RBBINode *fForwardTree; // The parse trees, generated by the scanner,
152 RBBINode *fReverseTree; // then manipulated by subsequent steps.
153 RBBINode *fSafeFwdTree;
154 RBBINode *fSafeRevTree;
156 RBBINode **fDefaultTree; // For rules not qualified with a !
204 RBBINode *val;
|
| D | rbbitblb.h | 44 RBBITableBuilder(RBBIRuleBuilder *rb, RBBINode **rootNode, UErrorCode &status);
90 void calcNullable(RBBINode *n);
91 void calcFirstPos(RBBINode *n);
92 void calcLastPos(RBBINode *n);
93 void calcFollowPos(RBBINode *n);
94 void calcChainedFollowPos(RBBINode *n);
108 void addRuleRootNodes(UVector *dest, RBBINode *node);
152 void printPosSets(RBBINode *n /* = NULL*/);
166 RBBINode *&fTree; // The root node of the parse tree to build a
|
| D | rbbistbl.cpp | 75 RBBINode *varRefNode; in lookup()
76 RBBINode *exprNode; in lookup()
77 RBBINode *usetNode; in lookup()
88 if (exprNode->fType == RBBINode::setRef) { in lookup()
168 RBBINode *RBBISymbolTable::lookupNode(const UnicodeString &key) const{ in lookupNode()
170 RBBINode *retNode = NULL; in lookupNode()
187 void RBBISymbolTable::addEntry (const UnicodeString &key, RBBINode *val, UErrorCode &er… in addEntry()
257 RBBINode::printTree(s->val, TRUE); in rbbiSymtablePrint()
258 RBBINode::printTree(s->val->fLeftChild, FALSE); in rbbiSymtablePrint()
|
| D | rbbiscan.h | 85 void fixOpStack(RBBINode::OpPrecedence p);
87 void findSetFor(const UnicodeString &s, RBBINode *node, UnicodeSet *setToAdopt = NULL);
93 RBBINode *pushNewNode(RBBINode::NodeType t);
121 RBBINode *fNodeStack[kStackSize]; // Node stack, holds nodes created
|
| D | rbbirb.cpp | 105 RBBINode *n = (RBBINode *)fUSetNodes->elementAt(i); in ~RBBIRuleBuilder()
|
| D | rbbisetb.h | 88 void addValToSet (RBBINode *usetNode, uint32_t val);
|
| /external/icu/icu4j/ |
| D | coverage-exclusion.txt | 945 com/ibm/icu/text/RBBINode#printHex:(II)V
946 com/ibm/icu/text/RBBINode#printInt:(II)V
947 com/ibm/icu/text/RBBINode#printNode:(Lcom/ibm/icu/text/RBBINode;)V
948 com/ibm/icu/text/RBBINode#printString:(Ljava/lang/String;I)V
949 com/ibm/icu/text/RBBINode#printTree:(Z)V
957 com/ibm/icu/text/RBBITableBuilder#printPosSets:(Lcom/ibm/icu/text/RBBINode;)V
|