<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>JacksonDunstan.com &#187; arrays</title>
	<atom:link href="http://jacksondunstan.com/articles/tag/arrays/feed" rel="self" type="application/rss+xml" />
	<link>http://jacksondunstan.com</link>
	<description>Mastering AS3</description>
	<lastBuildDate>Thu, 29 Jul 2010 17:27:33 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Functional Methods</title>
		<link>http://jacksondunstan.com/articles/706</link>
		<comments>http://jacksondunstan.com/articles/706#comments</comments>
		<pubDate>Mon, 21 Jun 2010 09:00:31 +0000</pubDate>
		<dc:creator>jackson</dc:creator>
				<category><![CDATA[AS3]]></category>
		<category><![CDATA[arrays]]></category>
		<category><![CDATA[functional]]></category>
		<category><![CDATA[functions]]></category>
		<category><![CDATA[inlining]]></category>
		<category><![CDATA[performance]]></category>
		<category><![CDATA[vectors]]></category>

		<guid isPermaLink="false">http://jacksondunstan.com/?p=706</guid>
		<description><![CDATA[Both Array and Vector have some methods that allow AS3 programmers to do some functional programming: every, filter, forEach, map, and some. These can lead to flexible and concise code, but at what performance cost? Today I&#8217;ll test them to get a handle on just how much speed you&#8217;re giving away by using these methods.

The [...]]]></description>
		<wfw:commentRss>http://jacksondunstan.com/articles/706/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Declaring Vectors</title>
		<link>http://jacksondunstan.com/articles/702</link>
		<comments>http://jacksondunstan.com/articles/702#comments</comments>
		<pubDate>Mon, 14 Jun 2010 09:00:48 +0000</pubDate>
		<dc:creator>jackson</dc:creator>
				<category><![CDATA[AS3]]></category>
		<category><![CDATA[arrays]]></category>
		<category><![CDATA[cast]]></category>
		<category><![CDATA[declare]]></category>
		<category><![CDATA[operators]]></category>
		<category><![CDATA[performance]]></category>
		<category><![CDATA[syntax]]></category>
		<category><![CDATA[vectors]]></category>

		<guid isPermaLink="false">http://jacksondunstan.com/?p=702</guid>
		<description><![CDATA[The differences between Vector and Array have been quite interesting since Vector was introduced in Flash Player 10. Until just recently I didn&#8217;t know that there was special syntax for declaring a Vector akin to Array's special a = [1,2,3,4,5] trick. This got me thinking about the various ways one can declare a Vector and, [...]]]></description>
		<wfw:commentRss>http://jacksondunstan.com/articles/702/feed</wfw:commentRss>
		<slash:comments>22</slash:comments>
		</item>
		<item>
		<title>Linked Lists: Part 3</title>
		<link>http://jacksondunstan.com/articles/558</link>
		<comments>http://jacksondunstan.com/articles/558#comments</comments>
		<pubDate>Wed, 23 Dec 2009 09:00:26 +0000</pubDate>
		<dc:creator>jackson</dc:creator>
				<category><![CDATA[AS3]]></category>
		<category><![CDATA[arrays]]></category>
		<category><![CDATA[linked lists]]></category>
		<category><![CDATA[performance]]></category>

		<guid isPermaLink="false">http://jacksondunstan.com/?p=558</guid>
		<description><![CDATA[Continuing in the series on linked lists that started with parts one and two, today I&#8217;ll make the first serious optimization pass on the LinkedList implementation. Read on for how successful this is.

Firstly, while I claimed last time that the API was complete, I changed it slightly this time. I realized that the two Array [...]]]></description>
		<wfw:commentRss>http://jacksondunstan.com/articles/558/feed</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Linked Lists: Part 2</title>
		<link>http://jacksondunstan.com/articles/552</link>
		<comments>http://jacksondunstan.com/articles/552#comments</comments>
		<pubDate>Mon, 21 Dec 2009 09:00:02 +0000</pubDate>
		<dc:creator>jackson</dc:creator>
				<category><![CDATA[AS3]]></category>
		<category><![CDATA[arrays]]></category>
		<category><![CDATA[linked lists]]></category>
		<category><![CDATA[performance]]></category>

		<guid isPermaLink="false">http://jacksondunstan.com/?p=552</guid>
		<description><![CDATA[Last time I began covering linked lists in AS3. As anyone who has ever taken a data structures class can tell you, this is definitely a core data structure. As such, it has numerous benefits compared to other single-dimensional data structures like arrays and hash tables. The Array class in AS3 is far from a [...]]]></description>
		<wfw:commentRss>http://jacksondunstan.com/articles/552/feed</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Linked Lists: Part I</title>
		<link>http://jacksondunstan.com/articles/548</link>
		<comments>http://jacksondunstan.com/articles/548#comments</comments>
		<pubDate>Fri, 18 Dec 2009 09:00:03 +0000</pubDate>
		<dc:creator>jackson</dc:creator>
				<category><![CDATA[AS3]]></category>
		<category><![CDATA[arrays]]></category>
		<category><![CDATA[linked lists]]></category>
		<category><![CDATA[performance]]></category>

		<guid isPermaLink="false">http://jacksondunstan.com/?p=548</guid>
		<description><![CDATA[I&#8217;ve written before about linked lists when I covered free lists. There were massive speedups to be had there, but that article mostly covered the performance costs of allocation and deallocation. Today is part one of a series that more generally covers linked lists.

I&#8217;ve written a LinkedList class in AS3 with an API that (mostly) [...]]]></description>
		<wfw:commentRss>http://jacksondunstan.com/articles/548/feed</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
		<item>
		<title>Array Performance</title>
		<link>http://jacksondunstan.com/articles/529</link>
		<comments>http://jacksondunstan.com/articles/529#comments</comments>
		<pubDate>Mon, 14 Dec 2009 09:00:54 +0000</pubDate>
		<dc:creator>jackson</dc:creator>
				<category><![CDATA[AS3]]></category>
		<category><![CDATA[arrays]]></category>
		<category><![CDATA[per]]></category>
		<category><![CDATA[performance]]></category>

		<guid isPermaLink="false">http://jacksondunstan.com/?p=529</guid>
		<description><![CDATA[Today&#8217;s article is inspired by Jean-Philippe Auclair&#8217;s excellent article on arrays and the comment he recently posted on my article about map performance. In it he discusses how the Array class is implemented using a densely-packed C/C++ array (a contiguous block of memory) and, after the first undefined element, a hash table. This got me [...]]]></description>
		<wfw:commentRss>http://jacksondunstan.com/articles/529/feed</wfw:commentRss>
		<slash:comments>6</slash:comments>
		</item>
		<item>
		<title>Map Performance</title>
		<link>http://jacksondunstan.com/articles/479</link>
		<comments>http://jacksondunstan.com/articles/479#comments</comments>
		<pubDate>Mon, 23 Nov 2009 09:00:09 +0000</pubDate>
		<dc:creator>jackson</dc:creator>
				<category><![CDATA[AS3]]></category>
		<category><![CDATA[arrays]]></category>
		<category><![CDATA[bitmaps]]></category>
		<category><![CDATA[byte array]]></category>
		<category><![CDATA[dictionaries]]></category>
		<category><![CDATA[maps]]></category>
		<category><![CDATA[objects]]></category>
		<category><![CDATA[performance]]></category>
		<category><![CDATA[vectors]]></category>

		<guid isPermaLink="false">http://jacksondunstan.com/?p=479</guid>
		<description><![CDATA[I recently received an e-mail from Dmitry Zhelnin (translation) with a test he did concerning the speed of a couple ways to get a value for a key, which I like to call a map and Wikipedia likes to call an associative array. I&#8217;d been meaning to do a similar test for a while now [...]]]></description>
		<wfw:commentRss>http://jacksondunstan.com/articles/479/feed</wfw:commentRss>
		<slash:comments>11</slash:comments>
		</item>
		<item>
		<title>Loop Speed</title>
		<link>http://jacksondunstan.com/articles/358</link>
		<comments>http://jacksondunstan.com/articles/358#comments</comments>
		<pubDate>Wed, 07 Oct 2009 09:00:31 +0000</pubDate>
		<dc:creator>jackson</dc:creator>
				<category><![CDATA[AS3]]></category>
		<category><![CDATA[arrays]]></category>
		<category><![CDATA[bitmaps]]></category>
		<category><![CDATA[dictionaries]]></category>
		<category><![CDATA[loops]]></category>
		<category><![CDATA[objects]]></category>
		<category><![CDATA[performance]]></category>
		<category><![CDATA[vectors]]></category>

		<guid isPermaLink="false">http://jacksondunstan.com/?p=358</guid>
		<description><![CDATA[AS3 gives you a good number of potential ways you can loop over collections. When Flash Player 10 first came out, I went ahead and tested out the new Vector class in a variety of ways. One of them was to pit it against the collections available in Flash Player 9: Array, Object, Dictionary, ByteArray, [...]]]></description>
		<wfw:commentRss>http://jacksondunstan.com/articles/358/feed</wfw:commentRss>
		<slash:comments>5</slash:comments>
		</item>
		<item>
		<title>Sorting Vectors</title>
		<link>http://jacksondunstan.com/articles/270</link>
		<comments>http://jacksondunstan.com/articles/270#comments</comments>
		<pubDate>Wed, 02 Sep 2009 09:00:45 +0000</pubDate>
		<dc:creator>jackson</dc:creator>
				<category><![CDATA[AS3]]></category>
		<category><![CDATA[arrays]]></category>
		<category><![CDATA[performance]]></category>
		<category><![CDATA[sorting]]></category>
		<category><![CDATA[vectors]]></category>

		<guid isPermaLink="false">http://jacksondunstan.com/?p=270</guid>
		<description><![CDATA[The Array class has a great function: sortOn(). It does a fast sort based on a property of each element of the array. Unfortunately, there is no equivalent in the Vector class. Below are some attempts to get around that limitation and preserve as much of the speed of sortOn() as possible.

First things first, nothing&#8217;s [...]]]></description>
		<wfw:commentRss>http://jacksondunstan.com/articles/270/feed</wfw:commentRss>
		<slash:comments>13</slash:comments>
		</item>
		<item>
		<title>Adding to Arrays and Vectors</title>
		<link>http://jacksondunstan.com/articles/265</link>
		<comments>http://jacksondunstan.com/articles/265#comments</comments>
		<pubDate>Mon, 31 Aug 2009 09:00:24 +0000</pubDate>
		<dc:creator>jackson</dc:creator>
				<category><![CDATA[AS3]]></category>
		<category><![CDATA[arrays]]></category>
		<category><![CDATA[functions]]></category>
		<category><![CDATA[vectors]]></category>

		<guid isPermaLink="false">http://jacksondunstan.com/?p=265</guid>
		<description><![CDATA[Adding on to existing arrays and vectors is one of those really common tasks that sounds dreary. Everyone knows about push() and unshift() for single elements and concat() for lots of elements. But what if you want to add a lot of elements to an existing array or vector without allocating a new array or [...]]]></description>
		<wfw:commentRss>http://jacksondunstan.com/articles/265/feed</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
	</channel>
</rss>
