in reply to Re: du and -s
in thread du and -s

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'

In Section Seekers of Perl Wisdom