<?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"
	>
<channel>
	<title>Comments for David R. MacIver</title>
	<atom:link href="http://www.drmaciver.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.drmaciver.com</link>
	<description></description>
	<pubDate>Sat, 19 Jul 2008 18:51:57 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5</generator>
		<item>
		<title>Comment on java.lang.String#hashCode by david</title>
		<link>http://www.drmaciver.com/2008/07/javalangstringhashcode/#comment-376</link>
		<dc:creator>david</dc:creator>
		<pubDate>Thu, 17 Jul 2008 08:23:27 +0000</pubDate>
		<guid isPermaLink="false">http://www.drmaciver.com/?p=171#comment-376</guid>
		<description>It doesn't actually matter which version I'm using. java.lang.String has a hash code implementation defined as part of the standard library specification, and it's been the same since... not sure. 1.2 or 1.3 I think.</description>
		<content:encoded><![CDATA[<p>It doesn&#8217;t actually matter which version I&#8217;m using. java.lang.String has a hash code implementation defined as part of the standard library specification, and it&#8217;s been the same since&#8230; not sure. 1.2 or 1.3 I think.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on java.lang.String#hashCode by Cetin Sert</title>
		<link>http://www.drmaciver.com/2008/07/javalangstringhashcode/#comment-375</link>
		<dc:creator>Cetin Sert</dc:creator>
		<pubDate>Thu, 17 Jul 2008 00:30:28 +0000</pubDate>
		<guid isPermaLink="false">http://www.drmaciver.com/?p=171#comment-375</guid>
		<description>david: "3948 don’t collide, or about 1.6% of them"

3 characters mono 1.9.1:

again the same situation with mono 1.9.1 so I conclude java and mono use the same hashing algorithm:
http://sert.homelinux.org/projects/mono-collisions3.txt

Oh by the way may I ask which implementation and version of java we are talking about here?</description>
		<content:encoded><![CDATA[<p>david: &#8220;3948 don’t collide, or about 1.6% of them&#8221;</p>
<p>3 characters mono 1.9.1:</p>
<p>again the same situation with mono 1.9.1 so I conclude java and mono use the same hashing algorithm:<br />
<a href="http://sert.homelinux.org/projects/mono-collisions3.txt" rel="nofollow">http://sert.homelinux.org/projects/mono-collisions3.txt</a></p>
<p>Oh by the way may I ask which implementation and version of java we are talking about here?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on java.lang.String#hashCode by david</title>
		<link>http://www.drmaciver.com/2008/07/javalangstringhashcode/#comment-373</link>
		<dc:creator>david</dc:creator>
		<pubDate>Wed, 16 Jul 2008 20:30:45 +0000</pubDate>
		<guid isPermaLink="false">http://www.drmaciver.com/?p=171#comment-373</guid>
		<description>Utterly pointless fact of the day. The following consist of all the String hash collisions contained in sowpods:

isohel, epistolaries
righto, buzzards
hierarch, crinolines
inwork, hypercatalexes
wainages, presentencing
variants, gelato
misused, horsemints
trichothecenes, locular
pomatoes, eructation</description>
		<content:encoded><![CDATA[<p>Utterly pointless fact of the day. The following consist of all the String hash collisions contained in sowpods:</p>
<p>isohel, epistolaries<br />
righto, buzzards<br />
hierarch, crinolines<br />
inwork, hypercatalexes<br />
wainages, presentencing<br />
variants, gelato<br />
misused, horsemints<br />
trichothecenes, locular<br />
pomatoes, eructation</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on java.lang.String#hashCode by david</title>
		<link>http://www.drmaciver.com/2008/07/javalangstringhashcode/#comment-372</link>
		<dc:creator>david</dc:creator>
		<pubDate>Wed, 16 Jul 2008 20:24:04 +0000</pubDate>
		<guid isPermaLink="false">http://www.drmaciver.com/?p=171#comment-372</guid>
		<description>For what it's worth, even fewer strings have unique hash codes for 3 characters. 3948 don't collide, or about 1.6% of them.

Also, this of course doesn't mean that probability of a hash collision is really high. In reality it's acceptable low. It's just a demonstration that it's not hard to find colliding pairs.</description>
		<content:encoded><![CDATA[<p>For what it&#8217;s worth, even fewer strings have unique hash codes for 3 characters. 3948 don&#8217;t collide, or about 1.6% of them.</p>
<p>Also, this of course doesn&#8217;t mean that probability of a hash collision is really high. In reality it&#8217;s acceptable low. It&#8217;s just a demonstration that it&#8217;s not hard to find colliding pairs.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on java.lang.String#hashCode by Cetin Sert</title>
		<link>http://www.drmaciver.com/2008/07/javalangstringhashcode/#comment-371</link>
		<dc:creator>Cetin Sert</dc:creator>
		<pubDate>Wed, 16 Jul 2008 16:29:25 +0000</pubDate>
		<guid isPermaLink="false">http://www.drmaciver.com/?p=171#comment-371</guid>
		<description>even the colliding strings seem to be the same ones ^^</description>
		<content:encoded><![CDATA[<p>even the colliding strings seem to be the same ones ^^</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Dynamic Page Served (once) in 0.134 seconds -->
