diff.ts

namespace pxt.diff {
    /*
    Constant MAX ∈ [0,M+N]
    Var V: Array [− MAX .. MAX] of Integer
    V[1]←0
    For D←0 to MAX Do
        For k ← −D to D in steps of 2 Do
            If k=−D or k≠D and V[k−1]<V[k+1] Then
                x ← V[k+1]
            Else
                x ← V[k−1]+1
            y←x−k
            While x<N and y<M and a[x+1] =b[y+1] Do
                (x,y)←(x+1,y+1)
            V[k]←x
            If x≥N and y≥M Then
                Length of an SES is D
                Stop
    */

    type UArray = Uint32Array | Uint16Array

    export function toLines(file: string, includeNewline?: boolean) {
        if (!file) return [];

        if (includeNewline) {
            const result: string[] = [];

            let lineStart = 0;
            for (let i = 0; i < file.length; i++) {
                const current = file.charAt(i);
                if (current === "\n") {
                    result.push(file.substring(lineStart, i + 1));
                    lineStart = i + 1;
                }
            }

            result.push(file.substring(lineStart));

            return result;
        }

        return file.split(/\r?\n/);
    }

    export interface DiffOptions {
        context?: number; // lines of context; defaults to 3
        ignoreWhitespace?: boolean;
        maxDiffSize?: number; // defaults to 1024
        full?: boolean; // don't try to create short diff
    }

    enum DiffOp {
        Added = 1,
        Deleted = -1,
        Unchanged = 0
    }

    type DiffPart = [DiffOp, string];

    // This is the format used by Google's diff-match-patch library, which we used
    // to use. Our diffs match this format but we don't use the start2 and length2
    // properties or include deletions in the diffs since our patches are meant to
    // be one-way only
    interface Patch {
        diffs: DiffPart[];
        length1: number;
        length2?: number;
        start1: number;
        start2?: number;
    }

    // based on An O(ND) Difference Algorithm and Its Variations by EUGENE W. MYERS
    export function compute(fileA: string, fileB: string, options: DiffOptions = {}): DiffPart[] {
        if (options.ignoreWhitespace) {
            fileA = fileA.replace(/[\r\n]+$/, "")
            fileB = fileB.replace(/[\r\n]+$/, "")
        }

        const a = toLines(fileA, true);
        const b = toLines(fileB, true);

        const MAX = Math.min(options.maxDiffSize || 1024, a.length + b.length)
        if (MAX == 0) // nothing to diff
            return [];
        const ctor = a.length > 0xfff0 ? Uint32Array : Uint16Array

        const idxmap: pxt.Map<number> = {}
        let curridx = 0
        const aidx = mkidx(a), bidx = mkidx(b)

        function mkidx(strings: string[]) {
            const idxarr = new ctor(strings.length)
            let i = 0
            for (let e of strings) {
                if (options.ignoreWhitespace)
                    e = e.replace(/\s+$/g, "").replace(/^\s+/g, ''); // only ignore start/end of lines
                if (idxmap.hasOwnProperty(e))
                    idxarr[i] = idxmap[e]
                else {
                    ++curridx
                    idxarr[i] = curridx
                    idxmap[e] = curridx
                }
                i++
            }
            return idxarr
        }

        const V = new ctor(2 * MAX + 1)
        let diffLen = -1
        for (let D = 0; D <= MAX; D++) {
            if (computeFor(D, V) != null) {
                diffLen = D
            }
        }

        if (diffLen == -1)
            return null // diffLen > MAX

        const trace: UArray[] = []
        let endpoint: number = null
        for (let D = 0; D <= diffLen; D++) {
            const V = trace.length ? trace[trace.length - 1].slice(0) : new ctor(2 * diffLen + 1)
            trace.push(V)
            endpoint = computeFor(D, V)
            if (endpoint != null)
                break
        }

        const diff: DiffPart[] = []
        let k = endpoint
        for (let D = trace.length - 1; D >= 0; D--) {
            const V = trace[D]
            let x = 0
            let nextK = 0
            if (k == -D || (k != D && V[MAX + k - 1] < V[MAX + k + 1])) {
                nextK = k + 1
                x = V[MAX + nextK]
            } else {
                nextK = k - 1
                x = V[MAX + nextK] + 1
            }
            let y = x - k
            const snakeLen = V[MAX + k] - x
            for (let i = snakeLen - 1; i >= 0; --i)
                diff.push([DiffOp.Unchanged, b[y + i]])

            if (nextK == k - 1) {
                diff.push([DiffOp.Deleted, a[x - 1]])
            } else {
                if (y > 0)
                    diff.push([DiffOp.Added, b[y - 1]])
            }
            k = nextK
        }
        diff.reverse()

        return diff;

        function computeFor(D: number, V: UArray) {
            for (let k = -D; k <= D; k += 2) {
                let x = 0
                if (k == -D || (k != D && V[MAX + k - 1] < V[MAX + k + 1]))
                    x = V[MAX + k + 1]
                else
                    x = V[MAX + k - 1] + 1
                let y = x - k
                while (x < aidx.length && y < bidx.length && aidx[x] == bidx[y]) {
                    x++
                    y++
                }
                V[MAX + k] = x
                if (x >= aidx.length && y >= bidx.length) {
                    return k
                }
            }
            return null
        }
    }

