在满足筛选器条件的每个行中，数据库服务器将对键应用哈希函数，并探测哈希表以查找匹配的键值。
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.
要写出一个完美的哈希函数是很困难的，特别是要处理哈希表中的冲突。
Perfecting hashing is difficult and to deal with that hashtable implementations support collision resolution.
目前我们讨论的Vimscript基本特性(语句和函数，数组和哈希表)已经足够为Vim的核心特性集创建几乎任何类型的添加项。
The basic features of Vimscript covered so far (statements and functions, arrays, and hashes) are sufficient to create almost any kind of addition to Vim's core feature set.
应用推荐