Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Re: Forks and Spoons

by thatguy (Parson)
on Aug 09, 2001 at 23:42 UTC ( #103591=note: print w/replies, xml ) Need Help??

in reply to Forks and Spoons

If you are looking for docs, check out perlfunc:fork. Also turnstep has a pretty good explanation and example you might want to check out.

don't forget that the Super Search is your friend!


Replies are listed 'Best First'.
Re: Re: Forks and Spoons
by thatguy (Parson) on Aug 09, 2001 at 23:50 UTC
    i belive the quote is "If you can't find it with super search, it aint a substring of a text field in your database"

    (found that here)


Re: Re: Forks and Spoons
by Mr.T (Sexton) on Aug 09, 2001 at 23:44 UTC
    Oh cool! There is a super search? I'll have to try that out. Does it find more specific searches or something, and thus is superior to basic searching?

    qw/"I pity da foo' who don't use Perl!"/;

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://103591]
[LanX]: so the mayor of London should be better named First Minister of the London region and is on a comparable level like Nicola Sturgeon
[LanX]: ?

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (4)
As of 2017-12-15 18:13 GMT
Find Nodes?
    Voting Booth?
    What programming language do you hate the most?

    Results (440 votes). Check out past polls.