以上来源于: WordNet
Gperf considers only a subset of each keyword's characters as the key when it searches for a perfect hash function.
在搜索完美hash函数时，gperf只将每个关键字字符中的一部分作为搜索键。
A perfect hash function is produced when gperf finds a configuration that assigns each keysig to a unique location within the generated lookup table.
当gperf找到某种配置，并且该配置将每个keysig分配到生成的查找表中惟一位置时，将生成一个完美hash函数。
We use order preserving minimal perfect hash function to realize the search of terms library. It can not only upgrade the search speed, but also avoid sorting.
采用有序保留最小完全散列函数实现词库的查找，不但能加快查找速度，而且无需预先对单词排序。
应用推荐