    export function computeFormattedDiff(fileA: string, fileB: string, options: DiffOptions = {}): string[] {
        const diff = compute(fileA, fileB, options);

        if (options.context == Infinity || options.full) {
            return diff.map(formatEdit);
        }

        let aline = 1, bline = 1, idx = 0
        const shortDiff: string[] = []
        const context = options.context || 3
        while (idx < diff.length) {
            let nextIdx = idx
            while (nextIdx < diff.length && diff[nextIdx][0] === DiffOp.Unchanged)
                nextIdx++
            if (nextIdx == diff.length)
                break
            const startIdx = nextIdx - context
            const skip = startIdx - idx
            if (skip > 0) {
                aline += skip
                bline += skip
                idx = startIdx
            }
            const hdPos = shortDiff.length
            const aline0 = aline, bline0 = bline
            shortDiff.push("@@") // patched below

            let endIdx = idx
            let numCtx = 0
            while (endIdx < diff.length) {
                if (diff[endIdx][0] === DiffOp.Unchanged) {
                    numCtx++
                    if (numCtx > context * 2 + 2) {
                        endIdx -= context + 2
                        break
                    }
                } else {
                    numCtx = 0
                }
                endIdx++
            }

            while (idx < endIdx) {
                shortDiff.push(formatEdit(diff[idx]))
                const c = diff[idx][0]
                switch (c) {
                    case DiffOp.Deleted: aline++; break;
                    case DiffOp.Added: bline++; break;
                    case DiffOp.Unchanged: aline++; bline++; break;
                }
                idx++
            }
            shortDiff[hdPos] = `@@ -${aline0},${aline - aline0} +${bline0},${bline - bline0} @@`
        }

        return shortDiff
    }

    function formatEdit([change, text]: DiffPart): string {
        let result: string;
        if (change === DiffOp.Added) {
            result = "+ ";
        }
        else if (change === DiffOp.Deleted) {
            result = "- ";
        }
        else {
            result = "  ";
        }

        return result + text.replace(/\r?n/, "");
    }

    function diffToPatch(diff: DiffPart[]): Patch[] {
        const linePatches: Patch[] = [];

        let patchedText = "";
        let currentAddition = "";
        let currentDeletion = "";
        let prevOp = DiffOp.Unchanged;

        const pushEdit = () => {
            linePatches.push({
                start1: patchedText.length,
                length1: currentDeletion.length,
                diffs: [[DiffOp.Added, currentAddition]]
            });
            patchedText += currentAddition;
            currentAddition = "";
            currentDeletion = "";
        };

        for (let i = 0; i < diff.length; i++) {
            const [op, line] = diff[i];

            if (op == DiffOp.Unchanged) {
                if (prevOp !== DiffOp.Unchanged) {
                    pushEdit();
                }
                patchedText += line
            }
            else if (op === DiffOp.Added) {
                currentAddition += line
            }
            else if (op === DiffOp.Deleted) {
                if (prevOp === DiffOp.Added) {
                    pushEdit();
                }
                currentDeletion += line
            }

            prevOp = op;
        }

        if (prevOp !== DiffOp.Unchanged) {
            pushEdit();
        }

        return linePatches;
    }

    export function computePatch(fileA: string, fileB: string): Patch[] {
        const diff = compute(fileA, fileB, { full: true });
        const patch = diffToPatch(diff);

        return patch
    }

