- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 46 for predecessor (0.33 sec)
-
subprojects/core/src/main/java/org/gradle/execution/plan/Node.java
*/ public void maybeInheritFinalizerGroups() { NodeGroup newGroup = group; for (Node predecessor : getDependencyPredecessors()) { if (predecessor.getGroup() instanceof HasFinalizers) { newGroup = maybeInheritGroupAsFinalizerDependency((HasFinalizers) predecessor.getGroup(), newGroup); } } if (newGroup != group) { setGroup(newGroup);
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Aug 24 13:30:48 UTC 2023 - 22.7K bytes - Viewed (0) -
platforms/core-configuration/model-core/src/main/java/org/gradle/model/internal/registry/DefaultModelRegistry.java
// Node must be at the predecessor state before calculating dependencies NodeAtState predecessor = new NodeAtState(getPath(), getTargetState().previous()); dependencies.add(graph.nodeAtState(predecessor)); // Transition any other nodes that depend on the predecessor state dependencies.add(new TransitionDependents(predecessor)); seenPredecessor = true;
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri May 24 15:40:00 UTC 2024 - 45.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/check.go
for _, c := range b.Preds { if !blockMark[c.b.ID] { f.Fatalf("predecessor block %v for %v is missing", c, b) } } for _, c := range b.Succs { if !blockMark[c.b.ID] { f.Fatalf("successor block %v for %v is missing", c, b) } } } if len(f.Entry.Preds) > 0 { f.Fatalf("entry block %s of %s has predecessor(s) %v", f.Entry, f.Name, f.Entry.Preds) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 09 16:41:23 UTC 2024 - 17.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/dom_test.go
blocs = append(blocs, Bloc("entry", Valu("mem", OpInitMem, types.TypeMem, 0, nil), Valu("p", OpConstBool, types.Types[types.TBOOL], 1, nil), Goto(blockn(0)), ), ) // We want predecessor lists to be long, so 2/3rds of the blocks have a // successor of the first or last block. for i := 0; i < size; i++ { switch i % 3 { case 0: blocs = append(blocs, Bloc(blockn(i),
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:28 UTC 2024 - 13.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/sparsecore/embedding_sequencing.cc
for (Operation* op : ops_to_process) { if (predecessors) { for (Value operand : op->getOperands()) { // Stop at the block boundary. if (mlir::isa<BlockArgument>(operand)) continue; Operation* predecessor = operand.getDefiningOp(); if (!operations->contains(predecessor) && !ops_to_avoid.contains(predecessor)) { new_ops.insert(operand.getDefiningOp());
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 39.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/tpu_resource_partitioning.cc
return GetResourceSubtype(resource.getType()); } // Updates uses of `old_read` to `new_partitioned_input` and `new_reads`. // `old_partitioned_input` is the predecessor of `old_read`. `new_reads` // contains the predecessors of `new_partitioned_input`. LogicalResult UpdateReadUses(TF::ReadVariableOp old_read, TF::TPUPartitionedInputV2Op old_partitioned_input,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Sep 06 19:12:29 UTC 2023 - 11.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 10.2K bytes - Viewed (0) -
src/internal/trace/gc.go
} } // An integrator tracks a position in a utilization function and // integrates it. type integrator struct { u *mmuSeries // pos is the index in u.util of the current time's non-strict // predecessor. pos int } // advance returns the integral of the utilization function from 0 to // time. advance must be called on monotonically increasing values of // times.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 26K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/block.go
} b.Preds[n] = Edge{} b.Preds = b.Preds[:n] b.Func.invalidateCFG() } // removeSucc removes the ith output edge from b. // It is the responsibility of the caller to remove // the corresponding predecessor edge. // Note that this potentially reorders successors of b, so it // must be used very carefully. func (b *Block) removeSucc(i int) { n := len(b.Succs) - 1 if i != n { e := b.Succs[n] b.Succs[i] = e
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 12.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/loopbce.go
// only when it's smaller than the limiting value. // Two conditions must happen listed below to accept ind // as an induction variable. // First condition: loop entry has a single predecessor, which // is the header block. This implies that b.Succs[0] is // reached iff ind < limit. if len(b.Succs[0].b.Preds) != 1 { // b.Succs[1] must exit the loop. continue }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 07 17:37:47 UTC 2023 - 11.8K bytes - Viewed (0)