Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling

Re^4: du -h, sorted

by hbm (Hermit)
on Feb 26, 2009 at 03:00 UTC ( #746428=note: print w/replies, xml ) Need Help??

in reply to Re^3: du -h, sorted
in thread du -h, sorted

Alas, your last two methods put a 400K file before a 399M file... For the first one, I added a "K" key to your anonymous hash:

perl -e 'sub h{pop=~/^([\d.]+)(.)/&&{K,1e1,M,1e3,G,1e6}->{$2}+$1}print + sort{h($b)<=>h$a}`du -h`'

For the second one, I think you're in a bind because ord(k)&7 and ord(K)&7 are equal...

And I offer another method, bumming heavily from yours, longer but possibly faster on large filesystems:

perl -e 'print map substr($_,8),reverse sort map sprintf("%8d",(/^([\d +.]+)([kKMG])/)?{K,1e1,M,1e3,G,1e6}->{$2}+$1:$1).$_,`du -h`'

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://746428]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (8)
As of 2016-12-09 20:22 GMT
Find Nodes?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:

    Results (157 votes). Check out past polls.