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

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).


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]
[marto]: ambrus, thanks I ended up going with '//*[starts- with(@id, "thread_")]...
[ambrus]: Sometimes it's easier to just match elements in ways other than xpath, like directly with perl code.
[marto]: this is a cheap hack, a script that doesn't need to run for long, using WWW::Mechanize:: Firefox to drive some awful interface.
[marto]: if it were anything more serious I'd spend more time looking into it properly :P

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (10)
As of 2016-12-08 10:56 GMT
Find Nodes?
    Voting Booth?
    On a regular basis, I'm most likely to spy upon:

    Results (140 votes). Check out past polls.