    export function applyPatch(file: string, patch: Patch[]) {
        let result = file;

        for (const part of patch) {
            const newText = part.diffs.filter(d => d[0] !== DiffOp.Deleted).map(d => d[1]).join("");
            result =
                result.substring(0, part.start1) +
                newText +
                result.substring(part.start1 + part.length1);
        }

        return result;
    }

    // based on "A Formal Investigation of Diff3" by Sanjeev Khanna, Keshav Kunal, and Benjamin C. Pierce
    export function diff3(fileA: string, fileO: string, fileB: string,
        lblA: string, lblB: string) {
        const ma = computeMatch(fileA)
        const mb = computeMatch(fileB)

        if (!ma || !mb) // diff failed, can't merge
            return undefined;

        const fa = toLines(fileA)
        const fb = toLines(fileB)
        let numConflicts = 0

        let r: string[] = []
        let la = 0, lb = 0
        for (let i = 0; i < ma.length - 1;) {
            if (ma[i] == la && mb[i] == lb) {
                r.push(fa[la])
                la++
                lb++
                i++
            } else {
                let aSame = true
                let bSame = true
                let j = i
                while (j < ma.length) {
                    if (ma[j] != la + j - i)
                        aSame = false
                    if (mb[j] != lb + j - i)
                        bSame = false
                    if (ma[j] != null && mb[j] != null)
                        break
                    j++
                }
                U.assert(j < ma.length)
                if (aSame) {
                    while (lb < mb[j])
                        r.push(fb[lb++])
                } else if (bSame) {
                    while (la < ma[j])
                        r.push(fa[la++])
                } else if (fa.slice(la, ma[j]).join("\n") == fb.slice(lb, mb[j]).join("\n")) {
                    // false conflict - both are the same
                    while (la < ma[j])
                        r.push(fa[la++])
                } else {
                    numConflicts++
                    r.push("<<<<<<< " + lblA)
                    while (la < ma[j])
                        r.push(fa[la++])
                    r.push("=======")
                    while (lb < mb[j])
                        r.push(fb[lb++])
                    r.push(">>>>>>> " + lblB)
                }
                i = j
                la = ma[j]
                lb = mb[j]
            }
        }

        return { merged: r.join("\n"), numConflicts }

        function computeMatch(fileA: string) {
            const da = compute(fileO, fileA, { context: Infinity })
            if (!da)
                return undefined;
            const ma: number[] = []

            let aidx = 0
            let oidx = 0

            // pxt.log(da)
            for (let l of da) {
                if (l[0] == DiffOp.Added) {
                    aidx++
                } else if (l[0] == DiffOp.Deleted) {
                    ma[oidx] = null
                    oidx++
                } else if (l[0] == DiffOp.Unchanged) {
                    ma[oidx] = aidx
                    aidx++
                    oidx++
                } else {
                    U.oops()
                }
            }

            ma.push(aidx + 1) // terminator

            return ma
        }
    }

    export function removeTrailingSemiColumns(src: string) {
        return toLines(src).map(line => line.replace(/;\s*$/, '')).join('\n');
    }

    export function split(dualSrc: string, options?: { removeTrailingSemiColumns?: boolean }): { fileA: string, fileB: string } {
        const src = dualSrc.split(/-{10,}/, 2);
        if (src.length < 2)
            return { fileA: dualSrc, fileB: undefined };

        let fileA = src[0].replace(/\n$/, ''); // intial new line introduced by html
        let fileB = src[1].replace(/^\n/, ''); // last new line introduct by html

        if (options && options.removeTrailingSemiColumns) {
            fileA = removeTrailingSemiColumns(fileA);
            fileB = removeTrailingSemiColumns(fileB);
        }

        return { fileA, fileB };
    }

    export interface DiffMarker {
        oldStart: number;
        oldLength: number;
        newStart: number;
        newLength: number;
    }

    export function parseDiffMarker(ln: string): DiffMarker {
        const m = /^@@ -(\d+),(\d+) \+(\d+),(\d+)/.exec(ln)
        return m && {
                oldStart: parseInt(m[1]) - 1,
                oldLength: parseInt(m[2]),
                newStart: parseInt(m[3]) - 1,
                newLength: parseInt(m[4])
            }
    }

