| /dports/devel/awless/awless-0.1.11/graph/ |
| H A D | diff.go | 40 toGraph *Graph member
46 return &Diff{fromGraph: fromG, toGraph: toG}
54 return d.toGraph
59 d.mergedGraph.store.Add(d.toGraph.store.Snapshot().Triples()...)
83 diff := &Diff{fromGraph: from, toGraph: to}
109 diff.toGraph.store.Add(tstore.SubjPred(res, MetaPredicate).StringLiteral(extraLit))
135 func compareChildTriplesOf(onPredicate, root string, fromGraph tstore.RDFGraph, toGraph tstore.RDFG…
139 toTriples := toGraph.WithSubjPred(root, onPredicate)
|
| /dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/src/Algebra/Graph/ |
| H A D | ToGraph.hs | 86 toGraph :: t -> G.Graph (ToVertex t)
87 toGraph = foldg G.Empty G.Vertex G.Overlay G.Connect function
98 foldg e v o c = G.foldg e v o c . toGraph
122 hasEdge x y = G.hasEdge x y . toGraph
334 toGraph = id function
341 toGraph = G.stars function
373 toGraph = G.stars function
419 toGraph = toGraph . LAM.skeleton function
442 toGraph = toGraph . toAdjacencyMap function
473 toGraph r = G.vertices (Set.toList $ R.domain r) `G.overlay` function
[all …]
|
| /dports/devel/hs-haskell-language-server/haskell-language-server-1.4.0/_cabal_deps/algebraic-graphs-0.5/test/Algebra/Graph/Test/ |
| H A D | API.hs | 158 , toGraph = T.toGraph function
162 , size = G.size . T.toGraph
232 , toGraph = id function
305 , toGraph = UG.fromUndirected function
349 , toGraph = T.toGraph . getMono function
421 , toGraph = T.toGraph function
425 , size = G.size . T.toGraph
491 , toGraph = T.toGraph function
495 , size = G.size . T.toGraph
556 , toGraph = T.toGraph function
[all …]
|
| /dports/math/hs-Agda/Agda-2.6.2/_cabal_deps/Cabal-3.0.2.0/tests/UnitTests/Distribution/Compat/ |
| H A D | Graph.hs | 40 (_, vtn, ktv) = toGraph g
50 (gr, vtn, ktv) = toGraph g
62 (gr, vtn, ktv) = toGraph g
|
| /dports/devel/hs-cabal-install/cabal-cabal-install-3.4.0.0/Cabal/tests/UnitTests/Distribution/Compat/ |
| H A D | Graph.hs | 40 (_, vtn, ktv) = toGraph g
50 (gr, vtn, ktv) = toGraph g
62 (gr, vtn, ktv) = toGraph g
|
| /dports/devel/hs-hls-install/haskell-language-server-1.4.0/install/_cabal_deps/Cabal-3.4.0.0/tests/UnitTests/Distribution/Compat/ |
| H A D | Graph.hs | 40 (_, vtn, ktv) = toGraph g
50 (gr, vtn, ktv) = toGraph g
62 (gr, vtn, ktv) = toGraph g
|
| /dports/lang/ghc/ghc-8.10.7/libraries/Cabal/Cabal/tests/UnitTests/Distribution/Compat/ |
| H A D | Graph.hs | 40 (_, vtn, ktv) = toGraph g
50 (gr, vtn, ktv) = toGraph g
62 (gr, vtn, ktv) = toGraph g
|
| /dports/cad/librecad/LibreCAD-2.2.0-rc2/librecad/src/ui/ |
| H A D | qg_graphicview.cpp | 93 view_rect = LC_Rect(toGraph(0, 0), toGraph(getWidth(), getHeight())); in QG_GraphicView()
370 RS_Vector mouse = toGraph(g.x(), g.y()); in event()
485 RS_Vector mouse = toGraph(e->x(), e->y()); in wheelEvent()
631 RS_Vector mainViewCenter = toGraph(getWidth()/2, getHeight()/2); in wheelEvent()
883 return toGraph(vp.x(), vp.y()); in getMousePosition()
969 view_rect = LC_Rect(toGraph(0, 0), in paintEvent()
970 toGraph(getWidth(), getHeight())); in paintEvent()
|
| /dports/cad/librecad/LibreCAD-2.2.0-rc2/librecad/src/actions/ |
| H A D | rs_actiondefault.cpp | 114 RS_Vector mouse = graphicView->toGraph(e->x(), e->y()); in mouseMoveEvent()
244 pPoints->v1 = graphicView->toGraph(e->x(), e->y()); in mousePressEvent()
304 pPoints->v2 = graphicView->toGraph(e->x(), e->y()); in mouseReleaseEvent()
330 pPoints->v2 = graphicView->toGraph(e->x(), e->y()); in mouseReleaseEvent()
|
| H A D | rs_actionsnapintersectionmanual.cpp | 101 RS_Vector mouse = graphicView->toGraph(e->x(), e->y()); in mouseMoveEvent()
148 RS_Vector mouse = graphicView->toGraph(e->x(), e->y()); in mouseReleaseEvent()
|
| H A D | rs_actionmodifytrim.cpp | 104 RS_Vector mouse = graphicView->toGraph(e->x(), e->y()); in mouseMoveEvent()
130 RS_Vector mouse = graphicView->toGraph(e->x(), e->y()); in mouseReleaseEvent()
|
| H A D | rs_actiondrawcircleinscribe.cpp | 122 pPoints->coord= graphicView->toGraph(e->x(), e->y()); in mouseMoveEvent()
176 pPoints->coord= graphicView->toGraph(e->x(), e->y()); in mouseReleaseEvent()
|
| H A D | rs_actiondrawcircletan2.cpp | 121 pPoints->coord= graphicView->toGraph(e->x(), e->y()); in mouseMoveEvent()
198 pPoints->coord= graphicView->toGraph(e->x(), e->y()); in mouseReleaseEvent()
|
| H A D | rs_actionmodifyround.cpp | 108 RS_Vector mouse = graphicView->toGraph(e->x(), e->y()); in mouseMoveEvent()
161 RS_Vector mouse = graphicView->toGraph(e->x(), e->y()); in mouseReleaseEvent()
|
| H A D | rs_actionprintpreview.cpp | 74 pPoints->v2 = graphicView->toGraph(e->x(), e->y()); in mouseMoveEvent()
103 pPoints->v1 = graphicView->toGraph(e->x(), e->y()); in mousePressEvent()
|
| H A D | rs_actiondrawcircletan2_1p.cpp | 158 pPoints->coord=graphicView->toGraph(e->x(),e->y()); in mouseMoveEvent()
221 pPoints->coord=graphicView->toGraph(e->x(),e->y()); in mouseReleaseEvent()
|
| H A D | rs_actiondimangular.cpp | 127 click1 = line1.getNearestPointOnEntity( graphicView->toGraph( e->x(), e->y())); in mouseReleaseEvent()
136 click2 = line2.getNearestPointOnEntity( graphicView->toGraph( e->x(), e->y())); in mouseReleaseEvent()
|
| /dports/graphics/qvge/qvge-0.6.3/src/qvge/ |
| H A D | CFileSerializerGraphML.cpp | 40 if (scene.toGraph(graphModel)) in save()
|
| H A D | CFileSerializerPlainDOT.cpp | 40 if (scene.toGraph(graphModel)) in save()
|
| /dports/devel/hs-cabal-install/cabal-cabal-install-3.4.0.0/cabal-install/Distribution/Client/ |
| H A D | CmdExec.hs | 22 , toGraph
244 fromElaboratedInstallPlan = fromGraph . toGraph
|
| /dports/lang/ghc/ghc-8.10.7/libraries/Cabal/cabal-install/Distribution/Client/ |
| H A D | CmdExec.hs | 22 , toGraph
257 fromElaboratedInstallPlan = fromGraph . toGraph
|
| /dports/cad/openroad/OpenROAD-2.0/src/par/src/ |
| H A D | HypergraphDecomposition.h | 66 void toGraph(Hypergraph& hypergraph,
|
| /dports/cad/librecad/LibreCAD-2.2.0-rc2/librecad/src/lib/gui/ |
| H A D | rs_graphicview.h | 306 RS_Vector toGraph(RS_Vector v) const;
307 RS_Vector toGraph(int x, int y) const;
|
| /dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/constraints/cumulative/ |
| H A D | ThetaLambdaUnaryTree.java | 207 out.print(toGraph(name)); in printTree()
215 public String toGraph(String name) { in toGraph() method in ThetaLambdaUnaryTree
|
| /dports/math/hs-Agda/Agda-2.6.2/_cabal_deps/Cabal-3.0.2.0/Distribution/Compat/ |
| H A D | Graph.hs | 80 toGraph,
403 toGraph :: Graph a -> (G.Graph, G.Vertex -> a, Key a -> Maybe G.Vertex)
404 toGraph g = (graphForward g, graphVertexToNode g, graphKeyToVertex g) function
|