/dports/biology/seqan-apps/seqan-seqan-v2.4.0/tests/graph_align/ |
H A D | test_graph_match_refinement.h | 459 vd = findVertex(ali_graph,0,0); in SEQAN_DEFINE_TEST() 462 vd = findVertex(ali_graph,0,8); in SEQAN_DEFINE_TEST() 484 vd = findVertex(ali_graph,1,0); in SEQAN_DEFINE_TEST() 488 vd = findVertex(ali_graph,1,8); in SEQAN_DEFINE_TEST() 509 vd = findVertex(ali_graph,2,0); in SEQAN_DEFINE_TEST() 513 vd = findVertex(ali_graph,2,8); in SEQAN_DEFINE_TEST() 534 vd = findVertex(ali_graph,3,0); in SEQAN_DEFINE_TEST() 538 vd = findVertex(ali_graph,3,3); in SEQAN_DEFINE_TEST() 542 vd = findVertex(ali_graph,3,5); in SEQAN_DEFINE_TEST() 546 vd = findVertex(ali_graph,3,6); in SEQAN_DEFINE_TEST() [all …]
|
H A D | test_graph_impl_align.h | 107 SEQAN_ASSERT_EQ(findVertex(g, id1, 0), v0); in SEQAN_DEFINE_TEST() 108 SEQAN_ASSERT_EQ(findVertex(g, id1, 1), v0); in SEQAN_DEFINE_TEST() 109 SEQAN_ASSERT_EQ(findVertex(g, id1, 2), nilVertex); in SEQAN_DEFINE_TEST() 125 SEQAN_ASSERT_EQ(findVertex(g, id2, 0), v1); in SEQAN_DEFINE_TEST() 126 SEQAN_ASSERT_EQ(findVertex(g, id2, 1), v1); in SEQAN_DEFINE_TEST() 127 SEQAN_ASSERT_EQ(findVertex(g, id2, 4), v1); in SEQAN_DEFINE_TEST() 128 SEQAN_ASSERT_EQ(findVertex(g, id2, 5), nilVertex); in SEQAN_DEFINE_TEST() 132 SEQAN_ASSERT_EQ(findVertex(g, id1, 0), v0); in SEQAN_DEFINE_TEST() 133 SEQAN_ASSERT_EQ(findVertex(g, id1, 1), v0); in SEQAN_DEFINE_TEST() 135 SEQAN_ASSERT_EQ(findVertex(g, id1, 10), 2u); in SEQAN_DEFINE_TEST() [all …]
|
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/tests/graph_msa/ |
H A D | test_graph_tcoffee.h | 286 addEdge(g, findVertex(g, 2, 8), findVertex(g, 3, 0), 40); in Test_TripletExtension() 288 SEQAN_ASSERT(cargo(findEdge(g, findVertex(g, 1, 0), findVertex(g, 2, 0))) == 30); in Test_TripletExtension() 289 SEQAN_ASSERT(cargo(findEdge(g, findVertex(g, 0, 8), findVertex(g, 3, 0))) == 20); in Test_TripletExtension() 290 SEQAN_ASSERT(cargo(findEdge(g, findVertex(g, 0, 8), findVertex(g, 2, 8))) == 30); in Test_TripletExtension() 460 SEQAN_ASSERT(findEdge(g, findVertex(g, 0, 1), findVertex(g, 1, 2)) == 0); in Test_ReversableFragments() 461 SEQAN_ASSERT(findEdge(g, findVertex(g, 0, 1), findVertex(g, 1, 4)) != 0); in Test_ReversableFragments() 462 SEQAN_ASSERT(findEdge(g, findVertex(g, 0, 2), findVertex(g, 1, 3)) != 0); in Test_ReversableFragments() 463 SEQAN_ASSERT(findEdge(g, findVertex(g, 0, 3), findVertex(g, 1, 2)) != 0); in Test_ReversableFragments() 464 SEQAN_ASSERT(findEdge(g, findVertex(g, 0, 3), findVertex(g, 1, 4)) == 0); in Test_ReversableFragments() 465 SEQAN_ASSERT(findEdge(g, findVertex(g, 0, 0), findVertex(g, 1, 0)) != 0); in Test_ReversableFragments() [all …]
|
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/demos/tutorial/alignment/ |
H A D | graph_assignment1.cpp | 41 u = findVertex(alignG, positionToId(stringSet(alignG), 0), 8); in main() 46 u = findVertex(alignG, positionToId(stringSet(alignG), 1), 8); in main() 47 v = findVertex(alignG, positionToId(stringSet(alignG), 2), 0); in main() 61 u = findVertex(alignG, positionToId(stringSet(alignG), 0), 11); in main() 66 u = findVertex(alignG, positionToId(stringSet(alignG), 1), 14); in main() 67 v = findVertex(alignG, positionToId(stringSet(alignG), 2), 6); in main()
|
H A D | graph.cpp | 48 u = findVertex(alignG, positionToId(stringSet(alignG), 0), 2); in main() 49 v = findVertex(alignG, positionToId(stringSet(alignG), 1), 3); in main()
|
/dports/graphics/qgis/qgis-3.22.3/tests/src/analysis/ |
H A D | testqgsnetworkanalysis.cpp | 97 QCOMPARE( graph.findVertex( QgsPointXY( 1, 2 ) ), 0 ); in testGraph() 103 QCOMPARE( graph.findVertex( QgsPointXY( 1, 2 ) ), 0 ); in testGraph() 104 QCOMPARE( graph.findVertex( QgsPointXY( 3, 4 ) ), 1 ); in testGraph() 388 startVertexIdx = graph->findVertex( QgsPointXY( 0, 0 ) ); in dijkkjkjkskkjsktra() 393 point_0_0_idx = graph->findVertex( QgsPointXY( 0, 0 ) ); in dijkkjkjkskkjsktra() 395 point_10_0_idx = graph->findVertex( QgsPointXY( 10, 0 ) ); in dijkkjkjkskkjsktra() 431 startVertexIdx = graph->findVertex( QgsPointXY( 10, 10 ) ); in dijkkjkjkskkjsktra() 436 point_0_0_idx = graph->findVertex( QgsPointXY( 0, 0 ) ); in dijkkjkjkskkjsktra() 438 point_10_0_idx = graph->findVertex( QgsPointXY( 10, 0 ) ); in dijkkjkjkskkjsktra() 507 const int endVertexIdx = graph->findVertex( snappedEnd ); in testRouteFail() [all …]
|
/dports/graphics/qgis-ltr/qgis-3.16.16/tests/src/analysis/ |
H A D | testqgsnetworkanalysis.cpp | 97 QCOMPARE( graph.findVertex( QgsPointXY( 1, 2 ) ), 0 ); in testGraph() 103 QCOMPARE( graph.findVertex( QgsPointXY( 1, 2 ) ), 0 ); in testGraph() 104 QCOMPARE( graph.findVertex( QgsPointXY( 3, 4 ) ), 1 ); in testGraph() 388 startVertexIdx = graph->findVertex( QgsPointXY( 0, 0 ) ); in dijkkjkjkskkjsktra() 393 point_0_0_idx = graph->findVertex( QgsPointXY( 0, 0 ) ); in dijkkjkjkskkjsktra() 395 point_10_0_idx = graph->findVertex( QgsPointXY( 10, 0 ) ); in dijkkjkjkskkjsktra() 436 point_0_0_idx = graph->findVertex( QgsPointXY( 0, 0 ) ); in dijkkjkjkskkjsktra() 502 int startVertexIdx = graph->findVertex( snappedStart ); in testRouteFail() 507 int endVertexIdx = graph->findVertex( snappedEnd ); in testRouteFail() 559 int startVertexIdx = graph->findVertex( snappedStart ); in testRouteFail2() [all …]
|
/dports/lang/ghc/ghc-8.10.7/libraries/Cabal/cabal-install/Distribution/Solver/Modular/ |
H A D | LabeledGraph.hs | 67 key_vertex k = findVertex 0 max_v 69 findVertex a b 72 LT -> findVertex a (mid-1) 74 GT -> findVertex (mid+1) b
|
/dports/devel/hs-cabal-install/cabal-cabal-install-3.4.0.0/cabal-install/Distribution/Solver/Modular/ |
H A D | LabeledGraph.hs | 68 key_vertex k = findVertex 0 max_v 70 findVertex a b 73 LT -> findVertex a (mid-1) 75 GT -> findVertex (mid+1) b
|
/dports/biology/seqan1/seqan-1.3.1/seqan/refinement/ |
H A D | graph_algorithm_refine_inexact.h | 108 end_knot = findVertex(ali_g,seq,end_pos-1);//end_pos1 is the first position of the next node in _getCutEndPos() 114 end_knot = findVertex(ali_g,seq,cut_end_pos-1); in _getCutEndPos() 131 act_knot = findVertex(ali_g,seq,act_pos); in _getCutBeginPos() 138 act_knot = findVertex(ali_g,seq,cut_act_pos); in _getCutBeginPos() 238 act_knot1 = findVertex(ali_g,seq1,act_pos1); in _makeRefinedGraphEdges()
|
/dports/biology/seqan/seqan-library-2.4.0/include/seqan/graph_align/ |
H A D | graph_algorithm_refine_inexact.h | 103 end_knot = findVertex(ali_g,seq,end_pos-1);//end_pos1 is the first position of the next node in _getCutEndPos() 112 end_knot = findVertex(ali_g,seq,cut_end_pos-1); in _getCutEndPos() 131 act_knot = findVertex(ali_g,seq,act_pos); in _getCutBeginPos() 141 … act_knot = findVertex(ali_g,seq,cut_act_pos); // have to watch out with cut_act_pos==seqLength! in _getCutBeginPos() 269 act_knot1 = findVertex(ali_g,seq1,act_pos1); in _makeRefinedGraphEdges()
|
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/include/seqan/graph_align/ |
H A D | graph_algorithm_refine_inexact.h | 103 end_knot = findVertex(ali_g,seq,end_pos-1);//end_pos1 is the first position of the next node in _getCutEndPos() 112 end_knot = findVertex(ali_g,seq,cut_end_pos-1); in _getCutEndPos() 131 act_knot = findVertex(ali_g,seq,act_pos); in _getCutBeginPos() 141 … act_knot = findVertex(ali_g,seq,cut_act_pos); // have to watch out with cut_act_pos==seqLength! in _getCutBeginPos() 269 act_knot1 = findVertex(ali_g,seq1,act_pos1); in _makeRefinedGraphEdges()
|
/dports/biology/pbseqan/seqan-21d95d737d8decb5cc3693b9065d81e831e7f57d/include/seqan/graph_align/ |
H A D | graph_algorithm_refine_inexact.h | 106 end_knot = findVertex(ali_g,seq,end_pos-1);//end_pos1 is the first position of the next node in _getCutEndPos() 115 end_knot = findVertex(ali_g,seq,cut_end_pos-1); in _getCutEndPos() 135 act_knot = findVertex(ali_g,seq,act_pos); in _getCutBeginPos() 145 … act_knot = findVertex(ali_g,seq,cut_act_pos); // have to watch out with cut_act_pos==seqLength! in _getCutBeginPos() 274 act_knot1 = findVertex(ali_g,seq1,act_pos1); in _makeRefinedGraphEdges()
|
/dports/graphics/qgis/qgis-3.22.3/src/analysis/processing/ |
H A D | qgsalgorithmshortestpathpointtopoint.cpp | 84 const int idxStart = graph->findVertex( snappedPoints[0] ); in processAlgorithm() 85 int idxEnd = graph->findVertex( snappedPoints[1] ); in processAlgorithm()
|
H A D | qgsalgorithmshortestpathlayertopoint.cpp | 91 const int idxEnd = graph->findVertex( snappedPoints[0] ); in processAlgorithm() 113 idxStart = graph->findVertex( snappedPoints[i] ); in processAlgorithm()
|
H A D | qgsalgorithmshortestpathpointtolayer.cpp | 91 const int idxStart = graph->findVertex( snappedPoints[0] ); in processAlgorithm() 113 idxEnd = graph->findVertex( snappedPoints[i] ); in processAlgorithm()
|
/dports/graphics/qgis-ltr/qgis-3.16.16/src/analysis/processing/ |
H A D | qgsalgorithmshortestpathpointtopoint.cpp | 84 int idxStart = graph->findVertex( snappedPoints[0] ); in processAlgorithm() 85 int idxEnd = graph->findVertex( snappedPoints[1] ); in processAlgorithm()
|
H A D | qgsalgorithmshortestpathlayertopoint.cpp | 91 int idxEnd = graph->findVertex( snappedPoints[0] ); in processAlgorithm() 113 idxStart = graph->findVertex( snappedPoints[i] ); in processAlgorithm()
|
H A D | qgsalgorithmshortestpathpointtolayer.cpp | 91 int idxStart = graph->findVertex( snappedPoints[0] ); in processAlgorithm() 113 idxEnd = graph->findVertex( snappedPoints[i] ); in processAlgorithm()
|
/dports/lang/ghc/ghc-8.10.7/libraries/containers/containers-tests/src/Data/ |
H A D | Graph.hs | 456 key_vertex k = findVertex 0 max_v 458 findVertex a b | a > b 460 findVertex a b = case compare k (key_map ! mid) of function 461 LT -> findVertex a (mid-1) 463 GT -> findVertex (mid+1) b
|
/dports/lang/ghc/ghc-8.10.7/libraries/containers/containers/src/Data/ |
H A D | Graph.hs | 456 key_vertex k = findVertex 0 max_v 458 findVertex a b | a > b 460 findVertex a b = case compare k (key_map ! mid) of function 461 LT -> findVertex a (mid-1) 463 GT -> findVertex (mid+1) b
|
/dports/lang/elm/compiler-0.19.1/_cabal_deps/containers-0.5.11.0/Data/ |
H A D | Graph.hs | 323 key_vertex k = findVertex 0 max_v 325 findVertex a b | a > b 327 findVertex a b = case compare k (key_map ! mid) of function 328 LT -> findVertex a (mid-1) 330 GT -> findVertex (mid+1) b
|
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/manual/source/Tutorial/DataStructures/Alignment/ |
H A D | AlignmentGraph.rst | 76 Note that we use :dox:`AlignmentGraph#findVertex findVertex()` to find the the 107 …The function :dox:`AlignmentGraph#findVertex` returns the vertex of an AlignmentGraph that covers …
|
/dports/graphics/qgis-ltr/qgis-3.16.16/src/analysis/network/ |
H A D | qgsgraph.h | 187 int findVertex( const QgsPointXY &pt ) const;
|
/dports/graphics/qgis/qgis-3.22.3/src/analysis/network/ |
H A D | qgsgraph.h | 187 int findVertex( const QgsPointXY &pt ) const;
|