@theia/core 1.67.0-next.56 → 1.67.0-next.86

package/lib/common/application-error.spec.js

@@ -0,0 +1,27 @@
+"use strict";
+// *****************************************************************************
+// Copyright (C) 2022 Ericsson 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-only WITH Classpath-exception-2.0
+// *****************************************************************************
+Object.defineProperty(exports, "__esModule", { value: true });
+const application_error_1 = require("./application-error");
+const chai_1 = require("chai");
+describe('ApplicationError', () => {
+    it('should not be able to use the same code twice', () => {
+        const code = 12345;
+        application_error_1.ApplicationError.declare(code, (message, data) => ({ message, data }));
+        (0, chai_1.expect)(() => application_error_1.ApplicationError.declare(code, (message, data) => ({ message, data }))).throw();
+    });
+});
+//# sourceMappingURL=application-error.spec.js.map

package/lib/common/application-error.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"application-error.spec.js","sourceRoot":"","sources":["../../src/common/application-error.spec.ts"],"names":[],"mappings":";AAAA,gFAAgF;AAChF,0CAA0C;AAC1C,EAAE;AACF,2EAA2E;AAC3E,mEAAmE;AACnE,wCAAwC;AACxC,EAAE;AACF,4EAA4E;AAC5E,8EAA8E;AAC9E,6EAA6E;AAC7E,yDAAyD;AACzD,uDAAuD;AACvD,EAAE;AACF,gFAAgF;AAChF,gFAAgF;;AAEhF,2DAAuD;AACvD,+BAA8B;AAE9B,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAE9B,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;QACrD,MAAM,IAAI,GAAG,KAAK,CAAC;QACnB,oCAAgB,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QACvE,IAAA,aAAM,EAAC,GAAG,EAAE,CAAC,oCAAgB,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;IACjG,CAAC,CAAC,CAAC;AACP,CAAC,CAAC,CAAC"}

package/lib/common/application-protocol.d.ts

@@ -0,0 +1,22 @@
+import { OS } from './os';
+export declare const applicationPath = "/services/application";
+export declare const ApplicationServer: unique symbol;
+export interface ApplicationServer {
+    getExtensionsInfos(): Promise<ExtensionInfo[]>;
+    getApplicationInfo(): Promise<ApplicationInfo | undefined>;
+    getApplicationRoot(): Promise<string>;
+    getApplicationPlatform(): Promise<string>;
+    /**
+     * @deprecated since 1.25.0. Use `OS.backend.type()` instead.
+     */
+    getBackendOS(): Promise<OS.Type>;
+}
+export interface ExtensionInfo {
+    name: string;
+    version: string;
+}
+export interface ApplicationInfo {
+    name: string;
+    version: string;
+}
+//# sourceMappingURL=application-protocol.d.ts.map

package/lib/common/application-protocol.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"application-protocol.d.ts","sourceRoot":"","sources":["../../src/common/application-protocol.ts"],"names":[],"mappings":"AAgBA,OAAO,EAAE,EAAE,EAAE,MAAM,MAAM,CAAC;AAE1B,eAAO,MAAM,eAAe,0BAA0B,CAAC;AAEvD,eAAO,MAAM,iBAAiB,eAA8B,CAAC;AAE7D,MAAM,WAAW,iBAAiB;IAC9B,kBAAkB,IAAI,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC;IAC/C,kBAAkB,IAAI,OAAO,CAAC,eAAe,GAAG,SAAS,CAAC,CAAC;IAC3D,kBAAkB,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IACtC,sBAAsB,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IAC1C;;OAEG;IACH,YAAY,IAAI,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;CACpC;AAED,MAAM,WAAW,aAAa;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,eAAe;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;CACnB"}

package/lib/common/application-protocol.js

@@ -0,0 +1,21 @@
+"use strict";
+// *****************************************************************************
+// Copyright (C) 2018 Ericsson 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-only WITH Classpath-exception-2.0
+// *****************************************************************************
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ApplicationServer = exports.applicationPath = void 0;
+exports.applicationPath = '/services/application';
+exports.ApplicationServer = Symbol('ApplicationServer');
+//# sourceMappingURL=application-protocol.js.map

package/lib/common/application-protocol.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"application-protocol.js","sourceRoot":"","sources":["../../src/common/application-protocol.ts"],"names":[],"mappings":";AAAA,gFAAgF;AAChF,0CAA0C;AAC1C,EAAE;AACF,2EAA2E;AAC3E,mEAAmE;AACnE,wCAAwC;AACxC,EAAE;AACF,4EAA4E;AAC5E,8EAA8E;AAC9E,6EAA6E;AAC7E,yDAAyD;AACzD,uDAAuD;AACvD,EAAE;AACF,gFAAgF;AAChF,gFAAgF;;;AAInE,QAAA,eAAe,GAAG,uBAAuB,CAAC;AAE1C,QAAA,iBAAiB,GAAG,MAAM,CAAC,mBAAmB,CAAC,CAAC"}

package/lib/common/array-utils.d.ts

