sglib-general

[Eric L. <co...@er...>]

Hello,

I have used SGLIB by now several times, and I have found the design and 
implementation very effective.

The feature that seems missing to me is an API for storing and fetching 
values by key in a dictionary.  In contrast, the existing binary/RB 
trees and hash table interfaces are best suited for abstracting sets. 
The hash and comparator functions operate on values not keys, so the 
only a way to achieve dictionary functionality, as far as I can see, is 
too fake it with an intermediary key-and-value struct where the value 
field can be left empty for lookups.

I would be curious to know the thoughts of others on this topic.

Sincerely,
Eric Levy