GOODS data structures (was Re: [Seaside] [ANN] SeasideTemplate)

[Alain Fischer]

I wasn't knowing the existance of Squeak SkipList.
So, I googled and found that:
- Scott A Crosby refactoring with Dictionary protocol
    
http://lists.squeakfoundation.org/pipermail/squeak-dev/2002-February/ 
035066.html
- A paper on SkipList implementation
http://citeseer.nj.nec.com/cache/papers/cs/1389/ftp: 
zSzzSzftp.cs.umd.eduzSzpubzSzpaperszSzpaperszSzncstrl.umcpzSzCS-TR 
-2286.1zSzCS-TR-2286.1.pdf/pugh90skip.pdf

I think that Scott A Crosby implementation is what you want

Alain


On 24 févr. 04, at 11:33, Avi Bryant wrote:

>
> On Feb 24, 2004, at 2:17 AM, Alain Fischer wrote:
>
>> No for the moment, my largest data collection is between 50 and 100  
>> objects
>> and I haven't had performance problems. The others objects are already
>> organized as tree.
>>
>> But sure if we need to store bigger collection we will need something
>> with better performance, BTree is a good candidate.
>
> Göran points out that Skiplists would be good candidates as well.  I  
> had momentarily overlooked this because for some reason the Squeak  
> SkipList implementation doesn't provide a Dictionary protocol, but  
> instead acts like a SortedCollection (does anyone know the reason for  
> this?).  I'll probably end up building them both to compare.
>
> Avi
> _______________________________________________
> Seaside mailing list
> Seaside at lists.squeakfoundation.org
> http://lists.squeakfoundation.org/listinfo/seaside
>