- Sort Score
- Result 10 results
- Languages All
Results 121 - 130 of 1,985 for grape (0.25 sec)
-
subprojects/composite-builds/src/test/groovy/org/gradle/composite/internal/DefaultIncludedBuildTaskGraphTest.groovy
} def "cannot schedule tasks when graph has not been created"() { when: graph.locateTask(taskIdentifier(DefaultBuildIdentifier.ROOT, ":task")).queueForExecution() then: def e = thrown(IllegalStateException) e.message == "No work graph available for this thread." } def "cannot schedule tasks when after graph has finished execution"() { when:
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Mar 08 10:04:24 UTC 2024 - 5.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/breakup-islands.mlir
} tf_executor.fetch %island#0, %island#1 : tensor<*xi32>, tensor<*xi32> } func.return %graph#0, %graph#1 : tensor<*xi32>, tensor<*xi32> } // CHECK-LABEL: func @multiple_return // CHECK: %[[GRAPH:.*]]:2 = tf_executor.graph { // CHECK: %[[ADD1:.*]], %[[ADD1_control:.*]] = tf_executor.island wraps "tf.Add"(%arg0, %arg1)
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Oct 31 08:59:10 UTC 2023 - 28.5K bytes - Viewed (0) -
tensorflow/compiler/jit/partially_decluster_pass.cc
// cluster. Status PartiallyDeclusterGraph(Graph* graph) { // When deciding whether to decluster a particular node, we base our decision // on if we've decided that some of its consumers have to be declustered too. // Iterating the graph in post-order guarantees that consumers have been // visited before producers. std::vector<Node*> post_order; GetPostOrder(*graph, &post_order, /*stable_comparator=*/NodeComparatorName(),
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Feb 09 11:36:41 UTC 2024 - 15.7K bytes - Viewed (0) -
platforms/core-configuration/graph-serialization/src/main/kotlin/org/gradle/internal/serialize/graph/package-info.java
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Sat Jun 08 11:29:30 UTC 2024 - 4.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConstants.java
static final String EDGE_NOT_IN_GRAPH = "Edge %s is not an element of this graph."; static final String NODE_REMOVED_FROM_GRAPH = "Node %s that was used to generate this set is no longer in the graph."; static final String NODE_PAIR_REMOVED_FROM_GRAPH = "Node %s or node %s that were used to generate this set are no longer in the graph."; static final String EDGE_REMOVED_FROM_GRAPH =
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 3.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/ImmutableGraph.java
@SuppressWarnings("Immutable") // The backing graph must be immutable. private final BaseGraph<N> backingGraph; ImmutableGraph(BaseGraph<N> backingGraph) { this.backingGraph = backingGraph; } /** Returns an immutable copy of {@code graph}. */ public static <N> ImmutableGraph<N> copyOf(Graph<N> graph) { return (graph instanceof ImmutableGraph) ? (ImmutableGraph<N>) graph : new ImmutableGraph<N>(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 01 16:30:37 UTC 2022 - 7.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/SuccessorsFunction.java
* * <h3>Usage</h3> * * Given an algorithm, for example: * * <pre>{@code * public <N> someGraphAlgorithm(N startNode, SuccessorsFunction<N> successorsFunction); * }</pre> * * you will invoke it depending on the graph representation you're using. * * <p>If you have an instance of one of the primary {@code common.graph} types ({@link Graph}, * {@link ValueGraph}, and {@link Network}):
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.3K bytes - Viewed (0) -
tensorflow/compiler/jit/xla_compile_util.cc
} // namespace absl::StatusOr<std::unique_ptr<Graph>> CreateSingleOpGraph( const NodeDef& node_def, absl::Span<const XlaArgument> args, absl::Span<const DataType> result_types) { // TODO(b/74182462): We implement this by creating a new dummy Graph including // _Arg nodes, and let CompileGraph walk it. This could be optimized. std::unique_ptr<Graph> graph(new Graph(OpRegistry::Global()));
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/mlir/tensorflow/translate/export_graphdef.h
#include "tensorflow/compiler/mlir/tensorflow/translate/mlir_roundtrip_flags.h" #include "tensorflow/core/framework/function.h" #include "tensorflow/core/framework/graph.pb.h" #include "tensorflow/core/framework/node_def.pb.h" #include "tensorflow/core/graph/graph.h" namespace tensorflow { ABSL_DEPRECATED("Use tensorflow::tf2xla::api::ConvertMlirToGraphdef instead.") // Given an MLIR module, returns a GraphDef.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Jun 12 22:19:26 UTC 2024 - 3.1K bytes - Viewed (0) -
maven-core/src/test/java/org/apache/maven/lifecycle/internal/builder/multithreaded/ConcurrencyDependencyGraphTest.java
assertEquals(1, graph.getFinishedProjects().size()); graph.markAsFinished(ProjectDependencyGraphStub.A); // still only A assertEquals(1, graph.getFinishedProjects().size()); Set<MavenProject> unfinishedProjects = graph.getUnfinishedProjects(); assertEquals(5, unfinishedProjects.size()); graph.markAsFinished(schedulableNewProcesses.get(0));
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Sat Apr 15 17:24:20 UTC 2023 - 3.8K bytes - Viewed (0)