>>>>> "DH" == Diane Holt <[EMAIL PROTECTED]> writes:
DH> I have 73 exclude names in one (it also has 30 include names) -- But you wouldn't benefit from an implementation that uses a Hashtable instead of a Vector at all. DirectoryScanner doesn't search for a pattern, it just walks through the list of patterns sequentially - something Hashtables won't do faster than Vectors. I didn't want to say DirectoryScanner couldn't be optimized, just storing the patterns inside a Hashtable won't help. Stefan
