<story><title>The most copied StackOverflow snippet of all time is flawed</title><url>https://programming.guide/worlds-most-copied-so-snippet.html</url></story><parent_chain></parent_chain><comment><author>ben509</author><text>Suppose we had an index of snippets, meaning you&amp;#x27;ve parsed them and are able to search isomorphically. So, e.g. variable names are not significant. Some techniques discussed[1].&lt;p&gt;Then we run that against source repos, we could get update notifications for copypasta&amp;#x27;d code.&lt;p&gt;&amp;quot;In file F at line L, it looks like you used some code from SO at revision R. In revision R&amp;#x27;, it&amp;#x27;s been corrected.&amp;quot;&lt;p&gt;[1]: &lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;wiki.haskell.org&amp;#x2F;Hoogle#Theoretical_Foundations&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;wiki.haskell.org&amp;#x2F;Hoogle#Theoretical_Foundations&lt;/a&gt;</text></comment>
<story><title>The most copied StackOverflow snippet of all time is flawed</title><url>https://programming.guide/worlds-most-copied-so-snippet.html</url></story><parent_chain></parent_chain><comment><author>billpg</author><text>Is using Math.pow and Math.log (twice) faster than a tight loop that won&amp;#x27;t run more than six times?</text></comment>