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

RE: Considering Super Search

by knight (Friar)
on Oct 30, 2000 at 22:16 UTC ( #39157=note: print w/replies, xml ) Need Help??


in reply to Considering Super Search

I'd also like an option to search an entire thread, not just individual nodes. I ran into a situation recently where I could remember one keyword from a thread's root node, and a different keyword from one of the replies, but there was no single node that had both words. When searching for common Perl words ("undef", "module", etc.) the sheer number of single-word matches returned by Super Search can get overwhelming...

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://39157]
help
Chatterbox?
[Discipulus]: Ah! if so you must play with him not with us ;=)
[vrk]: Hope he gets better soon.
[Discipulus]: hdb sorry i profit; is known that a prime number is never a figurate one nor the sumattion of two adjacent figurates of the same order? like 3th triangular+3th tetrahedric
[Discipulus]: if known where i can read about the matter?
[choroba]: he's not really sick, we just got nobody to look after him today

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (6)
As of 2017-04-27 07:53 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I'm a fool:











    Results (501 votes). Check out past polls.