<?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 for Why, Blog, Why?!</title>
	<atom:link href="http://www.christopherbloom.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.christopherbloom.com</link>
	<description>Mostly programming and parenting, and not a hint of sarcasm</description>
	<lastBuildDate>Thu, 20 Oct 2011 18:57:40 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>Comment on Find the longest common substring using PHP by Atti</title>
		<link>http://www.christopherbloom.com/2011/02/24/find-the-longest-common-substring-using-php/#comment-79</link>
		<dc:creator>Atti</dc:creator>
		<pubDate>Thu, 20 Oct 2011 18:57:40 +0000</pubDate>
		<guid isPermaLink="false">http://www.christopherbloom.com/?p=16#comment-79</guid>
		<description>A little bit simpler solution, only for two strings.
It returns string.
    function longestCommonSubstring( $str1, $str2, $case_sensitive=false)
    {
        $ret = array();
        $len1 = mb_strlen($str1);
        $len2 = mb_strlen($str2);
        if (! $len1 &#124;&#124; ! $len2)
            return false;
        // Find shorter
        if ($len2 &lt; $len1)
        {
            $t = $len1;
            $len1 = $len2;
            $len2 = $t;
            $t = $str1;
            $str1 = $str2;
            $str2 = $t;
        }
        if (! $case_sensitive)
        {
            $str1 = mb_strtolower($str1);
            $str2 = mb_strtolower($str2);
        }
        // Through chars.
        for ($i = 0; $i&lt;$len1; $i++)
        {
            // Next char is same?
            $c1 = mb_substr($str1, $i, 1);
            if ($c1 === mb_substr($str2, $i, 1))
            {
                $ret[] = $c1;
            }
            else
            {
                break;
            }
        }
        return implode(&#039;&#039;, $ret);
    } </description>
		<content:encoded><![CDATA[<p>A little bit simpler solution, only for two strings.<br />
It returns string. </p>
<p>    function longestCommonSubstring( $str1, $str2, $case_sensitive=false)<br />
    {<br />
        $ret = array(); </p>
<p>        $len1 = mb_strlen($str1);<br />
        $len2 = mb_strlen($str2);<br />
        if (! $len1 || ! $len2)<br />
            return false; </p>
<p>        // Find shorter<br />
        if ($len2 &lt; $len1)<br />
        {<br />
            $t = $len1;<br />
            $len1 = $len2;<br />
            $len2 = $t;<br />
            $t = $str1;<br />
            $str1 = $str2;<br />
            $str2 = $t;<br />
        } </p>
<p>        if (! $case_sensitive)<br />
        {<br />
            $str1 = mb_strtolower($str1);<br />
            $str2 = mb_strtolower($str2);<br />
        } </p>
<p>        // Through chars.<br />
        for ($i = 0; $i&lt;$len1; $i++)<br />
        {<br />
            // Next char is same?<br />
            $c1 = mb_substr($str1, $i, 1);<br />
            if ($c1 === mb_substr($str2, $i, 1))<br />
            {<br />
                $ret[] = $c1;<br />
            }<br />
            else<br />
            {<br />
                break;<br />
            } </p>
<p>        } </p>
<p>        return implode(&#039;&#039;, $ret);<br />
    }</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Join (implode) an Array of String Values with Formatting by John Bubriski</title>
		<link>http://www.christopherbloom.com/2011/05/21/join-implode-an-array-of-string-values-with-formatting/#comment-33</link>
		<dc:creator>John Bubriski</dc:creator>
		<pubDate>Wed, 01 Jun 2011 20:49:46 +0000</pubDate>
		<guid isPermaLink="false">http://www.christopherbloom.com/?p=31#comment-33</guid>
		<description>Nice post!  FYI, your tweet button doesn&#039;t appear to be working... at least not for me! </description>
		<content:encoded><![CDATA[<p>Nice post!  FYI, your tweet button doesn&#039;t appear to be working&#8230; at least not for me!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Earn Extra Money from Home with Web Development by web design peoria il</title>
		<link>http://www.christopherbloom.com/2011/05/12/working-from-home-with-web-development/#comment-18</link>
		<dc:creator>web design peoria il</dc:creator>
		<pubDate>Wed, 18 May 2011 01:59:54 +0000</pubDate>
		<guid isPermaLink="false">http://www.christopherbloom.com/?p=22#comment-18</guid>
		<description>you can get a lot of income provided that you are creative, savvy and a good talker </description>
		<content:encoded><![CDATA[<p>you can get a lot of income provided that you are creative, savvy and a good talker</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Asserting your domain expertise and learning to say &#8220;no&#8221; to your clients by jeff</title>
		<link>http://www.christopherbloom.com/2011/05/12/asserting-your-domain-expertise-and-learning-to-say-no-to-your-clients/#comment-17</link>
		<dc:creator>jeff</dc:creator>
		<pubDate>Thu, 12 May 2011 20:18:44 +0000</pubDate>
		<guid isPermaLink="false">http://www.christopherbloom.com/?p=20#comment-17</guid>
		<description>saying no will give you more time to find none-shit work.  i&#039;ve always found it more gratifying to work for the smart, savvy guys running projects than the stubborn ceos </description>
		<content:encoded><![CDATA[<p>saying no will give you more time to find none-shit work.  i&#039;ve always found it more gratifying to work for the smart, savvy guys running projects than the stubborn ceos</p>
]]></content:encoded>
	</item>
</channel>
</rss>

