Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^3: Search in array from match in another array, print once only.

by tmharish (Friar)
on Feb 22, 2013 at 10:11 UTC ( [id://1020121]=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    
use strict   ;
...

print "". ( ( $count{ $_ } ) ? "$_ Found $count{ $_ } times.\n" : "$_ 
+Not Found\n" ) foreach ( @array ) ;
  2. or download this
    54321 Found 1 times.
54312 Not Found
5999 Not Found
54352 Not Found
12345 Found 2 times.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://1020121]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others exploiting the Monastery: (2)
As of 2025-03-18 02:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    When you first encountered Perl, which feature amazed you the most?










    Results (56 votes). Check out past polls.