/dports/devel/icu/icu/source/common/ |
H A 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() 159 n = new RBBINode(*this); in cloneTree() 195 RBBINode *RBBINode::flattenVariables() { in flattenVariables() 226 void RBBINode::flattenSets() { in flattenSets() 264 void RBBINode::findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status) { in findNodes() 294 void RBBINode::printNode(const RBBINode *node) { in printNode() [all …]
|
H A 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(); 105 static void printNode(const RBBINode *n); [all …]
|
/dports/devel/icu-lx/icu/source/common/ |
H A 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() 159 n = new RBBINode(*this); in cloneTree() 195 RBBINode *RBBINode::flattenVariables() { in flattenVariables() 226 void RBBINode::flattenSets() { in flattenSets() 264 void RBBINode::findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status) { in findNodes() 294 void RBBINode::printNode(const RBBINode *node) { in printNode() [all …]
|
H A 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(); 105 static void printNode(const RBBINode *n); [all …]
|
/dports/www/firefox-esr/firefox-91.8.0/intl/icu/source/common/ |
H A 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() 159 n = new RBBINode(*this); in cloneTree() 195 RBBINode *RBBINode::flattenVariables() { in flattenVariables() 226 void RBBINode::flattenSets() { in flattenSets() 264 void RBBINode::findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status) { in findNodes() 293 void RBBINode::printNode(const RBBINode *node) { in printNode() [all …]
|
H A 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(); 105 static void printNode(const RBBINode *n); [all …]
|
/dports/lang/v8/v8-9.6.180.12/third_party/icu/source/common/ |
H A 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() 159 n = new RBBINode(*this); in cloneTree() 195 RBBINode *RBBINode::flattenVariables() { in flattenVariables() 226 void RBBINode::flattenSets() { in flattenSets() 264 void RBBINode::findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status) { in findNodes() 293 void RBBINode::printNode(const RBBINode *node) { in printNode() [all …]
|
H A 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(); 105 static void printNode(const RBBINode *n); [all …]
|
/dports/lang/spidermonkey78/firefox-78.9.0/intl/icu/source/common/ |
H A 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() 159 n = new RBBINode(*this); in cloneTree() 195 RBBINode *RBBINode::flattenVariables() { in flattenVariables() 226 void RBBINode::flattenSets() { in flattenSets() 264 void RBBINode::findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status) { in findNodes() 293 void RBBINode::printNode(const RBBINode *node) { in printNode() [all …]
|
H A 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(); 105 static void printNode(const RBBINode *n); [all …]
|
/dports/textproc/R-cran-stringi/stringi/src/icu69/common/ |
H A 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() 159 n = new RBBINode(*this); in cloneTree() 195 RBBINode *RBBINode::flattenVariables() { in flattenVariables() 226 void RBBINode::flattenSets() { in flattenSets() 264 void RBBINode::findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status) { in findNodes() 293 void RBBINode::printNode(const RBBINode *node) { in printNode() [all …]
|
H A 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(); 105 static void printNode(const RBBINode *n); [all …]
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/icu/source/common/ |
H A 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() 159 n = new RBBINode(*this); in cloneTree() 195 RBBINode *RBBINode::flattenVariables() { in flattenVariables() 226 void RBBINode::flattenSets() { in flattenSets() 264 void RBBINode::findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status) { in findNodes() 293 void RBBINode::printNode(const RBBINode *node) { in printNode() [all …]
|
H A 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(); 105 static void printNode(const RBBINode *n); [all …]
|
/dports/www/firefox/firefox-99.0/intl/icu/source/common/ |
H A 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() 159 n = new RBBINode(*this); in cloneTree() 195 RBBINode *RBBINode::flattenVariables() { in flattenVariables() 226 void RBBINode::flattenSets() { in flattenSets() 264 void RBBINode::findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status) { in findNodes() 294 void RBBINode::printNode(const RBBINode *node) { in printNode() [all …]
|
/dports/mail/thunderbird/thunderbird-91.8.0/intl/icu/source/common/ |
H A 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() 159 n = new RBBINode(*this); in cloneTree() 195 RBBINode *RBBINode::flattenVariables() { in flattenVariables() 226 void RBBINode::flattenSets() { in flattenSets() 264 void RBBINode::findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status) { in findNodes() 293 void RBBINode::printNode(const RBBINode *node) { in printNode() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/icu/source/common/ |
H A 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() 159 n = new RBBINode(*this); in cloneTree() 195 RBBINode *RBBINode::flattenVariables() { in flattenVariables() 226 void RBBINode::flattenSets() { in flattenSets() 264 void RBBINode::findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status) { in findNodes() 293 void RBBINode::printNode(const RBBINode *node) { in printNode() [all …]
|
/dports/www/firefox-legacy/firefox-52.8.0esr/intl/icu/source/common/ |
H A 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() 159 n = new RBBINode(*this); in cloneTree() 195 RBBINode *RBBINode::flattenVariables() { in flattenVariables() 226 void RBBINode::flattenSets() { in flattenSets() 264 void RBBINode::findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status) { in findNodes() 293 void RBBINode::printNode(const RBBINode *node) { in printNode() [all …]
|
H A D | rbbitblb.cpp | 95 RBBINode *bofTop = new RBBINode(RBBINode::opCat); in RBBIRuleScanner() 96 RBBINode *bofLeaf = new RBBINode(RBBINode::leafChar); in RBBIRuleScanner() 116 RBBINode *cn = new RBBINode(RBBINode::opCat); 124 cn->fRightChild = new RBBINode(RBBINode::endMark); 213 if (n->fType == RBBINode::lookAhead || n->fType == RBBINode::tag) { in doParseActions() 233 else if (n->fType == RBBINode::opStar || n->fType == RBBINode::opQuestion) { in doParseActions() 434 RBBINode *node = static_cast<RBBINode *>(ruleRootNodes.elementAt(i)); 447 RBBINode *tNode = (RBBINode *)leafNodes.elementAt(endNodeIx); 542 RBBINode *startNode; 820 RBBINode *tagNode; [all …]
|
/dports/lang/spidermonkey60/firefox-60.9.0/intl/icu/source/common/ |
H A 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() 159 n = new RBBINode(*this); in cloneTree() 195 RBBINode *RBBINode::flattenVariables() { in flattenVariables() 226 void RBBINode::flattenSets() { in flattenSets() 264 void RBBINode::findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status) { in findNodes() 293 void RBBINode::printNode(const RBBINode *node) { in printNode() [all …]
|
H A D | rbbitblb.cpp | 95 RBBINode *bofTop = new RBBINode(RBBINode::opCat); in build() 96 RBBINode *bofLeaf = new RBBINode(RBBINode::leafChar); in build() 116 RBBINode *cn = new RBBINode(RBBINode::opCat); in build() 124 cn->fRightChild = new RBBINode(RBBINode::endMark); in build() 213 if (n->fType == RBBINode::lookAhead || n->fType == RBBINode::tag) { in calcNullable() 233 else if (n->fType == RBBINode::opStar || n->fType == RBBINode::opQuestion) { in calcNullable() 434 RBBINode *node = static_cast<RBBINode *>(ruleRootNodes.elementAt(i)); in calcChainedFollowPos() 447 RBBINode *tNode = (RBBINode *)leafNodes.elementAt(endNodeIx); in calcChainedFollowPos() 542 RBBINode *startNode; in bofFixup() 820 RBBINode *tagNode; in flagTaggedStates() [all …]
|
/dports/www/node10/node-v10.24.1/deps/icu-small/source/common/ |
H A 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() 159 n = new RBBINode(*this); in cloneTree() 195 RBBINode *RBBINode::flattenVariables() { in flattenVariables() 226 void RBBINode::flattenSets() { in flattenSets() 264 void RBBINode::findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status) { in findNodes() 293 void RBBINode::printNode(const RBBINode *node) { in printNode() [all …]
|
/dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/icu4c-57.1/source/common/ |
H A D | rbbinode.cpp | 46 RBBINode::RBBINode(NodeType t) : UMemory() { in RBBINode() function in RBBINode 76 RBBINode::RBBINode(const RBBINode &other) : UMemory(other) { in RBBINode() function in RBBINode 109 RBBINode::~RBBINode() { in ~RBBINode() 145 RBBINode *RBBINode::cloneTree() { in cloneTree() 146 RBBINode *n; in cloneTree() 155 n = new RBBINode(*this); in cloneTree() 193 RBBINode *RBBINode::flattenVariables() { in flattenVariables() 220 void RBBINode::flattenSets() { in flattenSets() 258 void RBBINode::findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status) { in findNodes() 287 void RBBINode::printNode() { in printNode() [all …]
|
H A D | rbbitblb.cpp | 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() 211 if (n->fType == RBBINode::lookAhead || n->fType == RBBINode::tag) { in calcNullable() 231 else if (n->fType == RBBINode::opStar || n->fType == RBBINode::opQuestion) { in calcNullable() 432 RBBINode *node = static_cast<RBBINode *>(ruleRootNodes.elementAt(i)); in calcChainedFollowPos() 445 RBBINode *tNode = (RBBINode *)leafNodes.elementAt(endNodeIx); in calcChainedFollowPos() 540 RBBINode *startNode; in bofFixup() 818 RBBINode *tagNode; in flagTaggedStates() [all …]
|
/dports/textproc/R-cran-stringi/stringi/src/icu55/common/ |
H A 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() 151 n = new RBBINode(*this); in cloneTree() 187 RBBINode *RBBINode::flattenVariables() { in flattenVariables() 214 void RBBINode::flattenSets() { in flattenSets() 252 void RBBINode::findNodes(UVector *dest, RBBINode::NodeType kind, UErrorCode &status) { in findNodes() [all …]
|