On Tue, Jan 20, 2009 at 07:59:41PM +0100, Matthias Drochner wrote:
> This could be avoided if the
> search space got reduced by some compile-time constants.
> One could even speed-optimize the code by checking early
> whether the time_t is in the most common range (eg from ~now
> to now+X) and reducing the number of loop iterations
> in that case...
I think this is the best deal. I suspect that approximately every time_t
value will normally fit into epoche +/- 2^33 at most and that is one
trivial check to use as start value.
Joerg