Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re^2: Perlish way of doing this

by htoug (Deacon)
on Dec 08, 2004 at 12:53 UTC ( #413185=note: print w/replies, xml ) Need Help??


in reply to Re: Perlish way of doing this
in thread Perlish way of doing this

Ahhh, now I see. Ie after you updated the question.

I think that it could be simplified by noting that the two tmp-arrays can be created given only one of the input arrays - @tmp1 depends only on @a1 and @tmp2 only on @a2.

Your loop could be shortened to something like:

for my $elem (sort keys %a) { push @tmp1, (grep($elem eq $_} @a1) ? $elem : "##"; push @tmp2, (grep($elem eq $_} @a2) ? $elem : "##"; }
That satisfies your explanation.

But your code seems to indicate that the value is put into the tmp-arrays also if the value is present in neither the @a1 or @a2. Unfortunately your code does not have an example of this, so it cannot be tested.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (6)
As of 2016-10-01 18:17 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    How many different varieties (color, size, etc) of socks do you have in your sock drawer?






    Results (3 votes). Check out past polls.