Home
last modified time | relevance | path

Searched refs:fromGraph (Results 1 – 18 of 18) sorted by relevance

/dports/devel/awless/awless-0.1.11/graph/
H A Ddiff.go39 fromGraph *Graph member
46 return &Diff{fromGraph: fromG, toGraph: toG}
50 return d.fromGraph
61 fromTriples := d.fromGraph.store.Snapshot().Triples()
83 diff := &Diff{fromGraph: from, toGraph: to}
118 diff.fromGraph.store.Add(tstore.SubjPred(res, MetaPredicate).StringLiteral(extraLit))
135 func compareChildTriplesOf(onPredicate, root string, fromGraph tstore.RDFGraph, toGraph tstore.RDFG…
138 fromTriples := fromGraph.WithSubjPred(root, onPredicate)
/dports/graphics/qvge/qvge-0.6.3/src/qvge/
H A DCFileSerializerGraphML.cpp29 return scene.fromGraph(graphModel); in load()
H A DCFileSerializerPlainDOT.cpp29 return scene.fromGraph(graphModel); in load()
H A DCNodeEditorScene.h46 virtual bool fromGraph(const Graph& g);
H A DCFileSerializerDOT.cpp93 return scene.fromGraph(graphModel); in load()
H A DCEditorScene.h63 virtual bool fromGraph(const Graph&) { return false; } in fromGraph() function
H A DCNodeEditorScene.cpp45 bool CNodeEditorScene::fromGraph(const Graph& g) in fromGraph() function in CNodeEditorScene
/dports/finance/hs-hledger/hledger-1.19/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/
H A DNodeMap.hs9 new, fromGraph, mkNode, mkNode_, mkNodes, mkNodes_, mkEdge, mkEdges,
58 fromGraph :: (Ord a, Graph g) => g a b -> NodeMap a
59 fromGraph g = function
169 run g m = runState m (fromGraph g, g)
/dports/finance/hs-hledger-web/hledger-web-1.19/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/
H A DNodeMap.hs9 new, fromGraph, mkNode, mkNode_, mkNodes, mkNodes_, mkEdge, mkEdges,
58 fromGraph :: (Ord a, Graph g) => g a b -> NodeMap a
59 fromGraph g = function
169 run g m = runState m (fromGraph g, g)
/dports/finance/hs-hledger-ui/hledger-ui-1.19/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/
H A DNodeMap.hs9 new, fromGraph, mkNode, mkNode_, mkNodes, mkNodes_, mkEdge, mkEdges,
58 fromGraph :: (Ord a, Graph g) => g a b -> NodeMap a
59 fromGraph g = function
169 run g m = runState m (fromGraph g, g)
/dports/devel/hs-spago/spago-0.20.3/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/
H A DNodeMap.hs9 new, fromGraph, mkNode, mkNode_, mkNodes, mkNodes_, mkEdge, mkEdges,
58 fromGraph :: (Ord a, Graph g) => g a b -> NodeMap a
59 fromGraph g = function
169 run g m = runState m (fromGraph g, g)
/dports/devel/hs-darcs/darcs-2.16.4/_cabal_deps/fgl-5.7.0.3/Data/Graph/Inductive/
H A DNodeMap.hs9 new, fromGraph, mkNode, mkNode_, mkNodes, mkNodes_, mkEdge, mkEdges,
58 fromGraph :: (Ord a, Graph g) => g a b -> NodeMap a
59 fromGraph g = function
169 run g m = runState m (fromGraph g, g)
/dports/devel/hs-cabal-install/cabal-cabal-install-3.4.0.0/cabal-install/Distribution/Client/
H A DCmdExec.hs244 fromElaboratedInstallPlan = fromGraph . toGraph
245 fromGraph = foldMap fromPlan function
/dports/lang/ghc/ghc-8.10.7/libraries/Cabal/cabal-install/Distribution/Client/
H A DCmdExec.hs257 fromElaboratedInstallPlan = fromGraph . toGraph
258 fromGraph = foldMap fromPlan function
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/mlir/lib/Dialect/Linalg/Analysis/
H A DDependenceAnalysis.cpp345 const auto &fromGraph = dependencesFromGraphs[dt]; in print() local
346 for (const auto &it : fromGraph) { in print()
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/mlir/lib/Dialect/Linalg/Analysis/
H A DDependenceAnalysis.cpp345 const auto &fromGraph = dependencesFromGraphs[dt]; in print() local
346 for (const auto &it : fromGraph) { in print()
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/mlir/lib/Dialect/Linalg/Analysis/
H A DDependenceAnalysis.cpp345 const auto &fromGraph = dependencesFromGraphs[dt]; in print() local
346 for (const auto &it : fromGraph) { in print()
/dports/devel/llvm13/llvm-project-13.0.1.src/mlir/lib/Dialect/Linalg/Analysis/
H A DDependenceAnalysis.cpp345 const auto &fromGraph = dependencesFromGraphs[dt];
346 for (const auto &it : fromGraph) {