Array and Hash-Table References
What are the pros and cons of a Lisp in which (AREF x 3) and (GETHASH
'c y), for example, becomes (x 3) and (y 'c), respectively? The
latter are more concise; is there a down side?
.
Relevant Pages
- How to Speed up Cellular Automata [was Re: How to speed up an OpenGL application?]
... In the loop you hit aref a dozen times, god knows what else, without an iota of optimization. ... Lisp does more by default, so if you need to write ... (if (zerop cell) ...
(comp.lang.lisp) - Re: Program compression
... problems to be solved much more concisely than with Lisp. ... is competitively concise. ... let's say you have a text string which contains the notation ...
(comp.programming) - Creating setf expanders on methods
... data types (elt, aref, gethash, etc.) are a bit of an annoyance. ... Especially gethash, ... Obviously, though, I want ref to act appropriately in setf. ...
(comp.lang.lisp) - Re: is there a more concise or efficient way to code this fn ?
... > Your code is fine and no less concise than any recursive version I can ... > (you have written it correctly to take advantage of tail recursion, ... > Common Lisp doesn't guarantee that a compiler will cooperate). ... Where fold-right is predefined in my environment as... ...
(comp.lang.lisp) - Re: Very poor Lisp performance
... >> I had played with Lisp in various forms a number of times before, ... And OCaml is a great language for many tasks, ... > C. Do you think that Lisp is more concise than OCaml, ... A literal translation of a slab of Lisp ...
(comp.lang.lisp) |
|
