If you can easily sort the file on the non-date fields, then identical items will be adjacent, so you won't have to use a large amount of memory for a hash cache. But I still question whether it's necessary
In reply to Re: Caching process sets
by Thelonius
in thread Caching process sets
by billyak
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |