Associative array: Difference between revisions
Content added Content deleted
(see also) |
(detail, copyedit) |
||
| Line 1: | Line 1: | ||
[[Category:Encyclopedia]]An array where the indices are not just integers but may be arbitrary |
[[Category:Encyclopedia]]An array where the indices are not just integers but may be arbitrary data types. 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 |
|||
Copyright 1993 by Denis Howe |
|||
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.1 or any later version published by the Free Software Foundation; with no Invariant Sections, Front- or Back-Cover Texts. |
|||
== See also == |
== See also == |
||
Revision as of 19:36, 31 January 2008
An array where the indices are not just integers but may be arbitrary data types. 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