Associative array

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 at most once in the collection. 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 at most once in the collection. Operations associated with this data type allow: 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.The two major solutions to the dictionary problem are a hash table or a search tree.In some cases it is also possible to solve the problem using directly addressed arrays, binary search trees, or other more specialized structures. 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. The name does not come from the associative property known in mathematics. Rather, it arises from the fact that we associate values with keys. In an associative array, the association between a key and a value is often known as a 'binding', and the same word 'binding' may also be used to refer to the process of creating a new association. The operations that are usually defined for an associative array are: Often then instead of add or reassign there is a single set operation that adds a new ( k e y , v a l u e ) {displaystyle (key,value)} pair if one does not already exist, and otherwise reassigns it.