- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 152 for predecessor (0.17 sec)
-
guava/src/com/google/common/graph/NetworkConnections.java
* * <p>In the directed case, {@code edge} is assumed to be an outgoing edge. */ N adjacentNode(E edge); /** * Remove {@code edge} from the set of incoming edges. Returns the former predecessor node. * * <p>In the undirected case, returns {@code null} if {@code isSelfLoop} is true. */ @CanIgnoreReturnValue @CheckForNull N removeInEdge(E edge, boolean isSelfLoop);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 2.3K bytes - Viewed (0) -
guava/src/com/google/common/graph/GraphConnections.java
/** Remove {@code node} from the set of predecessors. */ void removePredecessor(N node); /** * Remove {@code node} from the set of successors. Returns the value previously associated with * the edge connecting the two nodes. */ @CanIgnoreReturnValue @CheckForNull V removeSuccessor(N node); /** * Add {@code node} as a predecessor to the origin node. In the case of an undirected graph, it
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 2.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/order_by_dialect.cc
public: MLIR_DEFINE_EXPLICIT_INTERNAL_INLINE_TYPE_ID(OrderByDialectPass) void runOnOperation() override; }; int DialectOrdering(Operation* predecessor, Operation* op) { return predecessor && predecessor->getName().getDialectNamespace() == op->getName().getDialectNamespace(); } void OrderByDialectPass::runOnOperation() { ModuleOp module = getOperation();
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Nov 08 17:01:11 UTC 2022 - 3.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/breakup-islands.cc
const auto predecessors = side_effect_analysis.DirectControlPredecessors(&sub_op); // Get the controls from the predecessors. llvm::SmallVector<Value, 4> predecessor_controls; predecessor_controls.reserve(predecessors.size()); for (auto predecessor : predecessors) { predecessor_controls.push_back(new_control_for_sub_ops[predecessor]); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Aug 11 20:52:36 UTC 2023 - 16.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/NetworkConnections.java
* * <p>In the directed case, {@code edge} is assumed to be an outgoing edge. */ N adjacentNode(E edge); /** * Remove {@code edge} from the set of incoming edges. Returns the former predecessor node. * * <p>In the undirected case, returns {@code null} if {@code isSelfLoop} is true. */ @CanIgnoreReturnValue @CheckForNull N removeInEdge(E edge, boolean isSelfLoop);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 2.3K bytes - Viewed (0) -
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/critical.go
// block, then we need to remove the // corresponding elements from the block // predecessors and phi args if reusedBlock { // Add p->d edge p.Succs[pi] = Edge{d, len(d.Preds)} d.Preds = append(d.Preds, Edge{p, pi}) // Remove p as a predecessor from b. b.removePred(i) // Update corresponding phi args b.removePhiArg(phi, i)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 16 21:40:11 UTC 2023 - 3.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractGraphTest.java
} assertThat( graph.predecessors(node).contains(adjacentNode) || graph.successors(node).contains(adjacentNode)) .isTrue(); } for (N predecessor : sanityCheckSet(graph.predecessors(node))) { assertThat(graph.successors(predecessor)).contains(node); assertThat(graph.hasEdgeConnecting(predecessor, node)).isTrue();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 16.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/utils/topological_sort.cc
int incoming_ctrl_edges = 0; int incoming_data_edges = 0; op.walk([&](Operation* child) { ancestor[child] = &op; for (Operation* predecessor : ctrlPredecessors(child)) { if (predecessor->getBlock() == &block) { incoming_ctrl_edges++; } } for (Value v : child->getOperands()) { if (v.getParentBlock() == &block) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Nov 08 17:01:11 UTC 2022 - 5K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/analysis/side_effect_analysis.cc
for (auto& entry : control_predecessors_) { auto op = entry.getFirst(); auto& predecessors = entry.getSecond(); auto& sorted_predecessors = sorted_control_predecessors_[op]; for (Operation* predecessor : predecessors) { sorted_predecessors.push_back(predecessor); sorted_control_successors_[predecessor].push_back(op); } } control_predecessors_.clear();
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 15 09:04:13 UTC 2024 - 41.2K bytes - Viewed (0)