"Josh Sebastian" <sebasttj@gmail.com> writes:

> On Mar 26, 3:24 pm, mr.h...@gmail.com wrote: 
>
> Look at the functions in search.h (eg, tsearch(3)). C++98's std::set
> tends to provide a set-like interface to a binary tree implementation,
> so you could provide your own light interface wrapper around the POSIX
> tree implementation.
>
> My man page says the tree functions are SVID only; the hash map (eg,
> hcreate(3)) functions are POSIX, though, and those could also be
> adapted to provide set-like operations.

The problem with the hash functions is that they are practically
impossible to use sensibly.  The standard functions only let you have
*one* global hash table, and the non-standard reentrant ones are,
well, non-standard.

--
Måns Rullgård
mans@mansr.com

[ Post a follow-up to this message ]