<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
<rss version="2.0">
  <channel>
  <title>comp.lang.python Google Group</title>
  <link>http://groups.google.co.in/group/comp.lang.python</link>
  <description>The Python computer language.</description>
  <language>en</language>
  <item>
  <title>Re: I passed a fizzbuzz test but failed at recursion.</title>
  <link>http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/4198dc78530a11f7/8333e767e61a6569?show_docid=8333e767e61a6569</link>
  <description>
  In all 3 branches, &#39;is&#39; should be &#39;==&#39;. As written, this code depends on &lt;br&gt; the implementation treating 0 as a singleton, which CPython does as an &lt;br&gt; optimization, but which the language def does not require. &lt;br&gt; If one reversed the string addition in each branch, it would. &lt;br&gt; As written, the &#39;word&#39; for n is tacked on at the end.
  </description>
  <guid isPermaLink="true">http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/4198dc78530a11f7/8333e767e61a6569?show_docid=8333e767e61a6569</guid>
  <author>
  tjre...@udel.edu
  (Terry Reedy)
  </author>
  <pubDate>Wed, 10 Mar 2010 17:52:47 UT
</pubDate>
  </item>
  <item>
  <title>Re: Calculating very large exponents in python</title>
  <link>http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/f43b4d63b0630386/9982040af3b2ad0a?show_docid=9982040af3b2ad0a</link>
  <description>
  Whoops---I missed this. I&#39;m too slow! But at least my answers agree &lt;br&gt; with yours. (Factoring 10**78+1 took around 7 seconds using GP/Pari &lt;br&gt; on a 2.5 GHz MacBook; factoring the remaining quotient n / (10**78+1) &lt;br&gt; was much quicker.)
  </description>
  <guid isPermaLink="true">http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/f43b4d63b0630386/9982040af3b2ad0a?show_docid=9982040af3b2ad0a</guid>
  <author>
  dicki...@gmail.com
  (Mark Dickinson)
  </author>
  <pubDate>Wed, 10 Mar 2010 17:51:23 UT
</pubDate>
  </item>
  <item>
  <title>Python 2.6.5 release candidate 2 now available</title>
  <link>http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/d86fab526f2acfff/4e4a14081d7c6967?show_docid=4e4a14081d7c6967</link>
  <description>
  Hi everyone, &lt;br&gt; The source tarballs and Windows installer for Python 2.6.5 release candidate 2 &lt;br&gt; are now available: &lt;br&gt; &lt;a target=&quot;_blank&quot; rel=nofollow href=&quot;http://www.python.org/download/releases/2.6.5/&quot;&gt;[link]&lt;/a&gt; &lt;br&gt; As usual, please download, install, and test them with your favorite projects &lt;br&gt; and environments. A number of regressions and build problems on OS X have
  </description>
  <guid isPermaLink="true">http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/d86fab526f2acfff/4e4a14081d7c6967?show_docid=4e4a14081d7c6967</guid>
  <author>
  ba...@python.org
  (Barry Warsaw)
  </author>
  <pubDate>Wed, 10 Mar 2010 17:50:10 UT
</pubDate>
  </item>
  <item>
  <title>Re: Calculating very large exponents in python</title>
  <link>http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/f43b4d63b0630386/524c0cd8c952064d?show_docid=524c0cd8c952064d</link>
  <description>
  The complete factorization is: 101 x 521 x 3121 x 9901 x 36479 x &lt;br&gt; 300623 x 53397071018461 x 1900381976777332243781 x &lt;br&gt; 606051786031039803398561192172 1 x &lt;br&gt; 994180836742593577430698877602 162911139953691479055102244799 4642391 &lt;br&gt; It helps if you notice that the digits of the original 156-digit &lt;br&gt; number come from concatenating a 78-digit string to itself, giving an
  </description>
  <guid isPermaLink="true">http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/f43b4d63b0630386/524c0cd8c952064d?show_docid=524c0cd8c952064d</guid>
  <author>
  dicki...@gmail.com
  (Mark Dickinson)
  </author>
  <pubDate>Wed, 10 Mar 2010 17:47:19 UT
</pubDate>
  </item>
  <item>
  <title>Re: Can&#39;t define __call__ within __init__?</title>
  <link>http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/6c1e03e9d76cf596/73ab3b2c0717997f?show_docid=73ab3b2c0717997f</link>
  <description>
  If you want different behaviour its usually best to use different classes. &lt;br&gt; You can keep all the common behaviour in a base class and just override the &lt;br&gt; __call__ method for the different behaviour. Then use a factory function to &lt;br&gt; decide which class to instantiate or else override __new__ and make the
  </description>
  <guid isPermaLink="true">http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/6c1e03e9d76cf596/73ab3b2c0717997f?show_docid=73ab3b2c0717997f</guid>
  <author>
  duncan.bo...@invalid.invalid
  (Duncan Booth)
  </author>
  <pubDate>Wed, 10 Mar 2010 17:39:27 UT
