| /external/chromium_org/third_party/icu/source/common/ |
| rbbinode.h | 14 // class RBBINode
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()
[all...] |
| rbbitblb.h | 18 #include "rbbinode.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
109 // UVector contents are RBBINode *
[all...] |
| rbbirb.h | 32 class RBBINode;
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
[all...] |
| rbbinode.cpp | 9 // File: rbbinode.cpp
11 // Implementation of class RBBINode, which represents a node in the
29 #include "rbbinode.h"
46 RBBINode::RBBINode(NodeType t) : UMemory() {
74 RBBINode::RBBINode(const RBBINode &other) : UMemory(other) {
105 RBBINode::~RBBINode() {
[all...] |
| rbbiscan.h | 23 #include "rbbinode.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
|
| rbbitblb.cpp | 27 RBBITableBuilder::RBBITableBuilder(RBBIRuleBuilder *rb, RBBINode **rootNode) :
93 RBBINode *bofTop = new RBBINode(RBBINode::opCat);
94 RBBINode *bofLeaf = new RBBINode(RBBINode::leafChar);
114 RBBINode *cn = new RBBINode(RBBINode::opCat)
[all...] |
| rbbisetb.cpp | 43 #include "rbbinode.h"
130 RBBINode *usetNode;
156 usetNode = (RBBINode *)this->fRB->fUSetNodes->elementAt(ni);
266 usetNode = (RBBINode *)this->fRB->fUSetNodes->elementAt(ni);
354 RBBINode *usetNode = (RBBINode *)sets->elementAt(ix);
359 void RBBISetBuilder::addValToSet(RBBINode *usetNode, uint32_t val) {
360 RBBINode *leafNode = new RBBINode(RBBINode::leafChar)
[all...] |
| rbbiscan.cpp | 33 #include "rbbinode.h"
198 RBBINode *n = NULL;
205 pushNewNode(RBBINode::opStart);
212 fixOpStack(RBBINode::precOpCat);
213 RBBINode *operandNode = fNodeStack[fNodeStackPtr--];
214 RBBINode *orNode = pushNewNode(RBBINode::opOr);
226 fixOpStack(RBBINode::precOpCat);
227 RBBINode *operandNode = fNodeStack[fNodeStackPtr--];
228 RBBINode *catNode = pushNewNode(RBBINode::opCat)
[all...] |
| rbbistbl.cpp | 23 #include "rbbinode.h"
73 RBBINode *varRefNode;
74 RBBINode *exprNode;
75 RBBINode *usetNode;
86 if (exprNode->fType == RBBINode::setRef) {
166 RBBINode *RBBISymbolTable::lookupNode(const UnicodeString &key) const{
168 RBBINode *retNode = NULL;
185 void RBBISymbolTable::addEntry (const UnicodeString &key, RBBINode *val, UErrorCode &err) {
|
| rbbisetb.h | 83 void addValToSet (RBBINode *usetNode, uint32_t val);
|
| rbbirb.cpp | 29 #include "rbbinode.h"
106 RBBINode *n = (RBBINode *)fUSetNodes->elementAt(i);
|
| /external/icu/icu4c/source/common/ |
| rbbinode.h | 14 // class RBBINode
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()
[all...] |
| rbbitblb.h | 18 #include "rbbinode.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
109 // UVector contents are RBBINode *
[all...] |
| rbbirb.h | 32 class RBBINode;
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
[all...] |
| rbbinode.cpp | 9 // File: rbbinode.cpp
11 // Implementation of class RBBINode, which represents a node in the
29 #include "rbbinode.h"
46 RBBINode::RBBINode(NodeType t) : UMemory() {
74 RBBINode::RBBINode(const RBBINode &other) : UMemory(other) {
105 RBBINode::~RBBINode() {
[all...] |
| rbbiscan.h | 23 #include "rbbinode.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
|
| rbbitblb.cpp | 27 RBBITableBuilder::RBBITableBuilder(RBBIRuleBuilder *rb, RBBINode **rootNode) :
93 RBBINode *bofTop = new RBBINode(RBBINode::opCat);
94 RBBINode *bofLeaf = new RBBINode(RBBINode::leafChar);
114 RBBINode *cn = new RBBINode(RBBINode::opCat)
[all...] |
| rbbisetb.cpp | 43 #include "rbbinode.h"
130 RBBINode *usetNode;
156 usetNode = (RBBINode *)this->fRB->fUSetNodes->elementAt(ni);
266 usetNode = (RBBINode *)this->fRB->fUSetNodes->elementAt(ni);
354 RBBINode *usetNode = (RBBINode *)sets->elementAt(ix);
359 void RBBISetBuilder::addValToSet(RBBINode *usetNode, uint32_t val) {
360 RBBINode *leafNode = new RBBINode(RBBINode::leafChar)
[all...] |
| rbbiscan.cpp | 32 #include "rbbinode.h"
199 RBBINode *n = NULL;
206 pushNewNode(RBBINode::opStart);
213 fixOpStack(RBBINode::precOpCat);
214 RBBINode *operandNode = fNodeStack[fNodeStackPtr--];
215 RBBINode *orNode = pushNewNode(RBBINode::opOr);
227 fixOpStack(RBBINode::precOpCat);
228 RBBINode *operandNode = fNodeStack[fNodeStackPtr--];
229 RBBINode *catNode = pushNewNode(RBBINode::opCat)
[all...] |
| rbbistbl.cpp | 23 #include "rbbinode.h"
73 RBBINode *varRefNode;
74 RBBINode *exprNode;
75 RBBINode *usetNode;
86 if (exprNode->fType == RBBINode::setRef) {
166 RBBINode *RBBISymbolTable::lookupNode(const UnicodeString &key) const{
168 RBBINode *retNode = NULL;
185 void RBBISymbolTable::addEntry (const UnicodeString &key, RBBINode *val, UErrorCode &err) {
|
| rbbisetb.h | 83 void addValToSet (RBBINode *usetNode, uint32_t val);
|
| rbbirb.cpp | 29 #include "rbbinode.h"
106 RBBINode *n = (RBBINode *)fUSetNodes->elementAt(i);
|
| /external/chromium_org/third_party/icu/source/common/unicode/ |
| urename.h | [all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| com.ibm.icu_4.2.1.v20100412.jar | |
| /prebuilts/misc/common/icu4j/ |
| icu4j.jar | |
