<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" media="screen" href="/~d/styles/rss2full.xsl"?><?xml-stylesheet type="text/css" media="screen" href="http://feeds.wordaligned.org/~d/styles/itemcontent.css"?><rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title>Word Aligned - Latest Comments</title><link xmlns="http://www.w3.org/2005/Atom" rel="http://api.friendfeed.com/2008/03#sup" href="http://disqus.com/sup/all.sup#forumcomments-4e0fcddc" type="application/json" /><link>http://wordaligned.disqus.com/</link><description>Tales from the code face</description><language>en</language><lastBuildDate>Wed, 25 Jan 2012 07:49:15 -0000</lastBuildDate><atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="self" type="application/rss+xml" href="http://feeds.wordaligned.org/wordaligned/comments" /><feedburner:info xmlns:feedburner="http://rssnamespace.org/feedburner/ext/1.0" uri="wordaligned/comments" /><atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="hub" href="http://pubsubhubbub.appspot.com/" /><item><title>Re: The case against TODO</title><link>http://wordaligned.org/articles/todo#comment-420487866</link><description>Late comment:&lt;br&gt;I believe the main problem with TODO &amp;amp; co. is that they are extremely silent. That why I made a habit of regularly check for TODOs and FIXMEs and HACKs project-wide. If possible I do the necessary work or put them into the used issue tracker. TODOs are fast but should only be temporary. Putting them into an issue tracker makes them less silent and probably will get "fixed" till the next release.</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Janosch Dalecke</dc:creator><pubDate>Wed, 25 Jan 2012 07:49:15 -0000</pubDate></item><item><title>Re: Wiki Markup</title><link>http://wordaligned.org/articles/wiki-markup#comment-404023645</link><description>Thanks for the hint of how to escape underscores in markdown ;) Useful for python special methods like "__call__"!</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Karol</dc:creator><pubDate>Sat, 07 Jan 2012 13:22:00 -0000</pubDate></item><item><title>Re: When you comment on a comment</title><link>http://wordaligned.org/articles/comments-on-comments#comment-403512382</link><description>I agree with you all the way. Likewise, this will help owner to have full control on their comments.</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Karmaloop Rep Codes</dc:creator><pubDate>Sat, 07 Jan 2012 03:07:31 -0000</pubDate></item><item><title>Re: A Subversion Pre-Commit Hook</title><link>http://wordaligned.org/articles/a-subversion-pre-commit-hook#comment-402105629</link><description>Iam looking for svn pre-commit hook script to verify the text that wrote while checkin the code to svn. Can anyone help me out in this??</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Kbudike</dc:creator><pubDate>Fri, 06 Jan 2012 04:07:49 -0000</pubDate></item><item><title>Re: Longest common subsequence</title><link>http://wordaligned.org/articles/longest-common-subsequence#comment-384887974</link><description>suppose you must take (n) Specified courses to each a college degree and each courses has a set of required pre request courses design an efficent greed Algorithm  that determine the fewest number of semesters that would be needed to take all (n) courses assuming that there is number ?&lt;br&gt;&lt;br&gt;can help me i need code in c++</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">ahmad</dc:creator><pubDate>Mon, 12 Dec 2011 11:40:45 -0000</pubDate></item><item><title>Re: Longest common subsequence</title><link>http://wordaligned.org/articles/longest-common-subsequence#comment-384885083</link><description>suppose you must take (n) Specified courses to each a college degree and each courses has a set of required pre request courses design an efficent greed Algorithm  that determine the fewest number of semesters that would be needed to take all (n) courses assuming that there is number ؟&lt;br&gt;&lt;br&gt;can help me</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">ahmad</dc:creator><pubDate>Mon, 12 Dec 2011 11:38:58 -0000</pubDate></item><item><title>Re: Longest common subsequence</title><link>http://wordaligned.org/articles/longest-common-subsequence#comment-372012860</link><description>I would dream to have an updated python script taking into account Logan's comments...</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Zk</dc:creator><pubDate>Fri, 25 Nov 2011 05:01:38 -0000</pubDate></item><item><title>Re: Essential Python Reading List</title><link>http://wordaligned.org/articles/essential-python-reading-list#comment-368656756</link><description>Thanks for the amazing list. This will help&amp;gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Zubin Mehta</dc:creator><pubDate>Sun, 20 Nov 2011 04:18:53 -0000</pubDate></item><item><title>Re: Define pedantic</title><link>http://wordaligned.org/articles/define-pedantic#comment-362725914</link><description>Hi my name is yogesh kumar. I like&lt;br&gt;this blog website. I say thanks to that person who made this &lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;a href="http://www.today-life-style.blogspot.com" rel="nofollow"&gt;www.today-life-style.blogspot....&lt;/a&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">222yogeshkumar</dc:creator><pubDate>Mon, 14 Nov 2011 06:10:47 -0000</pubDate></item><item><title>Re: A race within a race</title><link>http://wordaligned.org/articles/a-race-within-a-race#comment-357559547</link><description>wonderful,&lt;br&gt;Nice information I really like to watch you post.</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">phone number lookup</dc:creator><pubDate>Mon, 07 Nov 2011 12:03:35 -0000</pubDate></item><item><title>Re: How to Mirror a Subversion Repository</title><link>http://wordaligned.org/articles/how-to-mirror-a-subversion-repository#comment-351966553</link><description>rsync uses SSH, which encryps trafic by default. And, therefore, rsync is slower than netcat + tar solution. I've personally checked that.</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Alexander (avz)</dc:creator><pubDate>Mon, 31 Oct 2011 10:55:05 -0000</pubDate></item><item><title>Re: Keyword Substitution - Just say No!</title><link>http://wordaligned.org/articles/keyword-substitution-just-say-no#comment-330836631</link><description>Just found this post while trying for the nth time in as many months to find a way to disable this on my own computer so that I'm not forced to endure long recompiles post commit as a result of this dinosaur relic (that is only something them web admins use - eww...)&lt;br&gt;&lt;br&gt;Now, if only there was such a config option hidden away somewhere.</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Joshua Leung</dc:creator><pubDate>Mon, 10 Oct 2011 06:10:12 -0000</pubDate></item><item><title>Re: Next permutation: When C++ gets it right</title><link>http://wordaligned.org/articles/next-permutation#comment-326915589</link><description>can someone help me to make a program in c++ &lt;br&gt;r-pemutation &lt;br&gt;n(input by user)&lt;br&gt;r(input by user)&lt;br&gt;&lt;br&gt;example&lt;br&gt;n=6&lt;br&gt;r=3&lt;br&gt;&lt;br&gt;output:&lt;br&gt;123&lt;br&gt;124&lt;br&gt;125&lt;br&gt;126&lt;br&gt;132&lt;br&gt;134&lt;br&gt;135&lt;br&gt;136&lt;br&gt;142&lt;br&gt;143&lt;br&gt;145&lt;br&gt;146&lt;br&gt;.....&lt;br&gt;&lt;br&gt;please i need it now!!!</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Kurey09</dc:creator><pubDate>Wed, 05 Oct 2011 02:13:47 -0000</pubDate></item><item><title>Re: Oulipo and the Eodermdrome challenge</title><link>http://wordaligned.org/articles/oulipo-eodermdrome#comment-321077219</link><description>yearly relay was discovered by Anthony Terrana circa 1979/1980 along with dreary day Ed</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Anthonyterrana56</dc:creator><pubDate>Tue, 27 Sep 2011 15:31:26 -0000</pubDate></item><item><title>Re: Oulipo and the Eodermdrome challenge</title><link>http://wordaligned.org/articles/oulipo-eodermdrome#comment-321075485</link><description>DAILY I'D LAY D</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Anthonyterrana56</dc:creator><pubDate>Tue, 27 Sep 2011 15:28:26 -0000</pubDate></item><item><title>Re: Partitioning with Python</title><link>http://wordaligned.org/articles/partitioning-with-python#comment-321069494</link><description>DAILY ID LAY D&lt;br&gt;&lt;br&gt;&lt;br&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Anthonyterrana56</dc:creator><pubDate>Tue, 27 Sep 2011 15:17:50 -0000</pubDate></item><item><title>Re: Sums and sums of squares in C++</title><link>http://wordaligned.org/articles/sums-and-sums-of-squares#comment-317920058</link><description>anu bayan wala naman ang hinahanap koooo  ....please sasusunod pagbigyan yo naman ako!!!!!</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Denverpante29</dc:creator><pubDate>Thu, 22 Sep 2011 20:50:06 -0000</pubDate></item><item><title>Re: Drawing Chessboards</title><link>http://wordaligned.org/articles/drawing-chessboards#comment-316776148</link><description>how many squares are there on a chessboard and why?  (NOT 64) HELP</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Guest</dc:creator><pubDate>Wed, 21 Sep 2011 13:08:11 -0000</pubDate></item><item><title>Re: He Sells Shell Scripts to Intersect Sets</title><link>http://wordaligned.org/articles/shell-script-sets#comment-316762137</link><description>That's a clever idea, Shankar, though I think you'd have to use with some care since the lines in the first file are treated as patterns rather than literal tokens. Thanks for the comment.</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">tag</dc:creator><pubDate>Wed, 21 Sep 2011 12:44:50 -0000</pubDate></item><item><title>Re: He Sells Shell Scripts to Intersect Sets</title><link>http://wordaligned.org/articles/shell-script-sets#comment-316721000</link><description>Instead of using sort *and* uniq (2 tools), many set operations can also be accomplished with a single program - grep.&lt;br&gt;&lt;br&gt;Set subtraction (in IP2, but not IP1), for instance can be found with:&lt;br&gt;&lt;br&gt;$ grep -v -f IP1 IP2&lt;br&gt;&lt;br&gt;Shankar</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Shankar</dc:creator><pubDate>Wed, 21 Sep 2011 11:37:57 -0000</pubDate></item><item><title>Re: Copy, load, redirect and tee using C++ streambufs</title><link>http://wordaligned.org/articles/cpp-streambufs#comment-316511424</link><description>Thanks for the bug fix!</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">tag</dc:creator><pubDate>Wed, 21 Sep 2011 04:14:45 -0000</pubDate></item><item><title>Re: Copy, load, redirect and tee using C++ streambufs</title><link>http://wordaligned.org/articles/cpp-streambufs#comment-316501494</link><description>In your generic version should this line in the overflow funtion:&lt;br&gt;&lt;br&gt;return traits::eq_int_type(r1, eof) || traits::eq_int_type(r1, eof) ? eof : c;&lt;br&gt;&lt;br&gt;be:&lt;br&gt;&lt;br&gt;return traits::eq_int_type(r1, eof) || traits::eq_int_type(r2, eof) ? eof : c;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Guest</dc:creator><pubDate>Wed, 21 Sep 2011 03:31:52 -0000</pubDate></item><item><title>Re: He Sells Shell Scripts to Intersect Sets</title><link>http://wordaligned.org/articles/shell-script-sets#comment-315792709</link><description>excellent job!</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Andy</dc:creator><pubDate>Tue, 20 Sep 2011 04:41:56 -0000</pubDate></item><item><title>Re: A Subversion Pre-Commit Hook</title><link>http://wordaligned.org/articles/a-subversion-pre-commit-hook#comment-314702995</link><description>Hi Tony can i use commit hook in java if s could u just help me how.......?</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Dhananjay</dc:creator><pubDate>Mon, 19 Sep 2011 01:38:51 -0000</pubDate></item><item><title>Re: The Maximum Sum contiguous subsequence problem</title><link>http://wordaligned.org/articles/the-maximum-subsequence-problem#comment-307215719</link><description>Thanks for your comment, Óscar. In the implementation shown, empty subsequences are allowed, and the sum of an empty subsequence is 0.</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">tag</dc:creator><pubDate>Sun, 11 Sep 2011 12:06:25 -0000</pubDate></item></channel></rss>

