ant-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Stefan Bodewig <bode...@apache.org>
Subject Re: Performance of fileset related operations with a large number of files
Date Fri, 20 Jan 2006 04:58:04 GMT
On Thu, 19 Jan 2006, Paul Mackay <Paul.Mackay@nokia.com> wrote:

> Is there any way to avoid this high memory usage and time spent
> building a list?

No.  And you'll see that Ant 1.7 is both a bit better and a bit worse
than it used to be.  Directoryscanner has probably become a bit faster
but at the same time we've broadened the concept of FileSets to
ResourceCollections which means the copy task now works on more
complex structures and even non-Files which probably leads to a
further slowdown.

> Has there ever been any consideration of refactoring the way Ant
> processes filesets and similar constructs such that each selected
> file is processed once read in an iterative fashion, rather than
> building a complete list and then processing?

Apart from cosmetics like printing the number of files to copy (before
actually copying them) and backwards compatibility that Jeffrey
mentioned this would also break optimizations in Move, which checks
whether a fileset matches a whole directory tree and then simply moves
the root of that tree instead of the individual files.  To do that
Move has to complete the directory scans before it starts to move
anything.

Stefan

---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@ant.apache.org
For additional commands, e-mail: dev-help@ant.apache.org


Mime
View raw message