Added node_modules for the updating to work properly.

5 files changed, 214 insertions, 0 deletions

diff --git a/node_modules/leven/index.d.ts b/node_modules/leven/index.d.ts
new file mode 100644
index 0000000..571833a
--- /dev/null
+++ b/node_modules/leven/index.d.ts
@@ -0,0 +1,21 @@
+declare const leven: {
+	/**
+	Measure the difference between two strings.
+
+	@example
+	```
+	import leven = require('leven');
+
+	leven('cat', 'cow');
+	//=> 2
+	```
+	*/
+	(left: string, right: string): number;
+
+	// TODO: Remove this for the next major release, refactor the whole definition to:
+	// declare function leven(left: string, right: string): number;
+	// export = leven;
+	default: typeof leven;
+};
+
+export = leven;
diff --git a/node_modules/leven/index.js b/node_modules/leven/index.js
new file mode 100644
index 0000000..25f5a3d
--- /dev/null
+++ b/node_modules/leven/index.js
@@ -0,0 +1,77 @@
+'use strict';
+const array = [];
+const charCodeCache = [];
+
+const leven = (left, right) => {
+	if (left === right) {
+		return 0;
+	}
+
+	const swap = left;
+
+	// Swapping the strings if `a` is longer than `b` so we know which one is the
+	// shortest & which one is the longest
+	if (left.length > right.length) {
+		left = right;
+		right = swap;
+	}
+
+	let leftLength = left.length;
+	let rightLength = right.length;
+
+	// Performing suffix trimming:
+	// We can linearly drop suffix common to both strings since they
+	// don't increase distance at all
+	// Note: `~-` is the bitwise way to perform a `- 1` operation
+	while (leftLength > 0 && (left.charCodeAt(~-leftLength) === right.charCodeAt(~-rightLength))) {
+		leftLength--;
+		rightLength--;
+	}
+
+	// Performing prefix trimming
+	// We can linearly drop prefix common to both strings since they
+	// don't increase distance at all
+	let start = 0;
+
+	while (start < leftLength && (left.charCodeAt(start) === right.charCodeAt(start))) {
+		start++;
+	}
+
+	leftLength -= start;
+	rightLength -= start;
+
+	if (leftLength === 0) {
+		return rightLength;
+	}
+
+	let bCharCode;
+	let result;
+	let temp;
+	let temp2;
+	let i = 0;
+	let j = 0;
+
+	while (i < leftLength) {
+		charCodeCache[i] = left.charCodeAt(start + i);
+		array[i] = ++i;
+	}
+
+	while (j < rightLength) {
+		bCharCode = right.charCodeAt(start + j);
+		temp = j++;
+		result = j;
+
+		for (i = 0; i < leftLength; i++) {
+			temp2 = bCharCode === charCodeCache[i] ? temp : temp + 1;
+			temp = array[i];
+			// eslint-disable-next-line no-multi-assign
+			result = array[i] = temp > result ? temp2 > result ? result + 1 : temp2 : temp2 > temp ? temp + 1 : temp2;
+		}
+	}
+
+	return result;
+};
+
+module.exports = leven;
+// TODO: Remove this for the next major release
+module.exports.default = leven;
diff --git a/node_modules/leven/license b/node_modules/leven/license
new file mode 100644
index 0000000..e7af2f7
--- /dev/null
+++ b/node_modules/leven/license
@@ -0,0 +1,9 @@
+MIT License
+
+Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (sindresorhus.com)
+
+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.
diff --git a/node_modules/leven/package.json b/node_modules/leven/package.json
new file mode 100644
index 0000000..e1b3d8e
--- /dev/null
+++ b/node_modules/leven/package.json
@@ -0,0 +1,57 @@
+{
+	"name": "leven",
+	"version": "3.1.0",
+	"description": "Measure the difference between two strings using the fastest JS implementation of the Levenshtein distance algorithm",
+	"license": "MIT",
+	"repository": "sindresorhus/leven",
+	"author": {
+		"name": "Sindre Sorhus",
+		"email": "sindresorhus@gmail.com",
+		"url": "sindresorhus.com"
+	},
+	"engines": {
+		"node": ">=6"
+	},
+	"scripts": {
+		"test": "xo && ava && tsd",
+		"bench": "matcha bench.js"
+	},
+	"files": [
+		"index.js",
+		"index.d.ts"
+	],
+	"keywords": [
+		"leven",
+		"levenshtein",
+		"distance",
+		"algorithm",
+		"algo",
+		"string",
+		"difference",
+		"diff",
+		"fast",
+		"fuzzy",
+		"similar",
+		"similarity",
+		"compare",
+		"comparison",
+		"edit",
+		"text",
+		"match",
+		"matching"
+	],
+	"devDependencies": {
+		"ava": "^1.4.1",
+		"fast-levenshtein": "^2.0.6",
+		"ld": "^0.1.0",
+		"levdist": "^2.2.9",
+		"levenshtein": "^1.0.5",
+		"levenshtein-component": "^0.0.1",
+		"levenshtein-edit-distance": "^2.0.3",
+		"matcha": "^0.7.0",
+		"natural": "^0.6.3",
+		"talisman": "^0.21.0",
+		"tsd": "^0.7.2",
+		"xo": "^0.24.0"
+	}
+}
diff --git a/node_modules/leven/readme.md b/node_modules/leven/readme.md
new file mode 100644
index 0000000..33625c4
--- /dev/null
+++ b/node_modules/leven/readme.md
@@ -0,0 +1,50 @@
+# leven [![Build Status](https://travis-ci.org/sindresorhus/leven.svg?branch=master)](https://travis-ci.org/sindresorhus/leven)
+
+> Measure the difference between two strings<br>
+> One of the fastest JS implementations of the [Levenshtein distance](https://en.wikipedia.org/wiki/Levenshtein_distance) algorithm
+
+
+## Install
+
+```
+$ npm install leven
+```
+
+
+## Usage
+
+```js
+const leven = require('leven');
+
+leven('cat', 'cow');
+//=> 2
+```
+
+
+## Benchmark
+
+```
+$ npm run bench
+```
+
+```
+         165,926 op/s » leven
+         164,398 op/s » talisman
+           1,044 op/s » levenshtein-edit-distance
+             628 op/s » fast-levenshtein
+             497 op/s » levenshtein-component
+             195 op/s » ld
+             190 op/s » levenshtein
+             168 op/s » levdist
+              10 op/s » natural
+```
+
+
+## Related
+
+- [leven-cli](https://github.com/sindresorhus/leven-cli) - CLI for this module
+
+
+## License
+
+MIT © [Sindre Sorhus](https://sindresorhus.com)