<?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: Fast Integer Log2 function in C/C++</title>
	<atom:link href="http://www.southwindsgames.com/blog/2009/01/19/fast-integer-log2-function-in-cc/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.southwindsgames.com/blog/2009/01/19/fast-integer-log2-function-in-cc/</link>
	<description>Casual Games Development</description>
	<lastBuildDate>Sat, 17 Dec 2011 06:31:08 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Juan Pablo</title>
		<link>http://www.southwindsgames.com/blog/2009/01/19/fast-integer-log2-function-in-cc/comment-page-1/#comment-8369</link>
		<dc:creator>Juan Pablo</dc:creator>
		<pubDate>Tue, 21 Jun 2011 12:01:11 +0000</pubDate>
		<guid isPermaLink="false">http://www.southwindsgames.com/blog/?p=48#comment-8369</guid>
		<description>The one tagged: &quot;Find the log base 2 of an N-bit integer in O(lg(N)) operations with multiply and lookup&quot; is really smart, and it is easy to template the bounds for this one.
Thanks for the sharing the link :)</description>
		<content:encoded><![CDATA[<p>The one tagged: &#8220;Find the log base 2 of an N-bit integer in O(lg(N)) operations with multiply and lookup&#8221; is really smart, and it is easy to template the bounds for this one.<br />
Thanks for the sharing the link <img src='http://www.southwindsgames.com/blog/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: GS</title>
		<link>http://www.southwindsgames.com/blog/2009/01/19/fast-integer-log2-function-in-cc/comment-page-1/#comment-8366</link>
		<dc:creator>GS</dc:creator>
		<pubDate>Sun, 19 Jun 2011 18:54:47 +0000</pubDate>
		<guid isPermaLink="false">http://www.southwindsgames.com/blog/?p=48#comment-8366</guid>
		<description>Faster implementations can be found at http://graphics.stanford.edu/~seander/bithacks.html#IntegerLogLookup. The lookup-table implementation is roughly a third faster than the fastest algorithm here, as I measured it.</description>
		<content:encoded><![CDATA[<p>Faster implementations can be found at <a href="http://graphics.stanford.edu/~seander/bithacks.html#IntegerLogLookup" rel="nofollow">http://graphics.stanford.edu/~seander/bithacks.html#IntegerLogLookup</a>. The lookup-table implementation is roughly a third faster than the fastest algorithm here, as I measured it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: polar f4</title>
		<link>http://www.southwindsgames.com/blog/2009/01/19/fast-integer-log2-function-in-cc/comment-page-1/#comment-7827</link>
		<dc:creator>polar f4</dc:creator>
		<pubDate>Sat, 29 Jan 2011 07:59:36 +0000</pubDate>
		<guid isPermaLink="false">http://www.southwindsgames.com/blog/?p=48#comment-7827</guid>
		<description>What a great idea to let us in this whole procedure.</description>
		<content:encoded><![CDATA[<p>What a great idea to let us in this whole procedure.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Marcos</title>
		<link>http://www.southwindsgames.com/blog/2009/01/19/fast-integer-log2-function-in-cc/comment-page-1/#comment-5964</link>
		<dc:creator>Marcos</dc:creator>
		<pubDate>Tue, 15 Jun 2010 17:59:13 +0000</pubDate>
		<guid isPermaLink="false">http://www.southwindsgames.com/blog/?p=48#comment-5964</guid>
		<description>Thanks!</description>
		<content:encoded><![CDATA[<p>Thanks!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Joonas Kekoni</title>
		<link>http://www.southwindsgames.com/blog/2009/01/19/fast-integer-log2-function-in-cc/comment-page-1/#comment-5032</link>
		<dc:creator>Joonas Kekoni</dc:creator>
		<pubDate>Fri, 12 Mar 2010 14:18:17 +0000</pubDate>
		<guid isPermaLink="false">http://www.southwindsgames.com/blog/?p=48#comment-5032</guid>
		<description>Thanx. I was looking for this.</description>
		<content:encoded><![CDATA[<p>Thanx. I was looking for this.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Juan Pablo</title>
		<link>http://www.southwindsgames.com/blog/2009/01/19/fast-integer-log2-function-in-cc/comment-page-1/#comment-4252</link>
		<dc:creator>Juan Pablo</dc:creator>
		<pubDate>Fri, 15 Jan 2010 11:51:37 +0000</pubDate>
		<guid isPermaLink="false">http://www.southwindsgames.com/blog/?p=48#comment-4252</guid>
		<description>Yeah!
My head is programmed to write multiplatform code but I should have mentioned it anyway since it is way easier and probably the way to go on intel machines.
Thanks :)</description>
		<content:encoded><![CDATA[<p>Yeah!<br />
My head is programmed to write multiplatform code but I should have mentioned it anyway since it is way easier and probably the way to go on intel machines.<br />
Thanks <img src='http://www.southwindsgames.com/blog/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Eric Thiele</title>
		<link>http://www.southwindsgames.com/blog/2009/01/19/fast-integer-log2-function-in-cc/comment-page-1/#comment-4251</link>
		<dc:creator>Eric Thiele</dc:creator>
		<pubDate>Fri, 15 Jan 2010 11:36:20 +0000</pubDate>
		<guid isPermaLink="false">http://www.southwindsgames.com/blog/?p=48#comment-4251</guid>
		<description>on x86 arch you can do it event faster...

bsr eax,eax

input and output are the eax register

bsr out,in (bit search reverse) searches the last enabeld bit in and writes position in out. (position last enabled bit ist the log2)  :-)</description>
		<content:encoded><![CDATA[<p>on x86 arch you can do it event faster&#8230;</p>
<p>bsr eax,eax</p>
<p>input and output are the eax register</p>
<p>bsr out,in (bit search reverse) searches the last enabeld bit in and writes position in out. (position last enabled bit ist the log2)  <img src='http://www.southwindsgames.com/blog/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Juan Pablo</title>
		<link>http://www.southwindsgames.com/blog/2009/01/19/fast-integer-log2-function-in-cc/comment-page-1/#comment-53</link>
		<dc:creator>Juan Pablo</dc:creator>
		<pubDate>Fri, 03 Apr 2009 11:21:58 +0000</pubDate>
		<guid isPermaLink="false">http://www.southwindsgames.com/blog/?p=48#comment-53</guid>
		<description>You are right!
Corrected, thanks!</description>
		<content:encoded><![CDATA[<p>You are right!<br />
Corrected, thanks!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: cristina</title>
		<link>http://www.southwindsgames.com/blog/2009/01/19/fast-integer-log2-function-in-cc/comment-page-1/#comment-52</link>
		<dc:creator>cristina</dc:creator>
		<pubDate>Fri, 03 Apr 2009 04:01:37 +0000</pubDate>
		<guid isPermaLink="false">http://www.southwindsgames.com/blog/?p=48#comment-52</guid>
		<description>it is not equal or bigger. 
it is the last smaller or equal</description>
		<content:encoded><![CDATA[<p>it is not equal or bigger.<br />
it is the last smaller or equal</p>
]]></content:encoded>
	</item>
</channel>
</rss>

