Difference between revisions of "Hash"
Jump to navigation
Jump to search
m |
m |
||
| Line 1: | Line 1: | ||
A hash function is any function that can be used to map data of arbitrary size to fixed-size values. The values returned by a hash function are called hash values, hash codes, digests, or simply hashes. Use of a hash function to index a hash table is called hashing or scatter storage addressing. | A hash function is any function that can be used to map data of arbitrary size to fixed-size values. The values returned by a hash function are called hash values, hash codes, digests, or simply hashes. Use of a hash function to index a hash table is called hashing or scatter storage addressing. | ||
| − | {{wp | | + | {{wp | Hash_function}} |
Revision as of 16:54, 10 January 2022
A hash function is any function that can be used to map data of arbitrary size to fixed-size values. The values returned by a hash function are called hash values, hash codes, digests, or simply hashes. Use of a hash function to index a hash table is called hashing or scatter storage addressing.
