Matthew Mastracci wrote:
Bonus points if you can recognize that you only need to recurse past a
"blah*" or "bar*" node.
I imagine the correct solution would involve some sort of tree
structure in memory that gets build from the components of all the
patterns and represents the ideal scanning
Matthew Mastracci wrote:
...
The fileset directory scanning logic in NAnt is somewhat unintelligent
as to how deep it goes. We made this tradeoff in the past so that we
can better combine multiple recursive filesets without a major
performance hit. For instance, NAnt's filescanner is just as
