<?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: Exploring memcmp</title>
	<atom:link href="http://justin.harmonize.fm/index.php/2009/05/exploring-memcmp/feed/" rel="self" type="application/rss+xml" />
	<link>http://justin.harmonize.fm/index.php/2009/05/exploring-memcmp/</link>
	<description>A cup of coffee and a soapbox is like a bottle of Jack and a gun.</description>
	<lastBuildDate>Fri, 03 Feb 2012 21:19:23 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
	<item>
		<title>By: Twilight Breaking Dawn</title>
		<link>http://justin.harmonize.fm/index.php/2009/05/exploring-memcmp/comment-page-1/#comment-1198</link>
		<dc:creator>Twilight Breaking Dawn</dc:creator>
		<pubDate>Sat, 07 Jan 2012 16:09:02 +0000</pubDate>
		<guid isPermaLink="false">http://justin.harmonize.fm/?p=231#comment-1198</guid>
		<description>&lt;strong&gt;Just try to smile...&lt;/strong&gt;

for about 2-3 mins then you can get back to work...</description>
		<content:encoded><![CDATA[<p><strong>Just try to smile&#8230;</strong></p>
<p>for about 2-3 mins then you can get back to work&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Avis Robot Menager</title>
		<link>http://justin.harmonize.fm/index.php/2009/05/exploring-memcmp/comment-page-1/#comment-1061</link>
		<dc:creator>Avis Robot Menager</dc:creator>
		<pubDate>Tue, 13 Dec 2011 10:51:56 +0000</pubDate>
		<guid isPermaLink="false">http://justin.harmonize.fm/?p=231#comment-1061</guid>
		<description>&lt;strong&gt;Avis Robot Menager...&lt;/strong&gt;

[...]Exploring memcmp[...]...</description>
		<content:encoded><![CDATA[<p><strong>Avis Robot Menager&#8230;</strong></p>
<p>[...]Exploring memcmp[...]&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dan McGee</title>
		<link>http://justin.harmonize.fm/index.php/2009/05/exploring-memcmp/comment-page-1/#comment-690</link>
		<dc:creator>Dan McGee</dc:creator>
		<pubDate>Tue, 30 Aug 2011 03:51:46 +0000</pubDate>
		<guid isPermaLink="false">http://justin.harmonize.fm/?p=231#comment-690</guid>
		<description>I know this is a really old post, but thought I&#039;d bring memmem() to your attention.</description>
		<content:encoded><![CDATA[<p>I know this is a really old post, but thought I&#39;d bring memmem() to your attention.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tune Up Your PC &#187; Post Topic &#187; The memcmp function reports the result of the comparison at the point of the first difference, but it can still read past that point</title>
		<link>http://justin.harmonize.fm/index.php/2009/05/exploring-memcmp/comment-page-1/#comment-505</link>
		<dc:creator>Tune Up Your PC &#187; Post Topic &#187; The memcmp function reports the result of the comparison at the point of the first difference, but it can still read past that point</dc:creator>
		<pubDate>Thu, 21 Oct 2010 23:03:57 +0000</pubDate>
		<guid isPermaLink="false">http://justin.harmonize.fm/?p=231#comment-505</guid>
		<description>[...] people with free time on their hands or simply enjoy a challenge will  try to outdo the runtime library with fancy-pants memcmp algorithms which compare the buffers in larger-than-normal chunks by doing [...]</description>
		<content:encoded><![CDATA[<p>[...] people with free time on their hands or simply enjoy a challenge will  try to outdo the runtime library with fancy-pants memcmp algorithms which compare the buffers in larger-than-normal chunks by doing [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: justin</title>
		<link>http://justin.harmonize.fm/index.php/2009/05/exploring-memcmp/comment-page-1/#comment-178</link>
		<dc:creator>justin</dc:creator>
		<pubDate>Thu, 14 May 2009 00:05:04 +0000</pubDate>
		<guid isPermaLink="false">http://justin.harmonize.fm/?p=231#comment-178</guid>
		<description>I&#039;m aware of how poor this is algorithmically, but it&#039;s fast enough for what&lt;br&gt;I&#039;m doing. This was just a fun experiment in the impact of SIMD&lt;br&gt;instructions; I have no plans to use anything except the most naive approach&lt;br&gt;with the dumbest compiler settings for actually accomplishing my task.&lt;br&gt;&lt;br&gt;That algorithm looks interesting though, and pretty much exactly what&#039;s&lt;br&gt;needed. Thanks!</description>
		<content:encoded><![CDATA[<p>I&#39;m aware of how poor this is algorithmically, but it&#39;s fast enough for what<br />I&#39;m doing. This was just a fun experiment in the impact of SIMD<br />instructions; I have no plans to use anything except the most naive approach<br />with the dumbest compiler settings for actually accomplishing my task.</p>
<p>That algorithm looks interesting though, and pretty much exactly what&#39;s<br />needed. Thanks!</p>
]]></content:encoded>
	</item>
</channel>
</rss>

