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
Gary Feldman wrote:
Internally, we have a flag "isRecursive" that we set on patterns that
reflects whether the pattern potentially matches more than a single
directory:
Without studying the code to figure out the intent of the recursive
flag, my gut intuition is that only the ** implies recu
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
Gary Feldman wrote:
I'm trying to create a fileset that goes one level deep, to pick out
subdirectories. In other words, I have a tree that looks like:
root/
project1/
testresults/
project2/
testresults/
I've tried both
and
Both of these wind up
