- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 46 for predecessor (0.18 sec)
-
guava/src/com/google/common/graph/Graphs.java
} @Override Graph<N> delegate() { return graph; } @Override public Set<N> predecessors(N node) { return delegate().successors(node); // transpose } @Override public Set<N> successors(N node) { return delegate().predecessors(node); // transpose } @Override public Set<EndpointPair<N>> incidentEdges(N node) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.7K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/DefaultInheritanceAssembler.java
Object key = getPluginKey().apply(plugin); master.put(key, plugin); } } Map<Object, List<Plugin>> predecessors = new LinkedHashMap<>(); List<Plugin> pending = new ArrayList<>(); for (Plugin element : tgt) { Object key = getPluginKey().apply(element);
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Apr 12 10:50:18 UTC 2024 - 13.8K bytes - Viewed (0) -
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/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/loopreschedchecks.go
idom := f.Idom() po := f.postorder() // The ordering in the dominator tree matters; it's important that // the walk of the dominator tree also be a preorder (i.e., a node is // visited only after all its non-backedge predecessors have been visited). sdom := newSparseOrderedTree(f, idom, po) if f.pass.debug > 1 { fmt.Printf("before %s = %s\n", f.Name, sdom.treestructure(f.Entry)) } tofixBackedges := []edgeMem{}
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 22 21:17:10 UTC 2023 - 16K bytes - Viewed (0)