<?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: Optimizing Memory Consumption with String Pools: Part III</title>
	<atom:link href="http://nobugleftbehind.com/optimizing-memory-consumption-with-string-pools-part-iii/feed/" rel="self" type="application/rss+xml" />
	<link>http://nobugleftbehind.com/optimizing-memory-consumption-with-string-pools-part-iii/</link>
	<description>Software quality, testing and programming.</description>
	<lastBuildDate>Fri, 24 Apr 2009 06:04:59 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.1</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Tobias Gurock</title>
		<link>http://nobugleftbehind.com/optimizing-memory-consumption-with-string-pools-part-iii/comment-page-1/#comment-24</link>
		<dc:creator>Tobias Gurock</dc:creator>
		<pubDate>Wed, 04 Mar 2009 09:03:33 +0000</pubDate>
		<guid isPermaLink="false">http://nobugleftbehind.com/?p=274#comment-24</guid>
		<description>Eric:

&quot;For experimentation’s sake, you could try reversing the loop (taking the characters in the hash from last to first), thus emphasing the first characters .. &quot;

Will do. As written, I also experimented with other hash functions and will continue to do so. Maybe I will also revisit the collision lists/fixed-size array solution. I&#039;m thinking of turning the collision lists into collision trees and testing with dynamically-sized arrays.

Giel: You are welcome. :-)</description>
		<content:encoded><![CDATA[<p>Eric:</p>
<p>&#8220;For experimentation’s sake, you could try reversing the loop (taking the characters in the hash from last to first), thus emphasing the first characters .. &#8221;</p>
<p>Will do. As written, I also experimented with other hash functions and will continue to do so. Maybe I will also revisit the collision lists/fixed-size array solution. I&#8217;m thinking of turning the collision lists into collision trees and testing with dynamically-sized arrays.</p>
<p>Giel: You are welcome. <img src='http://nobugleftbehind.com/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Giel</title>
		<link>http://nobugleftbehind.com/optimizing-memory-consumption-with-string-pools-part-iii/comment-page-1/#comment-23</link>
		<dc:creator>Giel</dc:creator>
		<pubDate>Tue, 03 Mar 2009 14:20:14 +0000</pubDate>
		<guid isPermaLink="false">http://nobugleftbehind.com/?p=274#comment-23</guid>
		<description>Thanks for the 3 articles, Tobias :-)</description>
		<content:encoded><![CDATA[<p>Thanks for the 3 articles, Tobias <img src='http://nobugleftbehind.com/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Eric</title>
		<link>http://nobugleftbehind.com/optimizing-memory-consumption-with-string-pools-part-iii/comment-page-1/#comment-22</link>
		<dc:creator>Eric</dc:creator>
		<pubDate>Mon, 02 Mar 2009 21:58:42 +0000</pubDate>
		<guid isPermaLink="false">http://nobugleftbehind.com/?p=274#comment-22</guid>
		<description>Your hash function has the particularity of emphasing the last character in a string, with the shl 5, especially the last 8 characters of the string. Those 8 characters will be present almost literally in the hash if they are mostly numbers, delimiters and uppercase letters.

For experimentation&#039;s sake, you could try reversing the loop (taking the characters in the hash from last to first), thus emphasing the first characters, if I guessed right, your hash performance should decrease. If not, it&#039;s open season for other explanations :)</description>
		<content:encoded><![CDATA[<p>Your hash function has the particularity of emphasing the last character in a string, with the shl 5, especially the last 8 characters of the string. Those 8 characters will be present almost literally in the hash if they are mostly numbers, delimiters and uppercase letters.</p>
<p>For experimentation&#8217;s sake, you could try reversing the loop (taking the characters in the hash from last to first), thus emphasing the first characters, if I guessed right, your hash performance should decrease. If not, it&#8217;s open season for other explanations <img src='http://nobugleftbehind.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
</channel>
</rss>
