<?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/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: Concurrent Skip List woes</title>
	<atom:link href="http://surana.wordpress.com/2009/01/15/concurrent-skip-list-woes/feed/" rel="self" type="application/rss+xml" />
	<link>http://surana.wordpress.com/2009/01/15/concurrent-skip-list-woes/</link>
	<description>"glossing over detail for the sake of time or clarity"</description>
	<lastBuildDate>Thu, 03 Dec 2009 14:45:18 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Concurrent Skip List issues &#171; Handwaving</title>
		<link>http://surana.wordpress.com/2009/01/15/concurrent-skip-list-woes/#comment-175</link>
		<dc:creator>Concurrent Skip List issues &#171; Handwaving</dc:creator>
		<pubDate>Wed, 26 Aug 2009 19:52:05 +0000</pubDate>
		<guid isPermaLink="false">http://surana.wordpress.com/?p=78#comment-175</guid>
		<description>[...] Skip List&#160;issues By Pinku  A commenter on my code sample for a concurrent skiplist correctly pointed out two errors in the program. I [...]</description>
		<content:encoded><![CDATA[<p>[...] Skip List&nbsp;issues By Pinku  A commenter on my code sample for a concurrent skiplist correctly pointed out two errors in the program. I [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Pinku</title>
		<link>http://surana.wordpress.com/2009/01/15/concurrent-skip-list-woes/#comment-173</link>
		<dc:creator>Pinku</dc:creator>
		<pubDate>Tue, 25 Aug 2009 20:53:42 +0000</pubDate>
		<guid isPermaLink="false">http://surana.wordpress.com/?p=78#comment-173</guid>
		<description>You are right about both bugs. On the first, I changed it so it doesn&#039;t ask for a MaxHeight anymore. On the second, I failed to copy the code from the paper correctly. Your fix is correct.</description>
		<content:encoded><![CDATA[<p>You are right about both bugs. On the first, I changed it so it doesn&#8217;t ask for a MaxHeight anymore. On the second, I failed to copy the code from the paper correctly. Your fix is correct.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: D Meatte</title>
		<link>http://surana.wordpress.com/2009/01/15/concurrent-skip-list-woes/#comment-152</link>
		<dc:creator>D Meatte</dc:creator>
		<pubDate>Wed, 10 Jun 2009 19:04:32 +0000</pubDate>
		<guid isPermaLink="false">http://surana.wordpress.com/?p=78#comment-152</guid>
		<description>Thanks for posting this source. This was the only thread safe C# skip list I could find and it was a lot easier to adapt this than to make my own from one of Pugh&#039;s papers. 

I found what I think are two bugs in the posted source.

The first is on line 37. You&#039;re follow up post says it isn&#039;t needed, but I found if the randomLevel wasn&#039;t capped, I would get a level for my new node greater than the max height used to declare a new node&#039;s next lists.

The second is on line 59. I&#039;m fairly sure the &#039;lFound.HasValue&#039; in &#039;if (lFound.HasValue &amp;&amp; v.CompareTo(curr.key) == 0)&#039; should be &#039;!lFound.HasValue&#039; otherwise there&#039;s no opportunity for that function to ever initialize the variable and succeed in the find.</description>
		<content:encoded><![CDATA[<p>Thanks for posting this source. This was the only thread safe C# skip list I could find and it was a lot easier to adapt this than to make my own from one of Pugh&#8217;s papers. </p>
<p>I found what I think are two bugs in the posted source.</p>
<p>The first is on line 37. You&#8217;re follow up post says it isn&#8217;t needed, but I found if the randomLevel wasn&#8217;t capped, I would get a level for my new node greater than the max height used to declare a new node&#8217;s next lists.</p>
<p>The second is on line 59. I&#8217;m fairly sure the &#8216;lFound.HasValue&#8217; in &#8216;if (lFound.HasValue &amp;&amp; v.CompareTo(curr.key) == 0)&#8217; should be &#8216;!lFound.HasValue&#8217; otherwise there&#8217;s no opportunity for that function to ever initialize the variable and succeed in the find.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Complexity Matters &#171; Handwaving</title>
		<link>http://surana.wordpress.com/2009/01/15/concurrent-skip-list-woes/#comment-111</link>
		<dc:creator>Complexity Matters &#171; Handwaving</dc:creator>
		<pubDate>Mon, 19 Jan 2009 03:05:45 +0000</pubDate>
		<guid isPermaLink="false">http://surana.wordpress.com/?p=78#comment-111</guid>
		<description>[...] Handwaving &#8220;glossing over detail for the sake of time or clarity&#8221;      &#171; Concurrent Skip List&#160;woes [...]</description>
		<content:encoded><![CDATA[<p>[...] Handwaving &#8220;glossing over detail for the sake of time or clarity&#8221;      &laquo; Concurrent Skip List&nbsp;woes [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
