- Sort Score
- Result 10 results
- Languages All
Results 121 - 130 of 152 for predecessor (0.3 sec)
-
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) -
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) -
android/guava/src/com/google/common/graph/AbstractDirectedNetworkConnections.java
this.selfLoopCount = checkNonNegative(selfLoopCount); checkState(selfLoopCount <= inEdgeMap.size() && selfLoopCount <= outEdgeMap.size()); } @Override public Set<N> adjacentNodes() { return Sets.union(predecessors(), successors()); } @Override public Set<E> incidentEdges() { return new AbstractSet<E>() { @Override public UnmodifiableIterator<E> iterator() { Iterable<E> incidentEdges =
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.5K 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) -
guava/src/com/google/common/graph/SuccessorsFunction.java
* * <pre>{@code * someGraphAlgorithm(startNode, node -> ImmutableList.of(node.leftChild(), node.rightChild())); * }</pre> * * <p>Graph algorithms that need additional capabilities (accessing both predecessors and * successors, iterating over the edges, etc.) should declare their input to be of a type that * provides those capabilities, such as {@link Graph}, {@link ValueGraph}, or {@link Network}. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.3K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractDirectedNetworkConnections.java
this.selfLoopCount = checkNonNegative(selfLoopCount); checkState(selfLoopCount <= inEdgeMap.size() && selfLoopCount <= outEdgeMap.size()); } @Override public Set<N> adjacentNodes() { return Sets.union(predecessors(), successors()); } @Override public Set<E> incidentEdges() { return new AbstractSet<E>() { @Override public UnmodifiableIterator<E> iterator() { Iterable<E> incidentEdges =
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.5K bytes - Viewed (0)