<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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/"
		>
<channel>
	<title>Comments on: Upgrade your Flash CS4 to 10.0.2</title>
	<atom:link href="http://www.emanueleferonato.com/2009/06/22/upgrade-your-flash-cs4-to-10-0-2/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.emanueleferonato.com/2009/06/22/upgrade-your-flash-cs4-to-10-0-2/</link>
	<description>italian geek and PROgrammer</description>
	<lastBuildDate>Fri, 10 Feb 2012 12:12:29 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=</generator>
	<item>
		<title>By: Alex Schearer</title>
		<link>http://www.emanueleferonato.com/2009/06/22/upgrade-your-flash-cs4-to-10-0-2/#comment-472160</link>
		<dc:creator>Alex Schearer</dc:creator>
		<pubDate>Sun, 12 Jul 2009 02:47:58 +0000</pubDate>
		<guid isPermaLink="false">http://www.emanueleferonato.com/?p=1366#comment-472160</guid>
		<description>You might consider using an alternative data structure as the person above me suggests. A straight array is very inefficient way to store a dictionary. In fact it&#039;s inefficient in terms of memory and word look up. Let me point you to an implementation of a Trie in Actionscript 3 I wrote which may help you out. It looks up words in O(n) time and is much more memory efficient. I wrote it for the Wordplay contest and I&#039;m happy to share.

Check it out at here:

http://www.anotherearlymorning.com/2009/06/trie-data-structure-in-actionscript-3/</description>
		<content:encoded><![CDATA[<p>You might consider using an alternative data structure as the person above me suggests. A straight array is very inefficient way to store a dictionary. In fact it&#8217;s inefficient in terms of memory and word look up. Let me point you to an implementation of a Trie in Actionscript 3 I wrote which may help you out. It looks up words in O(n) time and is much more memory efficient. I wrote it for the Wordplay contest and I&#8217;m happy to share.</p>
<p>Check it out at here:</p>
<p><a href="http://www.anotherearlymorning.com/2009/06/trie-data-structure-in-actionscript-3/" rel="nofollow">http://www.anotherearlymorning.com/2009/06/trie-data-structure-in-actionscript-3/</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Atar sh.</title>
		<link>http://www.emanueleferonato.com/2009/06/22/upgrade-your-flash-cs4-to-10-0-2/#comment-464475</link>
		<dc:creator>Atar sh.</dc:creator>
		<pubDate>Tue, 23 Jun 2009 10:51:42 +0000</pubDate>
		<guid isPermaLink="false">http://www.emanueleferonato.com/?p=1366#comment-464475</guid>
		<description>Hey Imanuele, 
Just wanted to point out that using such long arrays may be slow. It&#039;s worth checking out other data structures, I found a red-black-tree implementation somewhere (I think it was FlashKit) which makes searches so much faster than running through an array.</description>
		<content:encoded><![CDATA[<p>Hey Imanuele,<br />
Just wanted to point out that using such long arrays may be slow. It&#8217;s worth checking out other data structures, I found a red-black-tree implementation somewhere (I think it was FlashKit) which makes searches so much faster than running through an array.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ali Nakipo?lu</title>
		<link>http://www.emanueleferonato.com/2009/06/22/upgrade-your-flash-cs4-to-10-0-2/#comment-464450</link>
		<dc:creator>Ali Nakipo?lu</dc:creator>
		<pubDate>Tue, 23 Jun 2009 09:13:23 +0000</pubDate>
		<guid isPermaLink="false">http://www.emanueleferonato.com/?p=1366#comment-464450</guid>
		<description>We had the same problems some time a go and we overcome by separating into 2 parts. Then we loaded files and used applicationDomian.getDifinition bla bla. Its is so cool to have fix now!</description>
		<content:encoded><![CDATA[<p>We had the same problems some time a go and we overcome by separating into 2 parts. Then we loaded files and used applicationDomian.getDifinition bla bla. Its is so cool to have fix now!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Zach Foley</title>
		<link>http://www.emanueleferonato.com/2009/06/22/upgrade-your-flash-cs4-to-10-0-2/#comment-464256</link>
		<dc:creator>Zach Foley</dc:creator>
		<pubDate>Mon, 22 Jun 2009 18:43:52 +0000</pubDate>
		<guid isPermaLink="false">http://www.emanueleferonato.com/?p=1366#comment-464256</guid>
		<description>Ha! Okay I will try. I abandoned a word game a few months back because the thing wouldn&#039;t compile... And it was definitely from the long lists.

Looks like yuo&#039;ll have some competition Emanuelle :-)</description>
		<content:encoded><![CDATA[<p>Ha! Okay I will try. I abandoned a word game a few months back because the thing wouldn&#8217;t compile&#8230; And it was definitely from the long lists.</p>
<p>Looks like yuo&#8217;ll have some competition Emanuelle :-)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Edgar</title>
		<link>http://www.emanueleferonato.com/2009/06/22/upgrade-your-flash-cs4-to-10-0-2/#comment-464244</link>
		<dc:creator>Edgar</dc:creator>
		<pubDate>Mon, 22 Jun 2009 17:28:06 +0000</pubDate>
		<guid isPermaLink="false">http://www.emanueleferonato.com/?p=1366#comment-464244</guid>
		<description>I&#039;m also interested on how you&#039;re parsing and using the word list :P. I also plan to enter into the contest :)</description>
		<content:encoded><![CDATA[<p>I&#8217;m also interested on how you&#8217;re parsing and using the word list :P. I also plan to enter into the contest :)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Cyclone103</title>
		<link>http://www.emanueleferonato.com/2009/06/22/upgrade-your-flash-cs4-to-10-0-2/#comment-464233</link>
		<dc:creator>Cyclone103</dc:creator>
		<pubDate>Mon, 22 Jun 2009 16:40:19 +0000</pubDate>
		<guid isPermaLink="false">http://www.emanueleferonato.com/?p=1366#comment-464233</guid>
		<description>And of course you will win first prize, I have no doubt ;)</description>
		<content:encoded><![CDATA[<p>And of course you will win first prize, I have no doubt ;)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Hawdon</title>
		<link>http://www.emanueleferonato.com/2009/06/22/upgrade-your-flash-cs4-to-10-0-2/#comment-464221</link>
		<dc:creator>Hawdon</dc:creator>
		<pubDate>Mon, 22 Jun 2009 15:40:52 +0000</pubDate>
		<guid isPermaLink="false">http://www.emanueleferonato.com/?p=1366#comment-464221</guid>
		<description>Like Lawrie, I too am interested in how you are parsing and accessing the word list...

A tutorial maybe? :)</description>
		<content:encoded><![CDATA[<p>Like Lawrie, I too am interested in how you are parsing and accessing the word list&#8230;</p>
<p>A tutorial maybe? :)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Lawrie</title>
		<link>http://www.emanueleferonato.com/2009/06/22/upgrade-your-flash-cs4-to-10-0-2/#comment-464218</link>
		<dc:creator>Lawrie</dc:creator>
		<pubDate>Mon, 22 Jun 2009 15:25:54 +0000</pubDate>
		<guid isPermaLink="false">http://www.emanueleferonato.com/?p=1366#comment-464218</guid>
		<description>Thanks for the tip Emanuele. Out of interest - how are you parsing and accessing the game list? Any optimisation recommendations?</description>
		<content:encoded><![CDATA[<p>Thanks for the tip Emanuele. Out of interest &#8211; how are you parsing and accessing the game list? Any optimisation recommendations?</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Performance optimized by W3 Total Cache. Learn more: http://www.w3-edge.com/wordpress-plugins/

Page Caching using disk: enhanced
Database Caching 6/11 queries in 0.026 seconds using disk: basic

Served from: www.emanueleferonato.com @ 2012-02-11 04:47:03 -->
