1. A disk access is about 1000 times slower than memory access and thus the hash is much faster, unless the hash is too big to fit the main memory.
2. On unix, and most likely on Windows too, disk access gets cached (due to the above reason) and thus the chdir won't make much difference since find() needs to access the directory once and thus it is in the cache.
Using your hash will most likely speed things up, Note that
the hash can contain only the roots in @INC and thus is very short.
For this, just sort @INC and thus you will have the prefixes
before the rest.
In reply to Re: Wondering about File::Find
by fundflow
in thread Wondering about File::Find
by jynx
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |