- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for nodeQueue (0.14 sec)
-
subprojects/core/src/main/java/org/gradle/execution/plan/DetermineExecutionPlanAction.java
private void processEntryNodes() { for (Node node : entryNodes) { nodeQueue.add(new NodeInVisitingSegment(node, visitingSegmentCounter++)); } } private void processNodeQueue() { while (!nodeQueue.isEmpty()) { final NodeInVisitingSegment nodeInVisitingSegment = nodeQueue.peekFirst(); final int currentSegment = nodeInVisitingSegment.visitingSegment;
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Dec 11 13:37:56 UTC 2023 - 17.7K bytes - Viewed (0) -
src/cmd/compile/internal/types2/initorder.go
// Priority queue // nodeQueue implements the container/heap interface; // a nodeQueue may be used as a priority queue. type nodeQueue []*graphNode func (a nodeQueue) Len() int { return len(a) } func (a nodeQueue) Swap(i, j int) { x, y := a[i], a[j] a[i], a[j] = y, x x.index, y.index = j, i } func (a nodeQueue) Less(i, j int) bool { x, y := a[i], a[j]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 28 22:06:51 UTC 2024 - 9.8K bytes - Viewed (0) -
src/go/types/initorder.go
// Priority queue // nodeQueue implements the container/heap interface; // a nodeQueue may be used as a priority queue. type nodeQueue []*graphNode func (a nodeQueue) Len() int { return len(a) } func (a nodeQueue) Swap(i, j int) { x, y := a[i], a[j] a[i], a[j] = y, x x.index, y.index = j, i } func (a nodeQueue) Less(i, j int) bool { x, y := a[i], a[j]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.9K bytes - Viewed (0) -
pkg/controller/podgc/gc_controller.go
} } func (gcc *PodGCController) discoverDeletedNodes(ctx context.Context, existingNodeNames sets.String) (sets.String, bool) { deletedNodesNames := sets.NewString() for gcc.nodeQueue.Len() > 0 { item, quit := gcc.nodeQueue.Get() if quit { return nil, true } nodeName := item if !existingNodeNames.Has(nodeName) { exists, err := gcc.checkIfNodeExists(ctx, nodeName) switch {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 13.3K bytes - Viewed (0) -
pkg/controller/podgc/gc_controller_test.go
} for _, pod := range test.pods { podInformer.Informer().GetStore().Add(pod) } // Overwrite queue fakeClock := testingclock.NewFakeClock(time.Now()) gcc.nodeQueue.ShutDown() gcc.nodeQueue = workqueue.NewTypedDelayingQueueWithConfig(workqueue.TypedDelayingQueueConfig[string]{Clock: fakeClock, Name: "podgc_test_queue"}) // First GC of orphaned pods gcc.gc(ctx)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 08:16:48 UTC 2024 - 29K bytes - Viewed (0) -
pkg/controller/nodeipam/ipam/range_allocator.go
if err := ra.ReleaseCIDR(logger, obj.(*v1.Node)); err != nil { utilruntime.HandleError(fmt.Errorf("error while processing CIDR Release: %w", err)) } // IndexerInformer uses a delta nodeQueue, therefore for deletes we have to use this // key function. key, err := cache.DeletionHandlingMetaNamespaceKeyFunc(obj) if err == nil { ra.queue.Add(key) } }, }) return ra, nil
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Apr 24 10:06:15 UTC 2024 - 16.2K bytes - Viewed (0) -
src/runtime/sigqueue_plan9.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 05 17:54:15 UTC 2022 - 3.3K bytes - Viewed (0)