/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/utils/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/ |
H A D | Graph.java | 122 private void markReachable(Node<N, E> startingNode) { in markReachable() argument 124 arr.add(startingNode); in markReachable() 137 public void traverseBFS(Node<N, E> startingNode, BFSTraversalVisitor tv, boolean longestPath) { in traverseBFS() argument 140 markReachable(startingNode); in traverseBFS() 149 queue.add(startingNode); in traverseBFS() 150 startingNode.setVisited(true); in traverseBFS() 152 Node<N, E> lastOfLayer = startingNode; in traverseBFS()
|
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/utils/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/ |
H A D | Graph.java | 122 private void markReachable(Node<N, E> startingNode) { in markReachable() argument 124 arr.add(startingNode); in markReachable() 137 public void traverseBFS(Node<N, E> startingNode, BFSTraversalVisitor tv, boolean longestPath) { in traverseBFS() argument 140 markReachable(startingNode); in traverseBFS() 149 queue.add(startingNode); in traverseBFS() 150 startingNode.setVisited(true); in traverseBFS() 152 Node<N, E> lastOfLayer = startingNode; in traverseBFS()
|
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/utils/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/ |
H A D | Graph.java | 122 private void markReachable(Node<N, E> startingNode) { in markReachable() argument 124 arr.add(startingNode); in markReachable() 137 public void traverseBFS(Node<N, E> startingNode, BFSTraversalVisitor tv, boolean longestPath) { in traverseBFS() argument 140 markReachable(startingNode); in traverseBFS() 149 queue.add(startingNode); in traverseBFS() 150 startingNode.setVisited(true); in traverseBFS() 152 Node<N, E> lastOfLayer = startingNode; in traverseBFS()
|
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/utils/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/ |
H A D | Graph.java | 122 private void markReachable(Node<N, E> startingNode) { in markReachable() argument 124 arr.add(startingNode); in markReachable() 137 public void traverseBFS(Node<N, E> startingNode, BFSTraversalVisitor tv, boolean longestPath) { in traverseBFS() argument 140 markReachable(startingNode); in traverseBFS() 149 queue.add(startingNode); in traverseBFS() 150 startingNode.setVisited(true); in traverseBFS() 152 Node<N, E> lastOfLayer = startingNode; in traverseBFS()
|
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/utils/IdealGraphVisualizer/HierarchicalLayout/src/main/java/com/sun/hotspot/igv/hierarchicallayout/ |
H A D | Graph.java | 122 private void markReachable(Node<N, E> startingNode) { in markReachable() argument 124 arr.add(startingNode); in markReachable() 137 public void traverseBFS(Node<N, E> startingNode, BFSTraversalVisitor tv, boolean longestPath) { in traverseBFS() argument 140 markReachable(startingNode); in traverseBFS() 149 queue.add(startingNode); in traverseBFS() 150 startingNode.setVisited(true); in traverseBFS() 152 Node<N, E> lastOfLayer = startingNode; in traverseBFS()
|
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/utils/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/ |
H A D | Graph.java | 122 private void markReachable(Node<N, E> startingNode) { in markReachable() argument 124 arr.add(startingNode); in markReachable() 137 public void traverseBFS(Node<N, E> startingNode, BFSTraversalVisitor tv, boolean longestPath) { in traverseBFS() argument 140 markReachable(startingNode); in traverseBFS() 149 queue.add(startingNode); in traverseBFS() 150 startingNode.setVisited(true); in traverseBFS() 152 Node<N, E> lastOfLayer = startingNode; in traverseBFS()
|
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/utils/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/ |
H A D | Graph.java | 122 private void markReachable(Node<N, E> startingNode) { in markReachable() argument 124 arr.add(startingNode); in markReachable() 137 public void traverseBFS(Node<N, E> startingNode, BFSTraversalVisitor tv, boolean longestPath) { in traverseBFS() argument 140 markReachable(startingNode); in traverseBFS() 149 queue.add(startingNode); in traverseBFS() 150 startingNode.setVisited(true); in traverseBFS() 152 Node<N, E> lastOfLayer = startingNode; in traverseBFS()
|
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/utils/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/ |
H A D | Graph.java | 122 private void markReachable(Node<N, E> startingNode) { in markReachable() argument 124 arr.add(startingNode); in markReachable() 137 public void traverseBFS(Node<N, E> startingNode, BFSTraversalVisitor tv, boolean longestPath) { in traverseBFS() argument 140 markReachable(startingNode); in traverseBFS() 149 queue.add(startingNode); in traverseBFS() 150 startingNode.setVisited(true); in traverseBFS() 152 Node<N, E> lastOfLayer = startingNode; in traverseBFS()
|
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/vic/lib/apiservers/engine/backends/ |
H A D | archive.go | 525 var startingNode *ArchiveReader 534 startingNode = item.(*ArchiveReader) 574 if startingNode != nil { 577 if node.mountPoint.Destination == startingNode.mountPoint.Destination { 585 nodes = append([]*ArchiveReader{startingNode}, nodes...) 588 startingNode = nodes[0] 604 startingNode = nil 613 if startingNode != nil { 618 nodes = append([]*ArchiveReader{startingNode}, nodes...) 623 err = rm.buildFilterSpec(containerSourcePath, nodes, startingNode) [all …]
|
/dports/irc/smuxi/smuxi-1.1/lib/db4o-net/Db4objects.Db4o/Db4objects.Db4o/Foundation/ |
H A D | Tree.cs | 552 public static void Traverse(Tree tree, Tree startingNode, ICancellableVisitor4 visitor in Traverse() argument 559 tree.Traverse(startingNode, visitor); in Traverse() 562 private bool Traverse(Tree startingNode, ICancellableVisitor4 visitor) in Traverse() argument 564 if (startingNode != null) in Traverse() 566 int cmp = Compare(startingNode); in Traverse() 571 return _subsequent.Traverse(startingNode, visitor); in Traverse() 581 if (!_preceding.Traverse(startingNode, visitor)) in Traverse()
|
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/ |
H A D | Graph.java | 128 private void markReachable(Node<N, E> startingNode) { in markReachable() argument 130 arr.add(startingNode); in markReachable() 143 public void traverseBFS(Node<N, E> startingNode, BFSTraversalVisitor tv, boolean longestPath) { in traverseBFS() argument 146 markReachable(startingNode); in traverseBFS() 155 queue.add(startingNode); in traverseBFS() 156 startingNode.setVisited(true); in traverseBFS() 158 Node<N, E> lastOfLayer = startingNode; in traverseBFS()
|
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/ |
H A D | Graph.java | 128 private void markReachable(Node<N, E> startingNode) { in markReachable() argument 130 arr.add(startingNode); in markReachable() 143 public void traverseBFS(Node<N, E> startingNode, BFSTraversalVisitor tv, boolean longestPath) { in traverseBFS() argument 146 markReachable(startingNode); in traverseBFS() 155 queue.add(startingNode); in traverseBFS() 156 startingNode.setVisited(true); in traverseBFS() 158 Node<N, E> lastOfLayer = startingNode; in traverseBFS()
|
/dports/databases/percona57-server/percona-server-5.7.36-39/storage/ndb/src/kernel/blocks/backup/ |
H A D | BackupProxy.cpp | 185 Uint32 startingNode = signal->theData[1]; in sendSUM_EVENT_REP() local 186 if (startingNode != 0) in sendSUM_EVENT_REP() 189 ss.m_report[1] == startingNode); in sendSUM_EVENT_REP() 190 ss.m_report[1] = startingNode; in sendSUM_EVENT_REP()
|
/dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/ndb/src/kernel/blocks/backup/ |
H A D | BackupProxy.cpp | 185 Uint32 startingNode = signal->theData[1]; in sendSUM_EVENT_REP() local 186 if (startingNode != 0) in sendSUM_EVENT_REP() 189 ss.m_report[1] == startingNode); in sendSUM_EVENT_REP() 190 ss.m_report[1] = startingNode; in sendSUM_EVENT_REP()
|
/dports/databases/percona57-client/percona-server-5.7.36-39/storage/ndb/src/kernel/blocks/backup/ |
H A D | BackupProxy.cpp | 185 Uint32 startingNode = signal->theData[1]; in sendSUM_EVENT_REP() local 186 if (startingNode != 0) in sendSUM_EVENT_REP() 189 ss.m_report[1] == startingNode); in sendSUM_EVENT_REP() 190 ss.m_report[1] = startingNode; in sendSUM_EVENT_REP()
|
/dports/databases/mysqlwsrep57-server/mysql-wsrep-wsrep_5.7.35-25.27/storage/ndb/src/kernel/blocks/backup/ |
H A D | BackupProxy.cpp | 185 Uint32 startingNode = signal->theData[1]; in sendSUM_EVENT_REP() local 186 if (startingNode != 0) in sendSUM_EVENT_REP() 189 ss.m_report[1] == startingNode); in sendSUM_EVENT_REP() 190 ss.m_report[1] = startingNode; in sendSUM_EVENT_REP()
|
/dports/databases/xtrabackup/percona-xtrabackup-2.4.21/storage/ndb/src/kernel/blocks/backup/ |
H A D | BackupProxy.cpp | 185 Uint32 startingNode = signal->theData[1]; in sendSUM_EVENT_REP() local 186 if (startingNode != 0) in sendSUM_EVENT_REP() 189 ss.m_report[1] == startingNode); in sendSUM_EVENT_REP() 190 ss.m_report[1] = startingNode; in sendSUM_EVENT_REP()
|
/dports/biology/velvet/velvet_1.2.10/contrib/MetaVelvet-1.2.01/Velvet-1.1.06/ |
H A D | readCoherentGraph.c | 122 boolean uniqueNodesConnect(Node * startingNode) in uniqueNodesConnect() argument 130 if (arcCount(startingNode) == 0) in uniqueNodesConnect() 133 if (getMarker(startingNode) == NULL_IDX) in uniqueNodesConnect() 139 for (startMarker = getMarker(startingNode); startMarker != NULL_IDX; in uniqueNodesConnect() 198 setUniqueness(startingNode, false); in uniqueNodesConnect() 202 if (destination == NULL || destination == startingNode in uniqueNodesConnect() 203 || destination == getTwinNode(startingNode)) { in uniqueNodesConnect() 256 && newList->node != getTwinNode(startingNode)) in uniqueNodesConnect()
|
/dports/biology/velvet/velvet_1.2.10/src/ |
H A D | readCoherentGraph.c | 122 static boolean uniqueNodesConnect(Node * startingNode) in uniqueNodesConnect() argument 130 if (arcCount(startingNode) == 0) in uniqueNodesConnect() 133 if (getMarker(startingNode) == NULL_IDX) in uniqueNodesConnect() 139 for (startMarker = getMarker(startingNode); startMarker != NULL_IDX; in uniqueNodesConnect() 198 setUniqueness(startingNode, false); in uniqueNodesConnect() 202 if (destination == NULL || destination == startingNode in uniqueNodesConnect() 203 || destination == getTwinNode(startingNode)) { in uniqueNodesConnect() 256 && newList->node != getTwinNode(startingNode)) in uniqueNodesConnect()
|
/dports/math/psurface/psurface-2.0.0-13-gb5b6825/ |
H A D | PSurfaceSmoother.cpp | 392 void PSurfaceSmoother<ctype>::moveSubGraph(int startingNode, DomainPolygon& from, int centerNode) in moveSubGraph() argument 395 if (startingNode==centerNode) in moveSubGraph() 398 from.nodes[startingNode].location = Node::IN_TRIANGLE; in moveSubGraph() 400 for (int i=0; i<from.nodes[startingNode].degree(); i++) in moveSubGraph() 401 if (from.nodes[from.nodes[startingNode].neighbors(i)].location!=Node::IN_TRIANGLE) in moveSubGraph() 402 moveSubGraph(from.nodes[startingNode].neighbors(i), from, centerNode); in moveSubGraph()
|
/dports/biology/velvet/velvet_1.2.10/contrib/MetaVelvet-v0.3.1/src/ |
H A D | readCoherentGraph.c | 164 static boolean uniqueNodesConnect(Node * startingNode) in uniqueNodesConnect() argument 176 if (arcCount(startingNode) == 0) in uniqueNodesConnect() 179 if (getMarker(startingNode) == NULL) in uniqueNodesConnect() 185 for (startMarker = getMarker(startingNode); startMarker != NULL; in uniqueNodesConnect() 244 setUniqueness(startingNode, false); in uniqueNodesConnect() 248 if (destination == NULL || destination == startingNode in uniqueNodesConnect() 249 || destination == getTwinNode(startingNode)) { in uniqueNodesConnect() 256 outputStartingNodeID = getNodeID(startingNode); in uniqueNodesConnect() 309 && newList->node != getTwinNode(startingNode)) in uniqueNodesConnect()
|
/dports/math/vtk8/VTK-8.2.0/Common/DataModel/ |
H A D | vtkOctreePointLocator.cxx | 848 vtkOctreePointLocatorNode* startingNode = nullptr; in FindClosestNPoints() local 875 startingNode = prevNode; in FindClosestNPoints() 879 startingNode = node; in FindClosestNPoints() 902 startingNode = prevNode; in FindClosestNPoints() 906 startingNode = node; in FindClosestNPoints() 912 int regionId = startingNode->GetID(); in FindClosestNPoints() 913 int numPoints = startingNode->GetNumberOfPoints(); in FindClosestNPoints() 914 int where = startingNode->GetMinID(); in FindClosestNPoints() 917 vtkOctreePointLocatorNode* parentOfNext = startingNode->GetChild(0); in FindClosestNPoints() 949 if(node == startingNode) in FindClosestNPoints()
|
/dports/math/vtk9/VTK-9.1.0/Common/DataModel/ |
H A D | vtkOctreePointLocator.cxx | 819 vtkOctreePointLocatorNode* startingNode = nullptr; in FindClosestNPoints() local 844 startingNode = prevNode; in FindClosestNPoints() 848 startingNode = node; in FindClosestNPoints() 871 startingNode = prevNode; in FindClosestNPoints() 875 startingNode = node; in FindClosestNPoints() 881 int regionId = startingNode->GetID(); in FindClosestNPoints() 882 int numPoints = startingNode->GetNumberOfPoints(); in FindClosestNPoints() 883 int where = startingNode->GetMinID(); in FindClosestNPoints() 886 vtkOctreePointLocatorNode* parentOfNext = startingNode->GetChild(0); in FindClosestNPoints() 918 if (node == startingNode) in FindClosestNPoints()
|
/dports/math/vtk6/VTK-6.2.0/Common/DataModel/ |
H A D | vtkOctreePointLocator.cxx | 847 vtkOctreePointLocatorNode* startingNode = 0; in FindClosestNPoints() local 874 startingNode = prevNode; in FindClosestNPoints() 878 startingNode = node; in FindClosestNPoints() 901 startingNode = prevNode; in FindClosestNPoints() 905 startingNode = node; in FindClosestNPoints() 911 int regionId = startingNode->GetID(); in FindClosestNPoints() 912 int numPoints = startingNode->GetNumberOfPoints(); in FindClosestNPoints() 913 int where = startingNode->GetMinID(); in FindClosestNPoints() 916 vtkOctreePointLocatorNode* parentOfNext = startingNode->GetChild(0); in FindClosestNPoints() 948 if(node == startingNode) in FindClosestNPoints()
|
/dports/converters/wkhtmltopdf/qt-5db36ec/src/3rdparty/webkit/Source/WebCore/page/ |
H A D | EventHandler.h | 144 bool scrollOverflow(ScrollDirection, ScrollGranularity, Node* startingNode = 0); 145 bool scrollRecursively(ScrollDirection, ScrollGranularity, Node* startingNode = 0); 146 … bool logicalScrollRecursively(ScrollLogicalDirection, ScrollGranularity, Node* startingNode = 0); 283 bool logicalScrollOverflow(ScrollLogicalDirection, ScrollGranularity, Node* startingNode = 0);
|