Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
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?
[Corion]: choroba: Yeah - I found that if you have the "right" datastructure from the start, it's fairly easy, but if you have some global datastructure that you mutate, you have to rewrite a lot to pass around the results instead.
[Corion]: I find the process quite similar to (in Prolog) passing around an accumulator variable in recursive predicates
[1nickt]: Good morning, brainy monks!

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (6)
As of 2017-12-11 11:25 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    What programming language do you hate the most?




















    Results (289 votes). Check out past polls.

    Notices?