|
| |
|
| org.apache.commons.collections.BulkTest
 org.apache.commons.collections.AbstractTestObject
org.apache.commons.collections.collection.AbstractTestCollection
org.apache.commons.collections.TestBinaryHeap
| TestBinaryHeap | | public class TestBinaryHeap extends AbstractTestCollection (Code) | | Tests the BinaryHeap.
version:
$Revision: 155406 $ $Date: 2005-02-26 12:55:26 +0000 (Sat, 26 Feb 2005) $
author:
Michael A. Smith |
| checkOrder | | protected void checkOrder(BinaryHeap h)(Code) | | Pops all elements from the heap and verifies that the elements come off
in the correct order. NOTE: this method empties the heap.
|
| isFailFastSupported | | public boolean isFailFastSupported()(Code) | | Overridden because UnboundedFifoBuffer isn't fail fast.
false |
| makeConfirmedFullCollection | | public Collection makeConfirmedFullCollection()(Code) | | |
| showTree | | protected String showTree(BinaryHeap h)(Code) | | Returns a string showing the contents of the heap formatted as a tree.
Makes no attempt at padding levels or handling wrapping.
|
| suite | | public static Test suite()(Code) | | |
| testAddRemove | | public void testAddRemove()(Code) | | Illustrates bad internal heap state reported in Bugzilla PR #235818.
|
| testBasicComparatorOps | | public void testBasicComparatorOps()(Code) | | |
| testBasicOps | | public void testBasicOps()(Code) | | |
| testRandom | | public void testRandom()(Code) | | Generate heaps staring with Integers from 0 - heapSize - 1.
Then perform random add / remove operations, checking
heap order after modifications. Alternates minHeaps, maxHeaps.
Based on code provided by Steve Phelps in PR #25818
|
| verify | | public void verify()(Code) | | |
| Fields inherited from org.apache.commons.collections.AbstractTestObject | final public static int COLLECTIONS_MAJOR_VERSION(Code)(Java Doc)
|
|
|
|