---

yaml
---
r: 126042
b: refs/heads/try
c: c614510
h: refs/heads/master
v: v3

Author: jroweboy

[refs]

@@ -2,7 +2,7 @@
 refs/heads/master: f2fa55903e378368ed9173560f03a0ef16e371c2
 refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
 refs/heads/snap-stage3: 9fc8394d3bce22ab483f98842434c84c396212ae
-refs/heads/try: 6b210878a19ffcc806e285f6678a2883eaf407b6
+refs/heads/try: c614510ddb0eca24ee102511feb69a159238a996
 refs/tags/release-0.1: 1f5c5126e96c79d22cb7862f75304136e204f105
 refs/heads/ndm: f3868061cd7988080c30d6d5bf352a5a5fe2460b
 refs/heads/try2: 147ecfdd8221e4a4d4e090486829a06da1e0ca3c

branches/try/src/librustdoc/html/static/main.js

@@ -112,8 +112,11 @@
         document.location.href = url;
     });
     /**
-     * Code from Stackoverflow to compute the Levenshtein distance between two strings
-     * Written by Marco de Wit at http://stackoverflow.com/a/18514751/745719
+     * A function to compute the Levenshtein distance between two strings
+     * Licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported
+     * Full License can be found at http://creativecommons.org/licenses/by-sa/3.0/legalcode
+     * This code is an unmodified version of the code written by Marco de Wit 
+     * and was found at http://stackoverflow.com/a/18514751/745719
      */
     var levenshtein = (function() {
         var row2 = [];