On 19 Jul 2010, at 00:15, Jacko wrote:
I remember now why I stopped reading CLF…
Simple really, if Lisp’s (X , Y) construct should have limits placed
on assignment of Y for translation lookaside buffer vitual memory
mapping thrashing and for easier garbage collection (provable), then
are there any structures in Ruby that may be better adapted such that
kernal poijnters may be used for faster code, and possibly extra
memory bandwidth for no garbage collector gc stalls and faster code?
There could well be places in a Ruby runtime where such an approach
would be possible although that may not be true for any of the current
Do you have a link through to the original articles/sites describing
this modification to Lisp along with some code examples?
raise ArgumentError unless @reality.responds_to? :reason