/third_party/icu/ohos_icu4j/src/main/java/ohos/global/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 127 RBBINode bofTop = new RBBINode(RBBINode.opCat); in buildForwardTable() 128 RBBINode bofLeaf = new RBBINode(RBBINode.leafChar); in buildForwardTable() 141 RBBINode cn = new RBBINode(RBBINode.opCat); in buildForwardTable() 144 RBBINode endMarkerNode = cn.fRightChild = new RBBINode(RBBINode.endMark); in buildForwardTable() 213 void calcNullable(RBBINode n) { in calcNullable() 217 if (n.fType == RBBINode.setRef || in calcNullable() 218 n.fType == RBBINode.endMark ) { in calcNullable() 224 if (n.fType == RBBINode.lookAhead || n.fType == RBBINode.tag) { in calcNullable() 238 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 | 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 …]
|
/third_party/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 …]
|
/third_party/flutter/skia/third_party/externals/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 | 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 | 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 …]
|
/third_party/skia/third_party/externals/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 …]
|
/third_party/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 …]
|
/third_party/node/deps/icu-small/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 …]
|