@@ -0,0 +1,62 @@
+export declare namespace ArrayUtils {
+    interface Head<T> extends Array<T> {
+        head(): T;
+    }
+    interface Tail<T> extends Array<T> {
+        tail(): T;
+    }
+    interface Children<T> extends Array<T> {
+        children(): Tail<T>;
+    }
+    const TailImpl: {
+        tail<T>(this: Array<T>): T;
+    };
+    const HeadAndChildrenImpl: {
+        head<T>(this: Array<T>): T;
+        children<T_1>(this: T_1[]): Tail<T_1>;
+    };
+    interface HeadAndTail<T> extends Head<T>, Tail<T>, Children<T> {
+    }
+    function asTail<T>(array: Array<T>): Tail<T>;
+    function asHeadAndTail<T>(array: Array<T>): HeadAndTail<T>;
+    enum Sort {
+        LeftBeforeRight = -1,
+        RightBeforeLeft = 1,
+        Equal = 0
+    }
+    /**
+     * Performs a binary search algorithm over a sorted collection. Useful for cases
+     * when we need to perform a binary search over something that isn't actually an
+     * array, and converting data to an array would defeat the use of binary search
+     * in the first place.
+     *
+     * @param length The collection length.
+     * @param compareToKey A function that takes an index of an element in the
+     *   collection and returns zero if the value at this index is equal to the
+     *   search key, a negative number if the value precedes the search key in the
+     *   sorting order, or a positive number if the search key precedes the value.
+     * @return A non-negative index of an element, if found. If not found, the
+     *   result is -(n+1) (or ~n, using bitwise notation), where n is the index
+     *   where the key should be inserted to maintain the sorting order.
+     */
+    function binarySearch2(length: number, compareToKey: (index: number) => number): number;
+    function partition<T>(array: T[], filter: (e: T, idx: number, arr: T[]) => boolean | undefined): [T[], T[]];
+    /**
+     * @returns New array with all falsy values removed. The original array IS NOT modified.
+     */
+    function coalesce<T>(array: ReadonlyArray<T | undefined | null>): T[];
+    /**
+     * groups array elements through a comparator function
+     * @param data array of elements to group
+     * @param compare comparator function: return of 0 means should group, anything above means not group
+     * @returns array of arrays with grouped elements
+     */
+    function groupBy<T>(data: ReadonlyArray<T>, compare: (a: T, b: T) => number): T[][];
+    function shallowEqual<T>(left: readonly T[], right: readonly T[]): boolean;
+    function startsWith<T>(left: readonly T[], right: readonly T[]): boolean;
+    function equals<T>(one: ReadonlyArray<T> | undefined, other: ReadonlyArray<T> | undefined, itemEquals?: (a: T, b: T) => boolean): boolean;
+    function findLast<T>(array: readonly T[], predicate: (item: T) => boolean): T | undefined;
+    function findLastIdx<T>(array: readonly T[], predicate: (item: T) => boolean, fromIndex?: number): number;
+    function checkAdjacentItems<T>(items: readonly T[], predicate: (item1: T, item2: T) => boolean): boolean;
+}
+//# sourceMappingURL=array-utils.d.ts.map

package/lib/common/array-utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-utils.d.ts","sourceRoot":"","sources":["../../src/common/array-utils.ts"],"names":[],"mappings":"AAgBA,yBAAiB,UAAU,CAAC;IACxB,UAAiB,IAAI,CAAC,CAAC,CAAE,SAAQ,KAAK,CAAC,CAAC,CAAC;QACrC,IAAI,IAAI,CAAC,CAAC;KACb;IAED,UAAiB,IAAI,CAAC,CAAC,CAAE,SAAQ,KAAK,CAAC,CAAC,CAAC;QACrC,IAAI,IAAI,CAAC,CAAC;KACb;IAED,UAAiB,QAAQ,CAAC,CAAC,CAAE,SAAQ,KAAK,CAAC,CAAC,CAAC;QACzC,QAAQ,IAAI,IAAI,CAAC,CAAC,CAAC,CAAA;KACtB;IAEM,MAAM,QAAQ;sBACH,MAAM,CAAC,CAAC,GAAG,CAAC;KAG7B,CAAC;IAEK,MAAM,mBAAmB;sBACd,MAAM,CAAC,CAAC,GAAG,CAAC;;KAO7B,CAAC;IAEF,UAAiB,WAAW,CAAC,CAAC,CAAE,SAAQ,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;KAAI;IAEzE,SAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAElD;IAED,SAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAEhE;IAED,KAAY,IAAI;QACZ,eAAe,KAAK;QACpB,eAAe,IAAI;QACnB,KAAK,IAAI;KACZ;IAGD;;;;;;;;;;;;;;OAcG;IACH,SAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,GAAG,MAAM,CAgB7F;IAED,SAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,OAAO,GAAG,SAAS,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAKjH;IAED;;OAEG;IACH,SAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,GAAG,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAE3E;IAED;;;;;OAKG;IACH,SAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,GAAG,CAAC,EAAE,EAAE,CAYzF;IAED,SAAgB,YAAY,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,GAAG,OAAO,CAUhF;IAED,SAAgB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,GAAG,OAAO,CAW9E;IAED,SAAgB,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,SAAS,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,GAAG,SAAS,EAAE,UAAU,GAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAA2B,GAAG,OAAO,CAoBlK;IAED,SAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,GAAG,SAAS,CAM/F;IAED,SAAgB,WAAW,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,EAAE,SAAS,SAAmB,GAAG,MAAM,CAUzH;IAED,SAAgB,kBAAkB,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO,CAS9G;CACJ"}

package/lib/common/array-utils.js

