Function fix

api/diffview.ts:51–182

(code:codes)

                    d: number = 0,
                    codes: opcodes = [],
                    fix = function diffview_opcodes_fix(code:codes): void {
                        let len:number = codes.length - 1,
                            prior:[string, number, number, number, number] = codes[len];
                        if (prior !== undefined) {
                            if (prior[0] === code[0]) {
                                if (code[0] === "replace" || code[0] === "equal") {
                                    prior[2] = code[2];
                                    prior[4] = code[4];
                                } else if (code[0] === "delete") {
                                    prior[2] = code[2];
                                } else if (code[0] === "insert") {
                                    prior[4] = code[4];
                                }
                                if (codes.length > 1 && prior[2] === code[2] && prior[4] === code[4]) {
                                    if (prior[0] === "insert" && two[codes[codes.length - 2][4] - (prior[4] - prior[3])] === one[codes[codes.length - 2][1]]) {
                                        codes.pop();
                                        len = len - 1;
                                        codes[len] = ["insert", -1, -1, codes[len][3], codes[len][4] - (prior[4] - prior[3])];
                                        if (codes[len][4] < 0) {
                                            codes[len][4] = prior[4] - prior[3];
                                        }
                                        do {
                                            // one-sided replacement undo, more like undelete
                                            table[one[c]][0] = table[one[c]][0] + 1;
                                            c = c - 1;
                                        } while (c > codes[codes.length - 2][2]);
                                        d = codes[len][4] - 1;
                                    }
                                }
                                return;
                            }
                            if (prior[0] === "insert" && prior[4] - prior[3] === 1) {
                                if (code[2] - code[1] === 1) {
                                    if (code[0] === "replace") {
                                        codes[len] = ["replace", code[1], code[2], prior[3], prior[4]];
                                        prior = codes[len];
                                        code = ["insert", -1, -2, code[3], code[4]];
                                    } else if (code[0] === "delete") {
                                        code = ["replace", code[1], code[2], prior[3], prior[4]];
                                        codes.pop();
                                        len = len - 1;
                                        prior = codes[len];
                                        if (codes[len][0] === "replace") {
                                            prior[2] = code[2];
                                            prior[4] = code[4];
                                            return;
                                        }
                                    }
                                } else if (code[0] === "delete") {
                                    codes[len] = ["replace", code[1], code[1] + 1, prior[3], prior[4]];
                                    prior = codes[len];
                                    code[1] = code[1] + 1;
                                } else if (code[0] === "replace") {
                                    codes[len] = ["replace", code[1], code[1] + 1, prior[3], prior[4]];
                                    prior = codes[len];
                                    c = (prior[2] > 0)
                                        ? prior[2]
                                        : 0;