    export interface RenderOptions extends DiffOptions {
        hideMarkerLine?: boolean;
        hideLineNumbers?: boolean;
        hideMarker?: boolean;
        hideRemoved?: boolean;
        update?: boolean; // simplified view that only shows update
    }

    export function render(fileA: string, fileB: string, options: RenderOptions = {}): HTMLElement {
        const diffLines = computeFormattedDiff(fileA, fileB, options);
        if (!diffLines) {
            return pxt.dom.el("div", null, pxtc.Util.lf("Too many differences to render diff."));
        }

        const diffClasses: pxt.Map<string> = {
            "@": "diff-marker",
            " ": "diff-unchanged",
            "+": "diff-added",
            "-": "diff-removed",
        }

        let lnA = 0, lnB = 0
        let lastMark = ""
        const tbody = pxt.dom.el("tbody");
        const diffEl = pxt.dom.el("table", {
            "class": `diffview ${options.update ? 'update' : ''}`
        }, tbody);
        let savedDiffEl: HTMLElement = null
        diffLines.forEach((ln: string, idx: number) => {
            const m = parseDiffMarker(ln);
            if (m) {
                lnA = m.oldStart
                lnB = m.newStart
            } else {
                if (ln[0] != "+")
                    lnA++
                if (ln[0] != "-")
                    lnB++
            }
            const nextMark = diffLines[idx + 1] ? diffLines[idx + 1][0] : ""
            const next2Mark = diffLines[idx + 2] ? diffLines[idx + 2][0] : ""
            const lnSrc = ln.slice(2);
            let currDiff = pxt.dom.el("code", null, lnSrc)

            if (savedDiffEl) {
                currDiff = savedDiffEl
                savedDiffEl = null
            } else if (ln[0] == "-" && (lastMark == " " || lastMark == "@") && nextMark == "+"
                && (next2Mark == " " || next2Mark == "@" || next2Mark == "")) {
                const r = lineDiff(ln.slice(2), diffLines[idx + 1].slice(2))
                currDiff = r.a
                savedDiffEl = r.b
            }
            lastMark = ln[0];

            // check if line is skipped
            if ((options.hideMarkerLine && lastMark == "@")
                || (options.hideRemoved && lastMark == "-"))
                return;

            // add diff
            const isMarkerLine = lastMark == "@";
            const className = `${diffClasses[lastMark]}`;
            tbody.appendChild(
                pxt.dom.el("tr", { "class": className }, [
                    !options.hideLineNumbers && pxt.dom.el("td", { class: "line-a", "data-content": lnA }),
                    !options.hideLineNumbers && pxt.dom.el("td", { class: "line-b", "data-content": lnB }),
                    isMarkerLine && pxt.dom.el("td", { "colspan": 2, class: "change" }, pxt.dom.el("code", null, ln)),
                    !options.hideMarker && !isMarkerLine && pxt.dom.el("td", { class: "marker", "data-content": lastMark }),
                    !isMarkerLine && pxt.dom.el("td", { class: "change" }, currDiff)
                ])
            );
        })

        return diffEl;
    }

    function lineDiff(lineA: string, lineB: string): { a: HTMLElement, b: HTMLElement } {
        const df = computeFormattedDiff(lineA.split("").join("\n"), lineB.split("").join("\n"), {
            context: Infinity
        })
        if (!df) // diff failed
            return {
                a: pxt.dom.el("div", { "class": "inline-diff" }, pxt.dom.el("code", null, lineA)),
                b: pxt.dom.el("div", { "class": "inline-diff" }, pxt.dom.el("code", null, lineB))
            }

        const ja: HTMLElement[] = []
        const jb: HTMLElement[] = []
        for (let i = 0; i < df.length;) {
            let j = i
            const mark = df[i][0]
            while (df[j] && df[j][0] == mark)
                j++
            const chunk = df.slice(i, j).map(s => s.slice(2)).join("")
            if (mark == " ") {
                ja.push(pxt.dom.el("code", { "class": "ch-common" }, chunk));
                jb.push(pxt.dom.el("code", { "class": "ch-common" }, chunk));
            } else if (mark == "-") {
                ja.push(pxt.dom.el("code", { "class": "ch-removed" }, chunk))
            } else if (mark == "+") {
                jb.push(pxt.dom.el("code", { "class": "ch-added" }, chunk))
            } else {
                pxt.Util.oops()
            }
            i = j
        }
        return {
            a: pxt.dom.el("div", { "class": "inline-diff" }, ja),
            b: pxt.dom.el("div", { "class": "inline-diff" }, jb)
        }
    }