@@ -0,0 +1,190 @@
+"use strict";
+// *****************************************************************************
+// Copyright (C) 2023 Ericsson 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-only WITH Classpath-exception-2.0
+// *****************************************************************************
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ArrayUtils = void 0;
+var ArrayUtils;
+(function (ArrayUtils) {
+    ArrayUtils.TailImpl = {
+        tail() {
+            return this[this.length - 1];
+        },
+    };
+    ArrayUtils.HeadAndChildrenImpl = {
+        head() {
+            return this[0];
+        },
+        children() {
+            return Object.assign(this.slice(1), ArrayUtils.TailImpl);
+        }
+    };
+    function asTail(array) {
+        return Object.assign(array, ArrayUtils.TailImpl);
+    }
+    ArrayUtils.asTail = asTail;
+    function asHeadAndTail(array) {
+        return Object.assign(array, ArrayUtils.HeadAndChildrenImpl, ArrayUtils.TailImpl);
+    }
+    ArrayUtils.asHeadAndTail = asHeadAndTail;
+    let Sort;
+    (function (Sort) {
+        Sort[Sort["LeftBeforeRight"] = -1] = "LeftBeforeRight";
+        Sort[Sort["RightBeforeLeft"] = 1] = "RightBeforeLeft";
+        Sort[Sort["Equal"] = 0] = "Equal";
+    })(Sort = ArrayUtils.Sort || (ArrayUtils.Sort = {}));
+    // Copied from https://github.com/microsoft/vscode/blob/9c29becfad5f68270b9b23efeafb147722c5feba/src/vs/base/common/arrays.ts
+    /**
+     * Performs a binary search algorithm over a sorted collection. Useful for cases
+     * when we need to perform a binary search over something that isn't actually an
+     * array, and converting data to an array would defeat the use of binary search
+     * in the first place.
+     *
+     * @param length The collection length.
+     * @param compareToKey A function that takes an index of an element in the
+     *   collection and returns zero if the value at this index is equal to the
+     *   search key, a negative number if the value precedes the search key in the
+     *   sorting order, or a positive number if the search key precedes the value.
+     * @return A non-negative index of an element, if found. If not found, the
+     *   result is -(n+1) (or ~n, using bitwise notation), where n is the index
+     *   where the key should be inserted to maintain the sorting order.
+     */
+    function binarySearch2(length, compareToKey) {
+        let low = 0;
+        let high = length - 1;
+        while (low <= high) {
+            const mid = ((low + high) / 2) | 0;
+            const comp = compareToKey(mid);
+            if (comp < 0) {
+                low = mid + 1;
+            }
+            else if (comp > 0) {
+                high = mid - 1;
+            }
+            else {
+                return mid;
+            }
+        }
+        return -(low + 1);
+    }
+    ArrayUtils.binarySearch2 = binarySearch2;
+    function partition(array, filter) {
+        const pass = [];
+        const fail = [];
+        array.forEach((e, idx, arr) => (filter(e, idx, arr) ? pass : fail).push(e));
+        return [pass, fail];
+    }
+    ArrayUtils.partition = partition;
+    /**
+     * @returns New array with all falsy values removed. The original array IS NOT modified.
+     */
+    function coalesce(array) {
+        return array.filter(e => !!e);
+    }
+    ArrayUtils.coalesce = coalesce;
+    /**
+     * groups array elements through a comparator function
+     * @param data array of elements to group
+     * @param compare comparator function: return of 0 means should group, anything above means not group
+     * @returns array of arrays with grouped elements
+     */
+    function groupBy(data, compare) {
+        const result = [];
+        let currentGroup = undefined;
+        for (const element of data.slice(0).sort(compare)) {
+            if (!currentGroup || compare(currentGroup[0], element) !== 0) {
+                currentGroup = [element];
+                result.push(currentGroup);
+            }
+            else {
+                currentGroup.push(element);
+            }
+        }
+        return result;
+    }
+    ArrayUtils.groupBy = groupBy;
+    function shallowEqual(left, right) {
+        if (left.length !== right.length) {
+            return false;
+        }
+        for (let i = 0; i < left.length; i++) {
+            if (left[i] !== right[i]) {
+                return false;
+            }
+        }
+        return true;
+    }
+    ArrayUtils.shallowEqual = shallowEqual;
+    function startsWith(left, right) {
+        if (right.length > left.length) {
+            return false;
+        }
+        for (let i = 0; i < right.length; i++) {
+            if (left[i] !== right[i]) {
+                return false;
+            }
+        }
+        return true;
+    }
+    ArrayUtils.startsWith = startsWith;
+    function equals(one, other, itemEquals = (a, b) => a === b) {
+        if (one === other) {
+            return true;
+        }
+        if (!one || !other) {
+            return false;
+        }
+        if (one.length !== other.length) {
+            return false;
+        }
+        for (let i = 0, len = one.length; i < len; i++) {
+            if (!itemEquals(one[i], other[i])) {
+                return false;
+            }
+        }
+        return true;
+    }
+    ArrayUtils.equals = equals;
+    function findLast(array, predicate) {
+        const idx = findLastIdx(array, predicate);
+        if (idx === -1) {
+            return undefined;
+        }
+        return array[idx];
+    }
+    ArrayUtils.findLast = findLast;
+    function findLastIdx(array, predicate, fromIndex = array.length - 1) {
+        for (let i = fromIndex; i >= 0; i--) {
+            const element = array[i];
+            if (predicate(element)) {
+                return i;
+            }
+        }
+        return -1;
+    }
+    ArrayUtils.findLastIdx = findLastIdx;
+    function checkAdjacentItems(items, predicate) {
+        for (let i = 0; i < items.length - 1; i++) {
+            const a = items[i];
+            const b = items[i + 1];
+            if (!predicate(a, b)) {
+                return false;
+            }
+        }
+        return true;
+    }
+    ArrayUtils.checkAdjacentItems = checkAdjacentItems;
+})(ArrayUtils || (exports.ArrayUtils = ArrayUtils = {}));
+//# sourceMappingURL=array-utils.js.map

