easier to read

Author: JoviDeCroock

src/diff/children.js

@@ -325,11 +325,7 @@ function constructNewChildrenArray(newParentVNode, renderResult, oldChildren) {
 
 				// When the remaining old chiildren is less than the new children
 				// plus our skewed index we know we are dealing with a growing list
-				if (remainingOldChildren < newChildrenLength + skewedIndex) {
-					skew += matchingIndex + skewedIndex;
-				} else {
-					skew = 0;
-				}
+				skew -= matchingIndex - skewedIndex;
 			}
 
 			// Move this VNode's DOM if the original index (matchingIndex) doesn't

test/browser/render.test.js

@@ -1636,6 +1636,7 @@ describe('render()', () => {
 		);
 		const a = ['0', '1', '2', '3', '4', '5', '6'];
 		const b = ['1', '3', '5', '2', '6', '4', '0'];
+		const c = ['11', '3', '1', '4', '6', '2', '5', '0', '9', '10'];
 		render(<App items={a} />, scratch);
 		expect(scratch.innerHTML).to.equal(
 			`<div>${a.map(n => `<div>${n}</div>`).join('')}</div>`
@@ -1646,6 +1647,11 @@ describe('render()', () => {
 			`<div>${b.map(n => `<div>${n}</div>`).join('')}</div>`
 		);
 
+		render(<App items={c} />, scratch);
+		expect(scratch.innerHTML).to.equal(
+			`<div>${c.map(n => `<div>${n}</div>`).join('')}</div>`
+		);
+
 		render(<App items={a} />, scratch);
 		expect(scratch.innerHTML).to.equal(
 			`<div>${a.map(n => `<div>${n}</div>`).join('')}</div>`