Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Super Search

( #3989=superdoc: print w/replies, xml ) Need Help??

Help for this page

You can also try using Google's advanced search against PerlMonks.

Reset search form

Match text containing
(separate strings with -- default is spaces)
titles against above.

Please be patient after submitting your search.

Match titles containing
(separate strings with -- default is spaces)

authors
(use "[one] [two]" to list multiple authors)
(Searching by author doesn't work for Categorized Questions and Answers yet.)

Search ,
starting at - - .

Search
the following sections:

Skip text containing
(separate strings with -- default is spaces)
(Does not exclude based on titles)

Skip titles containing
(separate strings with -- default is spaces)






parent node's author
(use "[one] [two]" to list multiple authors)
(This doesn't work for Categorized Questions and Answers yet.)

Please be patient after submitting your search.

Log In?
Username:
Password:

What's my password?
Create A New User
Chatterbox?
[choroba]: MCE
[karlgoethebier]: is about to reach nirvana tonight...
[Lady_Aleena]: It could have meant a "Miserably Cute Event" or "Man Crush Everyday". 8)
[Corion]: choroba: Re the one-shot thing, I also thought of bit vectors and/or indexes into one common array from the hashes, but that makes maintenance of all these indices a chorse
[Corion]: *core
[Corion]: ** chore
[Corion]: So I guess I will simply implement the linear scan first and wait with more fancy stuff until it becomes a problem
[karlgoethebier]: Lady_Aleena: ++ for "The Man Crusher Everyday"
[karlgoethebier]: this mad my day
[karlgoethebier]: no typo

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (13)
As of 2017-05-29 08:30 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?