- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 1,985 for grape (0.04 sec)
-
tensorflow/compiler/jit/xla_cluster_util.h
absl::StatusOr<absl::flat_hash_set<Node*>> GetNodesRelatedToRefVariables( const Graph& graph, FunctionLibraryRuntime* lib_runtime); // Deterministically serialized the graph to a byte string. absl::StatusOr<std::string> SerializeGraphDeterministic(const Graph& graph); // Computes a fingerprint of the given `graph`. The fingerprint can use used to // check if two graphs are likely the same but should not be relied on
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 21 09:53:30 UTC 2024 - 4.6K bytes - Viewed (0) -
tensorflow/compiler/jit/cluster_scoping_pass_test.cc
#include "tensorflow/core/graph/algorithm.h" #include "tensorflow/core/graph/graph_def_builder.h" #include "tensorflow/core/lib/core/status_test_util.h" #include "tensorflow/core/platform/test.h" #include "tensorflow/core/public/session_options.h" namespace tensorflow { namespace { Status ClusterScoping(std::unique_ptr<Graph>* graph) { FixupSourceAndSinkEdges(graph->get());
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Apr 29 16:20:48 UTC 2020 - 6.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/IncidentEdgeSet.java
final N node; final BaseGraph<N> graph; IncidentEdgeSet(BaseGraph<N> graph, N node) { this.graph = graph; this.node = node; } @Override public boolean remove(@CheckForNull Object o) { throw new UnsupportedOperationException(); } @Override public int size() { if (graph.isDirected()) { return graph.inDegree(node) + graph.outDegree(node)
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 2.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MutableGraph.java
* * <p>If the graph is directed, the resultant edge will be directed; otherwise, it will be * undirected. * * <p>If {@code nodeU} and {@code nodeV} are not already present in this graph, this method will * silently {@link #addNode(Object) add} {@code nodeU} and {@code nodeV} to the graph. * * @return {@code true} if the graph was modified as a result of this call
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 3.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/mlir2graphdef/invalid_input.mlir
func.return } // CHECK: functions must be of a single Graph with single op Islands: only single block functions are supported // ----- // Tests invalid functions for exporting to Graph/GraphDef. func.func @main() { func.return } // CHECK: functions must be of a single Graph with single op Islands: first op in function is not a tf_executor.graph // ----- func.func @main() { tf_executor.graph {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Mar 28 12:06:33 UTC 2022 - 2.3K bytes - Viewed (0) -
guava/src/com/google/common/graph/ImmutableValueGraph.java
private ImmutableValueGraph(ValueGraph<N, V> graph) { super(ValueGraphBuilder.from(graph), getNodeConnections(graph), graph.edges().size()); } /** Returns an immutable copy of {@code graph}. */ public static <N, V> ImmutableValueGraph<N, V> copyOf(ValueGraph<N, V> graph) { return (graph instanceof ImmutableValueGraph) ? (ImmutableValueGraph<N, V>) graph : new ImmutableValueGraph<N, V>(graph); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 01 16:30:37 UTC 2022 - 7.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/utils/dump_graph_test.cc
} private: string& str_; }; TEST(Dump, TextualIrToFileSuccess) { Graph graph(OpRegistry::Global()); Node* node; TF_CHECK_OK(NodeBuilder("A", "NoOp").Finalize(&graph, &node)); setenv("TF_DUMP_GRAPH_PREFIX", testing::TmpDir().c_str(), 1); UseMlirForGraphDump(MlirDumpConfig()); string ret = DumpGraphToFile("tir", graph); ASSERT_EQ(ret, io::JoinPath(testing::TmpDir(), "tir.mlir")); string actual;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Feb 26 03:47:51 UTC 2024 - 3.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphMutationTest.java
MutableGraph<Integer> graph = graphBuilder.allowsSelfLoops(true).build(); assertThat(graph.nodes()).isEmpty(); assertThat(graph.edges()).isEmpty(); AbstractGraphTest.validateGraph(graph); while (graph.nodes().size() < NUM_NODES) { graph.addNode(gen.nextInt(NODE_POOL_SIZE)); } ArrayList<Integer> nodeList = new ArrayList<>(graph.nodes());
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Aug 18 16:17:46 UTC 2017 - 4.2K bytes - Viewed (0) -
tensorflow/c/c_api.cc
TF_Graph* const graph = s->graph; if (graph != nullptr) { graph->mu.lock(); graph->sessions.erase(s); const bool del = graph->delete_requested && graph->sessions.empty(); graph->mu.unlock(); if (del) delete graph; } delete s->session; delete s; } void TF_SessionRun(TF_Session* session, const TF_Buffer* run_options,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Apr 15 03:35:10 UTC 2024 - 102.3K bytes - Viewed (0) -
tensorflow/compiler/jit/shape_inference_test.cc
auto f = ops::Neg(root.WithOpName("F"), e); auto g = ops::AddN(root.WithOpName("G"), std::initializer_list<Output>{e, f}); std::unique_ptr<Graph> graph(new Graph(OpRegistry::Global())); TF_CHECK_OK(root.ToGraph(graph.get())); GraphShapeInfo shape_info; TF_ASSERT_OK(InferShapes(graph.get(), /*arg_shapes=*/{}, /*fnlib_def=*/nullptr, &shape_info));
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri May 31 00:41:19 UTC 2024 - 10.3K bytes - Viewed (0)