Erlang Central

Difference between revisions of "Category:HashRecipes"

From ErlangCentral Wiki

Line 2: Line 2:
 
A hash table is a data structure that associates keys with values. The primary operation it supports efficiently is a lookup, where for a given identifier (key) is used to find the corresponding value.  Hashes work by transforming the key using a hash function into a unique identifier used to locate the desired value.  
 
A hash table is a data structure that associates keys with values. The primary operation it supports efficiently is a lookup, where for a given identifier (key) is used to find the corresponding value.  Hashes work by transforming the key using a hash function into a unique identifier used to locate the desired value.  
  
Although associative arrays may seem at odds with Erlang's single-assignment nature, Erlang in fact provides several comparable data structures, including dictionaries (see the 'dict' module), hash tables (see the 'ets' module), and a variety of other implementations.
+
Although associative arrays may seem at odds with Erlang's single-assignment nature, Erlang in fact provides several comparable data structures, including dictionaries (see the 'dict' module),[http://www.rushessay.com write my essay][http://www.example.com link title] hash tables (see the 'ets' module), and a variety of other implementations.
  
 
Consequently, Erlang can provide [http://portal.acm.org/citation.cfm?id=940887 efficient] (and safe) mechanisms for associative arrays.
 
Consequently, Erlang can provide [http://portal.acm.org/citation.cfm?id=940887 efficient] (and safe) mechanisms for associative arrays.

Revision as of 21:15, 26 April 2010

Introduction

A hash table is a data structure that associates keys with values. The primary operation it supports efficiently is a lookup, where for a given identifier (key) is used to find the corresponding value. Hashes work by transforming the key using a hash function into a unique identifier used to locate the desired value.

Although associative arrays may seem at odds with Erlang's single-assignment nature, Erlang in fact provides several comparable data structures, including dictionaries (see the 'dict' module), write my essaylink title hash tables (see the 'ets' module), and a variety of other implementations.

Consequently, Erlang can provide efficient (and safe) mechanisms for associative arrays.

See Category:HashRecipes for more on this topic.

Pages in category ‘HashRecipes’

The following 4 pages are in this category, out of 4 total.