package/lib/common/array-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-utils.js","sourceRoot":"","sources":["../../src/common/array-utils.ts"],"names":[],"mappings":";AAAA,gFAAgF;AAChF,0CAA0C;AAC1C,EAAE;AACF,2EAA2E;AAC3E,mEAAmE;AACnE,wCAAwC;AACxC,EAAE;AACF,4EAA4E;AAC5E,8EAA8E;AAC9E,6EAA6E;AAC7E,yDAAyD;AACzD,uDAAuD;AACvD,EAAE;AACF,gFAAgF;AAChF,gFAAgF;;;AAEhF,IAAiB,UAAU,CA8L1B;AA9LD,WAAiB,UAAU;IAaV,mBAAQ,GAAG;QACpB,IAAI;YACA,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACjC,CAAC;KACJ,CAAC;IAEW,8BAAmB,GAAG;QAC/B,IAAI;YACA,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,CAAC;QAED,QAAQ;YACJ,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,WAAA,QAAQ,CAAC,CAAC;QAClD,CAAC;KACJ,CAAC;IAIF,SAAgB,MAAM,CAAI,KAAe;QACrC,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,WAAA,QAAQ,CAAC,CAAC;IAC1C,CAAC;IAFe,iBAAM,SAErB,CAAA;IAED,SAAgB,aAAa,CAAI,KAAe;QAC5C,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,WAAA,mBAAmB,EAAE,WAAA,QAAQ,CAAC,CAAC;IAC/D,CAAC;IAFe,wBAAa,gBAE5B,CAAA;IAED,IAAY,IAIX;IAJD,WAAY,IAAI;QACZ,sDAAoB,CAAA;QACpB,qDAAmB,CAAA;QACnB,iCAAS,CAAA;IACb,CAAC,EAJW,IAAI,GAAJ,eAAI,KAAJ,eAAI,QAIf;IAED,6HAA6H;IAC7H;;;;;;;;;;;;;;OAcG;IACH,SAAgB,aAAa,CAAC,MAAc,EAAE,YAAuC;QACjF,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,IAAI,GAAG,MAAM,GAAG,CAAC,CAAC;QAEtB,OAAO,GAAG,IAAI,IAAI,EAAE,CAAC;YACjB,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACnC,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;YAC/B,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;gBACX,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;YAClB,CAAC;iBAAM,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;gBAClB,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;YACnB,CAAC;iBAAM,CAAC;gBACJ,OAAO,GAAG,CAAC;YACf,CAAC;QACL,CAAC;QACD,OAAO,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IACtB,CAAC;IAhBe,wBAAa,gBAgB5B,CAAA;IAED,SAAgB,SAAS,CAAI,KAAU,EAAE,MAA4D;QACjG,MAAM,IAAI,GAAQ,EAAE,CAAC;QACrB,MAAM,IAAI,GAAQ,EAAE,CAAC;QACrB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5E,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACxB,CAAC;IALe,oBAAS,YAKxB,CAAA;IAED;;OAEG;IACH,SAAgB,QAAQ,CAAI,KAA0C;QAClE,OAAY,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IAFe,mBAAQ,WAEvB,CAAA;IAED;;;;;OAKG;IACH,SAAgB,OAAO,CAAI,IAAsB,EAAE,OAA+B;QAC9E,MAAM,MAAM,GAAU,EAAE,CAAC;QACzB,IAAI,YAAY,GAAoB,SAAS,CAAC;QAC9C,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;YAChD,IAAI,CAAC,YAAY,IAAI,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3D,YAAY,GAAG,CAAC,OAAO,CAAC,CAAC;gBACzB,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC9B,CAAC;iBAAM,CAAC;gBACJ,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC/B,CAAC;QACL,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAZe,kBAAO,UAYtB,CAAA;IAED,SAAgB,YAAY,CAAI,IAAkB,EAAE,KAAmB;QACnE,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;YAC/B,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvB,OAAO,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAVe,uBAAY,eAU3B,CAAA;IAED,SAAgB,UAAU,CAAI,IAAkB,EAAE,KAAmB;QACjE,IAAI,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC7B,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvB,OAAO,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAXe,qBAAU,aAWzB,CAAA;IAED,SAAgB,MAAM,CAAI,GAAiC,EAAE,KAAmC,EAAE,aAAsC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;QACrJ,IAAI,GAAG,KAAK,KAAK,EAAE,CAAC;YAChB,OAAO,IAAI,CAAC;QAChB,CAAC;QAED,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YACjB,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,IAAI,GAAG,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;YAC9B,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChC,OAAO,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;IApBe,iBAAM,SAoBrB,CAAA;IAED,SAAgB,QAAQ,CAAI,KAAmB,EAAE,SAA+B;QAC5E,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAC1C,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;YACb,OAAO,SAAS,CAAC;QACrB,CAAC;QACD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC;IACtB,CAAC;IANe,mBAAQ,WAMvB,CAAA;IAED,SAAgB,WAAW,CAAI,KAAmB,EAAE,SAA+B,EAAE,SAAS,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC;QAC7G,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAEzB,IAAI,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;gBACrB,OAAO,CAAC,CAAC;YACb,CAAC;QACL,CAAC;QAED,OAAO,CAAC,CAAC,CAAC;IACd,CAAC;IAVe,sBAAW,cAU1B,CAAA;IAED,SAAgB,kBAAkB,CAAI,KAAmB,EAAE,SAA0C;QACjG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvB,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBACnB,OAAO,KAAK,CAAC;YACjB,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IATe,6BAAkB,qBASjC,CAAA;AACL,CAAC,EA9LgB,UAAU,0BAAV,UAAU,QA8L1B"}

package/lib/common/buffer.d.ts

@@ -0,0 +1,44 @@
+import * as streams from './stream';
+export declare class BinaryBuffer {
+    static alloc(byteLength: number): BinaryBuffer;
+    static wrap(actual: Uint8Array): BinaryBuffer;
+    static fromString(source: string): BinaryBuffer;
+    static concat(buffers: BinaryBuffer[], totalLength?: number): BinaryBuffer;
+    readonly buffer: Uint8Array;
+    readonly byteLength: number;
+    private constructor();
+    toString(): string;
+    slice(start?: number, end?: number): BinaryBuffer;
+    set(array: BinaryBuffer, offset?: number): void;
+    set(array: Uint8Array, offset?: number): void;
+    readUInt32BE(offset: number): number;
+    writeUInt32BE(value: number, offset: number): void;
+    readUInt32LE(offset: number): number;
+    writeUInt32LE(value: number, offset: number): void;
+    readUInt8(offset: number): number;
+    writeUInt8(value: number, offset: number): void;
+}
+export interface BinaryBufferReadable extends streams.Readable<BinaryBuffer> {
+}
+export declare namespace BinaryBufferReadable {
+    function toBuffer(readable: BinaryBufferReadable): BinaryBuffer;
+    function fromBuffer(buffer: BinaryBuffer): BinaryBufferReadable;
+    function fromReadable(readable: streams.Readable<string>): BinaryBufferReadable;
+}
+export interface BinaryBufferReadableStream extends streams.ReadableStream<BinaryBuffer> {
+}
+export declare namespace BinaryBufferReadableStream {
+    function toBuffer(stream: BinaryBufferReadableStream): Promise<BinaryBuffer>;
+    function fromBuffer(buffer: BinaryBuffer): BinaryBufferReadableStream;
+}
+export interface BinaryBufferReadableBufferedStream extends streams.ReadableBufferedStream<BinaryBuffer> {
+}
+export declare namespace BinaryBufferReadableBufferedStream {
+    function toBuffer(bufferedStream: streams.ReadableBufferedStream<BinaryBuffer>): Promise<BinaryBuffer>;
+}
+export interface BinaryBufferWriteableStream extends streams.WriteableStream<BinaryBuffer> {
+}
+export declare namespace BinaryBufferWriteableStream {
+    function create(options?: streams.WriteableStreamOptions): BinaryBufferWriteableStream;
+}
+//# sourceMappingURL=buffer.d.ts.map

package/lib/common/buffer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"buffer.d.ts","sourceRoot":"","sources":["../../src/common/buffer.ts"],"names":[],"mappings":"AAyBA,OAAO,KAAK,OAAO,MAAM,UAAU,CAAC;AASpC,qBAAa,YAAY;IAErB,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,MAAM,GAAG,YAAY;IAQ9C,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,GAAG,YAAY;IAS7C,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,YAAY;IAa/C,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,YAAY,EAAE,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,YAAY;IAmB1E,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;IAC5B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAE5B,OAAO;IAKP,QAAQ,IAAI,MAAM;IAalB,KAAK,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,YAAY;IAOjD,GAAG,CAAC,KAAK,EAAE,YAAY,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI;IAC/C,GAAG,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI;IAS7C,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IASpC,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;IAUlD,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IASpC,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;IAUlD,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAIjC,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;CAIlD;AAED,MAAM,WAAW,oBAAqB,SAAQ,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC;CAAI;AAChF,yBAAiB,oBAAoB,CAAC;IAClC,SAAgB,QAAQ,CAAC,QAAQ,EAAE,oBAAoB,GAAG,YAAY,CAErE;IACD,SAAgB,UAAU,CAAC,MAAM,EAAE,YAAY,GAAG,oBAAoB,CAErE;IACD,SAAgB,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,oBAAoB,CAYrF;CACJ;AAED,MAAM,WAAW,0BAA2B,SAAQ,OAAO,CAAC,cAAc,CAAC,YAAY,CAAC;CAAI;AAC5F,yBAAiB,0BAA0B,CAAC;IACxC,SAAgB,QAAQ,CAAC,MAAM,EAAE,0BAA0B,GAAG,OAAO,CAAC,YAAY,CAAC,CAElF;IACD,SAAgB,UAAU,CAAC,MAAM,EAAE,YAAY,GAAG,0BAA0B,CAE3E;CACJ;AAED,MAAM,WAAW,kCAAmC,SAAQ,OAAO,CAAC,sBAAsB,CAAC,YAAY,CAAC;CAAI;AAC5G,yBAAiB,kCAAkC,CAAC;IAChD,SAAsB,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC,sBAAsB,CAAC,YAAY,CAAC,GAAG,OAAO,CAAC,YAAY,CAAC,CAalH;CACJ;AAED,MAAM,WAAW,2BAA4B,SAAQ,OAAO,CAAC,eAAe,CAAC,YAAY,CAAC;CAAI;AAC9F,yBAAiB,2BAA2B,CAAC;IACzC,SAAgB,MAAM,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,sBAAsB,GAAG,2BAA2B,CAE5F;CACJ"}

package/lib/common/buffer.js

@@ -0,0 +1,206 @@
+"use strict";
+// *****************************************************************************
+// Copyright (C) 2020 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-only WITH Classpath-exception-2.0
+// *****************************************************************************
+/*---------------------------------------------------------------------------------------------
+ *  Copyright (c) Microsoft Corporation. All rights reserved.
+ *  Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+// based on https://github.com/microsoft/vscode/blob/04c36be045a94fee58e5f8992d3e3fd980294a84/src/vs/base/common/buffer.ts
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BinaryBufferWriteableStream = exports.BinaryBufferReadableBufferedStream = exports.BinaryBufferReadableStream = exports.BinaryBufferReadable = exports.BinaryBuffer = void 0;
+/* eslint-disable no-null/no-null */
+const safer_buffer_1 = require("safer-buffer");
+const iconv = require("iconv-lite");
+const streams = require("./stream");
+const hasBuffer = (typeof Buffer !== 'undefined');
+const hasTextEncoder = (typeof TextEncoder !== 'undefined');
+const hasTextDecoder = (typeof TextDecoder !== 'undefined');
+let textEncoder;
+let textDecoder;
+class BinaryBuffer {
+    static alloc(byteLength) {
+        if (hasBuffer) {
+            return new BinaryBuffer(Buffer.allocUnsafe(byteLength));
+        }
+        else {
+            return new BinaryBuffer(new Uint8Array(byteLength));
+        }
+    }
+    static wrap(actual) {
+        if (hasBuffer && !(Buffer.isBuffer(actual))) {
+            // https://nodejs.org/dist/latest-v10.x/docs/api/buffer.html#buffer_class_method_buffer_from_arraybuffer_byteoffset_length
+            // Create a zero-copy Buffer wrapper around the ArrayBuffer pointed to by the Uint8Array
+            actual = Buffer.from(actual.buffer, actual.byteOffset, actual.byteLength);
+        }
+        return new BinaryBuffer(actual);
+    }
+    static fromString(source) {
+        if (hasBuffer) {
+            return new BinaryBuffer(Buffer.from(source));
+        }
+        else if (hasTextEncoder) {
+            if (!textEncoder) {
+                textEncoder = new TextEncoder();
+            }
+            return new BinaryBuffer(textEncoder.encode(source));
+        }
+        else {
+            return new BinaryBuffer(iconv.encode(source, 'utf8'));
+        }
+    }
+    static concat(buffers, totalLength) {
+        if (typeof totalLength === 'undefined') {
+            totalLength = 0;
+            for (let i = 0, len = buffers.length; i < len; i++) {
+                totalLength += buffers[i].byteLength;
+            }
+        }
+        const ret = BinaryBuffer.alloc(totalLength);
+        let offset = 0;
+        for (let i = 0, len = buffers.length; i < len; i++) {
+            const element = buffers[i];
+            ret.set(element, offset);
+            offset += element.byteLength;
+        }
+        return ret;
+    }
+    constructor(buffer) {
+        this.buffer = buffer;
+        this.byteLength = this.buffer.byteLength;
+    }
+    toString() {
+        if (hasBuffer) {
+            return this.buffer.toString();
+        }
+        else if (hasTextDecoder) {
+            if (!textDecoder) {
+                textDecoder = new TextDecoder();
+            }
+            return textDecoder.decode(this.buffer);
+        }
+        else {
+            return iconv.decode(safer_buffer_1.Buffer.from(this.buffer), 'utf8');
+        }
+    }
+    slice(start, end) {
+        // IMPORTANT: use subarray instead of slice because TypedArray#slice
+        // creates shallow copy and NodeBuffer#slice doesn't. The use of subarray
+        // ensures the same, performant, behaviour.
+        return new BinaryBuffer(this.buffer.subarray(start, end));
+    }
+    set(array, offset) {
+        if (array instanceof BinaryBuffer) {
+            this.buffer.set(array.buffer, offset);
+        }
+        else {
+            this.buffer.set(array, offset);
+        }
+    }
+    readUInt32BE(offset) {
+        return (this.buffer[offset] * 2 ** 24
+            + this.buffer[offset + 1] * 2 ** 16
+            + this.buffer[offset + 2] * 2 ** 8
+            + this.buffer[offset + 3]);
+    }
+    writeUInt32BE(value, offset) {
+        this.buffer[offset + 3] = value;
+        value = value >>> 8;
+        this.buffer[offset + 2] = value;
+        value = value >>> 8;
+        this.buffer[offset + 1] = value;
+        value = value >>> 8;
+        this.buffer[offset] = value;
+    }
+    readUInt32LE(offset) {
+        return (((this.buffer[offset + 0] << 0) >>> 0) |
+            ((this.buffer[offset + 1] << 8) >>> 0) |
+            ((this.buffer[offset + 2] << 16) >>> 0) |
+            ((this.buffer[offset + 3] << 24) >>> 0));
+    }
+    writeUInt32LE(value, offset) {
+        this.buffer[offset + 0] = (value & 0b11111111);
+        value = value >>> 8;
+        this.buffer[offset + 1] = (value & 0b11111111);
+        value = value >>> 8;
+        this.buffer[offset + 2] = (value & 0b11111111);
+        value = value >>> 8;
+        this.buffer[offset + 3] = (value & 0b11111111);
+    }
+    readUInt8(offset) {
+        return this.buffer[offset];
+    }
+    writeUInt8(value, offset) {
+        this.buffer[offset] = value;
+    }
+}
+exports.BinaryBuffer = BinaryBuffer;
+var BinaryBufferReadable;
+(function (BinaryBufferReadable) {
+    function toBuffer(readable) {
+        return streams.consumeReadable(readable, chunks => BinaryBuffer.concat(chunks));
+    }
+    BinaryBufferReadable.toBuffer = toBuffer;
+    function fromBuffer(buffer) {
+        return streams.toReadable(buffer);
+    }
+    BinaryBufferReadable.fromBuffer = fromBuffer;
+    function fromReadable(readable) {
+        return {
+            read() {
+                const value = readable.read();
+                if (typeof value === 'string') {
+                    return BinaryBuffer.fromString(value);
+                }
+                return null;
+            }
+        };
+    }
+    BinaryBufferReadable.fromReadable = fromReadable;
+})(BinaryBufferReadable || (exports.BinaryBufferReadable = BinaryBufferReadable = {}));
+var BinaryBufferReadableStream;
+(function (BinaryBufferReadableStream) {
+    function toBuffer(stream) {
+        return streams.consumeStream(stream, chunks => BinaryBuffer.concat(chunks));
+    }
+    BinaryBufferReadableStream.toBuffer = toBuffer;
+    function fromBuffer(buffer) {
+        return streams.toStream(buffer, chunks => BinaryBuffer.concat(chunks));
+    }
+    BinaryBufferReadableStream.fromBuffer = fromBuffer;
+})(BinaryBufferReadableStream || (exports.BinaryBufferReadableStream = BinaryBufferReadableStream = {}));
+var BinaryBufferReadableBufferedStream;
+(function (BinaryBufferReadableBufferedStream) {
+    async function toBuffer(bufferedStream) {
+        if (bufferedStream.ended) {
+            return BinaryBuffer.concat(bufferedStream.buffer);
+        }
+        return BinaryBuffer.concat([
+            // Include already read chunks...
+            ...bufferedStream.buffer,
+            // ...and all additional chunks
+            await BinaryBufferReadableStream.toBuffer(bufferedStream.stream)
+        ]);
+    }
+    BinaryBufferReadableBufferedStream.toBuffer = toBuffer;
+})(BinaryBufferReadableBufferedStream || (exports.BinaryBufferReadableBufferedStream = BinaryBufferReadableBufferedStream = {}));
+var BinaryBufferWriteableStream;
+(function (BinaryBufferWriteableStream) {
+    function create(options) {
+        return streams.newWriteableStream(chunks => BinaryBuffer.concat(chunks), options);
+    }
+    BinaryBufferWriteableStream.create = create;
+})(BinaryBufferWriteableStream || (exports.BinaryBufferWriteableStream = BinaryBufferWriteableStream = {}));
+//# sourceMappingURL=buffer.js.map

