- Sort Score
- Result 10 results
- Languages All
Results 91 - 100 of 1,985 for grape (0.04 sec)
-
tensorflow/compiler/mlir/tf2xla/internal/mlir_bridge_pass_util.cc
bool IsSupportedByNonReplicatedBridge( const Graph& graph, const FunctionLibraryDefinition* function_library) { return IsNonReplicatedGraph(graph, function_library) && HasPsWithResourceVariable(graph); } bool IsSupportedByReplicatedBridge( const Graph& graph, const FunctionLibraryDefinition* function_library) { return IsReplicatedGraph(graph, function_library); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 07 12:22:33 UTC 2024 - 8.9K bytes - Viewed (0) -
maven-core/src/test/java/org/apache/maven/project/GraphTest.java
Graph graph = new Graph(); graph.addVertex("a"); assertEquals(1, graph.getVertices().size()); assertEquals("a", graph.getVertex("a").getLabel()); graph.addVertex("a"); assertEquals(1, graph.getVertices().size()); assertEquals("a", graph.getVertex("a").getLabel()); graph.addVertex("b");
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Sep 22 06:02:04 UTC 2023 - 8.3K bytes - Viewed (0) -
maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolverTest.java
* v1< * v3-v4 * */ graph = new MetadataGraph(4, 3); v1 = graph.addVertex(new ArtifactMetadata("g", "a1", "1.0")); graph.setEntry(v1); v2 = graph.addVertex(new ArtifactMetadata("g", "a2", "1.0")); v3 = graph.addVertex(new ArtifactMetadata("g", "a3", "1.0")); v4 = graph.addVertex(new ArtifactMetadata("g", "a4", "1.0")); // v1-->v2
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Thu Apr 25 05:46:50 UTC 2024 - 8.1K bytes - Viewed (0) -
tensorflow/compiler/jit/encapsulate_xla_computations_pass_test.cc
Status status; Node* launch = scope.graph()->AddNode(def, &status); TF_CHECK_OK(status); TF_CHECK_OK(scope.DoShapeInference(launch)); scope.graph()->AddEdge(a.node(), 0, launch, 0); scope.graph()->AddEdge(b.node(), 0, launch, 1); scope.graph()->AddEdge(c.node(), 0, launch, 2); scope.graph()->AddEdge(d.node(), 0, launch, 3); scope.graph()->AddEdge(u.node(), 0, launch, 4); scope.graph()->AddEdge(v.node(), 0, launch, 5);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Oct 16 18:03:15 UTC 2023 - 14.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphBuilder.java
* * <p>Examples of use: * * <pre>{@code * // Building a mutable graph * MutableGraph<String> graph = GraphBuilder.undirected().allowsSelfLoops(true).build(); * graph.putEdge("bread", "bread"); * graph.putEdge("chocolate", "peanut butter"); * graph.putEdge("peanut butter", "jelly"); * * // Building an immutable graph * ImmutableGraph<String> immutableGraph = * GraphBuilder.undirected()
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 03 01:21:31 UTC 2022 - 7.3K bytes - Viewed (0) -
platforms/core-runtime/base-services/src/test/groovy/org/gradle/internal/graph/CachingDirectedGraphWalkerTest.groovy
def values = walker.findValues() then: 1 * graph.getNodeValues(1, _, _) >> { args -> args[1] << '1'; args[2] << 2 } 1 * graph.getEdgeValues(1, 2, _) >> { args -> args[2] << '1->2' } 1 * graph.getNodeValues(2, _, _) >> { args -> args[1] << '2'; args[2] << 3 } 1 * graph.getEdgeValues(2, 3, _) >> { args -> args[2] << '2->3' } 1 * graph.getNodeValues(3, _, _) >> { args -> args[1] << '3'; args[2] << 1 }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 08:48:02 UTC 2023 - 9.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/internal/mlir_bridge_pass_util_test.cc
#include "tensorflow/core/framework/tensor_testutil.h" #include "tensorflow/core/graph/graph.h" #include "tensorflow/core/graph/node_builder.h" #include "tensorflow/core/platform/enable_tf2_utils.h" #include "tensorflow/core/platform/types.h" #include "tsl/lib/core/status_test_util.h" namespace tensorflow { namespace { // Produce a valid graph with a resource-type input. FunctionDef PassThroughResource() {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Apr 17 19:51:50 UTC 2024 - 10.3K bytes - Viewed (0) -
tensorflow/compiler/jit/resource_operation_safety_analysis_test.cc
root.graph()->AddControlEdge(write_0, neutral_0); root.graph()->AddControlEdge(neutral_0, read_0); root.graph()->AddControlEdge(read_0, write_1); root.graph()->AddControlEdge(write_1, neutral_1); root.graph()->AddControlEdge(neutral_1, read_1); std::vector<std::pair<int, int>> incompatible_pairs; TF_ASSERT_OK(ComputeIncompatiblePairs(root.graph(), &incompatible_pairs));
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Apr 28 16:53:59 UTC 2020 - 18.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
assertThat(graph.nodes()).containsExactly(N1, N5, N4, N2, N3).inOrder(); assertThat(graph.adjacentNodes(N1)).containsExactly(N4, N5); assertThat(graph.adjacentNodes(N2)).containsExactly(N3); assertThat(graph.adjacentNodes(N3)).containsExactly(N2); assertThat(graph.adjacentNodes(N4)).containsExactly(N1); assertThat(graph.adjacentNodes(N5)).containsExactly(N1); } @Test
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 12.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/convert_control_to_data_outputs.mlir
} func.return %graph#0, %graph#1, %graph#2, %graph#3 : !tf_res, !tf_res, tensor<f32>, tensor<f32> } // CHECK-LABEL: func @unconnected_while_cond func.func @unconnected_while_cond(%arg0: !tf_res, %arg1: !tf_res, %arg2: tensor<f32>, %arg3: tensor<f32>) -> (tensor<i32>) { %graph = tf_executor.graph { %island, %ctrl = tf_executor.island {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 22 18:35:00 UTC 2024 - 68.9K bytes - Viewed (0)