Re: du and -s

Note that du is much smarter than a simple File::Find routine. du knows it has seen a file before if you have multiple links to a file. The File::Find solution would include the size multiple times.

Abigail

Comment on Re: du and -s Select or Download Code

Replies are listed 'Best First'.
Re:x2 du and -s by grinder (Bishop) on Jul 24, 2002 at 13:14 UTC
Well that would be pretty easy to fix, wouldn't it? You just have to stat each file and cache the inode, to determine whether you have seen the file or not already before accumulating. The only question, depending on the number of file and the number of inodes of the filesystem, is what would use less memory, a hash or a bitvec? print@_{sort keys %_},$/if%_=split//,'= & *a?b:e\f/h^h!j+n,o@o;r$s-t%t#u'	[reply]

Replies are listed 'Best First'.

Re:x2 du and -s
by grinder (Bishop) on Jul 24, 2002 at 13:14 UTC

Well that would be pretty easy to fix, wouldn't it? You just have to stat each file and cache the inode, to determine whether you have seen the file or not already before accumulating.

The only question, depending on the number of file and the number of inodes of the filesystem, is what would use less memory, a hash or a bitvec?

print@_{sort keys %_},$/if%_=split//,'= & *a?b:e\f/h^h!j+n,o@o;r$s-t%t#u'

[reply]