<?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: Announcing a major revision of the Haskell text library</title>
	<atom:link href="http://www.serpentine.com/blog/2009/10/09/announcing-a-major-revision-of-the-haskell-text-library/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.serpentine.com/blog/2009/10/09/announcing-a-major-revision-of-the-haskell-text-library/</link>
	<description>Bryan O&#039;Sullivan&#039;s blog</description>
	<lastBuildDate>Wed, 08 Feb 2012 06:41:38 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Andrew Farmer</title>
		<link>http://www.serpentine.com/blog/2009/10/09/announcing-a-major-revision-of-the-haskell-text-library/comment-page-1/#comment-247246</link>
		<dc:creator>Andrew Farmer</dc:creator>
		<pubDate>Fri, 09 Oct 2009 18:57:06 +0000</pubDate>
		<guid isPermaLink="false">http://www.serpentine.com/blog/?p=477#comment-247246</guid>
		<description>Instead of having multiple graphs with the same scale, why not just draw multiple lines on the same graph? (Getting the same scale for free, and making the improvement very obvious.)</description>
		<content:encoded><![CDATA[<p>Instead of having multiple graphs with the same scale, why not just draw multiple lines on the same graph? (Getting the same scale for free, and making the improvement very obvious.)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tom Moertel</title>
		<link>http://www.serpentine.com/blog/2009/10/09/announcing-a-major-revision-of-the-haskell-text-library/comment-page-1/#comment-247228</link>
		<dc:creator>Tom Moertel</dc:creator>
		<pubDate>Fri, 09 Oct 2009 14:09:48 +0000</pubDate>
		<guid isPermaLink="false">http://www.serpentine.com/blog/?p=477#comment-247228</guid>
		<description>This is, as usual, great work. Thanks for this wonderful contribution to Haskell.

(Also, Tom Limoncelli is right -- put those graphs on the same scale if you want to foster visual comparisons.)

Cheers,
Tom</description>
		<content:encoded><![CDATA[<p>This is, as usual, great work. Thanks for this wonderful contribution to Haskell.</p>
<p>(Also, Tom Limoncelli is right &#8212; put those graphs on the same scale if you want to foster visual comparisons.)</p>
<p>Cheers,<br />
Tom</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tom Limoncelli</title>
		<link>http://www.serpentine.com/blog/2009/10/09/announcing-a-major-revision-of-the-haskell-text-library/comment-page-1/#comment-247224</link>
		<dc:creator>Tom Limoncelli</dc:creator>
		<pubDate>Fri, 09 Oct 2009 12:32:03 +0000</pubDate>
		<guid isPermaLink="false">http://www.serpentine.com/blog/?p=477#comment-247224</guid>
		<description>Dude, redraw those graphs all with the same scale.  It will blow people&#039;s minds!</description>
		<content:encoded><![CDATA[<p>Dude, redraw those graphs all with the same scale.  It will blow people&#8217;s minds!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ketil</title>
		<link>http://www.serpentine.com/blog/2009/10/09/announcing-a-major-revision-of-the-haskell-text-library/comment-page-1/#comment-247221</link>
		<dc:creator>Ketil</dc:creator>
		<pubDate>Fri, 09 Oct 2009 11:57:27 +0000</pubDate>
		<guid isPermaLink="false">http://www.serpentine.com/blog/?p=477#comment-247221</guid>
		<description>Nice work, as always!

It took me a little while to realize the scales are different in the graphs, and how great the improvement really was.

Presumably, the bytestring search function you compare to is more similar to the old/slow text search?  As somebody who uses bytestring a lot for storing text, I wonder if there are improvements to be had by using a similar approach?  (It seems pretty obvious that bytesting, using 8-bit units, should never be slower than text, using 16-bit, right?)

-k</description>
		<content:encoded><![CDATA[<p>Nice work, as always!</p>
<p>It took me a little while to realize the scales are different in the graphs, and how great the improvement really was.</p>
<p>Presumably, the bytestring search function you compare to is more similar to the old/slow text search?  As somebody who uses bytestring a lot for storing text, I wonder if there are improvements to be had by using a similar approach?  (It seems pretty obvious that bytesting, using 8-bit units, should never be slower than text, using 16-bit, right?)</p>
<p>-k</p>
]]></content:encoded>
	</item>
</channel>
</rss>

