in reply to Re: Special case mktime: semi-sequential access
in thread Special case mktime: semi-sequential access
To me it looks like a multiplication by 60 is simple enough and doesn't deserve caching. On the other hand, calculating date is tricky as it involves legacy code dating back to the Roman empire. So the OP approach definitely has some grounds. I wonder what benchmark would say though.
Besides, a log file is not always sequential if several applications run at once and buffering is involved.