will let you browse it. The general interface is gdbm() like and there
are both file backed and memory backed versions. It was designed to be
useful in small and large configs, you can get a hash into 128 bytes if
I recall correctly.
On Tue, Jul 17, 2001 at 05:57:25PM -0700, Brian J. Watson wrote:
> A couple of days ago, I was thinking about a common hash table
> implementation, ala include/linux/list.h. Then I came across
> include/linux/ghash.h, and thought that someone's already done it.
> After that I noticed the copyright line said 1997, and a quick check
> in cscope showed that nobody's including it.
> Does anyone know if this file is worth studying and working with? I
> have to wonder if nobody's using it after four years.
> Does anyone see a problem with a common hash table implementation?
> I've implemented a few hash tables from scratch for our clustering
> work, and it's starting to get a little old. Something easy to use
> like list.h would be a lot nicer.
> Brian Watson | "The common people of England... so
> Linux Kernel Developer | jealous of their liberty, but like the
> Open SSI Clustering Lab | common people of most other countries
> Compaq Computer Corp | never rightly considering wherein it
> Los Angeles, CA | consists..."
> | -Adam Smith, Wealth of Nations, 1776
> To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
> the body of a message to firstname.lastname@example.org
> More majordomo info at http://vger.kernel.org/majordomo-info.html
> Please read the FAQ at http://www.tux.org/lkml/
----- Larry McVoy lm at bitmover.com http://www.bitmover.com/lm - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to email@example.com More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/