Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation

Re: Coding problem

by Tomte (Priest)
on Aug 07, 2002 at 18:05 UTC ( #188413=note: print w/ replies, xml ) Need Help??

in reply to Coding problem

I second mkmcconns assumption that readMembers may not return an array, as a testrun with faked data did what it should do.

As a second note: You fetch every $active as many times as a $searchWord matches, maybe you'll want to say something like
(push(@found, $active) and last)if grep { /$searchWord/ } $newd;
to fetch a line only once (Just a thought).


Comment on Re: Coding problem
Select or Download Code
Replies are listed 'Best First'.
Re: Re: Coding problem
by kidd (Curate) on Aug 07, 2002 at 21:21 UTC
    maybe you'll want to say something like
    (push(@found, $active) and last)if grep { /$searchWord/ } $newd;

    Wow...thanks that saved me a lot of time...

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (11)
As of 2015-08-28 08:15 GMT
Find Nodes?
    Voting Booth?

    The oldest computer book still on my shelves (or on my digital media) is ...

    Results (335 votes), past polls