- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 58 for Predecessors (0.14 sec)
-
android/guava/src/com/google/common/graph/AbstractValueGraph.java
} @Override public Set<N> adjacentNodes(N node) { return AbstractValueGraph.this.adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return AbstractValueGraph.this.predecessors(node); } @Override public Set<N> successors(N node) { return AbstractValueGraph.this.successors(node); } @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 17 13:59:28 UTC 2023 - 4K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractValueGraph.java
} @Override public Set<N> adjacentNodes(N node) { return AbstractValueGraph.this.adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return AbstractValueGraph.this.predecessors(node); } @Override public Set<N> successors(N node) { return AbstractValueGraph.this.successors(node); } @Override
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 17 13:59:28 UTC 2023 - 4.3K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/DefaultProfileInjector.java
for (Plugin element : tgt) { Object key = getPluginKey().apply(element); master.put(key, element); } Map<Object, List<Plugin>> predecessors = new LinkedHashMap<>(); List<Plugin> pending = new ArrayList<>(); for (Plugin element : src) { Object key = getPluginKey().apply(element);
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Apr 12 10:50:18 UTC 2024 - 9.5K bytes - Viewed (0) -
android/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) -
src/cmd/compile/internal/ssa/numberlines.go
change = true } if change { ranges[i] = lp } } // Visit in reverse post order so that all non-loop predecessors come first. for j := len(po) - 1; j >= 0; j-- { b := po[j] // Find the first interesting position and check to see if it differs from any predecessor firstPos := src.NoXPos firstPosIndex := -1 if b.Pos.IsStmt() != src.PosNotStmt { note(b.Pos) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 14 21:26:13 UTC 2023 - 7.8K bytes - Viewed (0) -
subprojects/core/src/main/java/org/gradle/execution/plan/edges/DependentNodesSet.java
} @Override public void visitAllNodes(Consumer<Node> visitor) { } }; /** * The dependency predecessors, in order. */ default SortedSet<Node> getDependencyPredecessors() { return ImmutableSortedSet.of(); } DependentNodesSet addDependencyPredecessors(Node fromNode);
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Sep 12 20:17:10 UTC 2022 - 2.4K 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) -
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)