- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 152 for predecessor (0.18 sec)
-
android/guava/src/com/google/common/graph/DirectedGraphConnections.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 20 17:00:05 UTC 2024 - 18K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
} private static final int ENDPOINT = -2; // TODO(user): predecessors and successors should be collocated (reducing cache misses). // Might also explore collocating all of [hash, next, predecessor, successor] fields of an // entry in a *single* long[], though that reduces the maximum size of the set by a factor of 2 /** * Pointer to the predecessor of an entry in insertion order. ENDPOINT indicates a node is the
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 05 21:38:59 UTC 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
} private static final int ENDPOINT = -2; // TODO(user): predecessors and successors should be collocated (reducing cache misses). // Might also explore collocating all of [hash, next, predecessor, successor] fields of an // entry in a *single* long[], though that reduces the maximum size of the set by a factor of 2 /** * Pointer to the predecessor of an entry in insertion order. ENDPOINT indicates a node is the
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 05 21:38:59 UTC 2024 - 9.5K bytes - Viewed (0) -
guava/src/com/google/common/graph/DirectedGraphConnections.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 20 17:00:05 UTC 2024 - 18K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/trim.go
v.Pos = v.Pos.WithIsStmt() } sawStmt = true break } if !sawStmt && s.Pos.SameFileAndLine(bPos) { s.Pos = s.Pos.WithIsStmt() } } // If `s` had more than one predecessor, update its phi-ops to // account for the merge. if ns > 1 { for _, v := range s.Values { if v.Op == OpPhi { mergePhi(v, j, b) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 4.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/fuse_branchredirect.go
// license that can be found in the LICENSE file. package ssa // fuseBranchRedirect checks for a CFG in which the outbound branch // of an If block can be derived from its predecessor If block, in // some such cases, we can redirect the predecessor If block to the // corresponding successor block directly. For example: // // p: // v11 = Less64 <bool> v10 v8 // If v11 goto b else u // b: <- p ...
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 16 21:40:11 UTC 2023 - 3.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/lower_globals_to_ml_program_invalid.mlir
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Aug 24 21:57:26 UTC 2022 - 2.3K 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/GraphConnections.java
/** Remove {@code node} from the set of predecessors. */ void removePredecessor(N node); /** * Remove {@code node} from the set of successors. Returns the value previously associated with * the edge connecting the two nodes. */ @CanIgnoreReturnValue @CheckForNull V removeSuccessor(N node); /** * Add {@code node} as a predecessor to the origin node. In the case of an undirected graph, it
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 2.4K bytes - Viewed (0)