- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for Atkinson (0.16 sec)
-
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}. *
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0)