Searched refs:mmHeap (Results 1 – 4 of 4) sorted by relevance
197 MinMaxPriorityQueue<Integer> mmHeap = MinMaxPriorityQueue.expectedSize(heapSize).create(); in testHeapIntact() local203 assertTrue("Empty heap should be OK", mmHeap.isIntact()); in testHeapIntact()206 mmHeap.offer(randomInt); in testHeapIntact()209 assertIntact(mmHeap); in testHeapIntact()210 assertEquals(heapSize, mmHeap.size()); in testHeapIntact()216 mmHeap.offer(randomInt); in testHeapIntact()222 removeMinFromReplica(replica, mmHeap.poll()); in testHeapIntact()224 removeMaxFromReplica(replica, mmHeap.pollLast()); in testHeapIntact()227 assertThat(mmHeap).contains(v); in testHeapIntact()229 assertIntact(mmHeap); in testHeapIntact()[all …]
81 MinMaxPriorityQueue<T> mmHeap; field in MinMaxPriorityQueueBenchmark.InvertedMinMaxPriorityQueue84 mmHeap = MinMaxPriorityQueue.orderedBy(comparator).create(); in InvertedMinMaxPriorityQueue()89 return mmHeap; in delegate()94 return mmHeap.pollLast(); in poll()