<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>lkrubner</author><text>I love this:&lt;p&gt;&amp;quot;Key := Val Updates an existing Key
The key must be present in the old map. If Key is not in the old map Erlang will complain loudly.
Using two operations instead of one has several advantages:
A spelling mistake cannot accidentally introduce a new key&amp;quot;&lt;p&gt;Lord knows how many times I accidentally created a new key with a spelling typo, and then later when I wanted to retrieve the data, I was like &amp;quot;What the hell is wrong? I know I put data in that key, so why is nothing coming back? I guess I have discovered a rare bug in the compiler that no one has ever discovered before.&amp;quot;</text><parent_chain></parent_chain></comment><story><title>Big changes to Erlang</title><url>http://joearms.github.io/2014/02/01/big-changes-to-erlang.html</url></story>
<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>urbit</author><text>&amp;quot;This trick is well known to old-style functional programmers, they waffle on about Y combinators and eat this stuff for breakfast, but it’s the kind of stuff that gives functional programming a bad name. Try explaining this to first year students who had a heavy night out at the pub the evening before.&amp;quot;&lt;p&gt;Priceless (and completely true).  I really think this attitude is why Erlang is such a success.</text><parent_chain></parent_chain></comment><story><title>Big changes to Erlang</title><url>http://joearms.github.io/2014/02/01/big-changes-to-erlang.html</url></story>