<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://wiki.karljones.com/index.php?action=history&amp;feed=atom&amp;title=Associative_array</id>
		<title>Associative array - Revision history</title>
		<link rel="self" type="application/atom+xml" href="http://wiki.karljones.com/index.php?action=history&amp;feed=atom&amp;title=Associative_array"/>
		<link rel="alternate" type="text/html" href="http://wiki.karljones.com/index.php?title=Associative_array&amp;action=history"/>
		<updated>2026-10-23T14:51:36Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.24.2</generator>

	<entry>
		<id>http://wiki.karljones.com/index.php?title=Associative_array&amp;diff=17456&amp;oldid=prev</id>
		<title>Karl Jones: Created page with &quot;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 p...&quot;</title>
		<link rel="alternate" type="text/html" href="http://wiki.karljones.com/index.php?title=Associative_array&amp;diff=17456&amp;oldid=prev"/>
				<updated>2016-08-29T17:32:59Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot;In &lt;a href=&quot;/index.php/Computer_science&quot; title=&quot;Computer science&quot;&gt;computer science&lt;/a&gt;, an &amp;#039;&amp;#039;&amp;#039;associative array&amp;#039;&amp;#039;&amp;#039;, map, symbol table, or dictionary is an abstract data type composed of a collection of (key, value) pairs, such that each p...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;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.&lt;br /&gt;
&lt;br /&gt;
== Description ==&lt;br /&gt;
&lt;br /&gt;
Operations associated with this data type allow:&lt;br /&gt;
&lt;br /&gt;
* the addition of a pair to the collection&lt;br /&gt;
* the removal of a pair from the collection&lt;br /&gt;
* the modification of an existing pair&lt;br /&gt;
* the lookup of a value associated with a particular key&lt;br /&gt;
&lt;br /&gt;
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.&lt;br /&gt;
&lt;br /&gt;
The two major solutions to the dictionary problem are a [[hash table]] or a [[search tree]].&lt;br /&gt;
&lt;br /&gt;
In some cases it is also possible to solve the problem using directly addressed arrays, binary search trees, or other more specialized structures.&lt;br /&gt;
&lt;br /&gt;
Many [[Programming language|programming languages]] include associative arrays as primitive data types, and they are available in software libraries for many others.&lt;br /&gt;
&lt;br /&gt;
Content-addressable memory is a form of direct hardware-level support for associative arrays.&lt;br /&gt;
&lt;br /&gt;
Associative arrays have many applications including such fundamental programming patterns as memoization and the decorator pattern.&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
&lt;br /&gt;
* [[Key-value database]]&lt;br /&gt;
* [[Tuple]]&lt;br /&gt;
* [[Function (mathematics)]]&lt;br /&gt;
* [[Function (programming)]]&lt;br /&gt;
* [[JSON]]&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
&lt;br /&gt;
* [https://en.wikipedia.org/wiki/Associative_array Associative array] @ Wikipedia&lt;br /&gt;
&lt;br /&gt;
[[Category:Computer science]]&lt;/div&gt;</summary>
		<author><name>Karl Jones</name></author>	</entry>

	</feed>