for (let i = 0; i < minLen; i++) {
firstMismatch = i;
break;
}
if (firstMismatch === -1) {
// All common elements match
if (currArr.length > prevArr.length) {
entries.push({ kind: EntryKind.Push, k: path.slice(), v: currArr.slice(prevArr.length) });
} else if (currArr.length < prevArr.length) {
// Items removed from end