hash table hash function collision 哈希表哈希函数碰撞
For each row that satisfies the filter condition, the database server applies hash function to the key and proves the hash table to find a match.
在满足筛选器条件的每个行中，数据库服务器将对键应用哈希函数，并探测哈希表以查找匹配的键值。
It generates a hash table from the predetermined list of valid command-line options and a lookup function whose time complexity is o (1).
它将从预定的有效命令行选项列表和时间复杂度为O(1)的查找函数中生成一个散列表。
You can think of a hash table conceptually as a series of buckets, each with an address that is derived form the key value by applying the hash function.
可以在概念上将哈希表认为是一系列的 bucket，每个 bucket 所拥有的地址是通过应用哈希函数从键值导出的。
应用推荐