This repository was archived by the owner on Oct 17, 2021. It is now read-only.

Commit 01ad236

author

Jack Chan

committed

fix: add oldIndex in update

1 parent 7a1f675 commit 01ad236Copy full SHA for 01ad236

File tree

+21

-7

lines changed

+21

-7

lines changed

Lines changed: 13 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -108,17 +108,26 @@`
`108`	`108`	`var _loop = function _loop(i) {`
`109`	`109`	`if (!_lodash2.default.isEqual(leftArray[i], rightArray[i])) {`
`110`	`110`	`(function () {`
`111`		`- var index = _lodash2.default.findIndex(r[key], function (value) {`
	`111`	`+ var newIndex = _lodash2.default.findIndex(r[key], function (value) {`
`112`	`112`	`return _lodash2.default.isEqual(value, rightArray[i]);`
`113`	`113`	`});`
`114`	`114`	`for (var j = 0; j < allKeysCounter[rightArray[i]]; j++) {`
`115`		`- index = _lodash2.default.findIndex(r[key], function (value) {`
`116`		`- return _lodash2.default.isEqual(value, rightArray[i], index + 1);`
	`115`	`+ newIndex = _lodash2.default.findIndex(r[key], function (value) {`
	`116`	`+ return _lodash2.default.isEqual(value, rightArray[i], newIndex + 1);`
	`117`	`+ });`
	`118`	`+ }`
	`119`	`+ var oldIndex = _lodash2.default.findIndex(l[key], function (value) {`
	`120`	`+ return _lodash2.default.isEqual(value, rightArray[i]);`
	`121`	`+ });`
	`122`	`+ for (var _j = 0; _j < allKeysCounter[rightArray[i]]; _j++) {`
	`123`	`+ oldIndex = _lodash2.default.findIndex(l[key], function (value) {`
	`124`	`+ return _lodash2.default.isEqual(value, rightArray[i], oldIndex + 1);`
`117`	`125`	`});`
`118`	`126`	`}`
`119`	`127`	`allKeysObject[rightArray[i]].push({`
`120`	`128`	`counter: allKeysCounter[rightArray[i]],`
`121`		`- newIndex: index`
	`129`	`+ newIndex: newIndex,`
	`130`	`+ oldIndex: oldIndex`
`122`	`131`	`});`
`123`	`132`	`})();`
`124`	`133`	`}`

Lines changed: 8 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -36,13 +36,18 @@ const updatedDiff = (lhs, rhs, simpleArray = true) => {`
`36`	`36`	`const allKeysObject = _.reduce(allKeys, (acc, curr) => (acc[curr] = [], acc), {})`
`37`	`37`	`for (let i = 0; i < leftArray.length; i++) {`
`38`	`38`	`if (!_.isEqual(leftArray[i], rightArray[i])) {`
`39`		`- let index = _.findIndex(r[key], value => _.isEqual(value, rightArray[i]))`
	`39`	`+ let newIndex = _.findIndex(r[key], value => _.isEqual(value, rightArray[i]))`
`40`	`40`	`for (let j = 0; j < allKeysCounter[rightArray[i]]; j++) {`
`41`		`- index = _.findIndex(r[key], value => _.isEqual(value, rightArray[i], index + 1))`
	`41`	`+ newIndex = _.findIndex(r[key], value => _.isEqual(value, rightArray[i], newIndex + 1))`
	`42`	`+ }`
	`43`	`+ let oldIndex = _.findIndex(l[key], value => _.isEqual(value, rightArray[i]))`
	`44`	`+ for (let j = 0; j < allKeysCounter[rightArray[i]]; j++) {`
	`45`	`+ oldIndex = _.findIndex(l[key], value => _.isEqual(value, rightArray[i], oldIndex + 1))`
`42`	`46`	`}`
`43`	`47`	`allKeysObject[rightArray[i]].push({`
`44`	`48`	`counter: allKeysCounter[rightArray[i]],`
`45`		`- newIndex: index`
	`49`	`+ newIndex,`
	`50`	`+ oldIndex,`
`46`	`51`	`})`
`47`	`52`	`}`
`48`	`53`	`allKeysCounter[rightArray[i]] = allKeysCounter[rightArray[i]]++`

Comments

(0)