Beefy Boxes and Bandwidth Generously Provided by pair Networks Frank
"be consistent"
 
PerlMonks  

Re (tilly) 6: Refactor method calls or not?

by tilly (Archbishop)
on Jan 22, 2002 at 00:44 UTC ( [id://140565]=note: print w/replies, xml ) Need Help??

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


in reply to Re: Re: Re: Re: Re: Refactor method calls or not?
in thread Refactor method calls or not?

You can learn an idea in any language that supports it. If it is easier to learn this kind of technique in Lisp, it is because Lisp has a high density of "expert experts". However Perlmonks is not doing too badly on that measure either.

As for the similarity between the two solutions, they are similar and different. They are conceptually similar in that you institute the idea of code that writes your functions for you. But the ways that they allow you to dynamically generate code are completely unrelated mechanisms, and the difference has implications for memory usage, run-time performance, and flexibility. (The Lisp solution will, all else being equal, use more memory, have better run-time performance (as long as cache-misses are irrelevant), and is more flexible in what you can easily accomplish. Of course all else is not equal...)

  • Comment on Re (tilly) 6: Refactor method calls or not?

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://140565]
help
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    hippoepoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.