<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: sold</title><link>https://news.ycombinator.com/user?id=sold</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Thu, 30 Apr 2026 21:51:14 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=sold" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by sold in "Show HN: Django Secret Key Generator"]]></title><description><![CDATA[
<p>Since Django 1.10 you can simply use get_random_secret_key in django.core.management.utils.<p>This will not work:<p>if python3:
    print (SECRET_KEY)
else:
    print SECRET_KEY<p>because it's a syntax error in Python 3. Instead, you can just write "print (SECRET_KEY)", this works in both versions and has the same effect.</p>
]]></description><pubDate>Tue, 09 Aug 2016 19:51:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=12257282</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=12257282</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=12257282</guid></item><item><title><![CDATA[New comment by sold in "Django 1.10 released"]]></title><description><![CDATA[
<p>No, that's 1.11 (a LTS release)</p>
]]></description><pubDate>Mon, 01 Aug 2016 20:00:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=12205432</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=12205432</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=12205432</guid></item><item><title><![CDATA[New comment by sold in "Ask HN: Is there a mismatch between Math in German and English?"]]></title><description><![CDATA[
<p>"Monad" in English and "Monade" in German are the same, they can both mean the functional programming concept or the philosophical concept. You can just ignore the philosophical concept, it's not relevant to mathematics.</p>
]]></description><pubDate>Mon, 25 Jul 2016 10:11:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=12157618</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=12157618</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=12157618</guid></item><item><title><![CDATA[New comment by sold in "The Origins of SageMath; I am leaving academia to build a company [pdf]"]]></title><description><![CDATA[
<p>It's Python - you can do a lot of meta-programming with it, though unlike Lisp and Mathematica there's a division between expressions and statements.</p>
]]></description><pubDate>Sat, 11 Jun 2016 20:04:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=11885086</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=11885086</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=11885086</guid></item><item><title><![CDATA[New comment by sold in "Graph Isomorphism Algorithm Breaks 30-Year Impasse"]]></title><description><![CDATA[
<p>Earlier version was wrong <a href="https://cstheory.stackexchange.com/questions/1064/polynomial-time-algorithm-for-graph-isomorphism-testing" rel="nofollow">https://cstheory.stackexchange.com/questions/1064/polynomial...</a>, I doubt the current version has any substance.</p>
]]></description><pubDate>Tue, 15 Dec 2015 23:35:19 +0000</pubDate><link>https://news.ycombinator.com/item?id=10741298</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=10741298</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=10741298</guid></item><item><title><![CDATA[New comment by sold in "Graph Isomorphism Algorithm Breaks 30-Year Impasse"]]></title><description><![CDATA[
<p>The algorithm is only of theoretical interest, the situation is similar to primality testing. In practice programs such as nauty are good enough.</p>
]]></description><pubDate>Tue, 15 Dec 2015 21:09:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=10740484</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=10740484</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=10740484</guid></item><item><title><![CDATA[New comment by sold in "Ask HN: Do you find reading increasingly challenging?"]]></title><description><![CDATA[
<p>I set up an alarm clock for "detox" every day. I turn off my computer, silence the mobile phone and do nothing but read for hour or two. Resist any temptation to check email.<p>I've enjoyed this article that was recently on HN <a href="http://www.nytimes.com/2015/11/29/opinion/sunday/addicted-to-distraction.html" rel="nofollow">http://www.nytimes.com/2015/11/29/opinion/sunday/addicted-to...</a></p>
]]></description><pubDate>Sun, 06 Dec 2015 19:33:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=10686258</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=10686258</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=10686258</guid></item><item><title><![CDATA[New comment by sold in "Times Pulls Article Blaming Encryption in Paris Terror Attack"]]></title><description><![CDATA[
<p>I'd like to add this scenario actually happened during the Cold War. Soviets were reusing one time pads and the US army decrypted some of the messages, among other things this lead to discovery of Soviet spies targeting the US nuclear weapon program <a href="https://en.wikipedia.org/wiki/Venona_project" rel="nofollow">https://en.wikipedia.org/wiki/Venona_project</a></p>
]]></description><pubDate>Tue, 17 Nov 2015 23:06:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=10584670</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=10584670</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=10584670</guid></item><item><title><![CDATA[New comment by sold in "Ask HN: What are your best productivity tips (shortcuts/keybings/workflowithetc)?"]]></title><description><![CDATA[
<p>Alias often used commands, I have g = git, sl = ls (common typo).<p>Git: set up aliases. I can type "g co = git checkout", "g st = git status".
Git configuration: pull.ff only (then "git pull" does not cause an accidental merge), fetch.prune (then "git pull" = "git pull -p").<p>Chrome: Ctrl+L for URL bar, Ctrl+T new tab, Ctrl+Shift+T to reopen closed window, Ctrl+W to close tab<p>Bash: use Alt+. for last argument (e.g. type "vim x.py"; then "python " and press Alt+. to get "x.py"), Ctrl+R to search last commands. "cd -" = undo last "cd"<p>Gmail: use keyboard shortcuts (enable in settings). ? to see help, most important: "c" compose, "r" reply, "a" reply all, "f" forward<p>Use a password manager such as keepass, remember only a few passwords.</p>
]]></description><pubDate>Mon, 26 Oct 2015 22:07:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=10454830</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=10454830</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=10454830</guid></item><item><title><![CDATA[New comment by sold in "Ask HN: How often does Git merge make mistakes?"]]></title><description><![CDATA[
<p>Yes, ff-only will fail. If C,D are independent and simple, I would go ahead and rebase, otherwise do a proper merge.<p>Remember you can play a lot with git; if you are not sure how it will turn out, checkout a commit (e.g. git checkout origin/master), create a new throwaway branch (git checkout -b tmp), then you can do rebases, cherry-picks, merges etc., then do "git log tmp" or "git log -p tmp" to see how does the branch look. If you are unhappy, you can always throw it out (git branch -D tmp), it won't affect anything else.<p>I generally avoid the situation when a branch and origin diverges. The flow I have in my work is: If I need to make a small change (few lines), I pull, do changes, commit and push directly to master; if there are any intervening independent changes, pull --rebase. For anything larger, I create a new branch, and commit there. Once it is ready, I give it to a teammate for code review and do automated build, if everything is OK he merges it to master. Other people generally don't push to my branch, and there is no A-B-C vs A-B-D situation.<p>If several people work together on the same branch, we coordinate actions face-to-face or via team chat, to avoid conflicts. We pull/push many times a day and the changes are small enough so there are no problems with rebasing in a topic branch. If two people make big conflicting changes to the same branch, it means trouble and we merge or even discard some changes.</p>
]]></description><pubDate>Sat, 11 Jul 2015 21:29:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=9871648</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=9871648</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9871648</guid></item><item><title><![CDATA[New comment by sold in "Ask HN: How often does Git merge make mistakes?"]]></title><description><![CDATA[
<p>I recommend<p>git config --global pull.ff only<p>instead, then you can use "git pull" without worries. Or,<p>git pull --ff-only</p>
]]></description><pubDate>Sat, 11 Jul 2015 19:41:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=9871277</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=9871277</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9871277</guid></item><item><title><![CDATA[New comment by sold in "Fourier series"]]></title><description><![CDATA[
<p>See also <a href="http://www.quora.com/What-is-an-intuitive-way-of-explaining-how-the-Fourier-transform-works" rel="nofollow">http://www.quora.com/What-is-an-intuitive-way-of-explaining-...</a></p>
]]></description><pubDate>Tue, 23 Jun 2015 11:38:49 +0000</pubDate><link>https://news.ycombinator.com/item?id=9763952</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=9763952</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9763952</guid></item><item><title><![CDATA[New comment by sold in "The limits of type theory: computation vs. interaction"]]></title><description><![CDATA[
<p>> in fact, I think it's better than what languages with far richer type systems offer<p>Can you explain why? I don't know Kotlin, but from this page it seems to divide types into nullable and non-nullable (correct me if I'm wrong). Is it possible to have a type "T??" that has three possibilities - "null", "wrapped null" and "T"? If not, this approach will not help in the assoc problem mentioned by the parent poster.</p>
]]></description><pubDate>Mon, 08 Jun 2015 18:36:49 +0000</pubDate><link>https://news.ycombinator.com/item?id=9681202</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=9681202</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9681202</guid></item><item><title><![CDATA[New comment by sold in "Subtle Effect of Hidden Dependencies on the User Experience of Version Control [pdf]"]]></title><description><![CDATA[
<p>> this can lead to unexpected conflicts and can be relatively counter-intuitive to undo.<p>git merge --abort. Perhaps not intuitive, but it's a single command.</p>
]]></description><pubDate>Sat, 02 May 2015 18:27:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=9478013</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=9478013</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9478013</guid></item><item><title><![CDATA[New comment by sold in "[dead]"]]></title><description><![CDATA[
<p>See other threads e.g. <a href="https://news.ycombinator.com/item?id=9053552" rel="nofollow">https://news.ycombinator.com/item?id=9053552</a></p>
]]></description><pubDate>Sun, 15 Feb 2015 19:01:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=9053601</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=9053601</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9053601</guid></item><item><title><![CDATA[New comment by sold in "C99 tricks"]]></title><description><![CDATA[
<p>I see, thanks.</p>
]]></description><pubDate>Fri, 13 Feb 2015 14:12:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=9044361</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=9044361</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9044361</guid></item><item><title><![CDATA[New comment by sold in "C99 tricks"]]></title><description><![CDATA[
<p>What is the difference between x ?: y and x || y?</p>
]]></description><pubDate>Fri, 13 Feb 2015 13:51:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=9044253</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=9044253</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9044253</guid></item><item><title><![CDATA[New comment by sold in "A regular expression to check for prime numbers"]]></title><description><![CDATA[
<p>Unary representation is useless when speaking about complexity in number theory.<p>If you take a number N given in unary, convert it to binary and do trial division up to the square root, it will take O(N log N) time for conversion to binary and O(sqrt(N) * log(N)^2) for trial division (depending on your computational model, it could be O(N) and O(sqrt(N)) - I am counting bit complexity). In total, it's O(N log N). The runtime is dominated by reading the input! The complexity of trial division and the brilliant AKS algorithm is the same from this viewpoint.<p>Even if you had an algorithm that did not have to convert to binary and could tell in time linear to unary represenation whether a number is prime, it would be interesting trivia but nothing worthy a Nobel prize. In practice numbers are given in binary (or some other base>1 number system). To use your algorithm, you would have to convert to unary, which already means trial division would be faster.</p>
]]></description><pubDate>Fri, 13 Feb 2015 13:08:18 +0000</pubDate><link>https://news.ycombinator.com/item?id=9044090</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=9044090</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=9044090</guid></item><item><title><![CDATA[New comment by sold in "Ask HN: How do you take care of your vision?"]]></title><description><![CDATA[
<p>Flux <a href="https://justgetflux.com/" rel="nofollow">https://justgetflux.com/</a> or redshift <a href="http://jonls.dk/redshift/" rel="nofollow">http://jonls.dk/redshift/</a>.<p>Try setting it to the smallest temperature possible for 30 minutes and then turn it off to see the difference. I have it on all the time (though people working with colors might not be able to use it)</p>
]]></description><pubDate>Tue, 23 Dec 2014 20:32:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=8790044</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=8790044</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=8790044</guid></item><item><title><![CDATA[New comment by sold in "The reason people burn out on open source"]]></title><description><![CDATA[
<p>Note it's not a pull request; it's an issue in the tracker. Had it been a prepared patch, I would have more sympathy towards the reporter.</p>
]]></description><pubDate>Sun, 07 Dec 2014 15:20:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=8712387</link><dc:creator>sold</dc:creator><comments>https://news.ycombinator.com/item?id=8712387</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=8712387</guid></item></channel></rss>