| /dports/graphics/digikam/digikam-7.4.0/core/libs/database/history/ |
| H A D | itemhistorygraphmodel.cpp | 624 …QList<HistoryGraph::Vertex> shortestPath = graph().shortestPath(showActionsFrom, v); // clazy:… in addCombinedItemCategory() local
628 for (int i = 1 ; i < shortestPath.size() ; ++i) in addCombinedItemCategory()
630 … HistoryEdgeProperties props = graph().properties(shortestPath.at(i), shortestPath.at(i-1)); in addCombinedItemCategory()
643 shortestPath.removeOne(showActionsFrom); in addCombinedItemCategory()
644 shortestPath.removeOne(v); in addCombinedItemCategory()
648 shortestPath.removeOne(addedVertex); in addCombinedItemCategory()
651 addItemSubgroup(item, shortestPath, i18nc("@title", "Intermediate Steps:"), true); in addCombinedItemCategory()
|
| /dports/graphics/opencollada/OpenCOLLADA-1.6.68/COLLADABaseUtils/include/Math/ |
| H A D | COLLADABUMathQuaternion.h | 147 const Quaternion& rkQ, bool shortestPath = false );
161 const Quaternion& rkQ, bool shortestPath = false );
165 const Quaternion& rkQ, bool shortestPath = false );
|
| /dports/graphics/graphviz/graphviz-2.44.1/lib/pathplan/ |
| H A D | shortestpth.c | 31 static int *shortestPath(int root, int target, int V, array2 wadj) in shortestPath() function
110 return (shortestPath(V + 1, V, V + 2, wadj)); in makePath()
|
| /dports/www/firefox-esr/firefox-91.8.0/netwerk/streamconv/ |
| H A D | nsStreamConverterService.cpp | 271 auto* shortestPath = new nsTArray<nsCString>(); in FindConverter() local
277 delete shortestPath; in FindConverter()
284 *aEdgeList = shortestPath; in FindConverter()
307 shortestPath->AppendElement(newContractID); in FindConverter()
312 delete shortestPath; in FindConverter()
|
| /dports/www/firefox/firefox-99.0/netwerk/streamconv/ |
| H A D | nsStreamConverterService.cpp | 271 auto* shortestPath = new nsTArray<nsCString>(); in FindConverter() local
277 delete shortestPath; in FindConverter()
284 *aEdgeList = shortestPath; in FindConverter()
307 shortestPath->AppendElement(newContractID); in FindConverter()
312 delete shortestPath; in FindConverter()
|
| /dports/lang/spidermonkey60/firefox-60.9.0/netwerk/streamconv/ |
| H A D | nsStreamConverterService.cpp | 279 auto *shortestPath = new nsTArray<nsCString>(); in FindConverter() local
285 delete shortestPath; in FindConverter()
292 *aEdgeList = shortestPath; in FindConverter()
313 rv = shortestPath->AppendElement(newContractID) in FindConverter()
321 delete shortestPath; in FindConverter()
|
| /dports/www/firefox-legacy/firefox-52.8.0esr/netwerk/streamconv/ |
| H A D | nsStreamConverterService.cpp | 297 auto *shortestPath = new nsTArray<nsCString>(); in FindConverter() local
303 delete shortestPath; in FindConverter()
310 *aEdgeList = shortestPath; in FindConverter()
331 …rv = shortestPath->AppendElement(newContractID) ? NS_OK : NS_ERROR_FAILURE; // XXX this method in… in FindConverter()
337 delete shortestPath; in FindConverter()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/netwerk/streamconv/ |
| H A D | nsStreamConverterService.cpp | 271 auto* shortestPath = new nsTArray<nsCString>(); in FindConverter() local
277 delete shortestPath; in FindConverter()
284 *aEdgeList = shortestPath; in FindConverter()
307 shortestPath->AppendElement(newContractID); in FindConverter()
312 delete shortestPath; in FindConverter()
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/test/hotspot/jtreg/gc/stress/gcold/ |
| H A D | TestGCOld.java | 102 private static int shortestPath (TreeNode t) { in shortestPath() method in TestGCOld
107 return 1 + Math.min (shortestPath (t.left), shortestPath (t.right)); in shortestPath()
193 int h2 = shortestPath(t); in checkTrees()
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/test/hotspot/jtreg/gc/stress/gcold/ |
| H A D | TestGCOld.java | 104 private static int shortestPath (TreeNode t) { in shortestPath() method in TestGCOld
109 return 1 + Math.min (shortestPath (t.left), shortestPath (t.right)); in shortestPath()
195 int h2 = shortestPath(t); in checkTrees()
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/test/hotspot/jtreg/gc/stress/gcold/ |
| H A D | TestGCOld.java | 106 private static int shortestPath (TreeNode t) { in shortestPath() method in TestGCOld
111 return 1 + Math.min (shortestPath (t.left), shortestPath (t.right)); in shortestPath()
197 int h2 = shortestPath(t); in checkTrees()
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/test/hotspot/jtreg/gc/stress/gcold/ |
| H A D | TestGCOld.java | 106 private static int shortestPath (TreeNode t) { in shortestPath() method in TestGCOld
111 return 1 + Math.min (shortestPath (t.left), shortestPath (t.right)); in shortestPath()
197 int h2 = shortestPath(t); in checkTrees()
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/test/hotspot/jtreg/gc/stress/gcold/ |
| H A D | TestGCOld.java | 106 private static int shortestPath (TreeNode t) { in shortestPath() method in TestGCOld
111 return 1 + Math.min (shortestPath (t.left), shortestPath (t.right)); in shortestPath()
197 int h2 = shortestPath(t); in checkTrees()
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/test/hotspot/jtreg/gc/stress/gcold/ |
| H A D | TestGCOld.java | 102 private static int shortestPath (TreeNode t) { in shortestPath() method in TestGCOld
107 return 1 + Math.min (shortestPath (t.left), shortestPath (t.right)); in shortestPath()
193 int h2 = shortestPath(t); in checkTrees()
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/test/hotspot/jtreg/gc/stress/gcold/ |
| H A D | TestGCOld.java | 102 private static int shortestPath (TreeNode t) { in shortestPath() method in TestGCOld
107 return 1 + Math.min (shortestPath (t.left), shortestPath (t.right)); in shortestPath()
193 int h2 = shortestPath(t); in checkTrees()
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/test/hotspot/jtreg/gc/stress/gcold/ |
| H A D | TestGCOld.java | 104 private static int shortestPath (TreeNode t) { in shortestPath() method in TestGCOld
109 return 1 + Math.min (shortestPath (t.left), shortestPath (t.right)); in shortestPath()
195 int h2 = shortestPath(t); in checkTrees()
|
| /dports/graphics/ogre3d19/sinbad-ogre-dd30349ea667/OgreMain/include/ |
| H A D | OgreQuaternion.h | 259 const Quaternion& rkQ, bool shortestPath = false);
277 const Quaternion& rkQ, bool shortestPath = false);
294 const Quaternion& rkQ, bool shortestPath = false);
|
| /dports/games/keeperrl/keeperrl-alpha23/ |
| H A D | creature.cpp | 785 if (shortestPath && shortestPath->getLevel() != pos.getLevel()) in setPosition()
786 shortestPath.reset(); in setPosition()
1466 if (shortestPath && shortestPath->isReachable(getPosition())) in continueMoving()
1467 return move(shortestPath->getNextMove(getPosition())); in continueMoving()
1515 …bool targetChanged = shortestPath && shortestPath->getTarget().dist8(pos) > getPosition().dist8(po… in moveTowards()
1516 if (!shortestPath || targetChanged || shortestPath->isReversed() != away) { in moveTowards()
1523 CHECK(shortestPath); in moveTowards()
1524 if (shortestPath->isReachable(position)) in moveTowards()
1534 if (shortestPath->isReachable(position)) { in moveTowards()
1535 Position pos2 = shortestPath->getNextMove(position); in moveTowards()
[all …]
|
| /dports/lang/spidermonkey78/firefox-78.9.0/netwerk/streamconv/ |
| H A D | nsStreamConverterService.cpp | 281 auto* shortestPath = new nsTArray<nsCString>(); in FindConverter() local
287 delete shortestPath; in FindConverter()
294 *aEdgeList = shortestPath; in FindConverter()
317 shortestPath->AppendElement(newContractID); in FindConverter()
322 delete shortestPath; in FindConverter()
|
| /dports/math/ogdf/OGDF/include/ogdf/graphalg/ |
| H A D | SteinerTreePreprocessing.h | 524 void floydWarshall(NodeArray<NodeArray<T>> &shortestPath) const;
922 …shortestPath[v1][v2] = shortestPath[v2][v1] = min(shortestPath[v1][v2], m_copyGraph.weight(adj->th… in floydWarshall()
929 if (shortestPath[v1][pivot] == std::numeric_limits<T>::max() in floydWarshall()
930 || shortestPath[pivot][v2] == std::numeric_limits<T>::max()) { in floydWarshall()
934 Math::updateMin(shortestPath[v1][v2], shortestPath[v1][pivot] + shortestPath[pivot][v2]); in floydWarshall()
943 shortestPath.init(m_copyGraph); in computeShortestPathMatrix()
945 shortestPath[v].init(m_copyGraph, std::numeric_limits<T>::max()); in computeShortestPathMatrix()
948 floydWarshall(shortestPath); in computeShortestPathMatrix()
955 NodeArray<NodeArray<T>> shortestPath; in leastCostTest() local
956 computeShortestPathMatrix(shortestPath); in leastCostTest()
[all …]
|
| /dports/graphics/ogre3d/ogre-1.11.6/OgreMain/src/ |
| H A D | OgreQuaternion.cpp | 374 const Quaternion& rkQ, bool shortestPath) in Slerp() argument
380 if (fCos < 0.0f && shortestPath) in Slerp()
451 const Quaternion& rkB, const Quaternion& rkQ, bool shortestPath) in Squad() argument
454 Quaternion kSlerpP = Slerp(fT, rkP, rkQ, shortestPath); in Squad()
535 const Quaternion& rkQ, bool shortestPath) in nlerp() argument
539 if (fCos < 0.0f && shortestPath) in nlerp()
|
| /dports/graphics/ogre3d/ogre-1.11.6/OgreMain/include/ |
| H A D | OgreQuaternion.h | 296 const Quaternion& rkQ, bool shortestPath = false);
314 const Quaternion& rkQ, bool shortestPath = false);
331 const Quaternion& rkQ, bool shortestPath = false);
|
| /dports/graphics/ogre3d19/sinbad-ogre-dd30349ea667/OgreMain/src/ |
| H A D | OgreQuaternion.cpp | 425 const Quaternion& rkQ, bool shortestPath) in Slerp() argument
431 if (fCos < 0.0f && shortestPath) in Slerp()
502 const Quaternion& rkB, const Quaternion& rkQ, bool shortestPath) in Squad() argument
505 Quaternion kSlerpP = Slerp(fT, rkP, rkQ, shortestPath); in Squad()
594 const Quaternion& rkQ, bool shortestPath) in nlerp() argument
598 if (fCos < 0.0f && shortestPath) in nlerp()
|
| /dports/www/bolt/bolt-2.2.24/vendor/composer/composer/src/Composer/Downloader/ |
| H A D | PathDownloader.php | 90 $shortestPath = $this->filesystem->findShortestPath($absolutePath, $realUrl);
92 $fileSystem->symlink($shortestPath, $path);
|
| /dports/lang/guile2/guile-2.2.7/gc-benchmarks/larceny/ |
| H A D | gcold.scm | 100 (define (shortestPath t)
103 (+ 1 (min (shortestPath (TreeNode.left t))
104 (shortestPath (TreeNode.right t))))))
207 (h2 (shortestPath t)))
|