</pubDate>
  </item>
  <item>
  <title>Re: NoSQL Movement?</title>
  <link>http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/942e22a0145599b2/9713d7df5480d33e?show_docid=9713d7df5480d33e</link>
  <description>
  No, I&#39;m saying that if you plan to build a business that could grow you &lt;br&gt; should be clear up front how you plan to handle the growth. It&#39;s too late &lt;br&gt; if you suddenly discover your platform isn&#39;t scalable just when you need to &lt;br&gt; scale it.
  </description>
  <guid isPermaLink="true">http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/942e22a0145599b2/9713d7df5480d33e?show_docid=9713d7df5480d33e</guid>
  <author>
  duncan.bo...@invalid.invalid
  (Duncan Booth)
  </author>
  <pubDate>Wed, 10 Mar 2010 17:26:46 UT
</pubDate>
  </item>
  <item>
  <title>Re: equivalent of Ruby&#39;s Pathname?</title>
  <link>http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/f580fb3763208425/9e241a4e963a3c1b?show_docid=9e241a4e963a3c1b</link>
  <description>
  The next closest thing would probably be the Python Cookbook: &lt;br&gt; &lt;a target=&quot;_blank&quot; rel=nofollow href=&quot;http://code.activestate.com/recipes/langs/python/&quot;&gt;[link]&lt;/a&gt; &lt;br&gt; However, such stuff can also be found as third-party modules. &lt;br&gt; Cheers, &lt;br&gt; Chris
  </description>
  <guid isPermaLink="true">http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/f580fb3763208425/9e241a4e963a3c1b?show_docid=9e241a4e963a3c1b</guid>
  <author>
  c...@rebertia.com
  (Chris Rebert)
  </author>
  <pubDate>Wed, 10 Mar 2010 17:15:07 UT
</pubDate>
  </item>
  <item>
  <title>Re: equivalent of Ruby&#39;s Pathname?</title>
  <link>http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/f580fb3763208425/5c371155d4738c3a?show_docid=5c371155d4738c3a</link>
  <description>
  In terms of trying too hard to achieve perfection, am I missing a &lt;br&gt; Python repository similar to the C++ Boost project? All the nice-to- &lt;br&gt; have classes that extend the core of C++ get to live in Boost before &lt;br&gt; the C++ Committee pulls the best ideas off the top and add them to the &lt;br&gt; Standard Library...
  </description>
  <guid isPermaLink="true">http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/f580fb3763208425/5c371155d4738c3a?show_docid=5c371155d4738c3a</guid>
  <author>
  phlip2...@gmail.com
  (Phlip)
  </author>
  <pubDate>Wed, 10 Mar 2010 16:54:51 UT
</pubDate>
  </item>
  <item>
  <title>Re: Anything like &quot;Effective Java&quot; for Python?</title>
  <link>http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/47674ff2d2c78fa6/0aa7d771c2da799c?show_docid=0aa7d771c2da799c</link>
  <description>
  kj wrote: &lt;br&gt; oxymoronic, no? &lt;br&gt; Sorry, couldn&#39;t resist ;-) &lt;br&gt; Chris
  </description>
  <guid isPermaLink="true">http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/47674ff2d2c78fa6/0aa7d771c2da799c?show_docid=0aa7d771c2da799c</guid>
  <author>
  ch...@simplistix.co.uk
  (Chris Withers)
  </author>
  <pubDate>Wed, 10 Mar 2010 16:46:23 UT
</pubDate>
  </item>
  <item>
  <title>Re: Interacting With Another Script</title>
  <link>http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/fc3663ea0d0af3a6/abe2a3fdd0dce48e?show_docid=abe2a3fdd0dce48e</link>
  <description>
  That depends on the program. Some programs that prompt for input &lt;br&gt; (particulary username/password) flush stdin before displaying each &lt;br&gt; prompt. I&#39;m not saying the program in question does that... &lt;br&gt; That doesn&#39;t mean that data written prior to the prompt won&#39;t be &lt;br&gt; ignore. &lt;br&gt; It&#39;s worth trying, but there&#39;s a slight chance it won&#39;t work.
  </description>
  <guid isPermaLink="true">http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/fc3663ea0d0af3a6/abe2a3fdd0dce48e?show_docid=abe2a3fdd0dce48e</guid>
  <author>
  inva...@invalid.invalid
  (Grant Edwards)
  </author>
  <pubDate>Wed, 10 Mar 2010 16:44:29 UT
</pubDate>
  </item>
  <item>
  <title>Re: Interacting With Another Script</title>
  <link>http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/fc3663ea0d0af3a6/05dd89674ad2b6da?show_docid=05dd89674ad2b6da</link>
  <description>
  There&#39;s no magical &amp;quot;prompt time&amp;quot;. The process&#39;s stdin&#39;s openness to &lt;br&gt; writing is not conditional. &lt;br&gt; Just send it all the input at once with the proper newlines in place &lt;br&gt; and it should work just fine assuming the user input was valid &lt;br&gt; (barring vpopmail using some fancy terminal input malarkey like &lt;br&gt; curses).
  </description>
  <guid isPermaLink="true">http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/fc3663ea0d0af3a6/05dd89674ad2b6da?show_docid=05dd89674ad2b6da</guid>
  <author>
  c...@rebertia.com
  (Chris Rebert)
  </author>
  <pubDate>Wed, 10 Mar 2010 16:39:57 UT
