<?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 talkingCode</title>
	<atom:link href="http://talkingcode.co.uk/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://talkingcode.co.uk</link>
	<description>Linux, Software Development, Technology</description>
	<pubDate>Fri, 10 Oct 2008 21:51:04 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5.1</generator>
		<item>
		<title>Comment on Java, SSL, and the Keystore of Doom by Franta</title>
		<link>http://talkingcode.co.uk/2008/07/04/java-ssl-and-the-keystore-of-doom/#comment-304</link>
		<dc:creator>Franta</dc:creator>
		<pubDate>Thu, 04 Sep 2008 09:32:49 +0000</pubDate>
		<guid isPermaLink="false">http://talkingcode.co.uk/?p=42#comment-304</guid>
		<description>and Step 7: Become frustrated again</description>
		<content:encoded><![CDATA[<p>and Step 7: Become frustrated again</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Bounding box drag-select for tables; Javascript, Prototype by Dave</title>
		<link>http://talkingcode.co.uk/2007/12/07/bounding-box-drag-select-for-tables-javascript-prototype/#comment-303</link>
		<dc:creator>Dave</dc:creator>
		<pubDate>Thu, 04 Sep 2008 05:44:36 +0000</pubDate>
		<guid isPermaLink="false">http://talkingcode.co.uk/2007/12/07/bounding-box-drag-select-for-tables-javascript-prototype/#comment-303</guid>
		<description>hey, just wondering if there is a working demo somewhere.  The above demo does not seem to work.  It looks really cool though!  Thanks,  Dave</description>
		<content:encoded><![CDATA[<p>hey, just wondering if there is a working demo somewhere.  The above demo does not seem to work.  It looks really cool though!  Thanks,  Dave</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on ERROR 2026 (HY000): SSL connection error - the joy of MySQL SSL on Debian by Dweebos &#187; Blog Archive &#187; mysql ssl replication</title>
		<link>http://talkingcode.co.uk/2007/11/12/error-2026-hy000-ssl-connection-error-the-joy-of-mysql-ssl-on-debian/#comment-261</link>
		<dc:creator>Dweebos &#187; Blog Archive &#187; mysql ssl replication</dc:creator>
		<pubDate>Tue, 12 Aug 2008 14:29:57 +0000</pubDate>
		<guid isPermaLink="false">http://talkingcode.co.uk/2007/11/12/error-2026-hy000-ssl-connection-error-the-joy-of-mysql-ssl-on-debian/#comment-261</guid>
		<description>[...] aren&#8217;t linked to openssl due to Debian&#8217;s strict licensing stuff. I found someone with a solution of compiling from source, and that worked for me as well. The one thing I&#8217;m not sure about [...]</description>
		<content:encoded><![CDATA[<p>[...] aren&#8217;t linked to openssl due to Debian&#8217;s strict licensing stuff. I found someone with a solution of compiling from source, and that worked for me as well. The one thing I&#8217;m not sure about [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Java, SSL, and the Keystore of Doom by Flemming Frandsen</title>
		<link>http://talkingcode.co.uk/2008/07/04/java-ssl-and-the-keystore-of-doom/#comment-257</link>
		<dc:creator>Flemming Frandsen</dc:creator>
		<pubDate>Fri, 25 Jul 2008 10:25:35 +0000</pubDate>
		<guid isPermaLink="false">http://talkingcode.co.uk/?p=42#comment-257</guid>
		<description>Hi, I'd just like to thank you for posting this, it was an imeasureable help to me, so let me return the favor, take a look at this page:
http://www.agentbob.info/agentbob/79-AB.html

It neatly explains the hoops to jump through (convert key and cert to DER, then run a short bit of java on them) to get a private key imported into a jks.

I followed your instructions and then his and I now have it all working without any gui applications.</description>
		<content:encoded><![CDATA[<p>Hi, I&#8217;d just like to thank you for posting this, it was an imeasureable help to me, so let me return the favor, take a look at this page:<br />
<a href="http://www.agentbob.info/agentbob/79-AB.html" rel="nofollow">http://www.agentbob.info/agentbob/79-AB.html</a></p>
<p>It neatly explains the hoops to jump through (convert key and cert to DER, then run a short bit of java on them) to get a private key imported into a jks.</p>
<p>I followed your instructions and then his and I now have it all working without any gui applications.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Removing bytes from a file by qbJim</title>
		<link>http://talkingcode.co.uk/2008/06/25/removing-bytes-from-a-file/#comment-240</link>
		<dc:creator>qbJim</dc:creator>
		<pubDate>Thu, 17 Jul 2008 09:04:53 +0000</pubDate>
		<guid isPermaLink="false">http://talkingcode.co.uk/?p=37#comment-240</guid>
		<description>Doing it with C++ iostreams would have saved remembering the parameter list to read and write (perhaps not an issue for you).  It wouldn't have reduced the number of lines of code though, save a couple of #includes (it wouldn't increase it either, since while (cin &#62;&#62; c) { } is valid).

But my first instinct would have been to try and get perl to do it. If you could figure out how to embed arbitrary characters in a match string (perhaps a C-style "\x123" would work) then using perl -pe 's/something/\n/g' would save having any other files at all.</description>
		<content:encoded><![CDATA[<p>Doing it with C++ iostreams would have saved remembering the parameter list to read and write (perhaps not an issue for you).  It wouldn&#8217;t have reduced the number of lines of code though, save a couple of #includes (it wouldn&#8217;t increase it either, since while (cin &gt;&gt; c) { } is valid).</p>
<p>But my first instinct would have been to try and get perl to do it. If you could figure out how to embed arbitrary characters in a match string (perhaps a C-style &#8220;\x123&#8243; would work) then using perl -pe &#8217;s/something/\n/g&#8217; would save having any other files at all.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Getting started with Haskell&#8230; still by C-rat</title>
		<link>http://talkingcode.co.uk/2008/06/27/getting-started-with-haskell-still/#comment-199</link>
		<dc:creator>C-rat</dc:creator>
		<pubDate>Wed, 09 Jul 2008 15:06:06 +0000</pubDate>
		<guid isPermaLink="false">http://talkingcode.co.uk/?p=39#comment-199</guid>
		<description>I better put the Prelude on my reading list too. I might use init as a good example of lazy evaluation:

Hugs&#62; (init [1..]) !! 3
4</description>
		<content:encoded><![CDATA[<p>I better put the Prelude on my reading list too. I might use init as a good example of lazy evaluation:</p>
<p>Hugs&gt; (init [1..]) !! 3<br />
4</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Getting started with Haskell&#8230; still by sffubs</title>
		<link>http://talkingcode.co.uk/2008/06/27/getting-started-with-haskell-still/#comment-198</link>
		<dc:creator>sffubs</dc:creator>
		<pubDate>Wed, 09 Jul 2008 07:44:21 +0000</pubDate>
		<guid isPermaLink="false">http://talkingcode.co.uk/?p=39#comment-198</guid>
		<description>codders: yes, I believe laziness means you can do init . init . init without being wasteful. I think lilac wins! (I hadn't seen last or init before - shame on me!)</description>
		<content:encoded><![CDATA[<p>codders: yes, I believe laziness means you can do init . init . init without being wasteful. I think lilac wins! (I hadn&#8217;t seen last or init before - shame on me!)</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Getting started with Haskell&#8230; still by codders</title>
		<link>http://talkingcode.co.uk/2008/06/27/getting-started-with-haskell-still/#comment-177</link>
		<dc:creator>codders</dc:creator>
		<pubDate>Fri, 04 Jul 2008 17:45:52 +0000</pubDate>
		<guid isPermaLink="false">http://talkingcode.co.uk/?p=39#comment-177</guid>
		<description>stuart: awesome. Love Simon's work... I'll check it out.

Ryan, sffubs: fair point. I guess I'm not going to do a lot better. Shame to use the memory though.

lilac: Good point. 'init' isn't the most intuitively named function in the Prelude, but it certainly seems to do the job. D'you think I can do init . init . init . init... without being wasteful?

Thanks all :)</description>
		<content:encoded><![CDATA[<p>stuart: awesome. Love Simon&#8217;s work&#8230; I&#8217;ll check it out.</p>
<p>Ryan, sffubs: fair point. I guess I&#8217;m not going to do a lot better. Shame to use the memory though.</p>
<p>lilac: Good point. &#8216;init&#8217; isn&#8217;t the most intuitively named function in the Prelude, but it certainly seems to do the job. D&#8217;you think I can do init . init . init . init&#8230; without being wasteful?</p>
<p>Thanks all <img src='http://talkingcode.co.uk/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Getting started with Haskell&#8230; still by lilac</title>
		<link>http://talkingcode.co.uk/2008/06/27/getting-started-with-haskell-still/#comment-176</link>
		<dc:creator>lilac</dc:creator>
		<pubDate>Fri, 04 Jul 2008 17:24:09 +0000</pubDate>
		<guid isPermaLink="false">http://talkingcode.co.uk/?p=39#comment-176</guid>
		<description>I suggest you read through the Prelude. There's a lot of good stuff there that you'll end up reinventing if you don't know it's built-in.

lastButOne = last . init</description>
		<content:encoded><![CDATA[<p>I suggest you read through the Prelude. There&#8217;s a lot of good stuff there that you&#8217;ll end up reinventing if you don&#8217;t know it&#8217;s built-in.</p>
<p>lastButOne = last . init</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Getting started with Haskell&#8230; still by sffubs</title>
		<link>http://talkingcode.co.uk/2008/06/27/getting-started-with-haskell-still/#comment-174</link>
		<dc:creator>sffubs</dc:creator>
		<pubDate>Fri, 04 Jul 2008 16:37:56 +0000</pubDate>
		<guid isPermaLink="false">http://talkingcode.co.uk/?p=39#comment-174</guid>
		<description>Yep, as Ryan has already pointed out, reverse is O(n), but last-but-one is always going to be O(n) in time. You still only traverse the list once though in my solution, unless I've missed something.</description>
		<content:encoded><![CDATA[<p>Yep, as Ryan has already pointed out, reverse is O(n), but last-but-one is always going to be O(n) in time. You still only traverse the list once though in my solution, unless I&#8217;ve missed something.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
