- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 27 for predecessor (0.16 sec)
-
tensorflow/compiler/mlir/tensorflow/transforms/sparsecore/sparsecore_passes.td
let constructor = "TFDevice::CreateEmbeddingProgramKeyPass()"; let description = [{ Passes in the program key to embedding ops. Will move the embedding ops after a _TPUCompileMlir op if there is no predecessor _TPUCompileMlir op. Both the embedding op and compile op are assumed to be wrapped in separate tf_device.launch() ops. This is because the embedding op is head outside
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Mar 28 23:42:09 UTC 2024 - 3.9K bytes - Viewed (0) -
platforms/core-configuration/model-core/src/main/java/org/gradle/model/internal/registry/ModelBinding.java
* the target state, not the input state. Implicitly, a rule accepts as input the subject in the state that is the predecessor of the target state. */ public BindingPredicate getPredicate() { return predicate; } public boolean isBound() { return boundTo != null; }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Sep 28 09:51:04 UTC 2023 - 3.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/replicate_invariant_op_hoisting.cc
return WalkResult::interrupt(); return WalkResult::advance(); }); return result.wasInterrupted(); } // Make invariant the `ShapeOp`s or a `ReadVariableOp` that's the `ShapeOp`'s // predecessor. void MakeShapeOpInvariant(tf_device::ReplicateOp replicate_op, int num_replicas, Block* replicate_block, TF::ShapeOp shape_op) { // Ignore ShapeOps that have virtual devices.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 7.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 8.5K bytes - Viewed (0) -
src/internal/dag/parse.go
} for _, r := range rules { if r.op == "!<" { disallowed = append(disallowed, r) continue } for _, def := range r.def { if def == "NONE" { errorf("NONE cannot be a predecessor") continue } if !g.addNode(def) { errorf("multiple definitions for %s", def) } for _, less := range r.less { if less == "NONE" { continue }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 6.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadcode.go
// Note: this is trickier than it looks. Replacing // a Phi with a Copy can in general cause problems because // Phi and Copy don't have exactly the same semantics. // Phi arguments always come from a predecessor block, // whereas copies don't. This matters in loops like: // 1: x = (Phi y) // y = (Add x 1) // goto 1 // If we replace Phi->Copy, we get // 1: x = (Copy y) // y = (Add x 1)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Dec 08 00:29:01 UTC 2023 - 9.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/BaseGraph.java
ElementOrder<N> nodeOrder(); /** * Returns an {@link ElementOrder} that specifies the order of iteration for the elements of * {@link #edges()}, {@link #adjacentNodes(Object)}, {@link #predecessors(Object)}, {@link * #successors(Object)} and {@link #incidentEdges(Object)}. * * @since 29.0 */ ElementOrder<N> incidentEdgeOrder(); // // Element-level accessors // /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 8.8K bytes - Viewed (0) -
guava/src/com/google/common/graph/BaseGraph.java
ElementOrder<N> nodeOrder(); /** * Returns an {@link ElementOrder} that specifies the order of iteration for the elements of * {@link #edges()}, {@link #adjacentNodes(Object)}, {@link #predecessors(Object)}, {@link * #successors(Object)} and {@link #incidentEdges(Object)}. * * @since 29.0 */ ElementOrder<N> incidentEdgeOrder(); // // Element-level accessors // /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 8.8K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/DefaultProfileInjector.java
for (Plugin element : tgt) { Object key = getPluginKey().apply(element); master.put(key, element); } Map<Object, List<Plugin>> predecessors = new LinkedHashMap<>(); List<Plugin> pending = new ArrayList<>(); for (Plugin element : src) { Object key = getPluginKey().apply(element);
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Apr 12 10:50:18 UTC 2024 - 9.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardValueGraph.java
@Override public Set<N> adjacentNodes(N node) { return nodeInvalidatableSet(checkedConnections(node).adjacentNodes(), node); } @Override public Set<N> predecessors(N node) { return nodeInvalidatableSet(checkedConnections(node).predecessors(), node); } @Override public Set<N> successors(N node) { return nodeInvalidatableSet(checkedConnections(node).successors(), node); } @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 6.1K bytes - Viewed (0)