Hash function

A hash coding function which assigns a data item distinguished by some “key” into one of a number of possible “hash buckets” in a hash table. The hash function is usually combined with another more precise function.
For example a program might take a string of letters and put it in one of twenty six lists depending on its first letter. Ideally, a hash function should distribute items evenly between the buckets to reduce the number of hash collisions. If, for example, the strings were names beginning with “Mr.”, “Miss” or “Mrs.” then taking the first letter would be a very poor hash function because all names would hash the same.


Read Also:

  • Hashhead

    [hash-hed] /ˈhæʃˌhɛd/ noun, Slang. 1. a hashish addict.

  • Hash head

    noun phrase A frequent user of hashish or marijuana (1950s+ Narcotics)

  • Hash-house

    noun, Slang. 1. an inexpensive restaurant, diner, or the like, that serves a limited number of short-order dishes: We stopped for lunch at a roadside hash house. noun 1. (US, slang) a cheap café or restaurant noun A restaurant or lunch counter, esp a cheap one; hashery: the sort of lan-guage that one would expect […]

  • Hashimite

    [hash-uh-mahyt] /ˈhæʃ əˌmaɪt/ noun 1. a member of any Arab dynasty in the Middle East founded by Husein ibn-Ali or his descendants. adjective 2. of or relating to the Hashimites.

Disclaimer: Hash function definition / meaning should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional. All content on this website is for informational purposes only.