- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 17 for Edges (0.04 sec)
-
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/builder/NodeState.java
// If none of the incoming edges are transitive, remove previous state and do not traverse. // If not traversed before, simply add all selected outgoing edges (either hard or pending edges) // If traversed before: // If net exclusions for this node have not changed, ignore // If net exclusions for this node have changed, remove previous state and traverse outgoing edges again.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jun 07 14:19:34 UTC 2024 - 58.9K bytes - Viewed (0) -
tensorflow/compiler/jit/encapsulate_subgraphs_pass.cc
} Status Encapsulator::AddEdgesToOutputGraph( const absl::flat_hash_map<const Node*, Node*>& node_images, Graph* graph_out) { // Set of edges already added to the output graph, represented as (src, dst) // pairs. We use the set to deduplicate edges; multiple edges in the input // graph may map to one edge in the output graph. absl::flat_hash_set<std::pair<OutputTensor, InputTensor>,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 22 08:47:20 UTC 2024 - 51K bytes - Viewed (0) -
tensorflow/c/c_api_function_test.cc
const tensorflow::FunctionDef& fdef, const std::vector<EdgeSpec>& e_edges, // expected edges const std::vector<EdgeSpec>& c_edges, // expected ctrl edges bool is_exact_edges = true) { // Build a set of edges from fdef std::set<EdgeSpec> a_edges; // actual edges // Get edges from inputs to body nodes and between body nodes for (const NodeDef& node_def : fdef.node_def()) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Jul 20 22:08:54 UTC 2023 - 63.6K bytes - Viewed (0) -
tensorflow/compiler/jit/mark_for_compilation_pass.cc
// cost function, nor can we look at global information while deciding on // individual edges to contract. Instead, we will make decisions on these // important edges then make decisions on all other edges, causing the highest // chance of all most important edges to be contracted. // // An example of where this might occur is with a digraph:
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 21 12:19:41 UTC 2024 - 85.3K bytes - Viewed (0) -
platforms/software/dependency-management/src/integTest/groovy/org/gradle/integtests/resolve/suppliers/DynamicRevisionRemoteResolveWithMetadataSupplierIntegrationTest.groovy
} } """ metadataSupplierClass = 'MP' null } def checkResolve(Map edges) { assert succeeds('checkDeps') resolve.expectGraph { root(":", ":test:") { edges.each { from, to -> if (to instanceof List) { edge(from, to[0]).byReason(to[1]).maybeRequested()
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Apr 01 11:46:17 UTC 2024 - 49K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/regalloc.go
// such predecessor provides the starting register state for a block. // // It also requires that there are no critical edges (critical = // comes from a block with >1 successor and goes to a block with >1 // predecessor). This makes it easy to add fixup code on merge edges - // the source of a merge edge has only one successor, so we can add // fixup code to the end of that block. // Spilling //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 17:49:56 UTC 2023 - 87.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/prove.go
return } // Consider outgoing edges from this block. parent := b for i, branch := range [...]branch{positive, negative} { child := parent.Succs[i].b if getBranch(sdom, parent, child) != unknown { // For edges to uniquely dominated blocks, we // already did this when we visited the child. continue } // For edges to other blocks, this can trim a branch
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:30:21 UTC 2024 - 48.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/sparsecore/embedding_pipelining.cc
// that was extracted.. // Find the input edges to form the set of operands to the new function call. llvm::SetVector<Value> inputs; for (Operation* op : ops) { for (Value operand : op->getOperands()) { Operation* defining_op = operand.getDefiningOp(); if (!ops.contains(defining_op)) inputs.insert(operand); } } // Find the output edges to form the set of resutls of the new function call.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 92.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/flatbuffer_import.cc
context, {mlir::StringAttr::get(context, signature->signature_key)})); } // There are control nodes at each end of each control edge. For each of them, // we store the source vertices of the incoming edges (if any) and the control // node's output token. To improve testability, we use an ordered set for the // source vertices. struct ControlNodeDesc { std::set<int> incoming; std::optional<mlir::Value> outgoing;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 21 18:21:50 UTC 2024 - 66.8K bytes - Viewed (0) -
platforms/software/dependency-management/src/integTest/groovy/org/gradle/integtests/resolve/transform/ArtifactTransformWithDependenciesIntegrationTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Oct 24 06:54:47 UTC 2023 - 54.2K bytes - Viewed (0)