Jumping around an array can't be much worse than jumping around
a linked list, can it?
It does not have to be fixed length, though it wouldn't be log(n) to
grow the array, it can still be done...and once you reach maximal
size, you won't be growing it any more...
I had forgotten about the log(n) to delete, though log(n) is
still pretty good. As others have suggested, it might be good
to have a linked list for very-soon-to-expire timers. However,
they would have to be few enough that your linear insert was
not worse than a log(n) instert and a log(n) delete...
> > --
> And your solution is?
>
> George
-- Ben Greear (greearb@candelatech.com) http://www.candelatech.com Author of ScryMUD: scry.wanfear.com 4444 (Released under GPL) http://scry.wanfear.com http://scry.wanfear.com/~greear - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/