Also, I can't really believe that this I/O bound procedure would in any way be impacted by the number of nanoseconds required to manipulate the dates.
Never underestimate the impact of a large number of subroutine calls.
Given the OP's followup, it seems there's a lot going on in the original code.
-QM
--
Quantum Mechanics: The dreams stuff is made of
In reply to Re^2: search through hash for date in a range
by QM
in thread search through hash for date in a range
by bfdi533
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |