@theia/filesystem 1.34.2 → 1.34.3

package/lib/node/download/directory-archiver.d.ts

@@ -1,10 +1,10 @@
-import URI from '@theia/core/lib/common/uri';
-export declare class DirectoryArchiver {
-    archive(inputPath: string, outputPath: string, entries?: string[]): Promise<void>;
-    findCommonParents(uris: URI[]): Promise<Map<string, string[]>>;
-    protected closestCommonParentUri(left: URI, right: URI): URI | undefined;
-    protected isDir(uri: URI): Promise<boolean>;
-    protected equal(left: URI | URI[], right: URI | URI[]): boolean;
-    protected toUriString(uri: URI): string;
-}
+import URI from '@theia/core/lib/common/uri';
+export declare class DirectoryArchiver {
+    archive(inputPath: string, outputPath: string, entries?: string[]): Promise<void>;
+    findCommonParents(uris: URI[]): Promise<Map<string, string[]>>;
+    protected closestCommonParentUri(left: URI, right: URI): URI | undefined;
+    protected isDir(uri: URI): Promise<boolean>;
+    protected equal(left: URI | URI[], right: URI | URI[]): boolean;
+    protected toUriString(uri: URI): string;
+}
 //# sourceMappingURL=directory-archiver.d.ts.map

package/lib/node/download/directory-archiver.js

@@ -1,133 +1,133 @@
-"use strict";
-// *****************************************************************************
-// Copyright (C) 2018 TypeFox and others.
-//
-// This program and the accompanying materials are made available under the
-// terms of the Eclipse Public License v. 2.0 which is available at
-// http://www.eclipse.org/legal/epl-2.0.
-//
-// This Source Code may also be made available under the following Secondary
-// Licenses when the conditions for such availability set forth in the Eclipse
-// Public License v. 2.0 are satisfied: GNU General Public License, version 2
-// with the GNU Classpath Exception which is available at
-// https://www.gnu.org/software/classpath/license.html.
-//
-// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0 WITH Classpath-exception-2.0
-// *****************************************************************************
-var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
-    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
-    if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
-    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
-    return c > 3 && r && Object.defineProperty(target, key, r), r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.DirectoryArchiver = void 0;
-const inversify_1 = require("@theia/core/shared/inversify");
-const fs = require("@theia/core/shared/fs-extra");
-const tar_fs_1 = require("tar-fs");
-const uri_1 = require("@theia/core/lib/common/uri");
-const file_uri_1 = require("@theia/core/lib/node/file-uri");
-let DirectoryArchiver = class DirectoryArchiver {
-    async archive(inputPath, outputPath, entries) {
-        return new Promise(async (resolve, reject) => {
-            (0, tar_fs_1.pack)(inputPath, { entries }).pipe(fs.createWriteStream(outputPath)).on('finish', () => resolve()).on('error', e => reject(e));
-        });
-    }
-    async findCommonParents(uris) {
-        const map = new Map();
-        for (const uri of uris) {
-            // 1. Get the container if not the URI is not a directory.
-            const containerUri = (await this.isDir(uri)) ? uri : uri.parent;
-            let containerUriStr = this.toUriString(containerUri);
-            // 2. If the container already registered, just append the current URI to it.
-            if (map.has(containerUriStr)) {
-                map.set(containerUriStr, [...map.get(containerUriStr), this.toUriString(uri)]);
-            }
-            else {
-                // 3. Try to find the longest container URI that we can use.
-                // When we have `/A/B/` and `/A/C` and a file `A/B/C/D.txt` then we need to find `/A/B`. The longest URIs come first.
-                for (const knownContainerUri of Array.from(map.keys()).sort((left, right) => right.length - left.length)) {
-                    if (uri.toString().startsWith(knownContainerUri)) {
-                        containerUriStr = knownContainerUri;
-                        break;
-                    }
-                }
-                const entries = map.get(containerUriStr) || [];
-                entries.push(this.toUriString(uri));
-                map.set(containerUriStr, entries);
-            }
-            // 4. Collapse the hierarchy by finding the closest common parents for the entries, if any.
-            let collapsed = false;
-            collapseLoop: while (!collapsed) {
-                const knownContainerUris = Array.from(map.keys()).sort((left, right) => right.length - left.length);
-                if (knownContainerUris.length > 1) {
-                    for (let i = 0; i < knownContainerUris.length; i++) {
-                        for (let j = i + 1; j < knownContainerUris.length; j++) {
-                            const left = knownContainerUris[i];
-                            const right = knownContainerUris[j];
-                            const commonParent = this.closestCommonParentUri(new uri_1.default(left), new uri_1.default(right));
-                            if (commonParent && !commonParent.path.isRoot) {
-                                const leftEntries = map.get(left) || [];
-                                const rightEntries = map.get(right) || [];
-                                map.delete(left);
-                                map.delete(right);
-                                map.set(this.toUriString(commonParent), [...leftEntries, ...rightEntries]);
-                                break collapseLoop;
-                            }
-                        }
-                    }
-                }
-                collapsed = true;
-            }
-        }
-        return map;
-    }
-    closestCommonParentUri(left, right) {
-        if (left.scheme !== right.scheme) {
-            return undefined;
-        }
-        const allLeft = left.allLocations;
-        const allRight = right.allLocations;
-        for (const leftUri of allLeft) {
-            for (const rightUri of allRight) {
-                if (this.equal(leftUri, rightUri)) {
-                    return leftUri;
-                }
-            }
-        }
-        return undefined;
-    }
-    async isDir(uri) {
-        try {
-            const stat = await fs.stat(file_uri_1.FileUri.fsPath(uri));
-            return stat.isDirectory();
-        }
-        catch (_a) {
-            return false;
-        }
-    }
-    equal(left, right) {
-        if (Array.isArray(left) && Array.isArray(right)) {
-            if (left === right) {
-                return true;
-            }
-            if (left.length !== right.length) {
-                return false;
-            }
-            return left.map(this.toUriString).sort().toString() === right.map(this.toUriString).sort().toString();
-        }
-        else if (left instanceof uri_1.default && right instanceof uri_1.default) {
-            return this.toUriString(left) === this.toUriString(right);
-        }
-        return false;
-    }
-    toUriString(uri) {
-        const raw = uri.toString();
-        return raw.endsWith('/') ? raw.slice(0, -1) : raw;
-    }
-};
-DirectoryArchiver = __decorate([
-    (0, inversify_1.injectable)()
-], DirectoryArchiver);
-exports.DirectoryArchiver = DirectoryArchiver;
+"use strict";
+// *****************************************************************************
+// Copyright (C) 2018 TypeFox and others.
+//
+// This program and the accompanying materials are made available under the
+// terms of the Eclipse Public License v. 2.0 which is available at
+// http://www.eclipse.org/legal/epl-2.0.
+//
+// This Source Code may also be made available under the following Secondary
+// Licenses when the conditions for such availability set forth in the Eclipse
+// Public License v. 2.0 are satisfied: GNU General Public License, version 2
+// with the GNU Classpath Exception which is available at
+// https://www.gnu.org/software/classpath/license.html.
+//
+// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0 WITH Classpath-exception-2.0
+// *****************************************************************************
+var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
+    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
+    if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
+    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
+    return c > 3 && r && Object.defineProperty(target, key, r), r;
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DirectoryArchiver = void 0;
+const inversify_1 = require("@theia/core/shared/inversify");
+const fs = require("@theia/core/shared/fs-extra");
+const tar_fs_1 = require("tar-fs");
+const uri_1 = require("@theia/core/lib/common/uri");
+const file_uri_1 = require("@theia/core/lib/node/file-uri");
+let DirectoryArchiver = class DirectoryArchiver {
+    async archive(inputPath, outputPath, entries) {
+        return new Promise(async (resolve, reject) => {
+            (0, tar_fs_1.pack)(inputPath, { entries }).pipe(fs.createWriteStream(outputPath)).on('finish', () => resolve()).on('error', e => reject(e));
+        });
+    }
+    async findCommonParents(uris) {
+        const map = new Map();
+        for (const uri of uris) {
+            // 1. Get the container if not the URI is not a directory.
+            const containerUri = (await this.isDir(uri)) ? uri : uri.parent;
+            let containerUriStr = this.toUriString(containerUri);
+            // 2. If the container already registered, just append the current URI to it.
+            if (map.has(containerUriStr)) {
+                map.set(containerUriStr, [...map.get(containerUriStr), this.toUriString(uri)]);
+            }
+            else {
+                // 3. Try to find the longest container URI that we can use.
+                // When we have `/A/B/` and `/A/C` and a file `A/B/C/D.txt` then we need to find `/A/B`. The longest URIs come first.
+                for (const knownContainerUri of Array.from(map.keys()).sort((left, right) => right.length - left.length)) {
+                    if (uri.toString().startsWith(knownContainerUri)) {
+                        containerUriStr = knownContainerUri;
+                        break;
+                    }
+                }
+                const entries = map.get(containerUriStr) || [];
+                entries.push(this.toUriString(uri));
+                map.set(containerUriStr, entries);
+            }
+            // 4. Collapse the hierarchy by finding the closest common parents for the entries, if any.
+            let collapsed = false;
+            collapseLoop: while (!collapsed) {
+                const knownContainerUris = Array.from(map.keys()).sort((left, right) => right.length - left.length);
+                if (knownContainerUris.length > 1) {
+                    for (let i = 0; i < knownContainerUris.length; i++) {
+                        for (let j = i + 1; j < knownContainerUris.length; j++) {
+                            const left = knownContainerUris[i];
+                            const right = knownContainerUris[j];
+                            const commonParent = this.closestCommonParentUri(new uri_1.default(left), new uri_1.default(right));
+                            if (commonParent && !commonParent.path.isRoot) {
+                                const leftEntries = map.get(left) || [];
+                                const rightEntries = map.get(right) || [];
+                                map.delete(left);
+                                map.delete(right);
+                                map.set(this.toUriString(commonParent), [...leftEntries, ...rightEntries]);
+                                break collapseLoop;
+                            }
+                        }
+                    }
+                }
+                collapsed = true;
+            }
+        }
+        return map;
+    }
+    closestCommonParentUri(left, right) {
+        if (left.scheme !== right.scheme) {
+            return undefined;
+        }
+        const allLeft = left.allLocations;
+        const allRight = right.allLocations;
+        for (const leftUri of allLeft) {
+            for (const rightUri of allRight) {
+                if (this.equal(leftUri, rightUri)) {
+                    return leftUri;
+                }
+            }
+        }
+        return undefined;
+    }
+    async isDir(uri) {
+        try {
+            const stat = await fs.stat(file_uri_1.FileUri.fsPath(uri));
+            return stat.isDirectory();
+        }
+        catch (_a) {
+            return false;
+        }
+    }
+    equal(left, right) {
+        if (Array.isArray(left) && Array.isArray(right)) {
+            if (left === right) {
+                return true;
+            }
+            if (left.length !== right.length) {
+                return false;
+            }
+            return left.map(this.toUriString).sort().toString() === right.map(this.toUriString).sort().toString();
+        }
+        else if (left instanceof uri_1.default && right instanceof uri_1.default) {
+            return this.toUriString(left) === this.toUriString(right);
+        }
+        return false;
+    }
+    toUriString(uri) {
+        const raw = uri.toString();
+        return raw.endsWith('/') ? raw.slice(0, -1) : raw;
+    }
+};
+DirectoryArchiver = __decorate([
+    (0, inversify_1.injectable)()
+], DirectoryArchiver);
+exports.DirectoryArchiver = DirectoryArchiver;
 //# sourceMappingURL=directory-archiver.js.map

package/lib/node/download/directory-archiver.spec.d.ts

@@ -1,2 +1,2 @@
-export {};
+export {};
 //# sourceMappingURL=directory-archiver.spec.d.ts.map

package/lib/node/download/directory-archiver.spec.js

@@ -1,98 +1,98 @@
-"use strict";
-// *****************************************************************************
-// Copyright (C) 2018 TypeFox and others.
-//
-// This program and the accompanying materials are made available under the
-// terms of the Eclipse Public License v. 2.0 which is available at
-// http://www.eclipse.org/legal/epl-2.0.
-//
-// This Source Code may also be made available under the following Secondary
-// Licenses when the conditions for such availability set forth in the Eclipse
-// Public License v. 2.0 are satisfied: GNU General Public License, version 2
-// with the GNU Classpath Exception which is available at
-// https://www.gnu.org/software/classpath/license.html.
-//
-// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0 WITH Classpath-exception-2.0
-// *****************************************************************************
-Object.defineProperty(exports, "__esModule", { value: true });
-const fs = require("@theia/core/shared/fs-extra");
-const path = require("path");
-const temp = require("temp");
-const tar_fs_1 = require("tar-fs");
-const chai_1 = require("chai");
-const uri_1 = require("@theia/core/lib/common/uri");
-const mock_directory_archiver_1 = require("./test/mock-directory-archiver");
-const file_uri_1 = require("@theia/core/lib/node/file-uri");
-const track = temp.track();
-describe('directory-archiver', () => {
-    after(() => {
-        track.cleanupSync();
-    });
-    it('should archive a directory', async function () {
-        this.timeout(20000);
-        const fromPath = track.mkdirSync('from');
-        fs.writeFileSync(path.join(fromPath, 'A.txt'), 'A');
-        fs.writeFileSync(path.join(fromPath, 'B.txt'), 'B');
-        (0, chai_1.expect)(fs.readFileSync(path.join(fromPath, 'A.txt'), { encoding: 'utf8' })).to.be.equal('A');
-        (0, chai_1.expect)(fs.readFileSync(path.join(fromPath, 'B.txt'), { encoding: 'utf8' })).to.be.equal('B');
-        const toPath = track.mkdirSync('to');
-        const archiver = new mock_directory_archiver_1.MockDirectoryArchiver();
-        await archiver.archive(fromPath, path.join(toPath, 'output.tar'));
-        (0, chai_1.expect)(fs.existsSync(path.join(toPath, 'output.tar'))).to.be.true;
-        const assertPath = track.mkdirSync('assertPath');
-        return new Promise(resolve => {
-            fs.createReadStream(path.join(toPath, 'output.tar')).pipe((0, tar_fs_1.extract)(assertPath)).on('finish', () => {
-                (0, chai_1.expect)(fs.readdirSync(assertPath).sort()).to.be.deep.equal(['A.txt', 'B.txt']);
-                (0, chai_1.expect)(fs.readFileSync(path.join(assertPath, 'A.txt'), { encoding: 'utf8' })).to.be.equal(fs.readFileSync(path.join(fromPath, 'A.txt'), { encoding: 'utf8' }));
-                (0, chai_1.expect)(fs.readFileSync(path.join(assertPath, 'B.txt'), { encoding: 'utf8' })).to.be.equal(fs.readFileSync(path.join(fromPath, 'B.txt'), { encoding: 'utf8' }));
-                resolve();
-            });
-        });
-    });
-    describe('findCommonParents', () => {
-        [
-            {
-                input: ['/A/B/C/D.txt', '/X/Y/Z.txt'],
-                expected: new Map([['/A/B/C', ['/A/B/C/D.txt']], ['/X/Y', ['/X/Y/Z.txt']]]),
-                folders: ['/A', '/A/B', '/A/B/C', '/X', '/X/Y']
-            },
-            {
-                input: ['/A/B/C/D.txt', '/A/B/C/E.txt'],
-                expected: new Map([['/A/B/C', ['/A/B/C/D.txt', '/A/B/C/E.txt']]]),
-                folders: ['/A', '/A/B', '/A/B/C']
-            },
-            {
-                input: ['/A', '/A/B/C/D.txt', '/A/B/C/E.txt'],
-                expected: new Map([['/A', ['/A', '/A/B/C/D.txt', '/A/B/C/E.txt']]]),
-                folders: ['/A', '/A/B', '/A/B/C']
-            },
-            {
-                input: ['/A/B/C/D.txt', '/A/B/C/E.txt', '/A'],
-                expected: new Map([['/A', ['/A', '/A/B/C/D.txt', '/A/B/C/E.txt']]]),
-                folders: ['/A', '/A/B', '/A/B/C']
-            },
-            {
-                input: ['/A/B/C/D.txt', '/A/B/X/E.txt'],
-                expected: new Map([['/A/B', ['/A/B/C/D.txt', '/A/B/X/E.txt']]]),
-                folders: ['/A', '/A/B', '/A/B/C', '/A/B/X']
-            }
-        ].forEach(test => {
-            const { input, expected, folders } = test;
-            it(`should find the common parent URIs among [${input.join(', ')}] => [${Array.from(expected.keys()).join(', ')}]`, async () => {
-                const archiver = new mock_directory_archiver_1.MockDirectoryArchiver(folders ? folders.map(file_uri_1.FileUri.create) : []);
-                const actual = await archiver.findCommonParents(input.map(file_uri_1.FileUri.create));
-                (0, chai_1.expect)(asString(actual)).to.be.equal(asString(expected));
-            });
-        });
-        function asString(map) {
-            // eslint-disable-next-line @typescript-eslint/no-explicit-any
-            const obj = {};
-            for (const key of Array.from(map.keys()).sort()) {
-                const values = (map.get(key) || []).sort();
-                obj[new uri_1.default(key).withScheme('file').toString()] = `[${values.map(v => new uri_1.default(v).withScheme('file').toString()).join(', ')}]`;
-            }
-            return JSON.stringify(obj);
-        }
-    });
-});
+"use strict";
+// *****************************************************************************
+// Copyright (C) 2018 TypeFox and others.
+//
+// This program and the accompanying materials are made available under the
+// terms of the Eclipse Public License v. 2.0 which is available at
+// http://www.eclipse.org/legal/epl-2.0.
+//
+// This Source Code may also be made available under the following Secondary
+// Licenses when the conditions for such availability set forth in the Eclipse
+// Public License v. 2.0 are satisfied: GNU General Public License, version 2
+// with the GNU Classpath Exception which is available at
+// https://www.gnu.org/software/classpath/license.html.
+//
+// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0 WITH Classpath-exception-2.0
+// *****************************************************************************
+Object.defineProperty(exports, "__esModule", { value: true });
+const fs = require("@theia/core/shared/fs-extra");
+const path = require("path");
+const temp = require("temp");
+const tar_fs_1 = require("tar-fs");
+const chai_1 = require("chai");
+const uri_1 = require("@theia/core/lib/common/uri");
+const mock_directory_archiver_1 = require("./test/mock-directory-archiver");
+const file_uri_1 = require("@theia/core/lib/node/file-uri");
+const track = temp.track();
+describe('directory-archiver', () => {
+    after(() => {
+        track.cleanupSync();
+    });
+    it('should archive a directory', async function () {
+        this.timeout(20000);
+        const fromPath = track.mkdirSync('from');
+        fs.writeFileSync(path.join(fromPath, 'A.txt'), 'A');
+        fs.writeFileSync(path.join(fromPath, 'B.txt'), 'B');
+        (0, chai_1.expect)(fs.readFileSync(path.join(fromPath, 'A.txt'), { encoding: 'utf8' })).to.be.equal('A');
+        (0, chai_1.expect)(fs.readFileSync(path.join(fromPath, 'B.txt'), { encoding: 'utf8' })).to.be.equal('B');
+        const toPath = track.mkdirSync('to');
+        const archiver = new mock_directory_archiver_1.MockDirectoryArchiver();
+        await archiver.archive(fromPath, path.join(toPath, 'output.tar'));
+        (0, chai_1.expect)(fs.existsSync(path.join(toPath, 'output.tar'))).to.be.true;
+        const assertPath = track.mkdirSync('assertPath');
+        return new Promise(resolve => {
+            fs.createReadStream(path.join(toPath, 'output.tar')).pipe((0, tar_fs_1.extract)(assertPath)).on('finish', () => {
+                (0, chai_1.expect)(fs.readdirSync(assertPath).sort()).to.be.deep.equal(['A.txt', 'B.txt']);
+                (0, chai_1.expect)(fs.readFileSync(path.join(assertPath, 'A.txt'), { encoding: 'utf8' })).to.be.equal(fs.readFileSync(path.join(fromPath, 'A.txt'), { encoding: 'utf8' }));
+                (0, chai_1.expect)(fs.readFileSync(path.join(assertPath, 'B.txt'), { encoding: 'utf8' })).to.be.equal(fs.readFileSync(path.join(fromPath, 'B.txt'), { encoding: 'utf8' }));
+                resolve();
+            });
+        });
+    });
+    describe('findCommonParents', () => {
+        [
+            {
+                input: ['/A/B/C/D.txt', '/X/Y/Z.txt'],
+                expected: new Map([['/A/B/C', ['/A/B/C/D.txt']], ['/X/Y', ['/X/Y/Z.txt']]]),
+                folders: ['/A', '/A/B', '/A/B/C', '/X', '/X/Y']
+            },
+            {
+                input: ['/A/B/C/D.txt', '/A/B/C/E.txt'],
+                expected: new Map([['/A/B/C', ['/A/B/C/D.txt', '/A/B/C/E.txt']]]),
+                folders: ['/A', '/A/B', '/A/B/C']
+            },
+            {
+                input: ['/A', '/A/B/C/D.txt', '/A/B/C/E.txt'],
+                expected: new Map([['/A', ['/A', '/A/B/C/D.txt', '/A/B/C/E.txt']]]),
+                folders: ['/A', '/A/B', '/A/B/C']
+            },
+            {
+                input: ['/A/B/C/D.txt', '/A/B/C/E.txt', '/A'],
+                expected: new Map([['/A', ['/A', '/A/B/C/D.txt', '/A/B/C/E.txt']]]),
+                folders: ['/A', '/A/B', '/A/B/C']
+            },
+            {
+                input: ['/A/B/C/D.txt', '/A/B/X/E.txt'],
+                expected: new Map([['/A/B', ['/A/B/C/D.txt', '/A/B/X/E.txt']]]),
+                folders: ['/A', '/A/B', '/A/B/C', '/A/B/X']
+            }
+        ].forEach(test => {
+            const { input, expected, folders } = test;
+            it(`should find the common parent URIs among [${input.join(', ')}] => [${Array.from(expected.keys()).join(', ')}]`, async () => {
+                const archiver = new mock_directory_archiver_1.MockDirectoryArchiver(folders ? folders.map(file_uri_1.FileUri.create) : []);
+                const actual = await archiver.findCommonParents(input.map(file_uri_1.FileUri.create));
+                (0, chai_1.expect)(asString(actual)).to.be.equal(asString(expected));
+            });
+        });
+        function asString(map) {
+            // eslint-disable-next-line @typescript-eslint/no-explicit-any
+            const obj = {};
+            for (const key of Array.from(map.keys()).sort()) {
+                const values = (map.get(key) || []).sort();
+                obj[new uri_1.default(key).withScheme('file').toString()] = `[${values.map(v => new uri_1.default(v).withScheme('file').toString()).join(', ')}]`;
+            }
+            return JSON.stringify(obj);
+        }
+    });
+});
 //# sourceMappingURL=directory-archiver.spec.js.map

package/lib/node/download/file-download-backend-module.d.ts

@@ -1,4 +1,4 @@
-import { ContainerModule } from '@theia/core/shared/inversify';
-declare const _default: ContainerModule;
-export default _default;
+import { ContainerModule } from '@theia/core/shared/inversify';
+declare const _default: ContainerModule;
+export default _default;
 //# sourceMappingURL=file-download-backend-module.d.ts.map

package/lib/node/download/file-download-backend-module.js

@@ -1,33 +1,33 @@
-"use strict";
-// *****************************************************************************
-// Copyright (C) 2018 TypeFox and others.
-//
-// This program and the accompanying materials are made available under the
-// terms of the Eclipse Public License v. 2.0 which is available at
-// http://www.eclipse.org/legal/epl-2.0.
-//
-// This Source Code may also be made available under the following Secondary
-// Licenses when the conditions for such availability set forth in the Eclipse
-// Public License v. 2.0 are satisfied: GNU General Public License, version 2
-// with the GNU Classpath Exception which is available at
-// https://www.gnu.org/software/classpath/license.html.
-//
-// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0 WITH Classpath-exception-2.0
-// *****************************************************************************
-Object.defineProperty(exports, "__esModule", { value: true });
-const inversify_1 = require("@theia/core/shared/inversify");
-const backend_application_1 = require("@theia/core/lib/node/backend-application");
-const file_download_endpoint_1 = require("./file-download-endpoint");
-const file_download_handler_1 = require("./file-download-handler");
-const directory_archiver_1 = require("./directory-archiver");
-const file_download_cache_1 = require("./file-download-cache");
-exports.default = new inversify_1.ContainerModule(bind => {
-    bind(file_download_endpoint_1.FileDownloadEndpoint).toSelf().inSingletonScope();
-    bind(backend_application_1.BackendApplicationContribution).toService(file_download_endpoint_1.FileDownloadEndpoint);
-    bind(file_download_cache_1.FileDownloadCache).toSelf().inSingletonScope();
-    bind(file_download_handler_1.FileDownloadHandler).to(file_download_handler_1.SingleFileDownloadHandler).inSingletonScope().whenTargetNamed(file_download_handler_1.FileDownloadHandler.SINGLE);
-    bind(file_download_handler_1.FileDownloadHandler).to(file_download_handler_1.MultiFileDownloadHandler).inSingletonScope().whenTargetNamed(file_download_handler_1.FileDownloadHandler.MULTI);
-    bind(file_download_handler_1.FileDownloadHandler).to(file_download_handler_1.DownloadLinkHandler).inSingletonScope().whenTargetNamed(file_download_handler_1.FileDownloadHandler.DOWNLOAD_LINK);
-    bind(directory_archiver_1.DirectoryArchiver).toSelf().inSingletonScope();
-});
+"use strict";
+// *****************************************************************************
+// Copyright (C) 2018 TypeFox and others.
+//
+// This program and the accompanying materials are made available under the
+// terms of the Eclipse Public License v. 2.0 which is available at
+// http://www.eclipse.org/legal/epl-2.0.
+//
+// This Source Code may also be made available under the following Secondary
+// Licenses when the conditions for such availability set forth in the Eclipse
+// Public License v. 2.0 are satisfied: GNU General Public License, version 2
+// with the GNU Classpath Exception which is available at
+// https://www.gnu.org/software/classpath/license.html.
+//
+// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0 WITH Classpath-exception-2.0
+// *****************************************************************************
+Object.defineProperty(exports, "__esModule", { value: true });
+const inversify_1 = require("@theia/core/shared/inversify");
+const backend_application_1 = require("@theia/core/lib/node/backend-application");
+const file_download_endpoint_1 = require("./file-download-endpoint");
+const file_download_handler_1 = require("./file-download-handler");
+const directory_archiver_1 = require("./directory-archiver");
+const file_download_cache_1 = require("./file-download-cache");
+exports.default = new inversify_1.ContainerModule(bind => {
+    bind(file_download_endpoint_1.FileDownloadEndpoint).toSelf().inSingletonScope();
+    bind(backend_application_1.BackendApplicationContribution).toService(file_download_endpoint_1.FileDownloadEndpoint);
+    bind(file_download_cache_1.FileDownloadCache).toSelf().inSingletonScope();
+    bind(file_download_handler_1.FileDownloadHandler).to(file_download_handler_1.SingleFileDownloadHandler).inSingletonScope().whenTargetNamed(file_download_handler_1.FileDownloadHandler.SINGLE);
+    bind(file_download_handler_1.FileDownloadHandler).to(file_download_handler_1.MultiFileDownloadHandler).inSingletonScope().whenTargetNamed(file_download_handler_1.FileDownloadHandler.MULTI);
+    bind(file_download_handler_1.FileDownloadHandler).to(file_download_handler_1.DownloadLinkHandler).inSingletonScope().whenTargetNamed(file_download_handler_1.FileDownloadHandler.DOWNLOAD_LINK);
+    bind(directory_archiver_1.DirectoryArchiver).toSelf().inSingletonScope();
+});
 //# sourceMappingURL=file-download-backend-module.js.map

package/lib/node/download/file-download-cache.d.ts

@@ -1,22 +1,22 @@
-import { ILogger } from '@theia/core/lib/common/logger';
-export interface DownloadStorageItem {
-    file: string;
-    root?: string;
-    size: number;
-    remove: boolean;
-    expire?: number;
-}
-export declare class FileDownloadCache {
-    protected readonly logger: ILogger;
-    protected readonly downloads: Map<string, DownloadStorageItem>;
-    protected readonly expireTimeInMinutes: number;
-    addDownload(id: string, downloadInfo: DownloadStorageItem): void;
-    getDownload(id: string): DownloadStorageItem | undefined;
-    deleteDownload(id: string): void;
-    values(): {
-        [key: string]: DownloadStorageItem;
-    };
-    protected deleteRecursively(pathToDelete: string): void;
-    protected expireDownloads(): void;
-}
+import { ILogger } from '@theia/core/lib/common/logger';
+export interface DownloadStorageItem {
+    file: string;
+    root?: string;
+    size: number;
+    remove: boolean;
+    expire?: number;
+}
+export declare class FileDownloadCache {
+    protected readonly logger: ILogger;
+    protected readonly downloads: Map<string, DownloadStorageItem>;
+    protected readonly expireTimeInMinutes: number;
+    addDownload(id: string, downloadInfo: DownloadStorageItem): void;
+    getDownload(id: string): DownloadStorageItem | undefined;
+    deleteDownload(id: string): void;
+    values(): {
+        [key: string]: DownloadStorageItem;
+    };
+    protected deleteRecursively(pathToDelete: string): void;
+    protected expireDownloads(): void;
+}
 //# sourceMappingURL=file-download-cache.d.ts.map