new operations available for heap:
http://code.google.com/p/jc-pheap/source/list
changeVal < any value inside the heap, not just the min. honor system.
if you didn't put a value in, don't lie and changes its value. runtime
varies from O(1) to O(logn). code has explanation. was ambitious an
"meld" results look good (unless I made a mistake somewhere).
I merged two collections, each with 2 million unique elements. did union of
sorted sets, then did meld with my heap implementation:
performing union of two sorted sets
"Elapsed time: 18881.81 msecs"
--
