Home
last modified time | relevance | path

Searched refs:currentNode (Results 1 – 25 of 1491) sorted by relevance

12345678910>>...60

/dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/constraints/knapsack/
H A DTree.java512 currentNode = currentNode.parent; in computeReplacableWeight()
578 currentNode = currentNode.rightNeighbor; in computeReplacableWeight()
650 currentNode = currentNode.parent; in findNextLeafAtLeastOfWeight()
663 currentNode = currentNode.left; in findNextLeafAtLeastOfWeight()
665 currentNode = currentNode.right; in findNextLeafAtLeastOfWeight()
750 currentNode = currentNode.parent; in computeIntrusionWeight()
775 currentNode = currentNode.leftNeighbor; in computeIntrusionWeight()
811 currentNode = currentNode.leftNeighbor; in computeIntrusionWeight()
873 currentNode = currentNode.parent; in findPreviousLeafAtLeastOfWeight()
886 currentNode = currentNode.right; in findPreviousLeafAtLeastOfWeight()
[all …]
/dports/textproc/p5-XML-DOM-Lite/XML-DOM-Lite-0.16/lib/XML/DOM/Lite/
H A DNodeIterator.pm21 $self->{currentNode} = $root;
35 $self->{currentNode} = $self->{currentNode}->childNodes->[0];
37 $self->{currentNode} = $self->{currentNode}->nextSibling;
57 return $self->{currentNode};
61 $self->{currentNode} = $self->{currentNode}->nextSibling;
89 …$self->{currentNode} = $self->{currentNode}->childNodes->[$self->{currentNode}->childNodes->length…
94 … } elsif ($self->{currentNode}->parentNode and $self->{currentNode}->parentNode != $self->{root}) {
95 $self->{currentNode} = $self->{currentNode}->parentNode;
108 return $self->{currentNode};
112 $self->{currentNode} = $self->{currentNode}->previousSibling;
[all …]
/dports/net-im/matterbridge/matterbridge-1.22.3/vendor/github.com/labstack/echo/v4/
H A Drouter.go135 if currentNode == nil {
163 …currentNode.isLeaf = currentNode.staticChildren == nil && currentNode.paramChild == nil && current…
167 currentNode.kind,
169 currentNode,
172 currentNode.ppath,
173 currentNode.pnames,
190 currentNode.label = currentNode.prefix[0]
191 currentNode.prefix = currentNode.prefix[:lcpLen]
217 …currentNode.isLeaf = currentNode.staticChildren == nil && currentNode.paramChild == nil && current…
223 currentNode = c
[all …]
/dports/games/0ad/0ad-0.0.23b-alpha/libraries/source/fcollada/src/FCollada/FMath/
H A DFMTree.h203 currentNode = currentNode->parent;
210 currentNode = currentNode->right;
213 while (currentNode->left != NULL) currentNode = currentNode->left;
233 currentNode = currentNode->parent;
240 currentNode = currentNode->left;
243 while (currentNode->right != NULL) currentNode = currentNode->right;
304 currentNode = currentNode->parent;
311 currentNode = currentNode->right;
314 while (currentNode->left != NULL) currentNode = currentNode->left;
341 currentNode = currentNode->left;
[all …]
/dports/games/0ad/0ad-0.0.23b-alpha/libraries/source/fcollada/include/FMath/
H A DFMTree.h203 currentNode = currentNode->parent;
210 currentNode = currentNode->right;
213 while (currentNode->left != NULL) currentNode = currentNode->left;
233 currentNode = currentNode->parent;
240 currentNode = currentNode->left;
243 while (currentNode->right != NULL) currentNode = currentNode->right;
304 currentNode = currentNode->parent;
311 currentNode = currentNode->right;
314 while (currentNode->left != NULL) currentNode = currentNode->left;
341 currentNode = currentNode->left;
[all …]
/dports/graphics/dcmtk/dcmtk-DCMTK-3.6.6/dcmdata/libsrc/
H A Ddclist.cc57 currentNode(NULL), in DcmList()
157 currentNode = node; in insert()
171 currentNode = node; in insert()
194 tempnode = currentNode; in remove()
199 currentNode->prevNode->nextNode = currentNode->nextNode; in remove()
204 currentNode->nextNode->prevNode = currentNode->prevNode; in remove()
206 currentNode = currentNode->nextNode; in remove()
239 currentNode = currentNode->prevNode; in seek()
243 currentNode = currentNode->nextNode; in seek()
272 currentNode = NULL; in seek_to()
[all …]
/dports/games/nextgo/NeXTGo-3.0/
H A Dsmartgotree.c122 tnode = currentNode; in forwardOneNode()
210 tnode = currentNode; in findLast()
233 tnode = currentNode; in findLast0()
253 tnode = currentNode; in forwardOneVariant()
274 tnode = currentNode; in backOneVariant()
298 r = currentNode; in clearNodeFlags()
326 tnode = currentNode; in evaluateSteps()
397 tnode = currentNode; in stepForward()
425 tnode = currentNode; in stepBackward()
448 tnode = currentNode; in jumpForward()
[all …]
/dports/misc/sword/sword-1.8.1/src/keys/
H A Dtreekeyidx.cpp150 error = getTreeNodeFromIdxOffset(currentNode.parent, &currentNode); in parent()
160 error = getTreeNodeFromIdxOffset(currentNode.firstChild, &currentNode); in firstChild()
170 error = getTreeNodeFromIdxOffset(currentNode.next, &currentNode); in nextSibling()
455 currentNode.offset = ikey.currentNode.offset; in copyFrom()
456 currentNode.parent = ikey.currentNode.parent; in copyFrom()
457 currentNode.next = ikey.currentNode.next; in copyFrom()
458 currentNode.firstChild = ikey.currentNode.firstChild; in copyFrom()
459 stdstr(&(currentNode.name), ikey.currentNode.name); in copyFrom()
460 currentNode.dsize = ikey.currentNode.dsize; in copyFrom()
465 currentNode.userData = new char [ currentNode.dsize ]; in copyFrom()
[all …]
/dports/multimedia/assimp/assimp-5.1.3/code/AssetLib/Collada/
H A DColladaParser.cpp623 XmlNode currentNode; in ReadController() local
661 …for (XmlNode currentChildNode = node.first_child(); currentNode; currentNode = currentNode.next_si… in ReadController()
926 XmlNode currentNode; in ReadLight() local
990 XmlNode currentNode; in ReadCamera() local
1047 XmlNode currentNode; in ReadEffectProfileCommon() local
1142 XmlNode currentNode; in ReadSamplerProperties() local
1204 XmlNode currentNode; in ReadEffectColor() local
1267 XmlNode currentNode; in ReadEffectParam() local
1353 XmlNode currentNode; in ReadMesh() local
1378 XmlNode currentNode; in ReadSource() local
[all …]
/dports/sysutils/istio/istio-1.6.7/vendor/github.com/antlr/antlr4/runtime/Java/src/org/antlr/v4/runtime/tree/
H A DIterativeParseTreeWalker.java27 ParseTree currentNode = t; in walk() local
30 while (currentNode != null) { in walk()
33 if (currentNode instanceof ErrorNode) { in walk()
45 if (currentNode.getChildCount() > 0) { in walk()
46 nodeStack.push(currentNode); in walk()
49 currentNode = currentNode.getChild(0); in walk()
57 if (currentNode instanceof RuleNode) { in walk()
63 currentNode = null; in walk()
70 if (currentNode != null) { in walk()
75 currentNode = nodeStack.pop(); in walk()
[all …]
/dports/math/jts/jts-jts-1.18.1/modules/core/src/main/java/org/locationtech/jts/index/kdtree/
H A DKdTree.java238 KdNode currentNode = root; in insertExact() local
253 currentNode.increment(); in insertExact()
254 return currentNode; in insertExact()
262 leafNode = currentNode; in insertExact()
265 currentNode = currentNode.getLeft(); in insertExact()
268 currentNode = currentNode.getRight(); in insertExact()
287 if (currentNode == null)
320 if (currentNode == null)
323 return currentNode;
406 if (currentNode == null)
[all …]
/dports/games/fs2open/fs2open.github.com-release_21_4_1/lib/antlr4-cpp-runtime/runtime/src/tree/
H A DIterativeParseTreeWalker.cpp21 ParseTree *currentNode = t; in walk() local
24 while (currentNode != nullptr) { in walk()
26 if (antlrcpp::is<ErrorNode *>(currentNode)) { in walk()
31 enterRule(listener, currentNode); in walk()
35 if (!currentNode->children.empty()) { in walk()
36 nodeStack.push_back(currentNode); in walk()
39 currentNode = currentNode->children[0]; in walk()
47 exitRule(listener, currentNode); in walk()
52 currentNode = nullptr; in walk()
64 currentNode = nodeStack.back(); in walk()
[all …]
/dports/sysutils/istio/istio-1.6.7/vendor/github.com/antlr/antlr4/runtime/Cpp/runtime/src/tree/
H A DIterativeParseTreeWalker.cpp21 ParseTree *currentNode = t; in walk() local
24 while (currentNode != nullptr) { in walk()
26 if (antlrcpp::is<ErrorNode *>(currentNode)) { in walk()
31 enterRule(listener, currentNode); in walk()
35 if (!currentNode->children.empty()) { in walk()
36 nodeStack.push_back(currentNode); in walk()
39 currentNode = currentNode->children[0]; in walk()
47 exitRule(listener, currentNode); in walk()
52 currentNode = nullptr; in walk()
64 currentNode = nodeStack.back(); in walk()
[all …]
/dports/devel/libantlr4/libantlr4-4.9.3/runtime/src/tree/
H A DIterativeParseTreeWalker.cpp21 ParseTree *currentNode = t; in walk() local
24 while (currentNode != nullptr) { in walk()
26 if (antlrcpp::is<ErrorNode *>(currentNode)) { in walk()
31 enterRule(listener, currentNode); in walk()
35 if (!currentNode->children.empty()) { in walk()
36 nodeStack.push_back(currentNode); in walk()
39 currentNode = currentNode->children[0]; in walk()
47 exitRule(listener, currentNode); in walk()
52 currentNode = nullptr; in walk()
64 currentNode = nodeStack.back(); in walk()
[all …]
/dports/www/node10/node-v10.24.1/deps/v8/third_party/antlr4/runtime/Cpp/runtime/src/tree/
H A DIterativeParseTreeWalker.cpp21 ParseTree* currentNode = t; in walk() local
24 while (currentNode != nullptr) { in walk()
26 if (antlrcpp::is<ErrorNode*>(currentNode)) { in walk()
31 enterRule(listener, currentNode); in walk()
35 if (!currentNode->children.empty()) { in walk()
36 nodeStack.push_back(currentNode); in walk()
39 currentNode = currentNode->children[0]; in walk()
47 exitRule(listener, currentNode); in walk()
52 currentNode = nullptr; in walk()
64 currentNode = nodeStack.back(); in walk()
[all …]
/dports/games/libretro-play/Play--3cd0a367b5e24c061a6310c68c9fa7f6b531ebd4/deps/Framework/src/xml/
H A DWriter.cpp29 if(currentNode->GetChildCount() == 1) in WriteNode()
36 if(currentNode->GetChildCount() == 0) in WriteNode()
38 if(currentNode->IsTag()) in WriteNode()
42 DumpString(currentNode->GetText()); in WriteNode()
43 DumpAttributes(currentNode); in WriteNode()
49 if(currentNode->GetChildCount() == 1) in WriteNode()
56 DumpString(currentNode->GetText()); in WriteNode()
57 DumpAttributes(currentNode); in WriteNode()
72 DumpString(currentNode->GetText()); in WriteNode()
73 DumpAttributes(currentNode); in WriteNode()
[all …]
/dports/lang/mono/mono-5.10.1.57/mcs/class/System.ServiceModel/Mono.Xml.XPath/
H A DDTMXPathNavigator2.cs61 currentNode = org.currentNode; in SeekableDTMXPathNavigator2()
75 currentNode = pos;
205 int currentNode; field in Mono.Xml.XPath.SeekableDTMXPathNavigator2
382 if (currentNode > another.currentNode) in ComparePosition()
384 else if (currentNode < another.currentNode) in ComparePosition()
458 if (another.currentNode == currentNode) in IsDescendant()
481 if (this.currentNode != another.currentNode || in IsSamePosition()
500 this.currentNode = another.currentNode; in MoveTo()
532 currentNode = cur; in MoveToFirst()
561 currentNode = first; in MoveToFirstChild()
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Collections/tests/Generic/LinkedList/
H A DLinkedList.Generic.Tests.cs79 while (currentNode != null) in VerifyState()
86 currentNode = currentNode.Next; in VerifyState()
96 while (currentNode != null) in VerifyState()
101 nextNode = currentNode; in VerifyState()
102 currentNode = currentNode.Previous; in VerifyState()
329 currentNode = currentNode.Next; in VerifyFindLastDuplicates()
358 currentNode = currentNode.Next; in VerifyFindDuplicates()
380 currentNode = null; in VerifyFindLast()
389 currentNode = null; in VerifyFindLast()
403 currentNode = null; in VerifyFind()
[all …]
/dports/converters/wkhtmltopdf/qt-5db36ec/src/3rdparty/webkit/Source/JavaScriptCore/profiler/
H A DProfile.cpp54 ProfileNode* currentNode = m_head->firstChild(); in forEach() local
56 currentNode = nextNode; in forEach()
58 if (!currentNode) in forEach()
59 currentNode = m_head.get(); in forEach()
62 while (currentNode && currentNode != endNode) { in forEach()
63 (currentNode->*function)(); in forEach()
64 currentNode = currentNode->traverseNextNodePostOrder(); in forEach()
75 …for (ProfileNode* currentNode = m_head.get(); currentNode; currentNode = currentNode->traverseNext… in focus() local
76 processChildren = currentNode->focus(callIdentifier); in focus()
89 …for (ProfileNode* currentNode = m_head.get(); currentNode; currentNode = currentNode->traverseNext… in exclude() local
[all …]
/dports/converters/wkhtmltopdf/qt-5db36ec/src/3rdparty/javascriptcore/JavaScriptCore/profiler/
H A DProfile.cpp54 ProfileNode* currentNode = m_head->firstChild(); in forEach() local
56 currentNode = nextNode; in forEach()
58 if (!currentNode) in forEach()
59 currentNode = m_head.get(); in forEach()
62 while (currentNode && currentNode != endNode) { in forEach()
63 (currentNode->*function)(); in forEach()
64 currentNode = currentNode->traverseNextNodePostOrder(); in forEach()
75 …for (ProfileNode* currentNode = m_head.get(); currentNode; currentNode = currentNode->traverseNext… in focus() local
76 processChildren = currentNode->focus(callIdentifier); in focus()
89 …for (ProfileNode* currentNode = m_head.get(); currentNode; currentNode = currentNode->traverseNext… in exclude() local
[all …]
/dports/devel/qt5-scripttools/kde-qtscript-5.15.2p4/src/3rdparty/javascriptcore/JavaScriptCore/profiler/
H A DProfile.cpp54 ProfileNode* currentNode = m_head->firstChild(); in forEach() local
56 currentNode = nextNode; in forEach()
58 if (!currentNode) in forEach()
59 currentNode = m_head.get(); in forEach()
62 while (currentNode && currentNode != endNode) { in forEach()
63 (currentNode->*function)(); in forEach()
64 currentNode = currentNode->traverseNextNodePostOrder(); in forEach()
75 …for (ProfileNode* currentNode = m_head.get(); currentNode; currentNode = currentNode->traverseNext… in focus() local
76 processChildren = currentNode->focus(callIdentifier); in focus()
89 …for (ProfileNode* currentNode = m_head.get(); currentNode; currentNode = currentNode->traverseNext… in exclude() local
[all …]
/dports/devel/qt5-script/kde-qtscript-5.15.2p4/src/3rdparty/javascriptcore/JavaScriptCore/profiler/
H A DProfile.cpp54 ProfileNode* currentNode = m_head->firstChild(); in forEach() local
56 currentNode = nextNode; in forEach()
58 if (!currentNode) in forEach()
59 currentNode = m_head.get(); in forEach()
62 while (currentNode && currentNode != endNode) { in forEach()
63 (currentNode->*function)(); in forEach()
64 currentNode = currentNode->traverseNextNodePostOrder(); in forEach()
75 …for (ProfileNode* currentNode = m_head.get(); currentNode; currentNode = currentNode->traverseNext… in focus() local
76 processChildren = currentNode->focus(callIdentifier); in focus()
89 …for (ProfileNode* currentNode = m_head.get(); currentNode; currentNode = currentNode->traverseNext… in exclude() local
[all …]
/dports/devel/raknet/raknet-3.9.2_10,1/Source/
H A DDS_HuffmanEncodingTree.cpp143 currentNode = currentNode->parent; in GenerateFromFrequencyTable()
203 currentNode = root; in DecodeArray()
210 currentNode = currentNode->left; in DecodeArray()
212 currentNode = currentNode->right; in DecodeArray()
214 if ( currentNode->left == 0 && currentNode->right == 0 ) // Leaf in DecodeArray()
222 currentNode = root; in DecodeArray()
239 currentNode = root; in DecodeArray()
245 currentNode = currentNode->left; in DecodeArray()
247 currentNode = currentNode->right; in DecodeArray()
249 if ( currentNode->left == 0 && currentNode->right == 0 ) // Leaf in DecodeArray()
[all …]
/dports/lang/mono/mono-5.10.1.57/mcs/class/referencesource/System.Data/System/NewXml/
H A DTreeIterator.cs15 private XmlNode currentNode; field in System.Xml.TreeIterator
20 this.currentNode = nodeTop; in TreeIterator()
24 currentNode = nodeTop; in Reset()
29 return currentNode;
37 nextNode = currentNode.FirstChild; in Next()
41 currentNode = nextNode; in Next()
49 if ( currentNode == nodeTop ) { in NextRight()
50 currentNode = null; in NextRight()
57 currentNode = nextNode; in NextRight()
62 nextNode = currentNode; in NextRight()
[all …]
/dports/graphics/geos/geos-3.9.1/src/index/kdtree/
H A DKdTree.cpp104 KdNode* currentNode = root; in insertExact() local
114 while (currentNode != nullptr) { in insertExact()
121 currentNode->increment(); in insertExact()
122 return currentNode; in insertExact()
130 leafNode = currentNode; in insertExact()
132 currentNode = currentNode->getLeft(); in insertExact()
134 currentNode = currentNode->getRight(); in insertExact()
155 if (currentNode == nullptr) in queryNode()
179 visitor.visit(currentNode); in queryNode()
190 if (currentNode == nullptr) in queryNodePoint()
[all …]

12345678910>>...60