aboutsummaryrefslogtreecommitdiff
path: root/node_modules/fast-diff/README.md
diff options
context:
space:
mode:
authorFlorian Dold <florian.dold@gmail.com>2019-03-27 21:01:33 +0100
committerFlorian Dold <florian.dold@gmail.com>2019-03-27 21:01:33 +0100
commitcc97a4dd2a967e1c2273bd5f4c5f49a5bf2e2585 (patch)
tree92c5d88706a6ffc654d1b133618d357890e7096b /node_modules/fast-diff/README.md
parent3771b4d6b67b34c130f3a9a1a15f42deefdb2eda (diff)
remove node_modules
Diffstat (limited to 'node_modules/fast-diff/README.md')
-rw-r--r--node_modules/fast-diff/README.md24
1 files changed, 0 insertions, 24 deletions
diff --git a/node_modules/fast-diff/README.md b/node_modules/fast-diff/README.md
deleted file mode 100644
index e786a3a60..000000000
--- a/node_modules/fast-diff/README.md
+++ /dev/null
@@ -1,24 +0,0 @@
-# Fast Diff [![Build Status](https://travis-ci.org/jhchen/fast-diff.svg)](https://travis-ci.org/jhchen/fast-diff)
-
-This is a simplified import of the excellent [diff-match-patch](https://code.google.com/p/google-diff-match-patch/) library by [Neil Fraser](https://neil.fraser.name/) into the Node.js environment. The match and patch parts are removed, as well as all the extra diff options. What remains is incredibly fast diffing between two strings.
-
- The diff function is an implementation of ["An O(ND) Difference Algorithm and its Variations" (Myers, 1986)](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.4.6927&rep=rep1&type=pdf) with the suggested divide and conquer strategy along with several [optimizations](http://neil.fraser.name/news/2007/10/09/) Neil added.
-
-```js
-var diff = require('fast-diff');
-
-var good = 'Good dog';
-var bad = 'Bad dog';
-
-var result = diff(good, bad);
-// [[-1, "Goo"], [1, "Ba"], [0, "d dog"]]
-
-// Respect suggested edit location (cursor position), added in v1.1
-diff('aaa', 'aaaa', 1)
-// [[0, "a"], [1, "a"], [0, "aa"]]
-
-// For convenience
-diff.INSERT === 1;
-diff.EQUAL === 0;
-diff.DELETE === -1;
-```