|
|
| Problems? Is your data what you think it is? | |
| PerlMonks |
Re^3: How A Function Becomes Higher Orderby jdporter (Paladin) |
| on Sep 16, 2005 at 14:51 UTC ( [id://492722]=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.
O.k., you're talking about extending the one function in situ, not the kind of extension that subclassing or aggregation gives. And that's essentially my complaint about this technique: it's nearly impossible to build large, extensible frameworks with. In my experience, functional programming works great at small levels of granularity; for anything larger, OO is far more useful. (Of course, the FP purists will disagree, and I'm not saying they're wrong.)
In Section
Tutorials
|
|
||||||||||||||||||||||||||||||