BTW, by Ladder Queue I presume you mean this:

Sounds like an interesting calendar queue.  Lemme know how the  
performance is when you're done.  If the code's good we might add it  

Note by the way that the key isn't necessarily just the time but also  
the ordering.  Make sure you'll do okay just basing the queue  
decisions on the time alone.


On Aug 19, 2011, at 5:14 PM, Sean Luke wrote:

> Done.  Version on SVN has the following additional methods in Key:
> 		public int getOrdering() { return ordering; }
> 		public double getTime() { return time; }
> Sean
> On Aug 19, 2011, at 10:10 AM, Sam Brett wrote:
>> I am making a scheduler that uses for the heap a ladder queue. For  
>> the
>> ladder queue, however, it needs access to the time for each key.  
>> Currently,
>> the key's time is package scope. Can you put in a getter for time  
>> and while
>> you're at it, I guess ordering as well in the key class? I would  
>> prefer not
>> to copy nearly all the code for the Schedule.