- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 91 for predecessor (0.2 sec)
-
android/guava/src/com/google/common/graph/ValueGraph.java
@Override 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 */ @Override 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 - 15K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
@Override 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 */ @Override 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 - 13.6K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graph.java
@Override 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 */ @Override 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 - 13.6K bytes - Viewed (0) -
guava/src/com/google/common/graph/ValueGraph.java
@Override 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 */ @Override 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 - 16K 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/ssagen/ssa.go
} return &ssa.FuncLines{Filename: file, StartLineno: start, Lines: lines}, nil } // updateUnsetPredPos propagates the earliest-value position information for b // towards all of b's predecessors that need a position, and recurs on that // predecessor if its position is updated. B should have a non-empty position. func (s *state) updateUnsetPredPos(b *ssa.Block) { if b.Pos == src.NoXPos { s.Fatalf("Block %s should have a position", b) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 284.9K 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) -
src/cmd/compile/internal/ssa/func_test.go
"testing" ) // Compare two Funcs for equivalence. Their CFGs must be isomorphic, // and their values must correspond. // Requires that values and predecessors are in the same order, even // though Funcs could be equivalent when they are not. // TODO(matloob): Allow values and predecessors to be in different // orders if the CFG are otherwise equivalent. func Equiv(f, g *Func) bool { valcor := make(map[*Value]*Value)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 08 19:01:04 UTC 2023 - 13.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/fuse_test.go
for k, b := range fun.blocks { if k[:1] == "z" && b.Kind != BlockInvalid { t.Errorf("case2 %s was not eliminated, but should have", k) } } // Case 3, empty blocks with multiple predecessors, z0 and z1 will be eliminated. // entry // | \ // | b0 // | / \ // z0 z1 // \ / // exit fun = c.Fun("entry", Bloc("entry",
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 31 20:45:54 UTC 2023 - 7.4K bytes - Viewed (0)