The latest version can be downloaded here . These structures can be used to efficiently store and retrieve key-data pairs. Each of these structures can be accessed using its direct API, or it can be accessed using a dictionary abstraction. Probe search the data structure for the given key. If found, return it's associated data, otherwise, insert the given key-data pair.
Search search the data structure for the given key, and return the associated data, if found.
Const Search same as search but accepts a const pointer to the data structure instead and returns a const pointer to the associated data for the key. If found, remove the key-data pair from the data structure. Count return the number of key-data pairs stored in the data structure. Empty remove all key-data pairs from the data structure. Walk pass each key-data pair to a callback function, stopping when the callback functions returns 0.