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

Re: (FoxUni) Re: Nested data structures... nasty?

by Anonymous Monk
on May 29, 2002 at 00:03 UTC ( #169938=note: print w/ replies, xml ) Need Help??


in reply to Re: Nested data structures... nasty?
in thread Nested data structures... nasty?

Common Lisp has had those kind of optimizations for ages. You tell it what your variables hold, and how much effort it should spend compiling for speed, and it figures out the rest. The only catch is that it still does garbage collection.

For a real example of Common Lisp used in a high-performance situation, read this description of how Orbitz works.


Comment on Re: (FoxUni) Re: Nested data structures... nasty?

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://169938]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (9)
As of 2015-07-29 03:28 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (260 votes), past polls