    export function resolveMergeConflictMarker(content: string, startMarkerLine: number, local: boolean, remote: boolean): string {
        let lines = pxt.diff.toLines(content);
        let startLine = startMarkerLine;
        while (startLine < lines.length) {
            if (/^<<<<<<<[^<]/.test(lines[startLine])) {
                break;
            }
            startLine++;
        }
        let middleLine = startLine + 1;
        while (middleLine < lines.length) {
            if (/^=======$/.test(lines[middleLine]))
                break;
            middleLine++;
        }
        let endLine = middleLine + 1;
        while (endLine < lines.length) {
            if (/^>>>>>>>[^>]/.test(lines[endLine])) {
                break;
            }
            endLine++;
        }
        if (endLine >= lines.length) {
            // no match?
            pxt.debug(`diff marker mistmatch: ${lines.length} -> ${startLine} ${middleLine} ${endLine}`)
            return content;
        }

        // remove locals
        lines[startLine] = undefined;
        lines[middleLine] = undefined;
        lines[endLine] = undefined;
        if (!local)
            for (let i = startLine; i <= middleLine; ++i)
                lines[i] = undefined;
        if (!remote)
            for (let i = middleLine; i <= endLine; ++i)
                lines[i] = undefined;

        return lines.filter(line => line !== undefined).join("\n");
    }

    /**
     * A naive 3way merge for pxt.json files. It can mostly handle conflicts when adding/removing files concurrently.
     * - highest version number if kept
     * - current preferred editor is kept
     * - conjection of public flag
     * - files list is merged so that added files are kept and deleted files are removed
     * @param configA
     * @param configO
     * @param configB
     */
    export function mergeDiff3Config(configA: string, configO: string, configB: string): string {
        let jsonA: any = pxt.Util.jsonTryParse(configA); //  as pxt.PackageConfig
        let jsonO: any = pxt.Util.jsonTryParse(configO);
        let jsonB: any = pxt.Util.jsonTryParse(configB);
        // A is good, B destroyed
        if (jsonA && !jsonB)
            return configA; // keep A

        // A destroyed, B good, use B or O
        if (!jsonA)
            return configB || configO;

        // O is destroyed, B isnt, use B as O
        if (!jsonO && jsonB)
            jsonO = jsonB;

        // final check
        if (!jsonA || !jsonO || !jsonB)
            return undefined;

        delete jsonA.installedVersion;
        delete jsonO.installedVersion;
        delete jsonB.installedVersion;

        const r: any = {} as pxt.PackageConfig;

        const keys = pxt.U.unique(Object.keys(jsonO).concat(Object.keys(jsonA)).concat(Object.keys(jsonB)), l => l);
        for (const key of keys) {
            const vA = jsonA[key];
            const vO = jsonO[key];
            const vB = jsonB[key];
            const svA = JSON.stringify(vA);
            const svB = JSON.stringify(vB);
            if (svA == svB) { // same serialized keys
                if (vA !== undefined)
                    r[key] = vA;
            } else {
                switch (key) {
                    case "name":
                        r[key] = mergeName(vA, vO, vB);
                        break;
                    case "version": // pick highest version
                        r[key] = pxt.semver.strcmp(vA, vB) > 0 ? vA : vB;
                        break;
                    case "languageRestriction":
                    case "preferredEditor":
                    case "targetVersion":
                        r[key] = vA; // keep current one
                        break;
                    case "public":
                        r[key] = vA && vB;
                        break;
                    case "files":
                    case "testFiles": {// merge file arrays
                        const m = mergeFiles(vA || [], vO || [], vB || []);
                        if (!m)
                            return undefined;
                        r[key] = m.length ? m : undefined;
                        break;
                    }
                    case "dependencies":
                    case "testDependencies": {
                        const m = mergeDependencies(vA || {}, vO || {}, vB || {});
                        if (Object.keys(m).length)
                            return undefined;
                        r[key] = m;
                        break;
                    }
                    case "description":
                        if (vA && !vB) r[key] = vA; // new description
                        else if (!vA && vB) r[key] = vB;
                        else return undefined;
                        break;
                    default:
                        return undefined;
                }
            }
        }
        return pxt.Package.stringifyConfig(r);

        function mergeName(fA: string, fO: string, fB: string): string {
            if (fA == fO) return fB;
            if (fB == fO) return fA;
            if (fA == lf("Untitled")) return fB;
            return fA;
        }

        function mergeFiles(fA: string[], fO: string[], fB: string[]): string[] {
            const r: string[] = [];
            const fkeys = pxt.U.unique(fO.concat(fA).concat(fB), l => l);
            for (const fkey of fkeys) {
                const mA = fA.indexOf(fkey) > -1;
                const mB = fB.indexOf(fkey) > -1;
                const mO = fO.indexOf(fkey) > -1;
                if (mA == mB) { // both have or have nots
                    if (mA) // key is in set
                        r.push(fkey);
                } else { // conflict
                    if (mB == mO) { // mB not changed, false conflict
                        if (mA) // item added
                            r.push(fkey);
                    } else { // mA == mO, conflict
                        if (mB) // not deleted by A
                            r.push(fkey);
                    }
                }
            }
            return r;
        }

        function mergeDependencies(fA: pxt.Map<string>, fO: pxt.Map<string>, fB: pxt.Map<string>): pxt.Map<string> {
            const r: pxt.Map<string> = {};
            const fkeys = pxt.U.unique(Object.keys(fO).concat(Object.keys(fA)).concat(Object.keys(fB)), l => l);
            for (const fkey of fkeys) {
                const mA = fA[fkey];
                const mB = fB[fkey];
                const mO = fO[fkey]
                if (mA == mB) { // both have or have nots
                    if (mA) // key is in set
                        r[fkey] = mA;
                } else { // conflict
                    // check if it is a version change in github reference
                    const ghA = pxt.github.parseRepoId(mA)
                    const ghB = pxt.github.parseRepoId(mB)
                    if (ghA && ghB
                        && pxt.semver.tryParse(ghA.tag)
                        && pxt.semver.tryParse(ghB.tag)
                        && ghA.owner && ghA.project
                        && ghA.owner == ghB.owner
                        && ghA.project == ghB.project) {
                        const newtag = pxt.semver.strcmp(ghA.tag, ghB.tag) > 0
                            ? ghA.tag : ghB.tag;
                        r[fkey] = `github:${ghA.owner}/${ghA.project}#${newtag}`
                    } else if (mB == mO) { // mB not changed, false conflict
                        if (mA) // item added
                            r[fkey] = mA;
                    } else { // mA == mO, conflict
                        if (mB) // not deleted by A
                            r[fkey] = mB;
                    }
                }
            }
            return r;
        }
    }

