<?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: BitmapData, Vectors, ByteArrays and Optimization</title>
	<atom:link href="http://webr3.org/blog/haxe/bitmapdata-vectors-bytearrays-and-optimization/feed/" rel="self" type="application/rss+xml" />
	<link>http://webr3.org/blog/haxe/bitmapdata-vectors-bytearrays-and-optimization/</link>
	<description>the personal blog of nathan :)</description>
	<lastBuildDate>Fri, 12 Mar 2010 14:32:48 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: 비트맵데이터 퍼포먼스 향상시키기 &#171; jin_u as blog</title>
		<link>http://webr3.org/blog/haxe/bitmapdata-vectors-bytearrays-and-optimization/comment-page-1/#comment-188</link>
		<dc:creator>비트맵데이터 퍼포먼스 향상시키기 &#171; jin_u as blog</dc:creator>
		<pubDate>Sat, 07 Nov 2009 05:44:15 +0000</pubDate>
		<guid isPermaLink="false">http://webr3.org/blog/?p=53#comment-188</guid>
		<description>[...] 아래에 픽셀처리에 대한 글이 있어 참고하면 좋을 듯 싶다. setVector vs copyPixels BitmapData, Vectors, ByteArrays and Optimization [...]</description>
		<content:encoded><![CDATA[<p>[...] 아래에 픽셀처리에 대한 글이 있어 참고하면 좋을 듯 싶다. setVector vs copyPixels BitmapData, Vectors, ByteArrays and Optimization [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: bongiovi&#8217;s blog &#187; Post Topic &#187; BitmapData.setVector</title>
		<link>http://webr3.org/blog/haxe/bitmapdata-vectors-bytearrays-and-optimization/comment-page-1/#comment-41</link>
		<dc:creator>bongiovi&#8217;s blog &#187; Post Topic &#187; BitmapData.setVector</dc:creator>
		<pubDate>Mon, 27 Jul 2009 09:53:37 +0000</pubDate>
		<guid isPermaLink="false">http://webr3.org/blog/?p=53#comment-41</guid>
		<description>[...] http://webr3.org/blog/haxe/bitmapdata-vectors-bytearrays-and-optimization/ [...]</description>
		<content:encoded><![CDATA[<p>[...] <a href="http://webr3.org/blog/haxe/bitmapdata-vectors-bytearrays-and-optimization/" rel="nofollow">http://webr3.org/blog/haxe/bitmapdata-vectors-bytearrays-and-optimization/</a> [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: nathan</title>
		<link>http://webr3.org/blog/haxe/bitmapdata-vectors-bytearrays-and-optimization/comment-page-1/#comment-20</link>
		<dc:creator>nathan</dc:creator>
		<pubDate>Sat, 11 Jul 2009 19:36:15 +0000</pubDate>
		<guid isPermaLink="false">http://webr3.org/blog/?p=53#comment-20</guid>
		<description>completely unsure to be honest, it should be faster marginally, I&#039;ll do some tests and figure out.

interestingly if you use the &lt;a href=&quot;http://blog.joa-ebert.com/2009/06/26/as3v-for-ant-released/&quot; rel=&quot;nofollow&quot;&gt;new AS3V tool&lt;/a&gt; produced by Joa this is one of the optimizations it suggests</description>
		<content:encoded><![CDATA[<p>completely unsure to be honest, it should be faster marginally, I'll do some tests and figure out.</p>
<p>interestingly if you use the <a href="http://blog.joa-ebert.com/2009/06/26/as3v-for-ant-released/" rel="nofollow">new AS3V tool</a> produced by Joa this is one of the optimizations it suggests</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dr. Green</title>
		<link>http://webr3.org/blog/haxe/bitmapdata-vectors-bytearrays-and-optimization/comment-page-1/#comment-19</link>
		<dc:creator>Dr. Green</dc:creator>
		<pubDate>Sat, 11 Jul 2009 12:23:33 +0000</pubDate>
		<guid isPermaLink="false">http://webr3.org/blog/?p=53#comment-19</guid>
		<description>Hi!
This is a fantastic article. I did not know, haxe&#039;s optimization, but if You use:
... flash.Memory.setI32( i*4 , v[i] + 1 ); ...
can it be faster with bit-operations? Like i&lt;&lt;2 ? Or haxe optimize this?
Thanks for Your answer.</description>
		<content:encoded><![CDATA[<p>Hi!<br />
This is a fantastic article. I did not know, haxe's optimization, but if You use:<br />
... flash.Memory.setI32( i*4 , v[i] + 1 ); ...<br />
can it be faster with bit-operations? Like i&lt;&lt;2 ? Or haxe optimize this?<br />
Thanks for Your answer.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Huge</title>
		<link>http://webr3.org/blog/haxe/bitmapdata-vectors-bytearrays-and-optimization/comment-page-1/#comment-11</link>
		<dc:creator>Huge</dc:creator>
		<pubDate>Tue, 30 Jun 2009 01:06:41 +0000</pubDate>
		<guid isPermaLink="false">http://webr3.org/blog/?p=53#comment-11</guid>
		<description>Hi - interesting stuff.
To be fair to the bitmap versions, you should eliminate the &quot;%&quot; operation by using two loops, or making the width a power of 2 and use the &quot;&amp;&quot; operator.  However, I&#039;m sure that this will not close the gap to the memory version!</description>
		<content:encoded><![CDATA[<p>Hi - interesting stuff.<br />
To be fair to the bitmap versions, you should eliminate the "%" operation by using two loops, or making the width a power of 2 and use the "&amp;" operator.  However, I'm sure that this will not close the gap to the memory version!</p>
]]></content:encoded>
	</item>
</channel>
</rss>
