Dictionary (data structure)" redire

Dictionary (data structure)" redirects here. It is not to be confused with data dictionary.
"Associative container" redirects here. For the implementation of ordered associative arrays in the standard library of the C++ programming language, see Associative containers.
In computer science, an associative array, map, symbol table, or dictionary is an abstract data type composed of a collection of (key, value) pairs, such that each possible key appears just once in the collection.

Operations associated with this data type allow:[1][2]

the addition of pairs to the collection
the removal of pairs from the collection
the modification of the values of existing pairs
the lookup of the value associated with a particular key
The dictionary problem is a classic computer science problem: the task of designing a data structure that maintains a set of data during 'search' 'delete' and 'insert' operations.[3] A standard solution to the dictionary problem is a hash table; in some cases it is also possible to solve the problem using directly addressed arrays, binary search trees, or other more specialized structures.[1][2][4]

Many programming languages include associative arrays as primitive data types, and they are available in software libraries for many others. Content-addressable memory is a form of direct hardware-level support for associative arrays.

Associative arrays have many applications including such fundamental programming patterns as memoization and the decorator pattern.[5]

Results (English) 3:

Dictionary (data structure). "Redirects here. It is not to be confused with data dictionary.
." Associative container redirects. " Here. For the implementation of ordered associative arrays in the standard library of the C, programming language see. Associative containers.
In Computer Science an associative, array map symbol table,,,Or dictionary is an abstract data type composed of a collection of (,), key value pairs such that each possible key appears. Just once in the collection.

Operations associated with this data type allow: [] [] 1 2

the addition of pairs to the collection
the. Removal of pairs from the collection
the modification of the values of existing pairs
the lookup of the value associated. With a particular key
.The dictionary problem is a classic computer science problem: the task of designing a data structure that maintains a set. Of data during 'search.' '' '' delete and insert operations. [] A 3 standard solution to the dictionary problem is a hash table;? In some cases it is also possible to solve the problem using directly addressed arrays binary search, trees or other, more. Specialized structures.[] [] [1 2 4]

Many programming languages include associative arrays as primitive data types and they, are available in software. Libraries for many others. Content-addressable memory is a form of direct hardware-level support for associative arrays.

Associative. Arrays have many applications including such fundamental programming patterns as memoization and the decorator pattern 5. [].