I'm working on a pljava module. In it, I'd like to cache some allocated
structures (allocated using TopMemoryContext) using a string as the key. I
need a hash or binary-search table with dynamic size where I can store
arbitrary structures and then find them using strings. Typical size is less
than 100 entries and performance will be an issue. I'm sure something like
this exists in postgres but I haven't been able to find it. Please point me
in the right direction.

Thanks,

Thomas Hallgren





Wed, 17 Dec 2003 13:49:27 +0100
"Thomas Hallgren" <thhal@mailblocks.com>
Need a good .
"Thomas Hallgren" <thhal@mailblocks.com> writes:
> I'm working on a pljava module. In it, I'd like to cache some allocated
> structures (allocated using TopMemoryContext) using a string as the key. I
> need a hash or binary-search table with dynamic size where I can store
> arbitrary structures and then find them using strings.

Take a look at src/backend/utils/hash/dynahash.c

-Neil


04 Jan 2004 11:19:32 -0500
Neil Conway <neilc@samurai.com>
Re: Need a good .