Comparing version 0.1.0 to 0.1.1
@@ -59,2 +59,8 @@ /** | ||
// Fast-path at this particular point because the "no change" case that this covers | ||
// is orders magnitude more common than the others | ||
if (nStartIdx === nextLen) { | ||
return; | ||
} | ||
// List tail is the same | ||
@@ -61,0 +67,0 @@ while (pEndIdx >= pStartIdx && nEndIdx >= nStartIdx && equal(pEndItem, nEndItem)) { |
@@ -5,3 +5,3 @@ { | ||
"repository": "git://github.com/ashaffer/dift.git", | ||
"version": "0.1.0", | ||
"version": "0.1.1", | ||
"license": "MIT", | ||
@@ -8,0 +8,0 @@ "main": "lib/index.js", |
@@ -8,2 +8,4 @@ | ||
Without really researching it or benchmarking, i'm going to invoke [Cunningham's Law](https://meta.wikimedia.org/wiki/Cunningham%27s_Law) and say that it is the fastest key-based list diff algorithm in existence for this particular application. | ||
## Installation | ||
@@ -10,0 +12,0 @@ |
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
11543
341
34