Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 1 of 1 for cfm (0.01 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  2. github.com/google/guava

    android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java 

     * conventional bounded queues, which either block or reject new elements when full.
 *
 * <p>This implementation is based on the <a
 * href="http://portal.acm.org/citation.cfm?id=6621">min-max heap</a> developed by Atkinson, et al.
 * Unlike many other double-ended priority queues, it stores elements in a single array, as compact
 * as the traditional heap data structure used in {@link PriorityQueue}.
 *
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Sep 22 18:35:44 GMT 2025
    - 33.9K bytes
    - Click Count (0)
Back to Top