- Sort Score
- Result 10 results
- Languages All
Results 131 - 140 of 1,985 for grape (0.14 sec)
-
maven-compat/src/main/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolver.java
} if (graph.isEmpty()) { throw new GraphConflictResolutionException("graph with an entry, but not vertices do not exist"); } if (graph.isEmptyEdges()) { return null; // no edges - nothing to worry about } final TreeSet<MetadataGraphVertex> vertices = graph.getVertices(); try { // edge case - single vertex graph
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Wed Sep 06 11:28:54 UTC 2023 - 8.2K bytes - Viewed (0) -
tensorflow/compiler/jit/xla_cluster_util_test.cc
if (flib_def == nullptr) { flib_def = &flib_def_local; } std::unique_ptr<Graph> graph(new Graph(OpRegistry::Global())); TF_RETURN_IF_ERROR(scope.ToGraph(graph.get())); std::unique_ptr<ProcessFunctionLibraryRuntime> pflr( new ProcessFunctionLibraryRuntime( nullptr, Env::Default(), /*config=*/nullptr, TF_GRAPH_DEF_VERSION, flib_def, OptimizerOptions{}));
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 21 09:53:30 UTC 2024 - 10.8K bytes - Viewed (0) -
tensorflow/c/c_api_test.cc
TF_Status* s = TF_NewStatus(); TF_Graph* graph = TF_NewGraph(); // Create a simple graph. Placeholder(graph, s); ASSERT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s); ASSERT_TRUE(TF_GraphOperationByName(graph, "feed") != nullptr); TF_Operation* oper = ScalarConst(3, graph, s); ASSERT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s); ASSERT_TRUE(TF_GraphOperationByName(graph, "scalar") != nullptr); Neg(oper, graph, s);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Apr 15 03:35:10 UTC 2024 - 96.9K bytes - Viewed (0) -
guava/src/com/google/common/graph/ValueGraph.java
// ValueGraph-level accessors // /** Returns all nodes in this graph, in the order specified by {@link #nodeOrder()}. */ @Override Set<N> nodes(); /** Returns all edges in this graph. */ @Override Set<EndpointPair<N>> edges(); /** * Returns a live view of this graph as a {@link Graph}. The resulting {@link Graph} will have an
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 16K bytes - Viewed (0) -
tensorflow/compiler/jit/force_xla_constants_on_host_pass_test.cc
std::unique_ptr<Graph>* result) { auto graph = std::make_unique<Graph>(OpRegistry::Global()); GraphOptimizationPassOptions options; SessionOptions session_options; session_options.env = Env::Default(); options.graph = &graph; options.session_options = &session_options; options.flib_def = flib_def; TF_RETURN_IF_ERROR(s.ToGraph(graph.get())); ForceXlaConstantsOnHostPass rewriter;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 22 08:47:20 UTC 2024 - 4.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MutableNetwork.java
* also connect {@code nodeV} to {@code nodeU}. * * <p>If this graph is directed, {@code edge} will be directed in this graph; if it is undirected, * {@code edge} will be undirected in this graph. * * <p>If this graph is directed, {@code endpoints} must be ordered. * * <p><b>{@code edge} must be unique to this graph</b>, just as a {@code Map} key must be. It must * also be non-null. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.4K bytes - Viewed (0) -
android/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) -
tensorflow/compiler/jit/extract_outside_compilation_pass_test.cc
} TEST(RewriteOutsideCompilationSubgraphFnTest, NoSendFromHost) { // Build the graph: only 1 node: "arg0" tensorflow::Scope s = tensorflow::Scope::NewRootScope(); Output arg0 = ops::_Arg(s.WithOpName("arg0"), DT_INT32, 0); std::unique_ptr<Graph> g(new Graph(OpRegistry::Global())); TF_CHECK_OK(s.ToGraph(g.get()));
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Sep 06 19:12:29 UTC 2023 - 41K bytes - Viewed (0) -
guava/src/com/google/common/graph/ValueGraphBuilder.java
* * <pre>{@code * // Building a mutable value graph * MutableValueGraph<String, Double> graph = * ValueGraphBuilder.undirected().allowsSelfLoops(true).build(); * graph.putEdgeValue("San Francisco", "San Francisco", 0.0); * graph.putEdgeValue("San Jose", "San Jose", 0.0); * graph.putEdgeValue("San Francisco", "San Jose", 48.4); * * // Building an immutable value graph * ImmutableValueGraph<String, Double> immutableGraph =
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 03 01:21:31 UTC 2022 - 8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java
// In this case the graphs are considered equivalent; the property differences are irrelevant. @Test public void equivalent_propertiesDiffer() { graph.putEdge(N1, N2); MutableGraph<Integer> g2 = GraphBuilder.from(graph).allowsSelfLoops(!graph.allowsSelfLoops()).build(); g2.putEdge(N1, N2); assertThat(graph).isEqualTo(g2); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Jun 22 19:09:27 UTC 2017 - 4.7K bytes - Viewed (0)