散列算法c语言
I try to find some Hashing libraries for C and find several good ones.
我尝试找到一些用于C的哈希库,并找到几个好的库。
The hsearch function in the GNU C library.
There are other methods to organize information which later should be searched. The costs of insert, delete and search differ. One possible implementation is using hashing tables. The following functions are declared in the header file search.h.
还有其他组织信息的方法,以后应进行搜索。 插入,删除和搜索的成本有所不同。 一种可能的实现方式是使用哈希表。 头文件search.h中声明了以下函数。
CMPH – C Minimal Perfect Hashing Library.
The CMPH Library encapsulates the newest and more efficient algorithms in an easy-to-use, production-quality, fast API. The library was designed to work with big entries that cannot fit in the main memory. It has been used successfully for constructing minimal perfect hash functions for sets with more than 100 million of keys, and we intend to expand this number to the order of billion of keys.
CMPH 库以易于使用,高质量,快速的API封装了最新,更高效的算法。 该库旨在处理无法容纳在主存储器中的大型条目。 它已成功用于为拥有超过1亿个键的集合构造最小的完美哈希函数,并且我们打算将此数字扩展到十亿个键的数量级。
libghthash is a Generic Hash Table which is meant to be easy to extend, portable, clear in its code and easy to use. You can store any kind of data in it, regardless of size etc. It should be fairly portable, and has been successfully tried on Linux/x86, Solaris/SPARC and Win2000/x86 so far.
libghthash是通用哈希表,它易于扩展,可移植,代码清晰且易于使用。 您可以在其中存储任何类型的数据,而不管其大小如何。它应该是可移植的,并且到目前为止已经在Linux / x86,Solaris / SPARC和Win2000 / x86上成功进行了尝试。
散列算法c语言