- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 131 for Predecessors (0.28 sec)
-
src/cmd/compile/internal/ssa/fuse_branchredirect.go
// // The implementation here borrows the framework of the prove pass. // // 1, Traverse all blocks of function f to find If blocks. // 2, For any If block b, traverse all its predecessors to find If blocks. // 3, For any If block predecessor p, update relationship p->b. // 4, Traverse all successors of b. // 5, For any successor s of b, try to update relationship b->s, if a
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 16 21:40:11 UTC 2023 - 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/src/com/google/common/graph/UndirectedGraphConnections.java
} @Override public Set<N> adjacentNodes() { return Collections.unmodifiableSet(adjacentNodeValues.keySet()); } @Override public Set<N> predecessors() { return adjacentNodes(); } @Override public Set<N> successors() { return adjacentNodes(); } @Override public Iterator<EndpointPair<N>> incidentEdgeIterator(N thisNode) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Oct 06 00:47:57 UTC 2021 - 3.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/UndirectedGraphConnections.java
} @Override public Set<N> adjacentNodes() { return Collections.unmodifiableSet(adjacentNodeValues.keySet()); } @Override public Set<N> predecessors() { return adjacentNodes(); } @Override public Set<N> successors() { return adjacentNodes(); } @Override public Iterator<EndpointPair<N>> incidentEdgeIterator(N thisNode) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Oct 06 00:47:57 UTC 2021 - 3.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/tf_test_passes.td
} def TestSideEffectAnalysisPass : Pass<"tf-test-side-effect-analysis", "ModuleOp"> { let summary = "Test pass for analyzing side-effect analysis result"; let description = [{ Adds "Predecessors" and "Successors" remarks for each op based on the SideEffectAnalysis result. For testing purpose only. }]; let constructor = "::mlir::tf_test::CreateTestSideEffectAnalysisPass()"; }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Mar 03 00:21:29 UTC 2023 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
} @Override public Set<N> adjacentNodes(N node) { return AbstractNetwork.this.adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return AbstractNetwork.this.predecessors(node); } @Override public Set<N> successors(N node) { return AbstractNetwork.this.successors(node); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Mar 13 18:17:09 UTC 2024 - 10.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractNetwork.java
} @Override public Set<N> adjacentNodes(N node) { return AbstractNetwork.this.adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return AbstractNetwork.this.predecessors(node); } @Override public Set<N> successors(N node) { return AbstractNetwork.this.successors(node); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Mar 13 18:17:09 UTC 2024 - 10.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/trim.go
f.Blocks[n] = b n++ continue } bPos := b.Pos bIsStmt := bPos.IsStmt() == src.PosIsStmt // Splice b out of the graph. NOTE: `mergePhi` depends on the // order, in which the predecessors edges are merged here. p, i := b.Preds[0].b, b.Preds[0].i s, j := b.Succs[0].b, b.Succs[0].i ns := len(s.Preds) p.Succs[i] = Edge{s, j} s.Preds[j] = Edge{p, i} for _, e := range b.Preds[1:] {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 4.2K bytes - Viewed (0) -
docs/en/docs/history-design-future.md
As part of that, I needed to investigate, test and use many alternatives. The history of **FastAPI** is in great part the history of its predecessors. As said in the section [Alternatives](alternatives.md){.internal-link target=_blank}: <blockquote markdown="1"> **FastAPI** wouldn't exist if not for the previous work of others.
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Fri Mar 22 01:42:11 UTC 2024 - 4.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/GraphBuilder.java
return newBuilder; } /** * Specifies the order of iteration for the elements of {@link Graph#edges()}, {@link * Graph#adjacentNodes(Object)}, {@link Graph#predecessors(Object)}, {@link * Graph#successors(Object)} and {@link Graph#incidentEdges(Object)}. * * <p>The default value is {@link ElementOrder#unordered() unordered} for mutable graphs. For
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 03 01:21:31 UTC 2022 - 7.3K bytes - Viewed (0)