Home
last modified time | relevance | path

Searched refs:nodeDepth (Results 1 – 25 of 47) sorted by relevance

12

/dports/databases/hbase/hbase-1.2.1/hbase-prefix-tree/src/main/java/org/apache/hadoop/hbase/codec/prefixtree/encode/tokenize/
H A DTokenizerNode.java83 protected int nodeDepth; field in TokenizerNode
140 public TokenizerNode(Tokenizer builder, TokenizerNode parent, int nodeDepth, in TokenizerNode() argument
156 this.nodeDepth = nodeDepth; in reconstruct()
157 builder.submitMaxNodeDepthCandidate(nodeDepth); in reconstruct()
169 nodeDepth = 0; in reset()
220 int childNodeDepth = nodeDepth + 1; in addSorted()
252 int childNodeDepth = nodeDepth; in split()
278 ++nodeDepth; in incrementNodeDepthRecursively()
279 builder.submitMaxNodeDepthCandidate(nodeDepth); in incrementNodeDepthRecursively()
443 sb.append(Strings.padFront(nodeDepth + "", ' ', 3)); in getPaddedTokenAndOccurrenceString()
[all …]
H A DTokenizer.java110 protected TokenizerNode addNode(TokenizerNode parent, int nodeDepth, int tokenStartOffset, in addNode() argument
116 node = new TokenizerNode(this, parent, nodeDepth, tokenStartOffset, tokenOffset, in addNode()
122 node.reconstruct(this, parent, nodeDepth, tokenStartOffset, tokenOffset, inputTokenLength); in addNode()
138 protected void submitMaxNodeDepthCandidate(int nodeDepth) { in submitMaxNodeDepthCandidate() argument
139 if (nodeDepth > treeDepth) { in submitMaxNodeDepthCandidate()
140 treeDepth = nodeDepth; in submitMaxNodeDepthCandidate()
/dports/net/norm/norm-1.5r6/protolib/src/common/
H A DprotoXml.cpp96 bool ProtoXml::IterFilterBase::UpdateCurrentPath(int nodeDepth, const char* nodeName) in UpdateCurrentPath() argument
98 if (nodeDepth == path_depth) in UpdateCurrentPath()
114 else if (nodeDepth > path_depth) in UpdateCurrentPath()
116 ASSERT(1 == (nodeDepth - path_depth)); in UpdateCurrentPath()
135 for (int i = 0; i <= nodeDepth; i++) in UpdateCurrentPath()
150 path_depth = nodeDepth; in UpdateCurrentPath()
237 int nodeDepth = xmlTextReaderDepth(reader_ptr); in GetNext() local
238 if (nodeDepth < 0) in GetNext()
244 if (!IterFilterBase::UpdateCurrentPath(nodeDepth, nodeName)) in GetNext()
/dports/biology/mrbayes/MrBayes-3.2.7/src/
H A Dbest.c106 if ((*((TreeNode **)(x)))->nodeDepth < (*((TreeNode**)(y)))->nodeDepth) in CompareNodes()
108 else if ((*((TreeNode **)(x)))->nodeDepth > (*((TreeNode**)(y)))->nodeDepth) in CompareNodes()
123 if ((*((TreeNode **)(x)))->nodeDepth < (*((TreeNode**)(y)))->nodeDepth) in CompareNodesByX()
701 if (geneTreeNode->nodeDepth < speciesTreeNode->nodeDepth) { in LineagesIn()
897 timeInterval = q->nodeDepth - p->nodeDepth; in LnPriorProbGeneTree()
900 timeInterval = q->nodeDepth - r->nodeDepth; in LnPriorProbGeneTree()
910 timeInterval = p->anc->nodeDepth - p->nodeDepth; in LnPriorProbGeneTree()
914 timeInterval = p->anc->nodeDepth - q->nodeDepth; in LnPriorProbGeneTree()
1528 p->left->length = p->nodeDepth - p->left->nodeDepth; in Move_NodeSliderGeneTree()
1531 p->right->length = p->nodeDepth - p->right->nodeDepth; in Move_NodeSliderGeneTree()
[all …]
H A Dproposal.c1458 q->nodeDepth = p->nodeDepth; in Move_DelBranch()
1864 if (v->nodeDepth > a->nodeDepth) in Move_ExtFossilSPRClock()
2042 if (a->nodeDepth > v->nodeDepth) in Move_ExtFossilSPRClock()
2068 v->nodeDepth = u->nodeDepth; in Move_ExtFossilSPRClock()
3300 if (v->nodeDepth > a->nodeDepth) in Move_ExtSPRClock()
3478 if (a->nodeDepth > v->nodeDepth) in Move_ExtSPRClock()
3504 v->nodeDepth = u->nodeDepth; in Move_ExtSPRClock()
9563 if (v->nodeDepth > a->nodeDepth) in Move_ParsFossilSPRClock()
9702 if (p->nodeDepth > v->nodeDepth - minV || p->anc->nodeDepth < v->nodeDepth + minV) in Move_ParsFossilSPRClock()
9866 if (c->nodeDepth > v->nodeDepth) in Move_ParsFossilSPRClock()
[all …]
H A Dutils.c3458 p->nodeDepth = q->nodeDepth; in CopyTreeNodes()
4211 p->nodeDepth = p->left->nodeDepth; in InitCalibratedBrlens()
4213 p->nodeDepth = p->right->nodeDepth; in InitCalibratedBrlens()
4248 if (p->nodeDepth==0.0) p->nodeDepth = 1.0; in InitCalibratedBrlens()
4250 p->nodeDepth = p->age = 1.5 * p->nodeDepth; in InitCalibratedBrlens()
4536 p->nodeDepth = p->anc->nodeDepth + p->length; in IsCalibratedClockSatisfied()
4557 p->nodeDepth = maxHeight - p->nodeDepth; in IsCalibratedClockSatisfied()
4587 if (p->nodeDepth > q->nodeDepth) in IsCalibratedClockSatisfied()
6364 p->nodeDepth = p->anc->nodeDepth - p->length; in ResetRootHeight()
6571 q->nodeDepth = p->nodeDepth; in ResetBrlensFromTree()
[all …]
/dports/www/mediawiki135/mediawiki-1.35.5/includes/resourceloader/
H A DVueComponentParser.php300 private $nodeDepth = 0; variable in VueComponentParser::newFilteringDispatcher::AnonymousClass87ce9f8e0200
309 if ( $this->nodeDepth ) {
314 if ( $this->nodeDepth === 0 && $this->seenTag ) {
318 $this->nodeDepth++;
325 $this->nodeDepth--;
327 if ( $this->nodeDepth ) {
333 if ( $this->nodeDepth ) {
339 if ( $this->nodeDepth ) {
/dports/www/mediawiki136/mediawiki-1.36.3/includes/resourceloader/
H A DVueComponentParser.php300 private $nodeDepth = 0; variable in VueComponentParser::newFilteringDispatcher::AnonymousClass3b83b9ee0200
309 if ( $this->nodeDepth ) {
314 if ( $this->nodeDepth === 0 && $this->seenTag ) {
318 $this->nodeDepth++;
325 $this->nodeDepth--;
327 if ( $this->nodeDepth ) {
333 if ( $this->nodeDepth ) {
339 if ( $this->nodeDepth ) {
/dports/www/mediawiki137/mediawiki-1.37.1/includes/resourceloader/
H A DVueComponentParser.php304 private $nodeDepth = 0; variable in VueComponentParser::newFilteringDispatcher::AnonymousClassef38d44e0200
313 if ( $this->nodeDepth ) {
318 if ( $this->nodeDepth === 0 && $this->seenTag ) {
322 $this->nodeDepth++;
329 $this->nodeDepth--;
331 if ( $this->nodeDepth ) {
337 if ( $this->nodeDepth ) {
343 if ( $this->nodeDepth ) {
/dports/biology/hyphy/hyphy-2.5.33/res/TemplateBatchFiles/
H A DdistanceRMethodNPBootstrap.bf272 nodeDepth = 0;
326 nodeDepth = nodeDepth+1;
330 nodeDepth = nodeDepth+1;
345 treeNodes[m][1] = nodeDepth;
346 nodeDepth = nodeDepth-1;
362 while (nodeDepth >= 0)
365 treeNodes[m][1] = nodeDepth+n;
367 nodeDepth = nodeDepth-1;
H A DdistanceMethodNPBootstrap.bf346 nodeDepth = 0;
397 nodeDepth = nodeDepth+1;
401 nodeDepth = nodeDepth+1;
416 treeNodes[m][1] = nodeDepth;
417 nodeDepth = nodeDepth-1;
433 while (nodeDepth >= 0)
436 treeNodes[m][1] = nodeDepth+n;
438 nodeDepth = nodeDepth-1;
/dports/editors/calligra/calligra-3.2.1/libs/store/
H A DKoXmlReader.cpp760 unsigned nodeDepth; member in KoXmlNodeData
838 , nodeDepth(0) in KoXmlNodeData()
1013 if (nodeIndex == packedDoc->itemCount(nodeDepth) - 1) in loadChildren()
1014 childStop = packedDoc->itemCount(nodeDepth + 1); in loadChildren()
1069 dat->nodeDepth = nodeDepth + 1; in loadChildren()
1113 int nodeDepth = packedDoc->items[nodeIndex].depth; in loadChildren() local
1122 if (item.depth <= (unsigned)nodeDepth) in loadChildren()
1150 …textItem || instruction) ? (item.depth == (unsigned)nodeDepth) : (item.depth == (unsigned)nodeDep… in loadChildren()
1242 childStop = packedDoc->itemCount(nodeDepth + 1); in itemAsQDomNode()
1358 int nodeDepth = item.depth; in itemAsQDomNode() local
[all …]
/dports/editors/calligraplan/calligraplan-3.3.0/src/libs/store/
H A DKoXmlReader.cpp761 unsigned nodeDepth; member in KoXmlNodeData
839 , nodeDepth(0) in KoXmlNodeData()
1014 if (nodeIndex == packedDoc->itemCount(nodeDepth) - 1) in loadChildren()
1015 childStop = packedDoc->itemCount(nodeDepth + 1); in loadChildren()
1070 dat->nodeDepth = nodeDepth + 1; in loadChildren()
1114 int nodeDepth = packedDoc->items[nodeIndex].depth; in loadChildren() local
1123 if (item.depth <= (unsigned)nodeDepth) in loadChildren()
1151 …textItem || instruction) ? (item.depth == (unsigned)nodeDepth) : (item.depth == (unsigned)nodeDep… in loadChildren()
1243 childStop = packedDoc->itemCount(nodeDepth + 1); in itemAsQDomNode()
1359 int nodeDepth = item.depth; in itemAsQDomNode() local
[all …]
/dports/www/ilias/ILIAS-5.4.25/Services/Tree/classes/
H A Dclass.ilNestedSetTree.php533 $nodeDepth = $depth_cache[$a_endnode_id];
536 $nodeDepth = $this->getTree()->getDepth($a_endnode_id);
544 if (!$nodeDepth) {
546 } elseif ($nodeDepth == 1) {
551 } elseif ($nodeDepth == 2) {
560 } elseif ($nodeDepth == 3) {
573 } elseif ($nodeDepth < 32) {
585 for ($i = 1; $i < $nodeDepth - 2; $i++) {
612 for ($i = $nodeDepth - 4; $i >= 0; $i--) {
/dports/java/bouncycastle15/crypto-169/core/src/main/java/org/bouncycastle/crypto/digests/
H A DBlake2sDigest.java91 private int nodeDepth = 0; field in Blake2sDigest
157 this.nodeDepth = digest.nodeDepth; in Blake2sDigest()
234 nodeDepth = 0; in Blake2sDigest()
271 (nodeDepth << 16) | (innerHashLength << 24)); in init()
/dports/www/ilias6/ILIAS-6.14/Services/Tree/classes/
H A Dclass.ilNestedSetTree.php645 $nodeDepth = $depth_cache[$a_endnode_id];
648 $nodeDepth = $this->getTree()->getDepth($a_endnode_id);
656 if (!$nodeDepth) {
658 } elseif ($nodeDepth == 1) {
663 } elseif ($nodeDepth == 2) {
672 } elseif ($nodeDepth == 3) {
685 } elseif ($nodeDepth < 32) {
697 for ($i = 1; $i < $nodeDepth - 2; $i++) {
738 for ($i = $nodeDepth - 4; $i >= 0; $i--) {
/dports/lang/maude/maude-2.7.1/src/Utility/
H A DallSat.cc78 int nodeDepth = nodeStack.size(); in nextAssignment() local
79 for (int i = nodeDepth - 1; i >= 0; --i) in nextAssignment()
/dports/math/octomap/octomap-1.9.7/dynamicEDT3D/include/dynamicEDT3D/
H A DdynamicEDTOctomap.hxx106 int nodeDepth = it.getDepth(); in initializeOcTree() local
107 if( nodeDepth == treeDepth){ in initializeOcTree()
110 int cubeSize = 1 << (treeDepth - nodeDepth); in initializeOcTree()
/dports/net-p2p/qtum/qtum-mainnet-fastlane-v0.20.3/src/cryptopp/
H A Dblake2.h88 byte nodeDepth, innerLength, rfu[14];
123 byte nodeDepth, innerLength;
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/gpu/people/src/cuda/
H A Dmulti_tree.cu85 for(int nodeDepth = 0; nodeDepth < treeHeight; ++nodeDepth) in evaluateTree() local
/dports/devel/folly/folly-2021.12.27.00/folly/experimental/crypto/
H A DBlake2xb.h36 uint8_t nodeDepth; /* 17 */ member
/dports/www/seahub/seahub-8.0.7-server/media/assets/frontend/static/js/
H A DfileHistory.chunk.js.9f50a9302aba.map1 …nodeDepth","diff","Diff","ArrayDiff","diffElement","changeType","newItemData","diff_state","new_in…
H A DfileHistory.chunk.js.map1 …nodeDepth","diff","Diff","ArrayDiff","diffElement","changeType","newItemData","diff_state","new_in…
/dports/devel/eric6/eric6-21.11/eric/eric6/Plugins/CheckerPlugins/SyntaxChecker/pyflakes/
H A Dchecker.py876 nodeDepth = 0 variable in Checker
1404 print(' ' * self.nodeDepth + node.__class__.__name__)
1408 self.nodeDepth += 1
1409 node._pyflakes_depth = self.nodeDepth
1415 self.nodeDepth -= 1
1417 print(' ' * self.nodeDepth + 'end ' + node.__class__.__name__)
/dports/lang/spidermonkey78/firefox-78.9.0/third_party/python/pyflakes/pyflakes/
H A Dchecker.py826 nodeDepth = 0 variable in Checker
1337 print(' ' * self.nodeDepth + node.__class__.__name__)
1341 self.nodeDepth += 1
1342 node._pyflakes_depth = self.nodeDepth
1348 self.nodeDepth -= 1
1350 print(' ' * self.nodeDepth + 'end ' + node.__class__.__name__)

12