散列法（Hashing）或哈希法是一种将字符组成的字符串转换为固定长度（一般是更短长度）的数值或索引值的方法，称为散列法，也叫哈希法。由于通过更短的哈希值比用原始值进行数据库搜索更快，这种方法一般用来在数据库中建立索引并进行搜索，同时还用在各种解密算法中。
散列法
双语例句原声例句
-
由于 MD5 散列法已经被破坏，客户明智地规定，所有密匙必须使用 SHA-1 签名。
Since MD5 hashing has been broken, the client wisely stipulated that all keys must be signed using SHA-1 instead.
-
散列法实现简单，但会影响中间件的互操作和可移植性，难以保证优先级映射的严格序关系；
Static mapping method is simple to be implemented, but it can break the interoperability, portability and the strict order of middlewares priorities.
-
散列函数非常复杂，但现代类库中都有现成的类，重要的是，如何对散列法进行细调以获得最好的性能。
Hash functions can be complex and sophisticated, but modern libraries have good defaults. The important thing is how hashes work and how to tune them for maximum performance benefit.
-
Because if you did what I suggested with the list, the time to look up the key would be linear in the length of the list. You'd have to look at each element until you found the key.
字典是用一种很神奇的，叫做散列法的算法,来实现的，后面我们将,会学到一点关于。
应用推荐
$firstVoiceSent
- 来自原声例句