v1.0.0

Author: scravy

.gitignore

@@ -0,0 +1,4 @@
+node_modules
+.*.swp
+.DS_Store
+*.log

README.md

@@ -1 +1,36 @@
-# knuth-morris-pratt
+knuth-morris-pratt
+==================
+
+An implementation of the
+[Knuth-Morris-Pratt](https://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm)
+string searching algorithm in JavaScript (it works with strings ***and*** arrays!).
+
+License
+-------
+
+    Copyright (c) 2015 Julian Fleischer
+
+    Permission is hereby granted, free of charge, to any
+    person obtaining a copy of this software and associated
+    documentation files (the "Software"), to deal in the
+    Software without restriction, including without
+    limitation the rights to use, copy, modify, merge,
+    publish, distribute, sublicense, and/or sell copies of
+    the Software, and to permit persons to whom the Software
+    is furnished to do so, subject to the following
+    conditions:
+
+    The above copyright notice and this permission notice
+    shall be included in all copies or substantial portions
+    of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF
+    ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
+    TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
+    PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
+    THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+    DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
+    CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+    CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
+    IN THE SOFTWARE.
+

index.js

@@ -0,0 +1,56 @@
+/* vim: set et sw=2 ts=2: */
+
+/**
+ * `indexOf` is an implementation of the Knuth-Morrison-Pratt
+ * Algorithm for finding the index of a given subsequence
+ * (identified as `word` here) within a sequence (identified as
+ * `string` here). Thanks to JavaScript's dynamic nature it
+ * works equally well with strings and arrays.
+ */
+module.exports = function indexOf(word, string) {
+  'use strict';
+
+  var m = 0;
+  var i = 0;
+  var table = [];
+
+  var pos = 2;
+  var cnd = 0;
+
+  table[0] = -1;
+  table[1] = 0;
+
+  // build the table for KMP. This takes `O(word.length)` steps.
+  while (pos < word.length) {
+    if (word[pos - 1] == word[cnd]) {
+      cnd = cnd + 1;
+      table[pos] = cnd;
+      pos = pos + 1;
+    } else if (cnd > 0) {
+      cnd = table[cnd];
+    } else {
+      table[pos] = 0;
+      pos = pos + 1;
+    }
+  }
+  
+  // scan the string. This takes `O(string.length)` steps.
+  while (m + i < string.length) {
+    if (word[i] == string[m + i]) {
+      if (i == word.length - 1) {
+        return m;
+      }
+      i = i + 1;
+    } else {
+      if (table[i] > -1) {
+        m = m + i - table[i];
+        i = table[i];
+      } else {
+        i = 0;
+        m = m + 1;
+      }
+    }
+  }
+  // Returns -1 if the subsequence was not found in the sequence.
+  return -1;
+};

package.json

@@ -4,7 +4,7 @@
   "description": "An implementation of the Knuth-Morris-Pratt string searching algorithm.",
   "main": "index.js",
   "scripts": {
-    "test": "echo \"Error: no test specified\" && exit 1"
+    "test": "jshint index.js"
   },
   "repository": {
     "type": "git",
@@ -21,9 +21,12 @@
     "kmp"
   ],
   "author": "Julian Alexander Fleischer <tirednesscankill@warhog.net>",
-  "license": "ISC",
+  "license": "MIT",
   "bugs": {
     "url": "https://github.com/nodash/knuth-morris-pratt/issues"
   },
-  "homepage": "https://github.com/nodash/knuth-morris-pratt"
+  "homepage": "https://github.com/nodash/knuth-morris-pratt",
+  "devDependencies": {
+    "jshint": "^2.8.0"
+  }
 }