| /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
134 RBBINode bofTop = new RBBINode(RBBINode.opCat); in buildForwardTable()
135 RBBINode bofLeaf = new RBBINode(RBBINode.leafChar); in buildForwardTable()
148 RBBINode cn = new RBBINode(RBBINode.opCat); in buildForwardTable()
151 RBBINode endMarkerNode = cn.fRightChild = new RBBINode(RBBINode.endMark); in buildForwardTable()
220 void calcNullable(RBBINode n) { in calcNullable()
224 if (n.fType == RBBINode.setRef || in calcNullable()
225 n.fType == RBBINode.endMark ) { in calcNullable()
231 if (n.fType == RBBINode.lookAhead || n.fType == RBBINode.tag) { in calcNullable()
245 if (n.fType == RBBINode.opOr) { 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 | 49 List<RBBINode> fIncludesSets; // vector of the the original
101 RBBINode usetNode = fIncludesSets.get(i); in isDictionaryRange()
103 RBBINode setRef = usetNode.fParent; in isDictionaryRange()
105 RBBINode varRef = setRef.fParent; in isDictionaryRange()
106 if (varRef != null && varRef.fType == RBBINode.varRef) { in isDictionaryRange()
171 for (RBBINode usetNode : fRB.fUSetNodes) { in buildRanges()
290 for (RBBINode usetNode : fRB.fUSetNodes) { in buildRanges()
401 void addValToSets(List<RBBINode> sets, int val) { in addValToSets()
402 for (RBBINode usetNode : sets) { in addValToSets()
407 void addValToSet(RBBINode usetNode, int val) { in addValToSet()
[all …]
|
| /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
135 RBBINode bofTop = new RBBINode(RBBINode.opCat); in buildForwardTable()
136 RBBINode bofLeaf = new RBBINode(RBBINode.leafChar); in buildForwardTable()
149 RBBINode cn = new RBBINode(RBBINode.opCat); in buildForwardTable()
152 RBBINode endMarkerNode = cn.fRightChild = new RBBINode(RBBINode.endMark); in buildForwardTable()
221 void calcNullable(RBBINode n) { in calcNullable()
225 if (n.fType == RBBINode.setRef || in calcNullable()
226 n.fType == RBBINode.endMark ) { in calcNullable()
232 if (n.fType == RBBINode.lookAhead || n.fType == RBBINode.tag) { in calcNullable()
246 if (n.fType == RBBINode.opOr) { 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 | 50 List<RBBINode> fIncludesSets; // vector of the the original
102 RBBINode usetNode = fIncludesSets.get(i); in isDictionaryRange()
104 RBBINode setRef = usetNode.fParent; in isDictionaryRange()
106 RBBINode varRef = setRef.fParent; in isDictionaryRange()
107 if (varRef != null && varRef.fType == RBBINode.varRef) { in isDictionaryRange()
172 for (RBBINode usetNode : fRB.fUSetNodes) { in buildRanges()
291 for (RBBINode usetNode : fRB.fUSetNodes) { in buildRanges()
402 void addValToSets(List<RBBINode> sets, int val) { in addValToSets()
403 for (RBBINode usetNode : sets) { in addValToSets()
408 void addValToSet(RBBINode usetNode, int val) { in addValToSet()
[all …]
|
| /external/cronet/third_party/icu/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 | 33 RBBITableBuilder::RBBITableBuilder(RBBIRuleBuilder *rb, RBBINode **rootNode, UErrorCode &status) : in RBBITableBuilder()
88 RBBINode::printTree(fTree, true); in buildForwardTable()
99 RBBINode *bofTop = new RBBINode(RBBINode::opCat); in buildForwardTable()
100 RBBINode *bofLeaf = new RBBINode(RBBINode::leafChar); in buildForwardTable()
120 RBBINode *cn = new RBBINode(RBBINode::opCat); in buildForwardTable()
128 RBBINode *endMarkerNode = cn->fRightChild = new RBBINode(RBBINode::endMark); in buildForwardTable()
146 RBBINode::printTree(fTree, true); in buildForwardTable()
205 void RBBITableBuilder::calcNullable(RBBINode *n) { in calcNullable()
209 if (n->fType == RBBINode::setRef || in calcNullable()
210 n->fType == RBBINode::endMark ) { in calcNullable()
[all …]
|
| D | rbbisetb.cpp | 97 RBBINode *usetNode; in buildRanges()
123 usetNode = (RBBINode *)this->fRB->fUSetNodes->elementAt(ni); in buildRanges()
254 usetNode = (RBBINode *)this->fRB->fUSetNodes->elementAt(ni); in buildRanges()
372 RBBINode *usetNode = (RBBINode *)sets->elementAt(ix); in addValToSets()
377 void RBBISetBuilder::addValToSet(RBBINode *usetNode, uint32_t val) { in addValToSet()
378 RBBINode *leafNode = new RBBINode(RBBINode::leafChar); in addValToSet()
391 RBBINode *orNode = new RBBINode(RBBINode::opOr); in addValToSet()
471 RBBINode *usetNode = (RBBINode *)rlRange->fIncludesSets->elementAt(i); in printRanges()
473 RBBINode *setRef = usetNode->fParent; in printRanges()
475 RBBINode *varRef = setRef->fParent; in printRanges()
[all …]
|
| D | rbbitblb.h | 45 RBBITableBuilder(RBBIRuleBuilder *rb, RBBINode **rootNode, UErrorCode &status);
96 void calcNullable(RBBINode *n);
97 void calcFirstPos(RBBINode *n);
98 void calcLastPos(RBBINode *n);
99 void calcFollowPos(RBBINode *n);
100 void calcChainedFollowPos(RBBINode *n, RBBINode *endMarkNode);
115 void addRuleRootNodes(UVector *dest, RBBINode *node);
159 void printPosSets(RBBINode *n /* = NULL*/);
173 RBBINode *&fTree; // The root node of the parse tree to build a
|
| 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;
|
| /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 | 33 RBBITableBuilder::RBBITableBuilder(RBBIRuleBuilder *rb, RBBINode **rootNode, UErrorCode &status) : in RBBITableBuilder()
88 RBBINode::printTree(fTree, true); in buildForwardTable()
99 RBBINode *bofTop = new RBBINode(RBBINode::opCat); in buildForwardTable()
100 RBBINode *bofLeaf = new RBBINode(RBBINode::leafChar); in buildForwardTable()
120 RBBINode *cn = new RBBINode(RBBINode::opCat); in buildForwardTable()
128 RBBINode *endMarkerNode = cn->fRightChild = new RBBINode(RBBINode::endMark); in buildForwardTable()
146 RBBINode::printTree(fTree, true); in buildForwardTable()
205 void RBBITableBuilder::calcNullable(RBBINode *n) { in calcNullable()
209 if (n->fType == RBBINode::setRef || in calcNullable()
210 n->fType == RBBINode::endMark ) { in calcNullable()
[all …]
|
| D | rbbisetb.cpp | 97 RBBINode *usetNode; in buildRanges()
123 usetNode = (RBBINode *)this->fRB->fUSetNodes->elementAt(ni); in buildRanges()
254 usetNode = (RBBINode *)this->fRB->fUSetNodes->elementAt(ni); in buildRanges()
372 RBBINode *usetNode = (RBBINode *)sets->elementAt(ix); in addValToSets()
377 void RBBISetBuilder::addValToSet(RBBINode *usetNode, uint32_t val) { in addValToSet()
378 RBBINode *leafNode = new RBBINode(RBBINode::leafChar); in addValToSet()
391 RBBINode *orNode = new RBBINode(RBBINode::opOr); in addValToSet()
471 RBBINode *usetNode = (RBBINode *)rlRange->fIncludesSets->elementAt(i); in printRanges()
473 RBBINode *setRef = usetNode->fParent; in printRanges()
475 RBBINode *varRef = setRef->fParent; in printRanges()
[all …]
|
| D | rbbitblb.h | 45 RBBITableBuilder(RBBIRuleBuilder *rb, RBBINode **rootNode, UErrorCode &status);
96 void calcNullable(RBBINode *n);
97 void calcFirstPos(RBBINode *n);
98 void calcLastPos(RBBINode *n);
99 void calcFollowPos(RBBINode *n);
100 void calcChainedFollowPos(RBBINode *n, RBBINode *endMarkNode);
115 void addRuleRootNodes(UVector *dest, RBBINode *node);
159 void printPosSets(RBBINode *n /* = NULL*/);
173 RBBINode *&fTree; // The root node of the parse tree to build a
|
| 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;
|
| /external/icu/libicu/cts_headers/ |
| 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 | rbbitblb.h | 45 RBBITableBuilder(RBBIRuleBuilder *rb, RBBINode **rootNode, UErrorCode &status);
96 void calcNullable(RBBINode *n);
97 void calcFirstPos(RBBINode *n);
98 void calcLastPos(RBBINode *n);
99 void calcFollowPos(RBBINode *n);
100 void calcChainedFollowPos(RBBINode *n, RBBINode *endMarkNode);
115 void addRuleRootNodes(UVector *dest, RBBINode *node);
159 void printPosSets(RBBINode *n /* = NULL*/);
173 RBBINode *&fTree; // The root node of the parse tree to build a
|
| 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;
|