- Sort Score
- Result 10 results
- Languages All
Results 111 - 120 of 152 for predecessor (0.18 sec)
-
android/guava/src/com/google/common/graph/StandardNetwork.java
} @Override public Set<E> outEdges(N node) { return nodeInvalidatableSet(checkedConnections(node).outEdges(), 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); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 6.9K bytes - Viewed (0) -
guava/src/com/google/common/graph/ElementOrder.java
* <li>{@code predecessors(node)}: Connecting edge insertion order * <li>{@code successors(node)}: Connecting edge insertion order * <li>{@code incidentEdges(node)}: Edge insertion order * </ul> * <li>For {@link Network}: * <ul> * <li>{@code adjacentNodes(node)}: Stable order * <li>{@code predecessors(node)}: Connecting edge insertion order
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Oct 01 17:18:04 UTC 2021 - 6.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/StandardNetwork.java
} @Override public Set<E> outEdges(N node) { return nodeInvalidatableSet(checkedConnections(node).outEdges(), 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); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 6.9K 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) -
android/guava/src/com/google/common/graph/AbstractUndirectedNetworkConnections.java
final Map<E, N> incidentEdgeMap; AbstractUndirectedNetworkConnections(Map<E, N> incidentEdgeMap) { this.incidentEdgeMap = checkNotNull(incidentEdgeMap); } @Override public Set<N> predecessors() { return adjacentNodes(); } @Override public Set<N> successors() { return adjacentNodes(); } @Override public Set<E> incidentEdges() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 2.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/IncidentEdgeSet.java
} Object source = endpointPair.source(); Object target = endpointPair.target(); return (node.equals(source) && graph.successors(node).contains(target)) || (node.equals(target) && graph.predecessors(node).contains(source)); } else { if (endpointPair.isOrdered()) { return false; } Set<N> adjacent = graph.adjacentNodes(node); Object nodeU = endpointPair.nodeU();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 2.3K bytes - Viewed (0) -
guava/src/com/google/common/graph/IncidentEdgeSet.java
} Object source = endpointPair.source(); Object target = endpointPair.target(); return (node.equals(source) && graph.successors(node).contains(target)) || (node.equals(target) && graph.predecessors(node).contains(source)); } else { if (endpointPair.isOrdered()) { return false; } Set<N> adjacent = graph.adjacentNodes(node); Object nodeU = endpointPair.nodeU();
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 2.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/test_side_effect_analysis.cc
return llvm::join(id_vec, ","); }; func.walk([&](Operation* op) { if (!analysis.DirectControlPredecessors(op).empty()) { op->emitRemark("Predecessors: ") << "{" << join_ids(analysis.DirectControlPredecessors(op)) << "}"; } if (!analysis.DirectControlSuccessors(op).empty()) { op->emitRemark("Successors: ")
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Apr 19 00:13:50 UTC 2022 - 3.2K bytes - Viewed (0)