search trees

[MisterX]

i use them in all my index fields in all TAOO stacks... 

Single linked-lists. Using the Keyword fields you get another
linked list and i got a double linked-list coming soon for
other stuff...

It's just a matter of organization...

in c you would do something like:
struct list{
 char *name;
 int	*link
} *listlink;

in Rev :
item 1 of a list is a name, item 2 is either a control ID or a long name or
a link to another array key member.

Very simple...

cheers
Xavier

> -----Original Message-----
> From: use-revolution-bounces at lists.runrev.com 
> [mailto:use-revolution-bounces at lists.runrev.com] On Behalf Of 
> Eric Engle
> Sent: Sunday, May 22, 2005 03:46
> To: use-revolution at lists.runrev.com
> Subject: re: search trees
> 
> 
> 
> On May 21, 2005, at 8:20 AM, Eric Engle wrote:
> 
> >> Does anyone know of any implementations of depth first, breadthe 
> >> first, or a* tree search algorithms using transcript, metatalk, or 
> >> hypertalk?
> 
> >For depth first, use the natural recursive invocation allowed in 
> >Transcript.
> 
> Sounds nice - but I have no idea what you are talking about. 
> 
> >For breadth first, ping pong between two lists of things
> to work on, copying from one to the other each generation. 
> 
> Again, this sounds nice, but I was really looking for a 
> practical example. Of
> course, I understand the theory of these searches. I'm just 
> trying to figure
> out the easiest way to implement in hypertalk or transcript.
> 
> Could you please elaborate or provide or point me to examples?
> 
> __________________________________________________
> Do You Yahoo!?
> Tired of spam?  Yahoo! Mail has the best spam protection around 
> http://mail.yahoo.com 
> _______________________________________________
> use-revolution mailing list
> use-revolution at lists.runrev.com
> http://lists.runrev.com/mailman/listinfo/use-revolution
>