- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 131 for Predecessors (0.26 sec)
-
tensorflow/compiler/mlir/tensorflow/utils/topological_sort.h
namespace mlir { namespace TF { // A function that determines which op to emit next in the case of ties. // The predecessor (which can be null) is the last op we emitted, // and op is the candidate we're considering. A larger returned integer // means the op has a higher chance of being emitted first. typedef int (*PriorityFunction)(Operation *predecessor, Operation *op); // A function that returns extra dependencies for each op. These might
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Nov 08 17:01:11 UTC 2022 - 3.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/debug.go
state.currentState.reset(ourStartState) } // Zero predecessors if len(preds) == 0 { if previousBlock != nil { state.f.Fatalf("Function %v, block %s with no predecessors is not first block, has previous %s", state.f, b.String(), previousBlock.String()) } // startState is empty reset(abt.T{}) return abt.T{}, blockChanged } // One predecessor l0 := blockLocs[preds[0].ID] p0 := l0.endState
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 58.4K bytes - Viewed (0) -
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) -
android/guava/src/com/google/common/graph/DirectedNetworkConnections.java
return new DirectedNetworkConnections<>( ImmutableBiMap.copyOf(inEdges), ImmutableBiMap.copyOf(outEdges), selfLoopCount); } @Override public Set<N> predecessors() { return Collections.unmodifiableSet(((BiMap<E, N>) inEdgeMap).values()); } @Override public Set<N> successors() { return Collections.unmodifiableSet(((BiMap<E, N>) outEdgeMap).values()); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Oct 01 17:18:04 UTC 2021 - 2.2K bytes - Viewed (0) -
guava/src/com/google/common/graph/DirectedNetworkConnections.java
return new DirectedNetworkConnections<>( ImmutableBiMap.copyOf(inEdges), ImmutableBiMap.copyOf(outEdges), selfLoopCount); } @Override public Set<N> predecessors() { return Collections.unmodifiableSet(((BiMap<E, N>) inEdgeMap).values()); } @Override public Set<N> successors() { return Collections.unmodifiableSet(((BiMap<E, N>) outEdgeMap).values()); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Oct 01 17:18:04 UTC 2021 - 2.2K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/DefaultInheritanceAssembler.java
Object key = getPluginKey().apply(plugin); master.put(key, plugin); } } Map<Object, List<Plugin>> predecessors = new LinkedHashMap<>(); List<Plugin> pending = new ArrayList<>(); for (Plugin element : tgt) { Object key = getPluginKey().apply(element);
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Apr 12 10:50:18 UTC 2024 - 13.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/tpu_validate_inputs.cc
} } return successors; } // Gets the predecessors of an op wrapped in tf_executor.island. llvm::SmallVector<Operation*> GetPredecessors(Operation* op) { llvm::SmallVector<Operation*> predecessors; for (auto operand : op->getOperands()) { if (Operation* pred = operand.getDefiningOp()) { pred->walk([&](mlir::Operation* opinexecutor) { predecessors.push_back(opinexecutor); }); } }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 07 06:51:01 UTC 2024 - 21.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ElementOrder.java
* <li>{@code predecessors(node)}: Connecting edge insertion order * <li>{@code successors(node)}: Connecting edge insertion order * <li>{@code incidentEdges(node)}: Edge insertion order * </ul> * <li>For {@link Network}: * <ul> * <li>{@code adjacentNodes(node)}: Stable order * <li>{@code predecessors(node)}: Connecting edge insertion order
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Oct 01 17:18:04 UTC 2021 - 6.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardNetwork.java
} @Override public Set<E> outEdges(N node) { return nodeInvalidatableSet(checkedConnections(node).outEdges(), 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); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 6.9K bytes - Viewed (0) -
guava/src/com/google/common/graph/ElementOrder.java
* <li>{@code predecessors(node)}: Connecting edge insertion order * <li>{@code successors(node)}: Connecting edge insertion order * <li>{@code incidentEdges(node)}: Edge insertion order * </ul> * <li>For {@link Network}: * <ul> * <li>{@code adjacentNodes(node)}: Stable order * <li>{@code predecessors(node)}: Connecting edge insertion order
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Oct 01 17:18:04 UTC 2021 - 6.7K bytes - Viewed (0)