Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re^3: Fastest way to recurse through VERY LARGE directory tree

by eff_i_g (Curate)
on Jan 21, 2011 at 17:14 UTC ( #883575=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download



    Log In?
    Username:
    Password:

    What's my password?
    Create A New User
    Node Status?
    node history
    Node Type: note [id://883575]
    help
    Chatterbox?
    [1nickt]: Good morning Monks and Monkettes!
    [1nickt]: I have encountered a small code snippet I can not decipher: if ($?) { my $status = $? >> 8; ... }
    [1nickt]: Hm, found the doc
    [hippo]: >> is the bitwise shift, essentially divides the result by 256.
    [haukex]: $? and system - the exit code of a process is stored in the upper bits of $?, so >> 8 does a bit shift to get at it
    [hippo]: (truncating)
    [erix]: aah, yes haukex++
    [hippo]: Re: DBD::Sqlite queries slow - and gives wrong results has 6 upvotes. Is everyone quite well?

    How do I use this? | Other CB clients
    Other Users?
    Others pondering the Monastery: (8)
    As of 2017-12-13 11:34 GMT
    Sections?
    Information?
    Find Nodes?
    Leftovers?
      Voting Booth?
      What programming language do you hate the most?




















      Results (358 votes). Check out past polls.

      Notices?