</pubDate>
  </item>
  <item>
  <title>Re: Interacting With Another Script</title>
  <link>http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/fc3663ea0d0af3a6/b5d0ce20ffa3558d?show_docid=b5d0ce20ffa3558d</link>
  <description>
  (assuming TTW = Thru The Web; been a while since I&#39;ve come across an &lt;br&gt; unknown, non-new acronym) &lt;br&gt; [Disclaimer: I know zilch about vpopmail&#39;s specifics] &lt;br&gt; Option A. Check for when the latest output looks prompt-like (e.g. &lt;br&gt; colon followed by a space; this will be program-specific and possibly &lt;br&gt; different for vpopmail) and then ask for input. For example:
  </description>
  <guid isPermaLink="true">http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/fc3663ea0d0af3a6/b5d0ce20ffa3558d?show_docid=b5d0ce20ffa3558d</guid>
  <author>
  c...@rebertia.com
  (Chris Rebert)
  </author>
  <pubDate>Wed, 10 Mar 2010 16:31:06 UT
</pubDate>
  </item>
  <item>
  <title>Re: I passed a fizzbuzz test but failed at recursion.</title>
  <link>http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/4198dc78530a11f7/43d8235f21826acc?show_docid=43d8235f21826acc</link>
  <description>
  There&#39;s only one print, it prints the string returned by fizzbuzz(100) &lt;br&gt; The string is constructed via recursion &lt;br&gt; ie: &lt;br&gt; fizzbuzz(6) &lt;br&gt; fizzbuzz(5) &lt;br&gt; fizzbuzz(4) &lt;br&gt; fizzbuzz(3) &lt;br&gt; fizzbuzz(2) &lt;br&gt; fizzbuzz(1) &lt;br&gt; fizzbuzz(0) &lt;br&gt; &#39;&#39;+&#39;1 \n&#39; &lt;br&gt; &#39;1 \n&#39;+&#39;2 \n&#39; &lt;br&gt; &#39;1 \n2 \n&#39;+&#39;fizz \n&#39; &lt;br&gt; &#39;1 \n2 \n fizz \n&#39;+&#39;4 \n&#39;
  </description>
  <guid isPermaLink="true">http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/4198dc78530a11f7/43d8235f21826acc?show_docid=43d8235f21826acc</guid>
  <author>
  chris.hu...@gmail.com
  (Chris Hulan)
  </author>
  <pubDate>Wed, 10 Mar 2010 16:24:00 UT
</pubDate>
  </item>
  <item>
  <title>Re: os.rename [Errno 31] Too many links</title>
  <link>http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/89faea869c513d3e/0f291a92f60f7c84?show_docid=0f291a92f60f7c84</link>
  <description>
  If you are on linux you can have a look at the open file descriptors of &lt;br&gt; a running process like this: &lt;br&gt; ls -l /proc/PID/fd/ &lt;br&gt; But I guess it is a limitation of your filesystem. What do you use? &lt;br&gt; I once had this problem with ext2. It has a low limit for &lt;br&gt; subdirectories. &lt;br&gt; With xfs the limits are much greater.
  </description>
  <guid isPermaLink="true">http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/89faea869c513d3e/0f291a92f60f7c84?show_docid=0f291a92f60f7c84</guid>
  <author>
  h...@tbz-pariv.de
  (Thomas Guettler)
  </author>
  <pubDate>Wed, 10 Mar 2010 16:08:44 UT
</pubDate>
  </item>
  <item>
  <title>I passed a fizzbuzz test but failed at recursion.</title>
  <link>http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/4198dc78530a11f7/69114b81d9157096?show_docid=69114b81d9157096</link>
  <description>
  Look at this recursive fizzbuzz function from &lt;br&gt; &lt;a target=&quot;_blank&quot; rel=nofollow href=&quot;http://www.codinghorror.com/blog/2007/02/why-cant-programmers-program.html&quot;&gt;[link]&lt;/a&gt; &lt;br&gt; def fizzbuzz(num): &lt;br&gt; if num: &lt;br&gt; if num % 15 is 0: return fizzbuzz(num-1) + &#39;fizzbuzz \n&#39; &lt;br&gt; elif num % 5 is 0: return fizzbuzz(num-1) + &#39;buzz \n&#39; &lt;br&gt; elif num % 3 is 0: return fizzbuzz(num-1) + &#39;fizz \n&#39;
  </description>
  <guid isPermaLink="true">http://groups.google.co.in/group/comp.lang.python/browse_thread/thread/4198dc78530a11f7/69114b81d9157096?show_docid=69114b81d9157096</guid>
  <author>
  bsag...@gmail.com
  (Bill)
  </author>
  <pubDate>Wed, 10 Mar 2010 15:55:27 UT
</pubDate>
  </item>
  </channel>
</rss>
