Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re^2: Special case mktime: semi-sequential access

by Dallaylaen (Scribe)
on Jul 01, 2013 at 10:58 UTC ( #1041815=note: print w/ replies, xml ) Need Help??


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.


Comment on Re^2: Special case mktime: semi-sequential access
Re^3: Special case mktime: semi-sequential access
by not_japh (Novice) on Jul 01, 2013 at 11:48 UTC
    Sequential not necessary. Just within the same day is enough to avoid the date calculations by doing the time ones yourself.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1041815]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (4)
As of 2014-09-21 01:27 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    How do you remember the number of days in each month?











    Results (165 votes), past polls