Sujet : Re: DEFUN list argument
De : mail (at) *nospam* axel-reichert.de (Axel Reichert)
Groupes : comp.lang.lisp comp.lang.schemeSuivi-à : comp.lang.lispDate : 29. Sep 2024, 12:51:54
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <87plom3cf9.fsf@axel-reichert.de>
References : 1 2
User-Agent : Gnus/5.13 (Gnus v5.13) Emacs/28.2 (gnu/linux)
Kaz Kylheku <
643-408-1753@kylheku.com> writes:
Scheme offers very little; most serious work done with Scheme picks an
implementation and uses it.
>
Many of your own posts pick a particular Scheme like Gauche and often
use its extensions that are not in Scheme.
Like in geography: "Where does London end?" (-:
Linked lists have poor cache performance. Chasing down a linked list
involved dependent loads which the machine cannot prefetch, unlike
marching down an array that is contiguously laid out in memory.
>
The battle you are trying to pick here is outdated.
I have read so a couple of times. Interesting. But what is a Lisper to
do in the source code? Convert it all to vectors/arrays? Use more
imperative idioms than recursion? Do not care, because it is all handled
by the implementation?
Honestly curious,
Axel