Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 17 of 17 for PriorityQueue (0.06 sec)

  1. android/guava-testlib/test/com/google/common/testing/ArbitraryInstancesTest.java

        assertTrue(ArbitraryInstances.get(PriorityQueue.class).isEmpty());
        assertTrue(ArbitraryInstances.get(BitSet.class).isEmpty());
        assertTrue(ArbitraryInstances.get(TreeSet.class).isEmpty());
        assertTrue(ArbitraryInstances.get(TreeMap.class).isEmpty());
        assertFreshInstanceReturned(
            LinkedList.class,
            Deque.class,
            Queue.class,
            PriorityQueue.class,
            BitSet.class,
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Dec 11 20:45:32 UTC 2025
    - 22.2K bytes
    - Viewed (0)
  2. android/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java

        }
      }
    
      public void testCorrectOrdering_randomAccess() {
        long seed = new Random().nextLong();
        Random random = new Random(seed);
        PriorityQueue<Integer> control = new PriorityQueue<>();
        MinMaxPriorityQueue<Integer> q = MinMaxPriorityQueue.create();
        for (int i = 0; i < 73; i++) { // 73 is a childless uncle case.
          Integer element = random.nextInt();
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Oct 28 16:03:47 UTC 2025
    - 36.1K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/collect/TopKSelector.java

     * #offer} and a call to {@link #topK}, with O(k) memory. In comparison, quickselect has the same
     * asymptotics but requires O(n) memory, and a {@code PriorityQueue} implementation takes O(n log
     * k). In benchmarks, this implementation performs at least as well as either implementation, and
     * degrades more gracefully for worst-case input.
     *
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Sun Aug 31 13:15:26 UTC 2025
    - 11.3K bytes
    - Viewed (0)
  4. guava/src/com/google/common/collect/Iterators.java

    import java.util.Comparator;
    import java.util.Deque;
    import java.util.Enumeration;
    import java.util.Iterator;
    import java.util.List;
    import java.util.NoSuchElementException;
    import java.util.Objects;
    import java.util.PriorityQueue;
    import java.util.Queue;
    import org.jspecify.annotations.NonNull;
    import org.jspecify.annotations.Nullable;
    
    /**
     * This class contains static utility methods that operate on or return objects of type {@link
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Sep 16 12:42:11 UTC 2025
    - 51.4K bytes
    - Viewed (0)
  5. CHANGELOG/CHANGELOG-1.14.md

        * a. kubectl get pod test-pod -o custom-columns=CONTAINER:.spec.containers[0:3].name
        * b. kubectl get pod test-pod -o custom-columns=CONTAINER:.spec.containers[-2:].name
    * scheduler: use incremental scheduling cycle in PriorityQueue to put all in-flight unschedulable pods back to active queue if we received move request ([#73309](https://github.com/kubernetes/kubernetes/pull/73309), [@cofyc](https://github.com/cofyc))
    Registered: Fri Dec 26 09:05:12 UTC 2025
    - Last Modified: Mon Jun 14 22:06:39 UTC 2021
    - 271.5K bytes
    - Viewed (0)
  6. CHANGELOG/CHANGELOG-1.13.md

    * scheduler: use incremental scheduling cycle in PriorityQueue to put all in-flight unschedulable pods back to active queue if we received move request ([#73309](https://github.com/kubernetes/kubernetes/pull/73309), [@cofyc](https://github.com/cofyc))
    Registered: Fri Dec 26 09:05:12 UTC 2025
    - Last Modified: Thu May 05 13:44:43 UTC 2022
    - 273.1K bytes
    - Viewed (0)
  7. CHANGELOG/CHANGELOG-1.12.md

    * scheduler: use incremental scheduling cycle in PriorityQueue to put all in-flight unschedulable pods back to active queue if we received move request ([#73309](https://github.com/kubernetes/kubernetes/pull/73309), [@cofyc](https://github.com/cofyc))
    Registered: Fri Dec 26 09:05:12 UTC 2025
    - Last Modified: Thu Feb 06 06:04:15 UTC 2020
    - 293.8K bytes
    - Viewed (0)
Back to top