Associative array: Difference between revisions
Content added Content deleted
No edit summary |
No edit summary |
||
Line 1: | Line 1: | ||
[[Category:Encyclopedia]]An '''associative array'' is a collection indexed by arbitrary data types, not just small integers. Whereas an [[array]] is typically implemented as many same-sized items stored in a contiguous chunk of memory, an associative array must be implemented via a more complex data structure, such as a hash table, alist, or some other type of map. |
[[Category:Encyclopedia]]An '''associative array''' is a collection indexed by arbitrary data types, not just small integers. Whereas an [[array]] is typically implemented as many same-sized items stored in a contiguous chunk of memory, an associative array must be implemented via a more complex data structure, such as a hash table, alist, or some other type of map. |
||
==References== |
==References== |
Revision as of 19:37, 31 January 2008
An associative array is a collection indexed by arbitrary data types, not just small integers. Whereas an array is typically implemented as many same-sized items stored in a contiguous chunk of memory, an associative array must be implemented via a more complex data structure, such as a hash table, alist, or some other type of map.
References
- Free On-line Dictionary of Computing, http://foldoc.org/, Editor Denis Howe