- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 28 for predecessor (0.14 sec)
-
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) -
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) -
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/looprotate.go
// come right after it. after := map[ID][]*Block{} // Check each loop header and decide if we want to move it. for _, loop := range loopnest.loops { b := loop.header var p *Block // b's in-loop predecessor for _, e := range b.Preds { if e.b.Kind != BlockPlain { continue } if loopnest.b2l[e.b.ID] != loop { continue } p = e.b } if p == nil { continue }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 3K 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) -
tensorflow/compiler/mlir/tensorflow/transforms/lower_globals_to_ml_program.cc
&arg) .succeeded()) { options.insert(arg); } } } else { op->emitOpError("Predecessor op doesn't implement BranchOpInterface"); return failure(); } } } if (!options.empty()) { if (options.size() != 1) { op->emitOpError("Incompatible code paths.");
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 8.6K 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) -
tensorflow/compiler/mlir/tensorflow/transforms/move_tpu_compile_to_front.cc
while (op && op != func) { op->removeAttr("_is_compilation"); op->removeAttr("_wraps_compilation"); op = op->getParentOp(); } }); } int OutsideCompilationOrdering(Operation* predecessor, Operation* op) { // Actual compilations go first. if (op->hasAttr("_is_compilation")) return 2; // Followed by nested ops that contain compilations. if (op->hasAttr("_wraps_compilation")) return 1;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Oct 17 00:26:18 UTC 2023 - 3.2K bytes - Viewed (0)