Searched refs:mmHeap (Results 1 – 2 of 2) sorted by relevance
188 MinMaxPriorityQueue<Integer> mmHeap = in testHeapIntact() local195 assertTrue("Empty heap should be OK", mmHeap.isIntact()); in testHeapIntact()198 mmHeap.offer(randomInt); in testHeapIntact()202 mmHeap.isIntact()); in testHeapIntact()203 assertEquals(heapSize, mmHeap.size()); in testHeapIntact()209 mmHeap.offer(randomInt); in testHeapIntact()215 removeMinFromReplica(replica, mmHeap.poll()); in testHeapIntact()217 removeMaxFromReplica(replica, mmHeap.pollLast()); in testHeapIntact()220 assertTrue("MinMax queue has lost " + v, mmHeap.contains(v)); in testHeapIntact()222 assertTrue(mmHeap.isIntact()); in testHeapIntact()[all …]
81 MinMaxPriorityQueue<T> mmHeap; field in MinMaxPriorityQueueBenchmark.InvertedMinMaxPriorityQueue83 mmHeap = MinMaxPriorityQueue.orderedBy(comparator).create(); in InvertedMinMaxPriorityQueue()88 return mmHeap; in delegate()93 return mmHeap.pollLast(); in poll()