Thanks Georg,

	I'll study this tree

Sebastián Sastre
ssastre at seaswork.com.ar
www.seaswork.com.ar


> -----Mensaje original-----
> De: squeak-dev-bounces at lists.squeakfoundation.org 
> [mailto:squeak-dev-bounces at lists.squeakfoundation.org] En 
> nombre de Georg Gollmann
> Enviado el: Miércoles, 15 de Septiembre de 2004 03:52
> Para: The general-purpose Squeak developers list
> Asunto: Re: Searcheable BTree
> 
> 
> Am 15.09.2004 um 02:32 schrieb Sebastian Sastre:
> > Hi everybody, Avi,
> >  
> >     for a BTree, a message like
> >     
> >      >>keysStartingWith: aString
> >   
> >     that returns a set of keys will be *very* useful.
> >  
> >     I wonder if anybody has implemented an extension of the 
> available
> > Avi's BTree, or other implementation of your own, that 
> supports this 
> > kind of wilcarded key search.
> 
> You might want to look at 
> http://sts.tuwien.ac.at/go/GemStuff/DiscriminationTree.st
> This is for GemStone but should port easily.
> 
> Georg
> 
> ---
> Incoming mail is certified Virus Free.
> Checked by AVG anti-virus system (http://www.grisoft.com).
> Version: 6.0.760 / Virus Database: 509 - Release Date: 10/09/2004
>  
> 

---
Outgoing mail is certified Virus Free.
Checked by AVG anti-virus system (http://www.grisoft.com).
Version: 6.0.760 / Virus Database: 509 - Release Date: 10/09/2004