diff-sequences
Advanced tools
Comparing version 24.9.0 to 25.0.0
@@ -604,30 +604,8 @@ 'use strict'; | ||
// Lazily wrap callback functions to swap args if graph is transposed. | ||
const _callbacks$ = callbacks[0], | ||
foundSubsequence = _callbacks$.foundSubsequence, | ||
isCommon = _callbacks$.isCommon; | ||
const {foundSubsequence, isCommon} = callbacks[0]; | ||
callbacks[1] = { | ||
foundSubsequence: (function(_foundSubsequence) { | ||
function foundSubsequence(_x, _x2, _x3) { | ||
return _foundSubsequence.apply(this, arguments); | ||
} | ||
foundSubsequence.toString = function() { | ||
return _foundSubsequence.toString(); | ||
}; | ||
return foundSubsequence; | ||
})((nCommon, bCommon, aCommon) => { | ||
foundSubsequence: (nCommon, bCommon, aCommon) => { | ||
foundSubsequence(nCommon, aCommon, bCommon); | ||
}), | ||
isCommon: (function(_isCommon) { | ||
function isCommon(_x4, _x5) { | ||
return _isCommon.apply(this, arguments); | ||
} | ||
isCommon.toString = function() { | ||
return _isCommon.toString(); | ||
}; | ||
return isCommon; | ||
})((bIndex, aIndex) => isCommon(aIndex, bIndex)) | ||
}, | ||
isCommon: (bIndex, aIndex) => isCommon(aIndex, bIndex) | ||
}; | ||
@@ -644,5 +622,3 @@ } | ||
const _callbacks = callbacks[transposed ? 1 : 0], | ||
foundSubsequence = _callbacks.foundSubsequence, | ||
isCommon = _callbacks.isCommon; // Divide the index intervals at the middle change. | ||
const {foundSubsequence, isCommon} = callbacks[transposed ? 1 : 0]; // Divide the index intervals at the middle change. | ||
@@ -660,14 +636,16 @@ divide( | ||
); | ||
const nChangePreceding = division.nChangePreceding, | ||
aEndPreceding = division.aEndPreceding, | ||
bEndPreceding = division.bEndPreceding, | ||
nCommonPreceding = division.nCommonPreceding, | ||
aCommonPreceding = division.aCommonPreceding, | ||
bCommonPreceding = division.bCommonPreceding, | ||
nCommonFollowing = division.nCommonFollowing, | ||
aCommonFollowing = division.aCommonFollowing, | ||
bCommonFollowing = division.bCommonFollowing, | ||
nChangeFollowing = division.nChangeFollowing, | ||
aStartFollowing = division.aStartFollowing, | ||
bStartFollowing = division.bStartFollowing; // Unless either index interval is empty, they might contain common items. | ||
const { | ||
nChangePreceding, | ||
aEndPreceding, | ||
bEndPreceding, | ||
nCommonPreceding, | ||
aCommonPreceding, | ||
bCommonPreceding, | ||
nCommonFollowing, | ||
aCommonFollowing, | ||
bCommonFollowing, | ||
nChangeFollowing, | ||
aStartFollowing, | ||
bStartFollowing | ||
} = division; // Unless either index interval is empty, they might contain common items. | ||
@@ -674,0 +652,0 @@ if (aStart < aEndPreceding && bStart < bEndPreceding) { |
{ | ||
"name": "diff-sequences", | ||
"version": "24.9.0", | ||
"version": "25.0.0", | ||
"repository": { | ||
@@ -19,3 +19,3 @@ "type": "git", | ||
"engines": { | ||
"node": ">= 6" | ||
"node": ">= 8" | ||
}, | ||
@@ -34,3 +34,3 @@ "main": "build/index.js", | ||
}, | ||
"gitHead": "9ad0f4bc6b8bdd94989804226c28c9960d9da7d1" | ||
"gitHead": "ff9269be05fd8316e95232198fce3463bf2f270e" | ||
} |
New author
Supply chain riskA new npm collaborator published a version of the package for the first time. New collaborators are usually benign additions to a project, but do indicate a change to the security surface area of a package.
Found 1 instance in 1 package
0
53074
832