    export function hasMergeConflictMarker(content: string) {
        return content && /^(<<<<<<<[^<]|>>>>>>>[^>])/m.test(content);
    }

    export function reconstructConfig(parsed: pxt.github.ParsedRepo, files: pxt.Map<string>, commit: pxt.github.Commit, tp: pxt.ProjectTemplate) {
        let dependencies: pxt.Map<string> = {};
        // grab files from commit
        let commitFiles = commit.tree.tree.map(f => f.path)
            .filter(f => /\.(ts|blocks|md|jres|asm|json)$/.test(f))
            .filter(f => f != pxt.CONFIG_NAME);
        if (parsed.fileName)
            commitFiles = commitFiles
                .filter(f => f.indexOf(parsed.fileName) === 0)
                .map(f => f.slice(parsed.fileName.length + 1));
        // if no available files, include the files from the template
        if (!commitFiles.find(f => /\.ts$/.test(f))) {
            tp.config.files.filter(f => commitFiles.indexOf(f) < 0)
                .forEach(f => {
                    commitFiles.push(f);
                    files[f] = tp.files[f];
                })
            pxt.Util.jsonCopyFrom(dependencies, tp.config.dependencies);
        }

        // include corepkg if no dependencies
        if (!Object.keys(dependencies).length)
            dependencies[pxt.appTarget.corepkg] = "*";

        // yay, we have a new cfg
        const cfg: pxt.PackageConfig = {
            name: "",
            files: commitFiles,
            dependencies,
            preferredEditor: commitFiles.find(f => /.blocks$/.test(f)) ? pxt.BLOCKS_PROJECT_NAME : pxt.JAVASCRIPT_PROJECT_NAME
        };
        return cfg;
    }
}