Op Wednesday 05 August 2009 18:40:41 schreef Robin Anil: > I have say a million objects which needs to be inserted very fast and only > top K needs to be kept based on a comparator
Have a look at the PriorityQueue here: http://svn.apache.org/viewvc/lucene/java/trunk/src/java/org/apache/lucene/util/ and at how it is used in TopDocCollector here: http://svn.apache.org/viewvc/lucene/java/trunk/src/java/org/apache/lucene/search/ Regards, Paul Elschot > > > > On Wed, Aug 5, 2009 at 10:07 PM, Sean Owen <sro...@gmail.com> wrote: > > > Does java.util.PriorityQueue meet your needs? > > > > On Wed, Aug 5, 2009 at 5:33 PM, Robin Anil<robin.a...@gmail.com> wrote: > > > Is there any Min/MaxHeap implementation (non GPL) to include as part of > > > Mahout > > > > > >
