- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 58 for Predecessors (0.18 sec)
-
android/guava/src/com/google/common/graph/DirectedMultiNetworkConnections.java
@Override public Set<N> predecessors() { return Collections.unmodifiableSet(predecessorsMultiset().elementSet()); } private Multiset<N> predecessorsMultiset() { Multiset<N> predecessors = getReference(predecessorsReference); if (predecessors == null) { predecessors = HashMultiset.create(inEdgeMap.values());
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Oct 06 00:47:57 UTC 2021 - 4.6K bytes - Viewed (0) -
guava/src/com/google/common/graph/DirectedMultiNetworkConnections.java
@Override public Set<N> predecessors() { return Collections.unmodifiableSet(predecessorsMultiset().elementSet()); } private Multiset<N> predecessorsMultiset() { Multiset<N> predecessors = getReference(predecessorsReference); if (predecessors == null) { predecessors = HashMultiset.create(inEdgeMap.values());
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Oct 06 00:47:57 UTC 2021 - 4.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/tpu_colocate_splits.cc
if (!attr) return false; return !attr.getValue().empty(); } // Returns the predecessors of `op` when `op`'s predecessors are wrapped by // islands. llvm::SmallVector<Operation*> IslandPredecessors(Operation* op) { llvm::SmallVector<Operation*> predecessors; for (Value operand : op->getOperands()) { if (Operation* pred = operand.getDefiningOp()) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 27 18:44:34 UTC 2023 - 2.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractBaseGraph.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 7.2K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractBaseGraph.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 7.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/phiopt.go
// and len(b.Preds) is equal to 2. // 2. find the common dominator(b0) of the predecessors(pb0, pb1) of block b, and the // dominator(b0) is a If block. // Special case: one of the predecessors(pb0 or pb1) is the dominator(b0). // 3. the successors(sb0, sb1) of the dominator need to dominate the predecessors(pb0, pb1) // of block b respectively. // 4. replace this boolean Phi based on dominator block. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 8.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableValueGraph.java
if (isDirected()) { // In undirected graphs, the successor and predecessor sets are equal. // Since views are returned, we need to copy the predecessors that will be removed. // Thus we avoid modifying the underlying view while iterating over it. for (N predecessor : ImmutableList.copyOf(connections.predecessors())) { // requireNonNull is safe because the node is a predecessor. checkState(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat Oct 21 01:50:30 UTC 2023 - 6.4K bytes - Viewed (0) -
guava/src/com/google/common/graph/StandardMutableValueGraph.java
if (isDirected()) { // In undirected graphs, the successor and predecessor sets are equal. // Since views are returned, we need to copy the predecessors that will be removed. // Thus we avoid modifying the underlying view while iterating over it. for (N predecessor : ImmutableList.copyOf(connections.predecessors())) { // requireNonNull is safe because the node is a predecessor. checkState(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat Oct 21 01:50:30 UTC 2023 - 6.4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/BaseGraph.java
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 */ 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 - 8.8K bytes - Viewed (0) -
guava/src/com/google/common/graph/BaseGraph.java
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 */ 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 - 8.8K bytes - Viewed (0)