✳flâneur — a map of the web's best reading

Hash function - Wikipedia

en.wikipedia.org · 8,684 words · saved by 1 readers

A hash function is any function that can be used to map data of arbitrary size to fixed-size values, though there are some hash functions that support variable-length output.[1] The values returned by a hash function are called hash values, hash codes, (hash/message) digests,[2] or simply hashes. The values are usually used to index a fixed-size table called a hash table. Use of a hash function to index a hash table is called hashing or scatter-storage addressing. Hash functions and their associated hash tables are used in data storage and retrieval applications to access data in a small and nearly constant time per retrieval. They require an amount of storage space only fractionally greater than the total space required for the data or records themselves. Hashing is a computationally- and storage-space-efficient form of data access that avoids the non-constant access time of ordered and unordered lists and structured trees, and the often-exponential storage requirements of direct acce

Hash function - Wikipedia Jump to content From Wikipedia, the free encyclopedia Mapping arbitrary data to fixed-size values "hashlink" redirects here. For the Haxe virtual machine, see HashLink . "Hash code" redirects here. For the programming competition, see Hash Code (programming competition) . This article is about a computer programming construct. For other meanings of "hash" and "hashing", see Hash (disambiguation) . This section needs more citations . Please help improve this section by adding citations to reliable sources . Unsourced material may be challenged and removed . ( July 2010

Explore this link on the map →

related reading