تعريف hash table في الإنجليزية الإنجليزية القاموس.
An associative array implemented as a vector, the indexes into which are the result of applying a hash function to the key
A data structure that divides all elements into (preferably) equal-sized categories, or buckets, to allow quick access to the elements The hash function determines which bucket an element belongs in
Hashing data into the format of a hash table lets specially designed programs search for data quickly A hash table assigns a special search code to each piece of data For example, the C shell uses a hash table to locate commands more quickly; the rehash (4 2) command rebuilds the hash table after you add a new command
(Bilgisayar) In computer science, a hash table, or a hash map, is a data structure that associates keys with values. The primary operation it supports efficiently is a lookup: given a key (e.g. a person's name), find the corresponding value (e.g. that person's telephone number). It works by transforming the key using a hash function into a hash, a number that is used as an index in an array to locate the desired location ("bucket") where the values should be