[Q] Does anyone have a radix search trie Smalltalkimplementation?

Rob Withers slosher2 at home.com
Sun Jul 30 18:10:20 UTC 2000


Thank you Alan,

I was starting to be a little concerned that no one was interested. 
:)   Thanks for the huge pointer on where to go next.

It definitly needs a speed up and better performance tests/monitors. 
We'll get better algorithms.  What I am really interested in is the full
unification in CLOS.  It almost seems as if it is related to AOP.  A
single object may want to register for several events with different
patterns.  Since every object in the system can be considered a 1 arity
tuple, we could get Object to understand match: and implement a
doubleDispatch to locate special cases.  You may want to register with
an ad hoc match algorithm, however.  VM and JIT support could go a long
way on restricted class spaces.  Since we have a oop fence with the vm
event channel, we could possibly apply the idea of an 'Protocol class'
which could help us find a restricted class implementation of the space
structure and algorithms.  Is this the path of least resistence?

Could you tell us a little more about full unification in CLOS?

cheers,
Rob
8-)

Alan Kay wrote:
> 
> Rob --
> 
> Much work was done in the area of fast correlation of tuples with
> event patterns for OPS5 at CMU and later, ART (automated reasoning
> tool) at Inference Corp (spinoff from CMU, they used to be located in
> LA).   Most of this would work very well for Linda (whose pattern
> matching is kind of a minimal subset of what ART could do). You
> should find some great algorithms for this in the literature. ART, in
> particular, was pretty fantastic at being able to have many thousands
> of patterned watchers all looking at a big constantly changing tuple
> space 1000s of times per second. Several really serious mainframe and
> terminal systems (e.g. for American Express, a large airline, etc.)
> were done in ART in the 1980s.
>       Much earlier (late 60s) Dave Fisher (CMU) and I independently
> showed NLogN event expression catchers (like boolean expressions but
> seeming to continuously and efficiently evaluate), some of whose
> technology was later incorporated into the highly engineered OPS5
> (and then ART) stuff.
>       You could also look at how LINDA has been incorporated into CLOS
> with full unification instead of just simple matching ...
>      I.e. a lot has been done in this area over the years.
> 
> Cheers,
> 
> Alan
> 
> At 10:32 AM -0700 7/30/00, Rob Withers wrote:
> >Or any abstract tree implementation.  There's no sense in reinventing
> >the wheel.  Even better would be a Slang implementation.  8-)   (drool)
> >
> >thanks,
> >Rob
> >
> >--
> >--------------------------------------------------
> >Smalltalking by choice.  Isn't it nice to have one!

-- 
--------------------------------------------------
Smalltalking by choice.  Isn't it nice to have one!





More information about the Squeak-dev mailing list