Beefy Boxes and Bandwidth Generously Provided by pair Networks
good chemistry is complicated,
and a little bit messy -LW
 
PerlMonks  

Re^4: Why is this code so much slower than the same algorithm in C?

by Joost (Canon)
on Dec 10, 2008 at 23:28 UTC ( [id://729556]=note: print w/replies, xml ) Need Help??


in reply to Re^3: Why is this code so much slower than the same algorithm in C?
in thread Why is this code so much slower than the same algorithm in C?

Actually the code = data does not particularly enforce late compiling - it just means you can have a more efficient means to a] talk to the compiler and b] pre-process code before it reaches the compiler (since you can process structured data instead of strings). Being able to talk to the compiler from running code at all (using eval for example) is of course a good reason to optimize for all kinds of compiling speed-ups.

Anyway elisp is OK (if fairly slow), but it's quite archaic compared to scheme, common lisp and other "modern" lisps (basically any serious lisp created/standardized since the 80's). Most of the details are fairly easy to overcome, but the lack of true built-in support for lexical scoping (and closures) is probably the most annoying.

  • Comment on Re^4: Why is this code so much slower than the same algorithm in C?

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others having a coffee break in the Monastery: (8)
As of 2024-04-23 12:20 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found