| /external/icu/icu4c/source/common/ |
| rbbinode.h | 17 // class RBBINode
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()
[all...] |
| rbbitblb.h | 20 #include "rbbinode.h"
39 RBBITableBuilder(RBBIRuleBuilder *rb, RBBINode **rootNode);
51 void calcNullable(RBBINode *n);
52 void calcFirstPos(RBBINode *n);
53 void calcLastPos(RBBINode *n);
54 void calcFollowPos(RBBINode *n);
55 void calcChainedFollowPos(RBBINode *n);
63 void addRuleRootNodes(UVector *dest, RBBINode *node);
76 void printPosSets(RBBINode *n /* = NULL*/);
88 RBBINode *&fTree; // The root node of the parse tree to build
[all...] |
| rbbinode.cpp | 11 // File: rbbinode.cpp
13 // Implementation of class RBBINode, which represents a node in the
33 #include "rbbinode.h"
50 RBBINode::RBBINode(NodeType t) : UMemory() {
80 RBBINode::RBBINode(const RBBINode &other) : UMemory(other) {
113 RBBINode::~RBBINode() {
[all...] |
| rbbirb.h | 34 class RBBINode;
49 RBBINode *val;
81 virtual RBBINode *lookupNode(const UnicodeString &key) const;
82 virtual void addEntry (const UnicodeString &key, RBBINode *val, UErrorCode &err);
132 RBBINode *fForwardTree; // The parse trees, generated by the scanner,
133 RBBINode *fReverseTree; // then manipulated by subsequent steps.
134 RBBINode *fSafeFwdTree;
135 RBBINode *fSafeRevTree;
137 RBBINode **fDefaultTree; // For rules not qualified with a !
188 RBBINode *val
[all...] |
| rbbitblb.cpp | 29 RBBITableBuilder::RBBITableBuilder(RBBIRuleBuilder *rb, RBBINode **rootNode) :
84 RBBINode::printTree(fTree, TRUE);
95 RBBINode *bofTop = new RBBINode(RBBINode::opCat);
96 RBBINode *bofLeaf = new RBBINode(RBBINode::leafChar);
116 RBBINode *cn = new RBBINode(RBBINode::opCat)
[all...] |
| rbbiscan.h | 25 #include "rbbinode.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
|
| rbbisetb.cpp | 45 #include "rbbinode.h"
132 RBBINode *usetNode;
158 usetNode = (RBBINode *)this->fRB->fUSetNodes->elementAt(ni);
268 usetNode = (RBBINode *)this->fRB->fUSetNodes->elementAt(ni);
356 RBBINode *usetNode = (RBBINode *)sets->elementAt(ix);
361 void RBBISetBuilder::addValToSet(RBBINode *usetNode, uint32_t val) {
362 RBBINode *leafNode = new RBBINode(RBBINode::leafChar)
[all...] |
| rbbiscan.cpp | 33 #include "rbbinode.h"
201 RBBINode *n = NULL;
208 pushNewNode(RBBINode::opStart);
221 fixOpStack(RBBINode::precOpCat);
222 RBBINode *operandNode = fNodeStack[fNodeStackPtr--];
223 RBBINode *orNode = pushNewNode(RBBINode::opOr);
238 fixOpStack(RBBINode::precOpCat);
239 RBBINode *operandNode = fNodeStack[fNodeStackPtr--];
240 RBBINode *catNode = pushNewNode(RBBINode::opCat)
[all...] |
| rbbistbl.cpp | 23 #include "rbbinode.h"
75 RBBINode *varRefNode;
76 RBBINode *exprNode;
77 RBBINode *usetNode;
88 if (exprNode->fType == RBBINode::setRef) {
168 RBBINode *RBBISymbolTable::lookupNode(const UnicodeString &key) const{
170 RBBINode *retNode = NULL;
187 void RBBISymbolTable::addEntry (const UnicodeString &key, RBBINode *val, UErrorCode &err) {
257 RBBINode::printTree(s->val, TRUE);
258 RBBINode::printTree(s->val->fLeftChild, FALSE)
[all...] |
| rbbisetb.h | 85 void addValToSet (RBBINode *usetNode, uint32_t val);
|
| rbbirb.cpp | 31 #include "rbbinode.h"
108 RBBINode *n = (RBBINode *)fUSetNodes->elementAt(i);
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| RBBINode.java | 21 class RBBINode {
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) {
114 fFirstPosSet = new HashSet<RBBINode>();
115 fLastPosSet = new HashSet<RBBINode>();
[all...] |
| RBBITableBuilder.java | 46 Set<RBBINode> fPositions; // Set of parse tree positions associated
48 // UVector contents are RBBINode *
57 fPositions = new HashSet<RBBINode>();
121 RBBINode bofTop = new RBBINode(RBBINode.opCat);
122 RBBINode bofLeaf = new RBBINode(RBBINode.leafChar);
135 RBBINode cn = new RBBINode(RBBINode.opCat)
[all...] |
| RBBIRuleScanner.java | 58 RBBINode fNodeStack[] = new RBBINode[kStackSize]; // Node stack, holds nodes created
135 RBBINode n = null;
142 pushNewNode(RBBINode.opStart);
153 fixOpStack(RBBINode.precOpCat);
154 RBBINode operandNode = fNodeStack[fNodeStackPtr--];
155 RBBINode orNode = pushNewNode(RBBINode.opOr);
168 fixOpStack(RBBINode.precOpCat);
169 RBBINode operandNode = fNodeStack[fNodeStackPtr--]
[all...] |
| RBBISetBuilder.java | 45 List<RBBINode> fIncludesSets; // vector of the the original
51 fIncludesSets = new ArrayList<RBBINode>();
58 fIncludesSets = new ArrayList<RBBINode>(other.fIncludesSets);
105 RBBINode usetNode = fIncludesSets.get(i);
107 RBBINode setRef = usetNode.fParent;
109 RBBINode varRef = setRef.fParent;
110 if (varRef != null && varRef.fType == RBBINode.varRef) {
173 for (RBBINode usetNode : fRB.fUSetNodes) {
268 for (RBBINode usetNode : fRB.fUSetNodes) {
370 void addValToSets(List<RBBINode> sets, int val)
[all...] |
| RBBISymbolTable.java | 32 RBBINode val;
51 RBBINode varRefNode;
52 RBBINode exprNode;
54 RBBINode usetNode;
64 while (varRefNode.fLeftChild.fType == RBBINode.varRef) {
69 if (exprNode.fType == RBBINode.setRef) {
139 RBBINode lookupNode(String key) {
141 RBBINode retNode = null;
157 void addEntry(String key, RBBINode val) {
|
| RBBIRuleBuilder.java | 40 RBBINode[] fTreeRoots = new RBBINode[4];
59 List<RBBINode> fUSetNodes; // Vector of all uset nodes.
146 fUSetNodes = new ArrayList<RBBINode>();
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| RBBINode.java | 20 class RBBINode {
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) {
113 fFirstPosSet = new HashSet<RBBINode>();
114 fLastPosSet = new HashSet<RBBINode>();
[all...] |
| RBBITableBuilder.java | 45 Set<RBBINode> fPositions; // Set of parse tree positions associated
47 // UVector contents are RBBINode *
56 fPositions = new HashSet<RBBINode>();
120 RBBINode bofTop = new RBBINode(RBBINode.opCat);
121 RBBINode bofLeaf = new RBBINode(RBBINode.leafChar);
134 RBBINode cn = new RBBINode(RBBINode.opCat)
[all...] |
| RBBIRuleScanner.java | 57 RBBINode fNodeStack[] = new RBBINode[kStackSize]; // Node stack, holds nodes created
134 RBBINode n = null;
141 pushNewNode(RBBINode.opStart);
152 fixOpStack(RBBINode.precOpCat);
153 RBBINode operandNode = fNodeStack[fNodeStackPtr--];
154 RBBINode orNode = pushNewNode(RBBINode.opOr);
167 fixOpStack(RBBINode.precOpCat);
168 RBBINode operandNode = fNodeStack[fNodeStackPtr--]
[all...] |
| RBBISetBuilder.java | 44 List<RBBINode> fIncludesSets; // vector of the the original
50 fIncludesSets = new ArrayList<RBBINode>();
57 fIncludesSets = new ArrayList<RBBINode>(other.fIncludesSets);
104 RBBINode usetNode = fIncludesSets.get(i);
106 RBBINode setRef = usetNode.fParent;
108 RBBINode varRef = setRef.fParent;
109 if (varRef != null && varRef.fType == RBBINode.varRef) {
172 for (RBBINode usetNode : fRB.fUSetNodes) {
267 for (RBBINode usetNode : fRB.fUSetNodes) {
369 void addValToSets(List<RBBINode> sets, int val)
[all...] |
| RBBISymbolTable.java | 31 RBBINode val;
50 RBBINode varRefNode;
51 RBBINode exprNode;
53 RBBINode usetNode;
63 while (varRefNode.fLeftChild.fType == RBBINode.varRef) {
68 if (exprNode.fType == RBBINode.setRef) {
138 RBBINode lookupNode(String key) {
140 RBBINode retNode = null;
156 void addEntry(String key, RBBINode val) {
|
| RBBIRuleBuilder.java | 39 RBBINode[] fTreeRoots = new RBBINode[4];
58 List<RBBINode> fUSetNodes; // Vector of all uset nodes.
145 fUSetNodes = new ArrayList<RBBINode>();
|
| /prebuilts/misc/common/icu4j/ |
| icu4j.jar | |
| /prebuilts/misc/common/robolectric/lib/ |
| icu4j-53.1.jar | |
