Re: [q-lang-users] Association lists

[Eddie R. <ed...@ri...>]

Great! I use those libraries very often. Making those libraries faster 
would definitely improve the execution of most (all?) of my programs.

Thanks Jiri!

Eddie Rucker

Albert Graef wrote:
> Hi Jiri,
> 
> that looks nice, thanks a lot. Do you have a sf.net account? Then I
> could give you wiki access so that you can upload and describe it there.
> 
> Indeed your implementation seems to be much faster than the one in the
> standard library (which was based on Bird/Wadler). Care to elaborate on
> the implementation tricks that make this happen? Maybe we should redo
> bag, set and hdict, too, and replace the stdlib implementations...
> 
> Albert
> 
> Jiri Spitz wrote:
>> I have ported and completed the association lists based on AVL trees
>> from the SWI-Prolog to Q. Enclosed you will find the dict.q rewritten to
>> use this algorithm. It is not as elegant as the current implementation
>> (it is rather tricky), but the tree updates are more than two times
>> faster for large dictionaries.
>