@difizen/libro-common 0.3.3 → 1.0.0

package/es/common/strings.js

@@ -0,0 +1,433 @@
+/* eslint-disable no-control-regex */
+/*---------------------------------------------------------------------------------------------
+ *  Copyright (c) Microsoft Corporation. All rights reserved.
+ *  Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+import { CharCode } from "./charCode";
+export function isFalsyOrWhitespace(str) {
+  if (!str || typeof str !== 'string') {
+    return true;
+  }
+  return str.trim().length === 0;
+}
+var _formatRegexp = /{(\d+)}/g;
+
+/**
+ * Helper to produce a string with a variable number of arguments. Insert variable segments
+ * into the string using the {n} notation where N is the index of the argument following the string.
+ * @param value string to which formatting is applied
+ * @param args replacements for {n}-entries
+ */
+export function format(value) {
+  for (var _len = arguments.length, args = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {
+    args[_key - 1] = arguments[_key];
+  }
+  if (args.length === 0) {
+    return value;
+  }
+  return value.replace(_formatRegexp, function (match, group) {
+    var idx = parseInt(group, 10);
+    // eslint-disable-next-line no-restricted-globals
+    return isNaN(idx) || idx < 0 || idx >= args.length ? match : args[idx];
+  });
+}
+
+/**
+ * Converts HTML characters inside the string to use entities instead. Makes the string safe from
+ * being used e.g. in HTMLElement.innerHTML.
+ */
+export function escape(html) {
+  return html.replace(/[<>&]/g, function (match) {
+    switch (match) {
+      case '<':
+        return '&lt;';
+      case '>':
+        return '&gt;';
+      case '&':
+        return '&amp;';
+      default:
+        return match;
+    }
+  });
+}
+
+/**
+ * Escapes regular expression characters in a given string
+ */
+export function escapeRegExpCharacters(value) {
+  // eslint-disable-next-line no-useless-escape
+  return value.replace(/[\\\{\}\*\+\?\|\^\$\.\[\]\(\)]/g, '\\$&');
+}
+
+/**
+ * Counts how often `character` occurs inside `value`.
+ */
+export function count(value, character) {
+  var result = 0;
+  var ch = character.charCodeAt(0);
+  for (var i = value.length - 1; i >= 0; i--) {
+    if (value.charCodeAt(i) === ch) {
+      result++;
+    }
+  }
+  return result;
+}
+export function truncate(value, maxLength) {
+  var suffix = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : '…';
+  if (value.length <= maxLength) {
+    return value;
+  }
+  return "".concat(value.substr(0, maxLength)).concat(suffix);
+}
+
+/**
+ * Removes all occurrences of needle from the beginning and end of haystack.
+ * @param haystack string to trim
+ * @param needle the thing to trim (default is a blank)
+ */
+export function trim(haystack) {
+  var needle = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : ' ';
+  var trimmed = ltrim(haystack, needle);
+  return rtrim(trimmed, needle);
+}
+
+/**
+ * Removes all occurrences of needle from the beginning of haystack.
+ * @param haystack string to trim
+ * @param needle the thing to trim
+ */
+export function ltrim(haystack, needle) {
+  if (!haystack || !needle) {
+    return haystack;
+  }
+  var needleLen = needle.length;
+  if (needleLen === 0 || haystack.length === 0) {
+    return haystack;
+  }
+  var offset = 0;
+  while (haystack.indexOf(needle, offset) === offset) {
+    offset += needleLen;
+  }
+  return haystack.substring(offset);
+}
+
+/**
+ * Removes all occurrences of needle from the end of haystack.
+ * @param haystack string to trim
+ * @param needle the thing to trim
+ */
+export function rtrim(haystack, needle) {
+  if (!haystack || !needle) {
+    return haystack;
+  }
+  var needleLen = needle.length;
+  var haystackLen = haystack.length;
+  if (needleLen === 0 || haystackLen === 0) {
+    return haystack;
+  }
+  var offset = haystackLen;
+  var idx = -1;
+
+  // eslint-disable-next-line no-constant-condition
+  while (true) {
+    idx = haystack.lastIndexOf(needle, offset - 1);
+    if (idx === -1 || idx + needleLen !== offset) {
+      break;
+    }
+    if (idx === 0) {
+      return '';
+    }
+    offset = idx;
+  }
+  return haystack.substring(0, offset);
+}
+export function convertSimple2RegExpPattern(pattern) {
+  // eslint-disable-next-line no-useless-escape
+  return pattern
+  // eslint-disable-next-line no-useless-escape
+  .replace(/[\-\\\{\}\+\?\|\^\$\.\,\[\]\(\)\#\s]/g, '\\$&')
+  // eslint-disable-next-line no-useless-escape
+  .replace(/[\*]/g, '.*');
+}
+export function stripWildcards(pattern) {
+  return pattern.replace(/\*/g, '');
+}
+export function createRegExp(searchString, isRegex) {
+  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};
+  if (!searchString) {
+    throw new Error('Cannot create regex from empty string');
+  }
+  if (!isRegex) {
+    searchString = escapeRegExpCharacters(searchString);
+  }
+  if (options.wholeWord) {
+    if (!/\B/.test(searchString.charAt(0))) {
+      searchString = "\\b".concat(searchString);
+    }
+    if (!/\B/.test(searchString.charAt(searchString.length - 1))) {
+      searchString += '\\b';
+    }
+  }
+  var modifiers = '';
+  if (options.global) {
+    modifiers += 'g';
+  }
+  if (!options.matchCase) {
+    modifiers += 'i';
+  }
+  if (options.multiline) {
+    modifiers += 'm';
+  }
+  if (options.unicode) {
+    modifiers += 'u';
+  }
+  return new RegExp(searchString, modifiers);
+}
+export function regExpLeadsToEndlessLoop(regexp) {
+  // Exit early if it's one of these special cases which are meant to match
+  // against an empty string
+  if (regexp.source === '^' || regexp.source === '^$' || regexp.source === '$' || regexp.source === '^\\s*$') {
+    return false;
+  }
+
+  // We check against an empty string. If the regular expression doesn't advance
+  // (e.g. ends in an endless loop) it will match an empty string.
+  var match = regexp.exec('');
+  return !!(match && regexp.lastIndex === 0);
+}
+export function regExpContainsBackreference(regexpValue) {
+  return !!regexpValue.match(/([^\\]|^)(\\\\)*\\\d+/);
+}
+export function regExpFlags(regexp) {
+  return (regexp.global ? 'g' : '') + (regexp.ignoreCase ? 'i' : '') + (regexp.multiline ? 'm' : '') + (regexp /* standalone editor compilation */.unicode ? 'u' : '');
+}
+export function splitLines(str) {
+  return str.split(/\r\n|\r|\n/);
+}
+
+/**
+ * Returns first index of the string that is not whitespace.
+ * If string is empty or contains only whitespaces, returns -1
+ */
+export function firstNonWhitespaceIndex(str) {
+  for (var i = 0, len = str.length; i < len; i++) {
+    var chCode = str.charCodeAt(i);
+    if (chCode !== CharCode.Space && chCode !== CharCode.Tab) {
+      return i;
+    }
+  }
+  return -1;
+}
+
+/**
+ * Returns the leading whitespace of the string.
+ * If the string contains only whitespaces, returns entire string
+ */
+export function getLeadingWhitespace(str) {
+  var start = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;
+  var end = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : str.length;
+  for (var i = start; i < end; i++) {
+    var chCode = str.charCodeAt(i);
+    if (chCode !== CharCode.Space && chCode !== CharCode.Tab) {
+      return str.substring(start, i);
+    }
+  }
+  return str.substring(start, end);
+}
+
+/**
+ * Returns last index of the string that is not whitespace.
+ * If string is empty or contains only whitespaces, returns -1
+ */
+export function lastNonWhitespaceIndex(str) {
+  var startIndex = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : str.length - 1;
+  for (var i = startIndex; i >= 0; i--) {
+    var chCode = str.charCodeAt(i);
+    if (chCode !== CharCode.Space && chCode !== CharCode.Tab) {
+      return i;
+    }
+  }
+  return -1;
+}
+export function compare(a, b) {
+  if (a < b) {
+    return -1;
+  }
+  if (a > b) {
+    return 1;
+  }
+  return 0;
+}
+export function compareSubstring(a, b) {
+  var aStart = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
+  var aEnd = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : a.length;
+  var bStart = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : 0;
+  var bEnd = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : b.length;
+  for (; aStart < aEnd && bStart < bEnd; aStart++, bStart++) {
+    var codeA = a.charCodeAt(aStart);
+    var codeB = b.charCodeAt(bStart);
+    if (codeA < codeB) {
+      return -1;
+    }
+    if (codeA > codeB) {
+      return 1;
+    }
+  }
+  var aLen = aEnd - aStart;
+  var bLen = bEnd - bStart;
+  if (aLen < bLen) {
+    return -1;
+  }
+  if (aLen > bLen) {
+    return 1;
+  }
+  return 0;
+}
+export function compareIgnoreCase(a, b) {
+  return compareSubstringIgnoreCase(a, b, 0, a.length, 0, b.length);
+}
+export function compareSubstringIgnoreCase(a, b) {
+  var aStart = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 0;
+  var aEnd = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : a.length;
+  var bStart = arguments.length > 4 && arguments[4] !== undefined ? arguments[4] : 0;
+  var bEnd = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : b.length;
+  for (; aStart < aEnd && bStart < bEnd; aStart++, bStart++) {
+    var codeA = a.charCodeAt(aStart);
+    var codeB = b.charCodeAt(bStart);
+    if (codeA === codeB) {
+      // equal
+      continue;
+    }
+    var diff = codeA - codeB;
+    if (diff === 32 && isUpperAsciiLetter(codeB)) {
+      //codeB =[65-90] && codeA =[97-122]
+      continue;
+    } else if (diff === -32 && isUpperAsciiLetter(codeA)) {
+      //codeB =[97-122] && codeA =[65-90]
+      continue;
+    }
+    if (isLowerAsciiLetter(codeA) && isLowerAsciiLetter(codeB)) {
+      //
+      return diff;
+    }
+    return compareSubstring(a.toLowerCase(), b.toLowerCase(), aStart, aEnd, bStart, bEnd);
+  }
+  var aLen = aEnd - aStart;
+  var bLen = bEnd - bStart;
+  if (aLen < bLen) {
+    return -1;
+  }
+  if (aLen > bLen) {
+    return 1;
+  }
+  return 0;
+}
+export function isLowerAsciiLetter(code) {
+  return code >= CharCode.a && code <= CharCode.z;
+}
+export function isUpperAsciiLetter(code) {
+  return code >= CharCode.A && code <= CharCode.Z;
+}
+function isAsciiLetter(code) {
+  return isLowerAsciiLetter(code) || isUpperAsciiLetter(code);
+}
+export function equalsIgnoreCase(a, b) {
+  return a.length === b.length && doEqualsIgnoreCase(a, b);
+}
+function doEqualsIgnoreCase(a, b) {
+  var stopAt = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : a.length;
+  for (var i = 0; i < stopAt; i++) {
+    var codeA = a.charCodeAt(i);
+    var codeB = b.charCodeAt(i);
+    if (codeA === codeB) {
+      continue;
+    }
+
+    // a-z A-Z
+    if (isAsciiLetter(codeA) && isAsciiLetter(codeB)) {
+      var diff = Math.abs(codeA - codeB);
+      if (diff !== 0 && diff !== 32) {
+        return false;
+      }
+    }
+
+    // Any other charcode
+    else if (String.fromCharCode(codeA).toLowerCase() !== String.fromCharCode(codeB).toLowerCase()) {
+      return false;
+    }
+  }
+  return true;
+}
+export function startsWithIgnoreCase(str, candidate) {
+  var candidateLength = candidate.length;
+  if (candidate.length > str.length) {
+    return false;
+  }
+  return doEqualsIgnoreCase(str, candidate, candidateLength);
+}
+
+/**
+ * @returns the length of the common prefix of the two strings.
+ */
+export function commonPrefixLength(a, b) {
+  var i;
+  var len = Math.min(a.length, b.length);
+  for (i = 0; i < len; i++) {
+    if (a.charCodeAt(i) !== b.charCodeAt(i)) {
+      return i;
+    }
+  }
+  return len;
+}
+
+/**
+ * @returns the length of the common suffix of the two strings.
+ */
+export function commonSuffixLength(a, b) {
+  var i;
+  var len = Math.min(a.length, b.length);
+  var aLastIndex = a.length - 1;
+  var bLastIndex = b.length - 1;
+  for (i = 0; i < len; i++) {
+    if (a.charCodeAt(aLastIndex - i) !== b.charCodeAt(bLastIndex - i)) {
+      return i;
+    }
+  }
+  return len;
+}
+
+/**
+ * See http://en.wikipedia.org/wiki/Surrogate_pair
+ */
+export function isHighSurrogate(charCode) {
+  return charCode >= 0xd800 && charCode <= 0xdbff;
+}
+
+/**
+ * See http://en.wikipedia.org/wiki/Surrogate_pair
+ */
+export function isLowSurrogate(charCode) {
+  return charCode >= 0xdc00 && charCode <= 0xdfff;
+}
+
+/**
+ * See http://en.wikipedia.org/wiki/Surrogate_pair
+ */
+export function computeCodePoint(highSurrogate, lowSurrogate) {
+  return (highSurrogate - 0xd800 << 10) + (lowSurrogate - 0xdc00) + 0x10000;
+}
+
+/**
+ * get the code point that begins at offset `offset`
+ */
+export function getNextCodePoint(str, len, offset) {
+  var charCode = str.charCodeAt(offset);
+  if (isHighSurrogate(charCode) && offset + 1 < len) {
+    var nextCharCode = str.charCodeAt(offset + 1);
+    if (isLowSurrogate(nextCharCode)) {
+      return computeCodePoint(charCode, nextCharCode);
+    }
+  }
+  return charCode;
+}

package/es/common/types.d.ts

@@ -0,0 +1,16 @@
+export type Mutable<T> = {
+    -readonly [P in keyof T]: T[P];
+};
+export type RecursivePartial<T> = {
+    [P in keyof T]?: T[P] extends (infer I)[] ? RecursivePartial<I>[] : RecursivePartial<T[P]>;
+};
+export type MaybeArray<T> = T | T[];
+export type MaybePromise<T> = T | PromiseLike<T>;
+export type Newable<T> = new (...args: any[]) => T;
+export type Abstract<T> = {
+    prototype: T;
+};
+export declare function toArray<T>(v: MaybeArray<T>): T[];
+export declare function isPromise(obj: any): obj is Promise<any>;
+export declare function isPromiseLike<T>(obj: MaybePromise<T>): obj is PromiseLike<T>;
+//# sourceMappingURL=types.d.ts.map

package/es/common/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/common/types.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,OAAO,CAAC,CAAC,IAAI;IAAE,CAAC,UAAU,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;CAAE,CAAC;AAC5D,MAAM,MAAM,gBAAgB,CAAC,CAAC,IAAI;KAC/B,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,GACrC,gBAAgB,CAAC,CAAC,CAAC,EAAE,GACrB,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CAC3B,CAAC;AACF,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;AACpC,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;AACjD,MAAM,MAAM,OAAO,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;AACnD,MAAM,MAAM,QAAQ,CAAC,CAAC,IAAI;IACxB,SAAS,EAAE,CAAC,CAAC;CACd,CAAC;AAEF,wBAAgB,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAKhD;AAED,wBAAgB,SAAS,CAAC,GAAG,EAAE,GAAG,GAAG,GAAG,IAAI,OAAO,CAAC,GAAG,CAAC,CAMvD;AACD,wBAAgB,aAAa,CAAC,CAAC,EAAE,GAAG,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAE5E"}

package/es/common/types.js

@@ -0,0 +1,13 @@
+function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
+export function toArray(v) {
+  if (Array.isArray(v)) {
+    return v;
+  }
+  return [v];
+}
+export function isPromise(obj) {
+  return !!obj && (_typeof(obj) === 'object' || typeof obj === 'function') && typeof obj.then === 'function';
+}
+export function isPromiseLike(obj) {
+  return isPromise(obj);
+}

package/es/common/uint.d.ts

@@ -0,0 +1,32 @@
+export declare enum Constants {
+    /**
+     * MAX SMI (SMall Integer) as defined in v8.
+     * one bit is lost for boxing/unboxing flag.
+     * one bit is lost for sign flag.
+     * See https://thibaultlaurens.github.io/javascript/2013/04/29/how-the-v8-engine-works/#tagged-values
+     */
+    MAX_SAFE_SMALL_INTEGER = 1073741824,
+    /**
+     * MIN SMI (SMall Integer) as defined in v8.
+     * one bit is lost for boxing/unboxing flag.
+     * one bit is lost for sign flag.
+     * See https://thibaultlaurens.github.io/javascript/2013/04/29/how-the-v8-engine-works/#tagged-values
+     */
+    MIN_SAFE_SMALL_INTEGER = -1073741824,
+    /**
+     * Max unsigned integer that fits on 8 bits.
+     */
+    MAX_UINT_8 = 255,
+    /**
+     * Max unsigned integer that fits on 16 bits.
+     */
+    MAX_UINT_16 = 65535,
+    /**
+     * Max unsigned integer that fits on 32 bits.
+     */
+    MAX_UINT_32 = 4294967295,
+    UNICODE_SUPPLEMENTARY_PLANE_BEGIN = 65536
+}
+export declare function toUint8(v: number): number;
+export declare function toUint32(v: number): number;
+//# sourceMappingURL=uint.d.ts.map

package/es/common/uint.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"uint.d.ts","sourceRoot":"","sources":["../../src/common/uint.ts"],"names":[],"mappings":"AAKA,oBAAY,SAAS;IACnB;;;;;OAKG;IACH,sBAAsB,aAAU;IAEhC;;;;;OAKG;IACH,sBAAsB,cAAa;IAEnC;;OAEG;IACH,UAAU,MAAM;IAEhB;;OAEG;IACH,WAAW,QAAQ;IAEnB;;OAEG;IACH,WAAW,aAAa;IAExB,iCAAiC,QAAW;CAC7C;AAED,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAQzC;AAED,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAQ1C"}

package/es/common/uint.js

@@ -0,0 +1,56 @@
+/*---------------------------------------------------------------------------------------------
+ *  Copyright (c) Microsoft Corporation. All rights reserved.
+ *  Licensed under the MIT License. See License.txt in the project root for license information.
+ *--------------------------------------------------------------------------------------------*/
+
+export var Constants = /*#__PURE__*/function (Constants) {
+  /**
+   * MAX SMI (SMall Integer) as defined in v8.
+   * one bit is lost for boxing/unboxing flag.
+   * one bit is lost for sign flag.
+   * See https://thibaultlaurens.github.io/javascript/2013/04/29/how-the-v8-engine-works/#tagged-values
+   */
+  Constants[Constants["MAX_SAFE_SMALL_INTEGER"] = 1073741824] = "MAX_SAFE_SMALL_INTEGER";
+  /**
+   * MIN SMI (SMall Integer) as defined in v8.
+   * one bit is lost for boxing/unboxing flag.
+   * one bit is lost for sign flag.
+   * See https://thibaultlaurens.github.io/javascript/2013/04/29/how-the-v8-engine-works/#tagged-values
+   */
+  Constants[Constants["MIN_SAFE_SMALL_INTEGER"] = -1073741824] = "MIN_SAFE_SMALL_INTEGER";
+  /**
+   * Max unsigned integer that fits on 8 bits.
+   */
+  Constants[Constants["MAX_UINT_8"] = 255] = "MAX_UINT_8";
+  // 2^8 - 1
+  /**
+   * Max unsigned integer that fits on 16 bits.
+   */
+  Constants[Constants["MAX_UINT_16"] = 65535] = "MAX_UINT_16";
+  // 2^16 - 1
+  /**
+   * Max unsigned integer that fits on 32 bits.
+   */
+  Constants[Constants["MAX_UINT_32"] = 4294967295] = "MAX_UINT_32";
+  // 2^32 - 1
+  Constants[Constants["UNICODE_SUPPLEMENTARY_PLANE_BEGIN"] = 65536] = "UNICODE_SUPPLEMENTARY_PLANE_BEGIN";
+  return Constants;
+}({});
+export function toUint8(v) {
+  if (v < 0) {
+    return 0;
+  }
+  if (v > Constants.MAX_UINT_8) {
+    return Constants.MAX_UINT_8;
+  }
+  return v | 0;
+}
+export function toUint32(v) {
+  if (v < 0) {
+    return 0;
+  }
+  if (v > Constants.MAX_UINT_32) {
+    return Constants.MAX_UINT_32;
+  }
+  return v | 0;
+}

package/es/common/uri.d.ts

@@ -0,0 +1,56 @@
+import { Path } from './path';
+import { URI as Uri } from './vscode-uri/uri';
+export declare class URI {
+    private readonly codeUri;
+    private _path;
+    constructor(uri?: string | Uri, options?: {
+        simpleMode: boolean;
+    });
+    get parent(): URI;
+    relative(uri: URI): Path | undefined;
+    /**
+     * return a new URI replacing the current with its normalized path, resolving '..' and '.' segments
+     */
+    normalizePath(): URI;
+    get displayName(): string;
+    get scheme(): string;
+    get authority(): string;
+    get path(): Path;
+    get query(): string;
+    get fragment(): string;
+    toString(skipEncoding?: boolean): string;
+    toJSON(): any;
+    equals(uri: URI, caseSensitive?: boolean): boolean;
+    includes(uri: URI, caseSensitive?: boolean): boolean;
+    sameOrigin(uri: URI): boolean;
+    static resolve(uri: URI, path: string | Path): URI;
+    /**
+     * return a new URI replacing the current with the given scheme
+     */
+    static withScheme(uri: URI, scheme: string): URI;
+    /**
+     * return a new URI replacing the current with the given authority
+     */
+    static withAuthority(uri: URI, authority?: string): URI;
+    /**
+     * return a new URI replacing the current with the given path
+     */
+    static withPath(uri: URI, path?: string | Path): URI;
+    /**
+     * return a new URI replacing the current with the given query
+     */
+    static withQuery(uri: URI, query?: string): URI;
+    /**
+     * return a new URI replacing the current with the given fragment
+     */
+    static withFragment(uri: URI, fragment?: string): URI;
+    static sameOrigin(uriA: URI, uriB: URI): boolean;
+    static isEqualOrParent(uriA: URI, uriB: URI, caseSensitive?: boolean): boolean;
+    getParsedQuery(): {
+        [key: string]: string;
+    };
+    static stringifyQuery(query: {
+        [key: string]: any;
+    }): string;
+}
+//# sourceMappingURL=uri.d.ts.map

package/es/common/uri.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"uri.d.ts","sourceRoot":"","sources":["../../src/common/uri.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,GAAG,IAAI,GAAG,EAAE,MAAM,kBAAkB,CAAC;AAE9C,qBAAa,GAAG;IACd,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAM;IAC9B,OAAO,CAAC,KAAK,CAAmB;gBAEpB,GAAG,GAAE,MAAM,GAAG,GAAQ,EAAE,OAAO,CAAC,EAAE;QAAE,UAAU,EAAE,OAAO,CAAA;KAAE;IAQrE,IAAI,MAAM,IAAI,GAAG,CAKhB;IAED,QAAQ,CAAC,GAAG,EAAE,GAAG,GAAG,IAAI,GAAG,SAAS;IAOpC;;OAEG;IACH,aAAa,IAAI,GAAG;IAIpB,IAAI,WAAW,IAAI,MAAM,CASxB;IAED,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED,IAAI,SAAS,IAAI,MAAM,CAEtB;IAED,IAAI,IAAI,IAAI,IAAI,CAKf;IAED,IAAI,KAAK,IAAI,MAAM,CAElB;IAED,IAAI,QAAQ,IAAI,MAAM,CAErB;IAED,QAAQ,CAAC,YAAY,CAAC,EAAE,OAAO,GAAG,MAAM;IAIxC,MAAM,IAAI,GAAG;IAOb,MAAM,CAAC,GAAG,EAAE,GAAG,EAAE,aAAa,UAAO,GAAG,OAAO;IAU/C,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,aAAa,UAAO,GAAG,OAAO;IAajD,UAAU,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO;IAI7B,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,GAAG,GAAG;IAIlD;;OAEG;IACH,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,GAAG,GAAG;IAQhD;;OAEG;IACH,MAAM,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,SAAS,SAAK,GAAG,GAAG;IAQnD;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,GAAE,MAAM,GAAG,IAAS,GAAG,GAAG;IAQxD;;OAEG;IACH,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,SAAK,GAAG,GAAG;IAQ3C;;OAEG;IACH,MAAM,CAAC,YAAY,CAAC,GAAG,EAAE,GAAG,EAAE,QAAQ,SAAK,GAAG,GAAG;IAQjD,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,GAAG,OAAO;IAIhD,MAAM,CAAC,eAAe,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,aAAa,UAAO,GAAG,OAAO;IAa3E,cAAc,IAAI;QAAE,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAAA;KAAE;IAa3C,MAAM,CAAC,cAAc,CAAC,KAAK,EAAE;QAAE,CAAC,GAAG,EAAE,MAAM,GAAG,GAAG,CAAA;KAAE,GAAG,MAAM;CAU7D"}