package/lib/common/buffer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"buffer.js","sourceRoot":"","sources":["../../src/common/buffer.ts"],"names":[],"mappings":";AAAA,gFAAgF;AAChF,yCAAyC;AACzC,EAAE;AACF,2EAA2E;AAC3E,mEAAmE;AACnE,wCAAwC;AACxC,EAAE;AACF,4EAA4E;AAC5E,8EAA8E;AAC9E,6EAA6E;AAC7E,yDAAyD;AACzD,uDAAuD;AACvD,EAAE;AACF,gFAAgF;AAChF,gFAAgF;AAChF;;;gGAGgG;AAChG,0HAA0H;;;AAE1H,oCAAoC;AAEpC,+CAAqD;AACrD,oCAAoC;AACpC,oCAAoC;AAEpC,MAAM,SAAS,GAAG,CAAC,OAAO,MAAM,KAAK,WAAW,CAAC,CAAC;AAClD,MAAM,cAAc,GAAG,CAAC,OAAO,WAAW,KAAK,WAAW,CAAC,CAAC;AAC5D,MAAM,cAAc,GAAG,CAAC,OAAO,WAAW,KAAK,WAAW,CAAC,CAAC;AAE5D,IAAI,WAA+B,CAAC;AACpC,IAAI,WAA+B,CAAC;AAEpC,MAAa,YAAY;IAErB,MAAM,CAAC,KAAK,CAAC,UAAkB;QAC3B,IAAI,SAAS,EAAE,CAAC;YACZ,OAAO,IAAI,YAAY,CAAC,MAAM,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC;QAC5D,CAAC;aAAM,CAAC;YACJ,OAAO,IAAI,YAAY,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC;QACxD,CAAC;IACL,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,MAAkB;QAC1B,IAAI,SAAS,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;YAC1C,0HAA0H;YAC1H,wFAAwF;YACxF,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;QAC9E,CAAC;QACD,OAAO,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;IACpC,CAAC;IAED,MAAM,CAAC,UAAU,CAAC,MAAc;QAC5B,IAAI,SAAS,EAAE,CAAC;YACZ,OAAO,IAAI,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QACjD,CAAC;aAAM,IAAI,cAAc,EAAE,CAAC;YACxB,IAAI,CAAC,WAAW,EAAE,CAAC;gBACf,WAAW,GAAG,IAAI,WAAW,EAAE,CAAC;YACpC,CAAC;YACD,OAAO,IAAI,YAAY,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;QACxD,CAAC;aAAM,CAAC;YACJ,OAAO,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;QAC1D,CAAC;IACL,CAAC;IAED,MAAM,CAAC,MAAM,CAAC,OAAuB,EAAE,WAAoB;QACvD,IAAI,OAAO,WAAW,KAAK,WAAW,EAAE,CAAC;YACrC,WAAW,GAAG,CAAC,CAAC;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjD,WAAW,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;YACzC,CAAC;QACL,CAAC;QAED,MAAM,GAAG,GAAG,YAAY,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAC5C,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,MAAM,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YAC3B,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YACzB,MAAM,IAAI,OAAO,CAAC,UAAU,CAAC;QACjC,CAAC;QAED,OAAO,GAAG,CAAC;IACf,CAAC;IAKD,YAAoB,MAAkB;QAClC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC;IAC7C,CAAC;IAED,QAAQ;QACJ,IAAI,SAAS,EAAE,CAAC;YACZ,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAClC,CAAC;aAAM,IAAI,cAAc,EAAE,CAAC;YACxB,IAAI,CAAC,WAAW,EAAE,CAAC;gBACf,WAAW,GAAG,IAAI,WAAW,EAAE,CAAC;YACpC,CAAC;YACD,OAAO,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3C,CAAC;aAAM,CAAC;YACJ,OAAO,KAAK,CAAC,MAAM,CAAC,qBAAW,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC;QAC/D,CAAC;IACL,CAAC;IAED,KAAK,CAAC,KAAc,EAAE,GAAY;QAC9B,oEAAoE;QACpE,yEAAyE;QACzE,2CAA2C;QAC3C,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;IAC9D,CAAC;IAID,GAAG,CAAC,KAAgC,EAAE,MAAe;QACjD,IAAI,KAAK,YAAY,YAAY,EAAE,CAAC;YAChC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC1C,CAAC;aAAM,CAAC;YACJ,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACnC,CAAC;IACL,CAAC;IAED,YAAY,CAAC,MAAc;QACvB,OAAO,CACH,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE;cAC3B,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE;cACjC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;cAChC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAC5B,CAAC;IACN,CAAC;IAED,aAAa,CAAC,KAAa,EAAE,MAAc;QACvC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;QAChC,KAAK,GAAG,KAAK,KAAK,CAAC,CAAC;QACpB,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;QAChC,KAAK,GAAG,KAAK,KAAK,CAAC,CAAC;QACpB,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;QAChC,KAAK,GAAG,KAAK,KAAK,CAAC,CAAC;QACpB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;IAChC,CAAC;IAED,YAAY,CAAC,MAAc;QACvB,OAAO,CACH,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;YACtC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;YACtC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC;YACvC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAC1C,CAAC;IACN,CAAC;IAED,aAAa,CAAC,KAAa,EAAE,MAAc;QACvC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC;QAC/C,KAAK,GAAG,KAAK,KAAK,CAAC,CAAC;QACpB,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC;QAC/C,KAAK,GAAG,KAAK,KAAK,CAAC,CAAC;QACpB,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC;QAC/C,KAAK,GAAG,KAAK,KAAK,CAAC,CAAC;QACpB,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,UAAU,CAAC,CAAC;IACnD,CAAC;IAED,SAAS,CAAC,MAAc;QACpB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IAED,UAAU,CAAC,KAAa,EAAE,MAAc;QACpC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;IAChC,CAAC;CAEJ;AAvID,oCAuIC;AAGD,IAAiB,oBAAoB,CAoBpC;AApBD,WAAiB,oBAAoB;IACjC,SAAgB,QAAQ,CAAC,QAA8B;QACnD,OAAO,OAAO,CAAC,eAAe,CAAe,QAAQ,EAAE,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAClG,CAAC;IAFe,6BAAQ,WAEvB,CAAA;IACD,SAAgB,UAAU,CAAC,MAAoB;QAC3C,OAAO,OAAO,CAAC,UAAU,CAAe,MAAM,CAAC,CAAC;IACpD,CAAC;IAFe,+BAAU,aAEzB,CAAA;IACD,SAAgB,YAAY,CAAC,QAAkC;QAC3D,OAAO;YACH,IAAI;gBACA,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;gBAE9B,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;oBAC5B,OAAO,YAAY,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;gBAC1C,CAAC;gBAED,OAAO,IAAI,CAAC;YAChB,CAAC;SACJ,CAAC;IACN,CAAC;IAZe,iCAAY,eAY3B,CAAA;AACL,CAAC,EApBgB,oBAAoB,oCAApB,oBAAoB,QAoBpC;AAGD,IAAiB,0BAA0B,CAO1C;AAPD,WAAiB,0BAA0B;IACvC,SAAgB,QAAQ,CAAC,MAAkC;QACvD,OAAO,OAAO,CAAC,aAAa,CAAe,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAC9F,CAAC;IAFe,mCAAQ,WAEvB,CAAA;IACD,SAAgB,UAAU,CAAC,MAAoB;QAC3C,OAAO,OAAO,CAAC,QAAQ,CAAe,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IACzF,CAAC;IAFe,qCAAU,aAEzB,CAAA;AACL,CAAC,EAPgB,0BAA0B,0CAA1B,0BAA0B,QAO1C;AAGD,IAAiB,kCAAkC,CAelD;AAfD,WAAiB,kCAAkC;IACxC,KAAK,UAAU,QAAQ,CAAC,cAA4D;QACvF,IAAI,cAAc,CAAC,KAAK,EAAE,CAAC;YACvB,OAAO,YAAY,CAAC,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QACtD,CAAC;QAED,OAAO,YAAY,CAAC,MAAM,CAAC;YAEvB,iCAAiC;YACjC,GAAG,cAAc,CAAC,MAAM;YAExB,+BAA+B;YAC/B,MAAM,0BAA0B,CAAC,QAAQ,CAAC,cAAc,CAAC,MAAM,CAAC;SACnE,CAAC,CAAC;IACP,CAAC;IAbqB,2CAAQ,WAa7B,CAAA;AACL,CAAC,EAfgB,kCAAkC,kDAAlC,kCAAkC,QAelD;AAGD,IAAiB,2BAA2B,CAI3C;AAJD,WAAiB,2BAA2B;IACxC,SAAgB,MAAM,CAAC,OAAwC;QAC3D,OAAO,OAAO,CAAC,kBAAkB,CAAe,MAAM,CAAC,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,CAAC;IACpG,CAAC;IAFe,kCAAM,SAErB,CAAA;AACL,CAAC,EAJgB,2BAA2B,2CAA3B,2BAA2B,QAI3C"}

