about summary refs log tree commit diff
diff options
context:
space:
mode:
authorJames Rowe <jroweboy@gmail.com>2014-07-03 16:28:22 -0600
committerJames Rowe <jroweboy@gmail.com>2014-07-03 16:28:22 -0600
commitc614510ddb0eca24ee102511feb69a159238a996 (patch)
tree41c81ea8aa4e29dccf9cf841a147e2aaa0e3f15d
parent6b210878a19ffcc806e285f6678a2883eaf407b6 (diff)
Updated the licensing information for the Levenshtein distance function
-rw-r--r--src/librustdoc/html/static/main.js7
1 files changed, 5 insertions, 2 deletions
diff --git a/src/librustdoc/html/static/main.js b/src/librustdoc/html/static/main.js
index 3df2bf3c339..c6cc4c25282 100644
--- a/src/librustdoc/html/static/main.js
+++ b/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 = [];