- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 26 for priorityQueue (0.18 sec)
-
src/container/heap/example_pq_test.go
} // A PriorityQueue implements heap.Interface and holds Items. type PriorityQueue []*Item func (pq PriorityQueue) Len() int { return len(pq) } func (pq PriorityQueue) Less(i, j int) bool { // We want Pop to give us the highest, not lowest, priority so we use greater than here. return pq[i].priority > pq[j].priority } func (pq PriorityQueue) Swap(i, j int) { pq[i], pq[j] = pq[j], pq[i]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 31 20:27:36 UTC 2024 - 2.5K bytes - Viewed (0) -
pkg/scheduler/internal/queue/scheduling_queue.go
} // Option configures a PriorityQueue type Option func(*priorityQueueOptions) // WithClock sets clock for PriorityQueue, the default clock is clock.RealClock. func WithClock(clock clock.Clock) Option { return func(o *priorityQueueOptions) { o.clock = clock } } // WithPodInitialBackoffDuration sets pod initial backoff duration for PriorityQueue.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 13:26:09 UTC 2024 - 61.4K bytes - Viewed (0) -
pkg/scheduler/internal/queue/testing.go
return NewTestQueueWithObjects(ctx, lessFn, nil, opts...) } // NewTestQueueWithObjects creates a priority queue with an informer factory // populated with the provided objects. func NewTestQueueWithObjects( ctx context.Context, lessFn framework.LessFunc, objs []runtime.Object, opts ...Option, ) *PriorityQueue {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Feb 10 00:53:58 UTC 2022 - 1.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/Queues.java
public static <E extends Comparable> PriorityQueue<E> newPriorityQueue() { return new PriorityQueue<>(); } /** * Creates a {@code PriorityQueue} containing the given elements. * * <p><b>Note:</b> If the specified iterable is a {@code SortedSet} or a {@code PriorityQueue}, * this priority queue will be ordered according to the same ordering. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 18K bytes - Viewed (0) -
pkg/test/loadbalancersim/loadbalancer/edf.go
deadline float64 index int64 value any weight float64 } // priorityQueue is a queue that always pop the highest priority item type priorityQueue []*Entry // Len implements heap.Interface/sort.Interface func (pq priorityQueue) Len() int { return len(pq) } // Less implements heap.Interface/sort.Interface func (pq priorityQueue) Less(i, j int) bool { // Flip logic to make this a min queue.
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Jul 20 19:13:32 UTC 2023 - 2.8K bytes - Viewed (0) -
src/main/java/org/codelibs/core/collection/CollectionsUtil.java
return new PriorityQueue<>(initialCapacity, comparator); } /** * {@link PriorityQueue}の新しいインスタンスを作成して返します。 * * @param <E> * {@link PriorityQueue}の要素型 * @param c * 要素が優先度キューに配置されるコレクション * @return {@link PriorityQueue}の新しいインスタンス * @see PriorityQueue#PriorityQueue(PriorityQueue) */
Registered: Wed Jun 12 12:50:12 UTC 2024 - Last Modified: Thu Mar 07 01:59:08 UTC 2024 - 53.9K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/MinMaxPriorityQueueBenchmark.java
import com.google.common.base.Function; import java.math.BigInteger; import java.util.Comparator; import java.util.PriorityQueue; import java.util.Queue; import java.util.Random; import org.checkerframework.checker.nullness.qual.Nullable; /** * Benchmarks to compare performance of MinMaxPriorityQueue and PriorityQueue. * * @author Sverre Sundsdal */ public class MinMaxPriorityQueueBenchmark {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 19 19:24:36 UTC 2023 - 4.3K bytes - Viewed (0) -
platforms/core-execution/execution/src/main/java/org/gradle/internal/execution/history/OutputsCleaner.java
import javax.annotation.Nullable; import java.io.File; import java.io.IOException; import java.nio.file.DirectoryStream; import java.nio.file.Files; import java.nio.file.Path; import java.util.Map; import java.util.PriorityQueue; import java.util.function.Predicate; /** * Cleans outputs, removing empty directories. * * This class should be used when cleaning output directories when only a subset of the files can be deleted.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 09:46:15 UTC 2023 - 5.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Queues.java
public static <E extends Comparable> PriorityQueue<E> newPriorityQueue() { return new PriorityQueue<>(); } /** * Creates a {@code PriorityQueue} containing the given elements. * * <p><b>Note:</b> If the specified iterable is a {@code SortedSet} or a {@code PriorityQueue}, * this priority queue will be ordered according to the same ordering. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 16K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/TestsForQueuesInJavaUtil.java
new TestStringQueueGenerator() { @Override public Queue<String> create(String[] elements) { return new PriorityQueue<>(MinimalCollection.of(elements)); } }) .named("PriorityQueue") .withFeatures(CollectionFeature.GENERAL_PURPOSE, CollectionSize.ANY) .suppressing(suppressForPriorityQueue()) .createTestSuite(); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Dec 04 17:37:03 UTC 2017 - 9.4K bytes - Viewed (0)