package/lib/common/cancellation.d.ts

@@ -0,0 +1,25 @@
+import { Event } from './event';
+export interface CancellationToken {
+    readonly isCancellationRequested: boolean;
+    readonly onCancellationRequested: Event<void>;
+}
+export declare namespace CancellationToken {
+    const None: CancellationToken;
+    const Cancelled: CancellationToken;
+    function is(value: unknown): value is CancellationToken;
+}
+export declare class CancellationError extends Error {
+    constructor();
+}
+export declare class CancellationTokenSource {
+    private _token;
+    private _parentListener?;
+    constructor(parent?: CancellationToken);
+    get token(): CancellationToken;
+    cancel(): void;
+    dispose(): void;
+}
+export declare function cancelled(): Error;
+export declare function isCancelled(err: Error | undefined): boolean;
+export declare function checkCancelled(token?: CancellationToken): void;
+//# sourceMappingURL=cancellation.d.ts.map

package/lib/common/cancellation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cancellation.d.ts","sourceRoot":"","sources":["../../src/common/cancellation.ts"],"names":[],"mappings":"AAoBA,OAAO,EAAE,KAAK,EAAW,MAAM,SAAS,CAAC;AAIzC,MAAM,WAAW,iBAAiB;IAC9B,QAAQ,CAAC,uBAAuB,EAAE,OAAO,CAAC;IAK1C,QAAQ,CAAC,uBAAuB,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;CACjD;AAWD,yBAAiB,iBAAiB,CAAC;IAExB,MAAM,IAAI,EAAE,iBAGjB,CAAC;IAEI,MAAM,SAAS,EAAE,iBAGtB,CAAC;IAEH,SAAgB,EAAE,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,iBAAiB,CAI7D;CACJ;AAED,qBAAa,iBAAkB,SAAQ,KAAK;;CAK3C;AAuCD,qBAAa,uBAAuB;IAEhC,OAAO,CAAC,MAAM,CAAoB;IAClC,OAAO,CAAC,eAAe,CAAC,CAAyB;gBAErC,MAAM,CAAC,EAAE,iBAAiB;IAItC,IAAI,KAAK,IAAI,iBAAiB,CAO7B;IAED,MAAM,IAAI,IAAI;IAWd,OAAO,IAAI,IAAI;CAYlB;AAID,wBAAgB,SAAS,IAAI,KAAK,CAEjC;AAED,wBAAgB,WAAW,CAAC,GAAG,EAAE,KAAK,GAAG,SAAS,GAAG,OAAO,CAE3D;AAED,wBAAgB,cAAc,CAAC,KAAK,CAAC,EAAE,iBAAiB,GAAG,IAAI,CAI9D"}