Mattijsen lt;[EMAIL PROTECTED]gt; -
Delivered-To: [EMAIL PROTECTED]
In-Reply-To: lt;[EMAIL PROTECTED]gt;
Date: Mon, 10 Mar 2003 15:33:38 +0100
To: Tim Bunce lt;[EMAIL PROTECTED]gt;, [EMAIL PROTECTED]
From: Elizabeth Mattijsen lt;[EMAIL PROTECTED]gt;
Subject: Re: The Judy algorithm
At 10:37
I think this might be interesting to some of you...
Judy is a general purpose dynamic array implemented as a C callable
library. Judy's speed and memory usage are typically better than
other data storage models and improves with very large data sets.
Tim Bunce wrote:
I think this might be interesting to some of you...
http://sourceforge.net/projects/judy
Indeed. Maybe someone can wrap up list.c and/or hash.c and compare
performance for typical usage patterns - however they look like - but
mainly linear in arrays I presume.
t/src/intlist
At 10:37 + 3/10/03, Tim Bunce wrote:
I think this might be interesting to some of you...
Judy is a general purpose dynamic array implemented as a C callable
library. Judy's speed and memory usage are typically better than
other data storage models and improves with very large data sets.
