[retroforth] Re: Reva 5.0.0.6 released
- From: "Ron Aaron" <ron@xxxxxxxxxxx>
- To: retroforth@xxxxxxxxxxxxx
- Date: Fri, 28 Jan 2005 09:55:33 -0800 (PST)
On Fri, January 28, 2005 9:05, Helmar Wodtke said:
> Well, very good. I want to explain what I mean with "self-reflective".
Yes, for turnkey it's a good thing.
I was going to add a field which says explicitly how big the word is so that
'see' could actually work correctly in all cases.
> I use in HelFORTH a strategy that makes it possible to clone the FORTH core in
> it's own segment. This is fine to play with :) You can start one system that
I need to do something like that for Reva...
> I'm currently a little bit back from this idea. I used it some years ago for a
I was considering hashing. But the regular lookup is quite fast enough for my
purposes. But when I have a 'real' app on Reva, then I will know if it's fast
enough.
> BTW: my code for the search "optimization" in HelFORTH - the difference in
> dictionary structure is that the tick information is stored after the name
> (you see: after comparisation a pointer already points to that position. The
> reason that I made it this way is that I can put more fields in the dictionary
> after the tick information without to change too much on other places :) )
Hmm... But the existing structure makes traversing faster I think. Maybe
not.
--
My GPG public key is at http://ronware.org/
fingerprint: 8130 734C 69A3 6542 0853 CB42 3ECF 9259 AD29 415D
Other related posts:
