Re: "PriorityMap"
- From: Patricia Shanahan <pats@xxxxxxx>
- Date: Sun, 30 Mar 2008 14:13:48 -0700
Andreas Leitgeb wrote:
I'm in search of a data structure for the followig usecase:
Some algorithm spits out *lots* of pairs (k,v) of type (int,long).
I only want either those ten(*) pairs with the lowest keys, or all
pairs with the lowest ten(*) keys. (whichever is easier to achieve)
The keys (k) are not necessarily unique, in fact I usually get a
couple of different values (v) for each k, and I'm interested only
in the v's, that came with those ten(*) smallest k's. The actual
k's do not matter afterwards.
There are much too many to save them all and filter afterwards.
PriorityQueue and TreeMap do not seem to make it easy to efficiently prune them beyond the first ten(*) entries after each add().
I'd use a PriorityQueue but with either a Comparable element type or a
Comparator that uses descending order of the key values. That way, the
head item is the one with the largest key, and the one that should be
removed when an insertion increases the queue size beyond 10.
Patricia
.
- Follow-Ups:
- Re: "PriorityMap"
- From: Andreas Leitgeb
- Re: "PriorityMap"
- References:
- "PriorityMap"
- From: Andreas Leitgeb
- "PriorityMap"
- Prev by Date: Re: Free Tutorial website And Ebooks programing tutorials
- Next by Date: Re: setting up CLASS PATH dynamically
- Previous by thread: "PriorityMap"
- Next by thread: Re: "PriorityMap"
- Index(es):
Relevant Pages
|
|
