- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 53 for Edges (0.04 sec)
-
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/artifact/ResolvedArtifactsGraphVisitor.java
} } if (node.isRoot() || hasTransitiveIncomingEdge) { // Since file dependencies are not modeled as actual edges, we need to verify // there are edges to this node that would follow this file dependency. for (LocalFileDependencyMetadata fileDependency : node.getOutgoingFileEdges()) { int id = nextId++;
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jun 07 02:21:08 UTC 2024 - 6.2K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/DependencyGraphNode.java
Collection<? extends DependencyGraphEdge> getIncomingEdges(); Collection<? extends DependencyGraphEdge> getOutgoingEdges(); /** * The outgoing file dependencies of this node. Should be modelled edges to another node, but are treated separately for now. */ Set<? extends LocalFileDependencyMetadata> getOutgoingFileEdges(); VariantGraphResolveMetadata getMetadata(); boolean isSelected();
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jun 07 14:19:34 UTC 2024 - 1.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/stablehlo/odml_converter/passes.td
let description = [{ Outline specific patterns into composites. Specific patterns can be any sub-DAG within a single `Block*`. The signature of the new composite matches the inupt and output edges from a node in the sub-DAG to a node out of it. The associated decomposition has the same semantic as the matched ops, but may not have identical structure. }]; let options = [];
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 08 19:05:30 UTC 2024 - 1.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/mlir_graph_optimization_pass.cc
<< (*graph)->num_edges(); is_module_updated = true; } } else if (pass_state == MlirOptimizationPassState::FallbackEnabled) { VLOG(2) << "Run MLIR graph optimization pass with fallback: " << StringRefToView(name); VLOG(2) << "Graph #nodes " << (*graph)->num_nodes() << " #edges " << (*graph)->num_edges();
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Jun 12 22:19:26 UTC 2024 - 18.5K bytes - Viewed (0) -
tensorflow/cc/framework/gradients.cc
auto const& pair = visited.insert(nout.node()); if (pair.second) { queue.push_back(std::make_pair(nout.node(), static_cast<Node*>(nullptr))); } } // BFS from nodes in 'inputs_' along out edges for the entire graph. Internal // output nodes are recorded during the traversal. All nodes that are output // nodes but not internal output nodes are considered the frontier of the
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sat Apr 13 05:57:22 UTC 2024 - 22K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/compile.go
{"tighten tuple selectors", "schedule"}, // remove critical edges before phi tighten, so that phi args get better placement {"critical", "phi tighten"}, // don't layout blocks until critical edges have been removed {"critical", "layout"}, // regalloc requires the removal of all critical edges {"critical", "regalloc"}, // regalloc requires all the values in a block to be scheduled
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 22 14:55:18 UTC 2024 - 18.6K bytes - Viewed (0) -
tensorflow/cc/framework/scope.h
/// successful. Otherwise, return the error status. // TODO(josh11b, keveman): Make this faster; right now it converts // Graph->GraphDef->Graph. This cleans up the graph (e.g. adds // edges from the source and to the sink node, resolves back edges // by name), and makes sure the resulting graph is valid. Status ToGraph( Graph* g, GraphConstructorOptions opts = GraphConstructorOptions{}) const;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sat Apr 13 09:08:33 UTC 2024 - 10.5K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/builder/ModuleResolveState.java
assert newSelection != null; assert this.selected != newSelection; assert newSelection.getModule() == this; changingSelection = true; // Remove any outgoing edges for the current selection selected.removeOutgoingEdges(); this.selected = newSelection; this.replaced = false; doRestart(newSelection); changingSelection = false;
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jun 07 02:21:08 UTC 2024 - 18.7K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/stablehlo/passes/replace_stablehlo_ops_in_main_function_with_xla_call_module_ops.cc
// // A variable is live if it holds a value that may be used in the future. // It is live-in at node n if it is live on any of the node's in-edges. // It is live-out at node n if it is live on any of the node's out-edges. // def[n] refers to values that are defined at node n. // use[n] refers to values that are used at node n. // // Given a node n, variables' liveliness is defined like the following:
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 21K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/builder/EdgeState.java
import org.gradle.internal.resolve.ModuleVersionResolveException; import javax.annotation.Nullable; import java.util.LinkedList; import java.util.List; /** * Represents the edges in the dependency graph. * * A dependency can have the following states: * 1. Unattached: in this case the state of the dependency is tied to the state of it's associated {@link SelectorState}.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jun 07 02:21:08 UTC 2024 - 18.1K bytes - Viewed (0)