| /external/chromium_org/third_party/icu/source/common/ |
| D | rbbinode.cpp | 46 RBBINode::RBBINode(NodeType t) : UMemory() { in RBBINode() function in RBBINode
74 RBBINode::RBBINode(const RBBINode &other) : UMemory(other) { in RBBINode() function in RBBINode
105 RBBINode::~RBBINode() { in ~RBBINode()
141 RBBINode *RBBINode::cloneTree() { in cloneTree()
142 RBBINode *n; in cloneTree()
144 if (fType == RBBINode::varRef) { in cloneTree()
148 } else if (fType == RBBINode::uset) { in cloneTree()
151 n = new RBBINode(*this); in cloneTree()
187 RBBINode *RBBINode::flattenVariables() { in flattenVariables()
189 RBBINode *retNode = fLeftChild->cloneTree(); in flattenVariables()
[all …]
|
| D | rbbitblb.cpp | 27 RBBITableBuilder::RBBITableBuilder(RBBIRuleBuilder *rb, RBBINode **rootNode) : in RBBITableBuilder()
93 RBBINode *bofTop = new RBBINode(RBBINode::opCat); in build()
94 RBBINode *bofLeaf = new RBBINode(RBBINode::leafChar); in build()
114 RBBINode *cn = new RBBINode(RBBINode::opCat); in build()
122 cn->fRightChild = new RBBINode(RBBINode::endMark); in build()
200 void RBBITableBuilder::calcNullable(RBBINode *n) { in calcNullable()
204 if (n->fType == RBBINode::setRef || in calcNullable()
205 n->fType == RBBINode::endMark ) { in calcNullable()
211 if (n->fType == RBBINode::lookAhead || n->fType == RBBINode::tag) { in calcNullable()
225 if (n->fType == RBBINode::opOr) { in calcNullable()
[all …]
|
| D | rbbinode.h | 25 class RBBINode : public UMemory {
55 RBBINode *fParent;
56 RBBINode *fLeftChild;
57 RBBINode *fRightChild;
87 RBBINode(NodeType t);
88 RBBINode(const RBBINode &other);
89 ~RBBINode();
91 RBBINode *cloneTree();
92 RBBINode *flattenVariables();
94 void findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status);
[all …]
|
| D | rbbiscan.cpp | 199 RBBINode *n = NULL; in doParseActions()
206 pushNewNode(RBBINode::opStart); in doParseActions()
213 fixOpStack(RBBINode::precOpCat); in doParseActions()
214 RBBINode *operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()
215 RBBINode *orNode = pushNewNode(RBBINode::opOr); in doParseActions()
227 fixOpStack(RBBINode::precOpCat); in doParseActions()
228 RBBINode *operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()
229 RBBINode *catNode = pushNewNode(RBBINode::opCat); in doParseActions()
241 pushNewNode(RBBINode::opLParen); in doParseActions()
245 fixOpStack(RBBINode::precLParen); in doParseActions()
[all …]
|
| D | rbbisetb.cpp | 130 RBBINode *usetNode; in build()
156 usetNode = (RBBINode *)this->fRB->fUSetNodes->elementAt(ni); in build()
266 usetNode = (RBBINode *)this->fRB->fUSetNodes->elementAt(ni); in build()
354 RBBINode *usetNode = (RBBINode *)sets->elementAt(ix); in addValToSets()
359 void RBBISetBuilder::addValToSet(RBBINode *usetNode, uint32_t val) { in addValToSet()
360 RBBINode *leafNode = new RBBINode(RBBINode::leafChar); in addValToSet()
373 RBBINode *orNode = new RBBINode(RBBINode::opOr); in addValToSet()
444 RBBINode *usetNode = (RBBINode *)rlRange->fIncludesSets->elementAt(i); in printRanges()
446 RBBINode *setRef = usetNode->fParent; in printRanges()
448 RBBINode *varRef = setRef->fParent; in printRanges()
[all …]
|
| D | rbbirb.h | 32 class RBBINode; variable
47 RBBINode *val;
79 virtual RBBINode *lookupNode(const UnicodeString &key) const;
80 virtual void addEntry (const UnicodeString &key, RBBINode *val, UErrorCode &err);
130 RBBINode *fForwardTree; // The parse trees, generated by the scanner,
131 RBBINode *fReverseTree; // then manipulated by subsequent steps.
132 RBBINode *fSafeFwdTree;
133 RBBINode *fSafeRevTree;
135 RBBINode **fDefaultTree; // For rules not qualified with a !
186 RBBINode *val;
|
| D | rbbitblb.h | 37 RBBITableBuilder(RBBIRuleBuilder *rb, RBBINode **rootNode);
49 void calcNullable(RBBINode *n);
50 void calcFirstPos(RBBINode *n);
51 void calcLastPos(RBBINode *n);
52 void calcFollowPos(RBBINode *n);
53 void calcChainedFollowPos(RBBINode *n);
72 void printPosSets(RBBINode *n /* = NULL*/);
84 RBBINode *&fTree; // The root node of the parse tree to build a
|
| D | rbbiscan.h | 84 void fixOpStack(RBBINode::OpPrecedence p);
86 void findSetFor(const UnicodeString &s, RBBINode *node, UnicodeSet *setToAdopt = NULL);
92 RBBINode *pushNewNode(RBBINode::NodeType t);
120 RBBINode *fNodeStack[kStackSize]; // Node stack, holds nodes created
|
| D | rbbistbl.cpp | 73 RBBINode *varRefNode; in lookup()
74 RBBINode *exprNode; in lookup()
75 RBBINode *usetNode; in lookup()
86 if (exprNode->fType == RBBINode::setRef) { in lookup()
166 RBBINode *RBBISymbolTable::lookupNode(const UnicodeString &key) const{ in lookupNode()
168 RBBINode *retNode = NULL; in lookupNode()
185 void RBBISymbolTable::addEntry (const UnicodeString &key, RBBINode *val, UErrorCode &er… in addEntry()
|
| D | rbbisetb.h | 83 void addValToSet (RBBINode *usetNode, uint32_t val);
|
| D | rbbirb.cpp | 106 RBBINode *n = (RBBINode *)fUSetNodes->elementAt(i); in ~RBBIRuleBuilder()
|
| /external/icu/icu4c/source/common/ |
| D | rbbinode.cpp | 46 RBBINode::RBBINode(NodeType t) : UMemory() { in RBBINode() function in RBBINode
74 RBBINode::RBBINode(const RBBINode &other) : UMemory(other) { in RBBINode() function in RBBINode
105 RBBINode::~RBBINode() { in ~RBBINode()
141 RBBINode *RBBINode::cloneTree() { in cloneTree()
142 RBBINode *n; in cloneTree()
144 if (fType == RBBINode::varRef) { in cloneTree()
148 } else if (fType == RBBINode::uset) { in cloneTree()
151 n = new RBBINode(*this); in cloneTree()
187 RBBINode *RBBINode::flattenVariables() { in flattenVariables()
189 RBBINode *retNode = fLeftChild->cloneTree(); in flattenVariables()
[all …]
|
| D | rbbitblb.cpp | 27 RBBITableBuilder::RBBITableBuilder(RBBIRuleBuilder *rb, RBBINode **rootNode) : in RBBITableBuilder()
93 RBBINode *bofTop = new RBBINode(RBBINode::opCat); in build()
94 RBBINode *bofLeaf = new RBBINode(RBBINode::leafChar); in build()
114 RBBINode *cn = new RBBINode(RBBINode::opCat); in build()
122 cn->fRightChild = new RBBINode(RBBINode::endMark); in build()
200 void RBBITableBuilder::calcNullable(RBBINode *n) { in calcNullable()
204 if (n->fType == RBBINode::setRef || in calcNullable()
205 n->fType == RBBINode::endMark ) { in calcNullable()
211 if (n->fType == RBBINode::lookAhead || n->fType == RBBINode::tag) { in calcNullable()
225 if (n->fType == RBBINode::opOr) { in calcNullable()
[all …]
|
| D | rbbinode.h | 25 class RBBINode : public UMemory {
55 RBBINode *fParent;
56 RBBINode *fLeftChild;
57 RBBINode *fRightChild;
87 RBBINode(NodeType t);
88 RBBINode(const RBBINode &other);
89 ~RBBINode();
91 RBBINode *cloneTree();
92 RBBINode *flattenVariables();
94 void findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status);
[all …]
|
| D | rbbiscan.cpp | 199 RBBINode *n = NULL; in doParseActions()
206 pushNewNode(RBBINode::opStart); in doParseActions()
213 fixOpStack(RBBINode::precOpCat); in doParseActions()
214 RBBINode *operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()
215 RBBINode *orNode = pushNewNode(RBBINode::opOr); in doParseActions()
227 fixOpStack(RBBINode::precOpCat); in doParseActions()
228 RBBINode *operandNode = fNodeStack[fNodeStackPtr--]; in doParseActions()
229 RBBINode *catNode = pushNewNode(RBBINode::opCat); in doParseActions()
241 pushNewNode(RBBINode::opLParen); in doParseActions()
245 fixOpStack(RBBINode::precLParen); in doParseActions()
[all …]
|
| D | rbbisetb.cpp | 130 RBBINode *usetNode; in build()
156 usetNode = (RBBINode *)this->fRB->fUSetNodes->elementAt(ni); in build()
266 usetNode = (RBBINode *)this->fRB->fUSetNodes->elementAt(ni); in build()
354 RBBINode *usetNode = (RBBINode *)sets->elementAt(ix); in addValToSets()
359 void RBBISetBuilder::addValToSet(RBBINode *usetNode, uint32_t val) { in addValToSet()
360 RBBINode *leafNode = new RBBINode(RBBINode::leafChar); in addValToSet()
373 RBBINode *orNode = new RBBINode(RBBINode::opOr); in addValToSet()
444 RBBINode *usetNode = (RBBINode *)rlRange->fIncludesSets->elementAt(i); in printRanges()
446 RBBINode *setRef = usetNode->fParent; in printRanges()
448 RBBINode *varRef = setRef->fParent; in printRanges()
[all …]
|
| D | rbbirb.h | 32 class RBBINode; variable
47 RBBINode *val;
79 virtual RBBINode *lookupNode(const UnicodeString &key) const;
80 virtual void addEntry (const UnicodeString &key, RBBINode *val, UErrorCode &err);
130 RBBINode *fForwardTree; // The parse trees, generated by the scanner,
131 RBBINode *fReverseTree; // then manipulated by subsequent steps.
132 RBBINode *fSafeFwdTree;
133 RBBINode *fSafeRevTree;
135 RBBINode **fDefaultTree; // For rules not qualified with a !
186 RBBINode *val;
|
| D | rbbitblb.h | 37 RBBITableBuilder(RBBIRuleBuilder *rb, RBBINode **rootNode);
49 void calcNullable(RBBINode *n);
50 void calcFirstPos(RBBINode *n);
51 void calcLastPos(RBBINode *n);
52 void calcFollowPos(RBBINode *n);
53 void calcChainedFollowPos(RBBINode *n);
72 void printPosSets(RBBINode *n /* = NULL*/);
84 RBBINode *&fTree; // The root node of the parse tree to build a
|
| D | rbbiscan.h | 84 void fixOpStack(RBBINode::OpPrecedence p);
86 void findSetFor(const UnicodeString &s, RBBINode *node, UnicodeSet *setToAdopt = NULL);
92 RBBINode *pushNewNode(RBBINode::NodeType t);
120 RBBINode *fNodeStack[kStackSize]; // Node stack, holds nodes created
|
| D | rbbistbl.cpp | 73 RBBINode *varRefNode; in lookup()
74 RBBINode *exprNode; in lookup()
75 RBBINode *usetNode; in lookup()
86 if (exprNode->fType == RBBINode::setRef) { in lookup()
166 RBBINode *RBBISymbolTable::lookupNode(const UnicodeString &key) const{ in lookupNode()
168 RBBINode *retNode = NULL; in lookupNode()
185 void RBBISymbolTable::addEntry (const UnicodeString &key, RBBINode *val, UErrorCode &er… in addEntry()
|
| D | rbbisetb.h | 83 void addValToSet (RBBINode *usetNode, uint32_t val);
|
| D | rbbirb.cpp | 106 RBBINode *n = (RBBINode *)fUSetNodes->elementAt(i); in ~RBBIRuleBuilder()
|