SettingsAssociative arrays
Association list
In computer programming and particularly in Lisp, an association list, often referred to as an alist, is a linked list in which each list element (or node) comprises a key and a value.
In computer programming and particularly in Lisp, an association list, often referred to as an alist, is a linked list in which each list element (or node) comprises a key and a value.
Associative array
In computer science, an associative array, map, 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 computer science, an associative array, map, or dictionary is an abstract data type composed of a collection of (key,value) pairs, such that each possible key appears at most once...
Associative containers (C++)
In computing, associative containers refer to a group of class templates in the standard library of the C++ programming language that implement ordered associative arrays.
In computing, associative containers refer to a group of class templates in the standard library of the C++ programming language that implement ordered associative arrays.
Bidirectional map
In computer science, a bidirectional map is an associative data structure in which both types can be used as key.
In computer science, a bidirectional map is an associative data structure in which both types can be used as key.
Content Addressable Parallel Processor
A Content Addressable Parallel Processor (CAPP) is a type of parallel processor which uses content-addressing memory (CAM) principles.
A Content Addressable Parallel Processor (CAPP) is a type of parallel processor which uses content-addressing memory (CAM) principles.
Content-addressable memory
Content-addressable memory is a special type of computer memory used in certain very high speed searching applications.
Content-addressable memory is a special type of computer memory used in certain very high speed searching applications.
Content-addressable storage
Content-addressable storage, also referred to as associative storage or abbreviated CAS, is a mechanism for storing information that can be retrieved based on its content, not its st...
Content-addressable storage, also referred to as associative storage or abbreviated CAS, is a mechanism for storing information that can be retrieved based on its content, not its st...
Ctrie
A concurrent hash-trie or Ctrie is a concurrent thread-safe lock-free implementation of a hash array mapped trie.
A concurrent hash-trie or Ctrie is a concurrent thread-safe lock-free implementation of a hash array mapped trie.
Fusion tree
A fusion tree is a type of tree data structure that implements an associative array on w-bit integers.
A fusion tree is a type of tree data structure that implements an associative array on w-bit integers.
Hash array mapped trie
A hash array mapped trie is an implementation of an associative array that combines the characteristics of a hash table and an array mapped trie.
A hash array mapped trie is an implementation of an associative array that combines the characteristics of a hash table and an array mapped trie.
Index mapping
Index mapping is a computer science term (also known as a "trivial hash function") that is used to describe the mapping of raw data, used directly as in array index, for an array.
Index mapping is a computer science term (also known as a "trivial hash function") that is used to describe the mapping of raw data, used directly as in array index, for an array.
Lookup table
In computer science, a lookup table is a data structure, usually an array or associative array, often used to replace a runtime computation with a simpler array indexing operation.
In computer science, a lookup table is a data structure, usually an array or associative array, often used to replace a runtime computation with a simpler array indexing operation.
Multimap
A multimap is a generalization of a map or associative array abstract data type in which more than one value may be associated with and returned for a given key.
A multimap is a generalization of a map or associative array abstract data type in which more than one value may be associated with and returned for a given key.
X-fast trie
In computer science, an x-fast trie is a data structure for storing integers from a bounded domain.
In computer science, an x-fast trie is a data structure for storing integers from a bounded domain.