24 Mar
2011
24 Mar
'11
7:49 a.m.
Hi Olivier,
2011/3/19 Olivier Guilyardi <list(a)samalyse.com>om>:
On 03/18/2011 06:06 PM, Olivier Guilyardi wrote:
I see nobody answered yet... but don't despair, it's probably because
the long-awaited LV2r4 release made David want to run away for a
while. :-)
However, I have no idea why he needs such a thing and I have to admit
my ignorance in this regard (the only thing I ever read about radix
trees is the Wikipedia article, I'm afraid).
In any case, I have to ping him for a number of related things w.r.t.
SLV2 (Windows port, mostly), so I will try to remember him about this.
Best regards,
Stefano
Hi!
On 03/11/2011 07:22 PM, David Robillard wrote:
Alright, attached is a minimal radix tree implementation. I just wrote it from
scratch. Would that work for sord?
If so, I'll try and benchmark it and do some more tests.
Attached is an updated version with a couple of fixes and optimizations. On Fri, 2011-03-11 at 12:08 +0100, Olivier
Guilyardi wrote:
I will
try and submit a patch to remove glib. It'll take some time because I
have dozens of other things to do, but I will work on this. I had a quick look
at sord, it seems it only needs glib's sequence and hash table. Is this correct,
or will you need some more utilities?
Overall I need sequence, hash table (or hash
table like thing, I'll
probably use a radix tree)