[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: The quickest way to not to descend into sub-directories once a file
|
From: |
Peng Yu |
|
Subject: |
Re: The quickest way to not to descend into sub-directories once a file is found? |
|
Date: |
Fri, 27 Sep 2019 10:26:31 -0500 |
But wouldn't a scripting language be less efficient than C implementation?
I am not sure the time saved by traverse fewer files using pruning
will be greater than the time wasted in using a scripting language.
I'd like to know this beforehand before I create a custom
implementation in a scripting language.
Does anybody have any data on how slow it would be compared with
equivalent C implementation for directory traversal?
> For this kind of advanced directory traversal rule, you may want
> to use the tree scanning features of some scripting language
> like the File::Find of perl.
--
Regards,
Peng