Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot

Re: Array splitting

by johngg (Abbot)
on Oct 31, 2012 at 22:50 UTC ( #1001758=note: print w/ replies, xml ) Need Help??

in reply to Array splitting

The { $a cmp $b } comparison is the default behaviour for sort so doesn't have to be mentioned specifically if you don't wish. You can populate your @A and @trash arrays in one go by eliminating the intermediate @sorted array and pushing onto the appropriate array using a ternary (see Conditional Operator).

$ perl -Mstrict -Mwarnings -E' > my @notSorted = qw{ Beep Ape Circus Arg }; > my( @A, @trash ); > push @{ $_ =~ m{^A} ? \ @A : \ @trash }, $_ for sort @notSorted; > do { > local $" = q{, }; > say qq{@A}; > say qq{@trash}; > };' Ape, Arg Beep, Circus $

I hope this is helpful.



Comment on Re: Array splitting
Select or Download Code
Replies are listed 'Best First'.
Re^2: Array splitting
by Hopfi (Novice) on Nov 01, 2012 at 00:18 UTC
    Alright. Thanks very much guys! Im more a C++ guy and not used to those different operations (like eq != ==).

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1001758]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (3)
As of 2016-05-29 04:00 GMT
Find Nodes?
    Voting Booth?