<?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: Python&#8217;s hash lookup is insanely good</title>
	<atom:link href="http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/</link>
	<description>Programming, gardening, economics, life in Cleveland Heights</description>
	<lastBuildDate>Sat, 04 Feb 2012 03:03:50 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Generic Viagra</title>
		<link>http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/comment-page-1/#comment-11575</link>
		<dc:creator>Generic Viagra</dc:creator>
		<pubDate>Sat, 25 Jun 2011 08:02:54 +0000</pubDate>
		<guid isPermaLink="false">http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/#comment-11575</guid>
		<description>Not to take away from Python, at least here, but I expect the reason you see such a fantastic performance here has to do with the magic of your CPU cache ... However, it is always impressive!&lt;br&gt;&lt;br&gt; &lt;br&gt;&lt;a href=&quot;http://www.kamagra-world.co.uk/&quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Viagra&lt;/b&gt;&lt;/a&gt;&lt;br&gt;&lt;a href=&quot;http://www.kamagra-site.co.uk/&quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Generic Viagra&lt;/b&gt;&lt;/a&gt;&lt;br&gt;&lt;a href=&quot;http://www.cheap-generic-viagra.co.uk/&quot; rel=&quot;nofollow&quot;&gt;&lt;b&gt;Kamagra&lt;/b&gt;&lt;/a&gt;</description>
		<content:encoded><![CDATA[<p>Not to take away from Python, at least here, but I expect the reason you see such a fantastic performance here has to do with the magic of your CPU cache &#8230; However, it is always impressive!</p>
<p> <br /><a href="http://www.kamagra-world.co.uk/" rel="nofollow"><b>Viagra</b></a><br /><a href="http://www.kamagra-site.co.uk/" rel="nofollow"><b>Generic Viagra</b></a><br /><a href="http://www.cheap-generic-viagra.co.uk/" rel="nofollow"><b>Kamagra</b></a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: meow mix coupons</title>
		<link>http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/comment-page-1/#comment-10872</link>
		<dc:creator>meow mix coupons</dc:creator>
		<pubDate>Tue, 08 Mar 2011 21:58:17 +0000</pubDate>
		<guid isPermaLink="false">http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/#comment-10872</guid>
		<description>&lt;br&gt;Very nice, I&#039;m gonna try some of these, i don&#039;t know if they will work with me as i with to, but i&#039;m gonna give this a try.
&lt;br&gt; ...</description>
		<content:encoded><![CDATA[<p>Very nice, I&#39;m gonna try some of these, i don&#39;t know if they will work with me as i with to, but i&#39;m gonna give this a try.<br />
<br /> &#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Name</title>
		<link>http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/comment-page-1/#comment-3414</link>
		<dc:creator>Name</dc:creator>
		<pubDate>Sun, 15 Nov 2009 10:24:26 +0000</pubDate>
		<guid isPermaLink="false">http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/#comment-3414</guid>
		<description>The lookup is often O(1) but the function that hashes a string so it can be looked up is usually not O(1) and will change depending on how long the string is.&lt;br&gt;&lt;br&gt;Also, collisions are possible in a hash table and in those cases it will not be O(1) to look those items up.</description>
		<content:encoded><![CDATA[<p>The lookup is often O(1) but the function that hashes a string so it can be looked up is usually not O(1) and will change depending on how long the string is.</p>
<p>Also, collisions are possible in a hash table and in those cases it will not be O(1) to look those items up.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Name</title>
		<link>http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/comment-page-1/#comment-2901</link>
		<dc:creator>Name</dc:creator>
		<pubDate>Sun, 15 Nov 2009 05:24:26 +0000</pubDate>
		<guid isPermaLink="false">http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/#comment-2901</guid>
		<description>The lookup is often O(1) but the function that hashes a string so it can be looked up is usually not O(1) and will change depending on how long the string is.&lt;br&gt;&lt;br&gt;Also, collisions are possible in a hash table and in those cases it will not be O(1) to look those items up.</description>
		<content:encoded><![CDATA[<p>The lookup is often O(1) but the function that hashes a string so it can be looked up is usually not O(1) and will change depending on how long the string is.</p>
<p>Also, collisions are possible in a hash table and in those cases it will not be O(1) to look those items up.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Matt Wilson</title>
		<link>http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/comment-page-1/#comment-2859</link>
		<dc:creator>Matt Wilson</dc:creator>
		<pubDate>Mon, 02 Nov 2009 21:05:08 +0000</pubDate>
		<guid isPermaLink="false">http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/#comment-2859</guid>
		<description>O(1) is a constant amount of time.  In the toy hash tables I built in&lt;br&gt;school, the hashing code took a significant amount of time, even if it&lt;br&gt;was a fixed amount of time, regardless of the number of elements in my&lt;br&gt;hash table.&lt;br&gt;&lt;br&gt;What surprised me with python is how small that time really is.  I&lt;br&gt;wasn&#039;t able to separate the cost of hashing an object from a simple&lt;br&gt;string comparison.</description>
		<content:encoded><![CDATA[<p>O(1) is a constant amount of time.  In the toy hash tables I built in<br />school, the hashing code took a significant amount of time, even if it<br />was a fixed amount of time, regardless of the number of elements in my<br />hash table.</p>
<p>What surprised me with python is how small that time really is.  I<br />wasn&#39;t able to separate the cost of hashing an object from a simple<br />string comparison.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anonymous</title>
		<link>http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/comment-page-1/#comment-2858</link>
		<dc:creator>Anonymous</dc:creator>
		<pubDate>Mon, 02 Nov 2009 20:30:05 +0000</pubDate>
		<guid isPermaLink="false">http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/#comment-2858</guid>
		<description>Isn&#039;t hash lookup supposed to be an O(1) operation?  So why is this so surprising?  &lt;br&gt;&lt;br&gt;&lt;a href=&quot;http://en.wikipedia.org/wiki/Hash_table&quot; rel=&quot;nofollow&quot;&gt;http://en.wikipedia.org/wiki/Hash_table&lt;/a&gt;</description>
		<content:encoded><![CDATA[<p>Isn&#39;t hash lookup supposed to be an O(1) operation?  So why is this so surprising?  </p>
<p><a href="http://en.wikipedia.org/wiki/Hash_table" rel="nofollow">http://en.wikipedia.org/wiki/Hash_table</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Trade Show Displays</title>
		<link>http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/comment-page-1/#comment-2846</link>
		<dc:creator>Trade Show Displays</dc:creator>
		<pubDate>Mon, 02 Nov 2009 13:13:40 +0000</pubDate>
		<guid isPermaLink="false">http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/#comment-2846</guid>
		<description>This is the best post on this topic i have ever read.&lt;br&gt;&lt;br&gt;Thanks&lt;br&gt;Jikso laiye&lt;br&gt;______________________________________________</description>
		<content:encoded><![CDATA[<p>This is the best post on this topic i have ever read.</p>
<p>Thanks<br />Jikso laiye<br />______________________________________________</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: cruise deals</title>
		<link>http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/comment-page-1/#comment-2718</link>
		<dc:creator>cruise deals</dc:creator>
		<pubDate>Sat, 17 Oct 2009 16:02:02 +0000</pubDate>
		<guid isPermaLink="false">http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/#comment-2718</guid>
		<description>This posting is marvelous and what a fantastic research that you have done. It has helped me a lot. thank you very much.</description>
		<content:encoded><![CDATA[<p>This posting is marvelous and what a fantastic research that you have done. It has helped me a lot. thank you very much.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Register Domain Name</title>
		<link>http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/comment-page-1/#comment-2597</link>
		<dc:creator>Register Domain Name</dc:creator>
		<pubDate>Thu, 08 Oct 2009 10:06:09 +0000</pubDate>
		<guid isPermaLink="false">http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/#comment-2597</guid>
		<description>Thanks for sharing the post...</description>
		<content:encoded><![CDATA[<p>Thanks for sharing the post&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: panini </title>
		<link>http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/comment-page-1/#comment-2382</link>
		<dc:creator>panini </dc:creator>
		<pubDate>Sun, 13 Sep 2009 17:44:59 +0000</pubDate>
		<guid isPermaLink="false">http://blog.tplus1.com/index.php/2008/03/17/pythons-hash-lookup-is-insanely-good/#comment-2382</guid>
		<description>Too bad I didn&#039;t master phyton, I only use HTML and CSS..</description>
		<content:encoded><![CDATA[<p>Too bad I didn&#39;t master phyton, I only use HTML and CSS..</p>
]]></content:encoded>
	</item>
</channel>
</rss>

