| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/utils/IdealGraphVisualizer/View/src/com/sun/hotspot/igv/view/ |
| H A D | NodeQuickSearch.java | 85 InputGraph matchGraph = p.getGraph(); in evaluate() local
93 matchGraph = graph; in evaluate()
103 matchGraph = graph; in evaluate()
111 final InputGraph theGraph = p.getGraph() != matchGraph ? matchGraph : null; in evaluate()
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/utils/IdealGraphVisualizer/View/src/com/sun/hotspot/igv/view/ |
| H A D | NodeQuickSearch.java | 85 InputGraph matchGraph = p.getGraph(); in evaluate() local
93 matchGraph = graph; in evaluate()
103 matchGraph = graph; in evaluate()
111 final InputGraph theGraph = p.getGraph() != matchGraph ? matchGraph : null; in evaluate()
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/utils/IdealGraphVisualizer/View/src/com/sun/hotspot/igv/view/ |
| H A D | NodeQuickSearch.java | 85 InputGraph matchGraph = p.getGraph(); in evaluate() local
93 matchGraph = graph; in evaluate()
103 matchGraph = graph; in evaluate()
111 final InputGraph theGraph = p.getGraph() != matchGraph ? matchGraph : null; in evaluate()
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/utils/IdealGraphVisualizer/View/src/com/sun/hotspot/igv/view/ |
| H A D | NodeQuickSearch.java | 85 InputGraph matchGraph = p.getGraph(); in evaluate() local
93 matchGraph = graph; in evaluate()
103 matchGraph = graph; in evaluate()
111 final InputGraph theGraph = p.getGraph() != matchGraph ? matchGraph : null; in evaluate()
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/utils/IdealGraphVisualizer/View/src/com/sun/hotspot/igv/view/ |
| H A D | NodeQuickSearch.java | 85 InputGraph matchGraph = p.getGraph(); in evaluate() local
93 matchGraph = graph; in evaluate()
103 matchGraph = graph; in evaluate()
111 final InputGraph theGraph = p.getGraph() != matchGraph ? matchGraph : null; in evaluate()
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/utils/IdealGraphVisualizer/View/src/com/sun/hotspot/igv/view/ |
| H A D | NodeQuickSearch.java | 85 InputGraph matchGraph = p.getGraph(); in evaluate() local
93 matchGraph = graph; in evaluate()
103 matchGraph = graph; in evaluate()
111 final InputGraph theGraph = p.getGraph() != matchGraph ? matchGraph : null; in evaluate()
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/utils/IdealGraphVisualizer/View/src/com/sun/hotspot/igv/view/ |
| H A D | NodeQuickSearch.java | 85 InputGraph matchGraph = p.getGraph(); in evaluate() local
93 matchGraph = graph; in evaluate()
103 matchGraph = graph; in evaluate()
111 final InputGraph theGraph = p.getGraph() != matchGraph ? matchGraph : null; in evaluate()
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/utils/IdealGraphVisualizer/View/src/main/java/com/sun/hotspot/igv/view/ |
| H A D | NodeQuickSearch.java | 86 InputGraph matchGraph = p.getGraph(); in evaluate() local
94 matchGraph = graph; in evaluate()
104 matchGraph = graph; in evaluate()
112 final InputGraph theGraph = p.getGraph() != matchGraph ? matchGraph : null; in evaluate()
|
| /dports/devel/radare2/radare2-5.1.1/libr/core/ |
| H A D | zdiff.c | 16 static bool matchGraph(RSignItem *a, RSignItem *b) { in matchGraph() function
86 if (matchGraph (si, si2)) { in r_core_zdiff()
|
| /dports/biology/seqan1/seqan-1.3.1/seqan/graph_msa/ |
| H A D | graph_align_tcoffee_progressive.h | 330 Graph<Undirected<void> > matchGraph; in heaviestMatching() local
334 for(TSize i = 0; i < m; ++i) addVertex(matchGraph); in heaviestMatching()
335 for(TSize i = 0; i < n; ++i) value(vertexMap, addVertex(matchGraph)) = true; in heaviestMatching()
340 addEdge(matchGraph, i, m+j); in heaviestMatching()
352 TCargo val = weightedBipartiteMatching(matchGraph, vertexMap, weights, edges); in heaviestMatching()
390 TVertexIterator itVertex(matchGraph); in heaviestMatching()
|
| /dports/biology/seqan/seqan-library-2.4.0/include/seqan/graph_msa/ |
| H A D | graph_align_tcoffee_progressive.h | 326 Graph<Undirected<void> > matchGraph; in heaviestMatching() local
330 for(TSize i = 0; i < m; ++i) addVertex(matchGraph); in heaviestMatching()
331 for(TSize i = 0; i < n; ++i) value(vertexMap, addVertex(matchGraph)) = true; in heaviestMatching()
336 addEdge(matchGraph, i, m+j); in heaviestMatching()
348 TCargo val = weightedBipartiteMatching(matchGraph, vertexMap, weights, edges); in heaviestMatching()
386 TVertexIterator itVertex(matchGraph); in heaviestMatching()
|
| /dports/biology/seqan-apps/seqan-seqan-v2.4.0/include/seqan/graph_msa/ |
| H A D | graph_align_tcoffee_progressive.h | 326 Graph<Undirected<void> > matchGraph; in heaviestMatching() local
330 for(TSize i = 0; i < m; ++i) addVertex(matchGraph); in heaviestMatching()
331 for(TSize i = 0; i < n; ++i) value(vertexMap, addVertex(matchGraph)) = true; in heaviestMatching()
336 addEdge(matchGraph, i, m+j); in heaviestMatching()
348 TCargo val = weightedBipartiteMatching(matchGraph, vertexMap, weights, edges); in heaviestMatching()
386 TVertexIterator itVertex(matchGraph); in heaviestMatching()
|
| /dports/biology/pbseqan/seqan-21d95d737d8decb5cc3693b9065d81e831e7f57d/include/seqan/graph_msa/ |
| H A D | graph_align_tcoffee_progressive.h | 329 Graph<Undirected<void> > matchGraph; in heaviestMatching() local
333 for(TSize i = 0; i < m; ++i) addVertex(matchGraph); in heaviestMatching()
334 for(TSize i = 0; i < n; ++i) value(vertexMap, addVertex(matchGraph)) = true; in heaviestMatching()
339 addEdge(matchGraph, i, m+j); in heaviestMatching()
351 TCargo val = weightedBipartiteMatching(matchGraph, vertexMap, weights, edges); in heaviestMatching()
389 TVertexIterator itVertex(matchGraph); in heaviestMatching()
|
| /dports/devel/radare2/radare2-5.1.1/libr/anal/ |
| H A D | sign.c | 1224 static double matchGraph(RSignItem *a, RSignItem *b) { in matchGraph() function
1270 gscore = matchGraph (it, data->test); in closest_match_update()
1481 double graphScore = matchGraph (si, si2); in r_sign_diff()
1540 double graphScore = matchGraph (si, si2); in r_sign_diff_by_name()
|