slom

Hi all,

Hi all,

I think Eli and Aziz defended the case quite well allready, but as the
author of the r6rs tiny-clos i think i should leave a comment or two
here too:

currently for simple benchmarks (fib anyone? I'm somewhere arround
10 times
slower than native application.

(swindle ~90, LispWorks claims to befaster than normal application
which i find highly confusing, haven't checked for others yet)


currently I only use a normal hash-table here, but it only retains
pointers
to generic functions, should be an easy fix if needed

(just to clarify: "normal" instances are not held in any way ...)

define portable, show me your portable (as in doesn't use
"implementation specific ways")
CL CLOS implementation and we can talk

(bonus points if you show me a *fast* CL CLOS that doesn't use
"implementation specific ways")


How does STKlos do speed wise? (also what about Gauche's clos, GOOPS?
I think these three are somehow
based on each other)


Whats missing in Swindle then?


--

Greets

Christian