@pokash/n8n-nodes-ksef 0.2.15 → 0.2.16

package/node_modules/@oozcitak/infra/lib/String.js

@@ -0,0 +1,472 @@
+"use strict";
+var __values = (this && this.__values) || function(o) {
+    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
+    if (m) return m.call(o);
+    if (o && typeof o.length === "number") return {
+        next: function () {
+            if (o && i >= o.length) o = void 0;
+            return { value: o && o[i++], done: !o };
+        }
+    };
+    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var CodePoints_1 = require("./CodePoints");
+var ByteSequence_1 = require("./ByteSequence");
+var Byte_1 = require("./Byte");
+var util_1 = require("@oozcitak/util");
+/**
+ * Determines if the string `a` is a code unit prefix of string `b`.
+ *
+ * @param a - a string
+ * @param b - a string
+ */
+function isCodeUnitPrefix(a, b) {
+    /**
+     * 1. Let i be 0.
+     * 2. While true:
+     * 2.1. Let aCodeUnit be the ith code unit of a if i is less than a’s length;
+     * otherwise null.
+     * 2.2. Let bCodeUnit be the ith code unit of b if i is less than b’s length;
+     * otherwise null.
+     * 2.3. If bCodeUnit is null, then return true.
+     * 2.4. Return false if aCodeUnit is different from bCodeUnit.
+     * 2.5. Set i to i + 1.
+     */
+    var i = 0;
+    while (true) {
+        var aCodeUnit = i < a.length ? a.charCodeAt(i) : null;
+        var bCodeUnit = i < b.length ? b.charCodeAt(i) : null;
+        if (aCodeUnit === null)
+            return true;
+        if (aCodeUnit !== bCodeUnit)
+            return false;
+        i++;
+    }
+}
+exports.isCodeUnitPrefix = isCodeUnitPrefix;
+/**
+ * Determines if the string `a` is a code unit less than string `b`.
+ *
+ * @param a - a string
+ * @param b - a string
+ */
+function isCodeUnitLessThan(a, b) {
+    /**
+     * 1. If b is a code unit prefix of a, then return false.
+     * 2. If a is a code unit prefix of b, then return true.
+     * 3. Let n be the smallest index such that the nth code unit of a is
+     * different from the nth code unit of b. (There has to be such an index,
+     * since neither string is a prefix of the other.)
+     * 4. If the nth code unit of a is less than the nth code unit of b, then
+     * return true.
+     * 5. Return false.
+     */
+    if (isCodeUnitPrefix(b, a))
+        return false;
+    if (isCodeUnitPrefix(a, b))
+        return true;
+    for (var i = 0; i < Math.min(a.length, b.length); i++) {
+        var aCodeUnit = a.charCodeAt(i);
+        var bCodeUnit = b.charCodeAt(i);
+        if (aCodeUnit === bCodeUnit)
+            continue;
+        return (aCodeUnit < bCodeUnit);
+    }
+    /* istanbul ignore next */
+    return false;
+}
+exports.isCodeUnitLessThan = isCodeUnitLessThan;
+/**
+ * Isomorphic encodes the given string.
+ *
+ * @param str - a string
+ */
+function isomorphicEncode(str) {
+    var e_1, _a;
+    /**
+     * 1. Assert: input contains no code points greater than U+00FF.
+     * 2. Return a byte sequence whose length is equal to input’s length and whose
+     * bytes have the same values as input’s code points, in the same order.
+     */
+    var codePoints = Array.from(str);
+    var bytes = new Uint8Array(codePoints.length);
+    var i = 0;
+    try {
+        for (var str_1 = __values(str), str_1_1 = str_1.next(); !str_1_1.done; str_1_1 = str_1.next()) {
+            var codePoint = str_1_1.value;
+            var byte = codePoint.codePointAt(0);
+            console.assert(byte !== undefined && byte <= 0x00FF, "isomorphicEncode requires string bytes to be less than or equal to 0x00FF.");
+            if (byte !== undefined && byte <= 0x00FF) {
+                bytes[i++] = byte;
+            }
+        }
+    }
+    catch (e_1_1) { e_1 = { error: e_1_1 }; }
+    finally {
+        try {
+            if (str_1_1 && !str_1_1.done && (_a = str_1.return)) _a.call(str_1);
+        }
+        finally { if (e_1) throw e_1.error; }
+    }
+    return bytes;
+}
+exports.isomorphicEncode = isomorphicEncode;
+/**
+ * Determines if the given string is An ASCII string.
+ *
+ * @param str - a string
+ */
+function isASCIIString(str) {
+    /**
+     * An ASCII string is a string whose code points are all ASCII code points.
+     */
+    return /^[\u0000-\u007F]*$/.test(str);
+}
+exports.isASCIIString = isASCIIString;
+/**
+ * Converts all uppercase ASCII code points to lowercase.
+ *
+ * @param str - a string
+ */
+function asciiLowercase(str) {
+    var e_2, _a;
+    /**
+     * To ASCII lowercase a string, replace all ASCII upper alphas in the string
+     * with their corresponding code point in ASCII lower alpha.
+     */
+    var result = "";
+    try {
+        for (var str_2 = __values(str), str_2_1 = str_2.next(); !str_2_1.done; str_2_1 = str_2.next()) {
+            var c = str_2_1.value;
+            var code = c.codePointAt(0);
+            if (code !== undefined && code >= 0x41 && code <= 0x5A) {
+                result += String.fromCodePoint(code + 0x20);
+            }
+            else {
+                result += c;
+            }
+        }
+    }
+    catch (e_2_1) { e_2 = { error: e_2_1 }; }
+    finally {
+        try {
+            if (str_2_1 && !str_2_1.done && (_a = str_2.return)) _a.call(str_2);
+        }
+        finally { if (e_2) throw e_2.error; }
+    }
+    return result;
+}
+exports.asciiLowercase = asciiLowercase;
+/**
+ * Converts all uppercase ASCII code points to uppercase.
+ *
+ * @param str - a string
+ */
+function asciiUppercase(str) {
+    var e_3, _a;
+    /**
+     * To ASCII uppercase a string, replace all ASCII lower alphas in the string
+     * with their corresponding code point in ASCII upper alpha.
+     */
+    var result = "";
+    try {
+        for (var str_3 = __values(str), str_3_1 = str_3.next(); !str_3_1.done; str_3_1 = str_3.next()) {
+            var c = str_3_1.value;
+            var code = c.codePointAt(0);
+            if (code !== undefined && code >= 0x61 && code <= 0x7A) {
+                result += String.fromCodePoint(code - 0x20);
+            }
+            else {
+                result += c;
+            }
+        }
+    }
+    catch (e_3_1) { e_3 = { error: e_3_1 }; }
+    finally {
+        try {
+            if (str_3_1 && !str_3_1.done && (_a = str_3.return)) _a.call(str_3);
+        }
+        finally { if (e_3) throw e_3.error; }
+    }
+    return result;
+}
+exports.asciiUppercase = asciiUppercase;
+/**
+ * Compares two ASCII strings case-insensitively.
+ *
+ * @param a - a string
+ * @param b - a string
+ */
+function asciiCaseInsensitiveMatch(a, b) {
+    /**
+     * A string A is an ASCII case-insensitive match for a string B, if the ASCII
+     * lowercase of A is the ASCII lowercase of B.
+     */
+    return asciiLowercase(a) === asciiLowercase(b);
+}
+exports.asciiCaseInsensitiveMatch = asciiCaseInsensitiveMatch;
+/**
+ * ASCII encodes a string.
+ *
+ * @param str - a string
+ */
+function asciiEncode(str) {
+    /**
+     * 1. Assert: input is an ASCII string.
+     * 2. Return the isomorphic encoding of input.
+     */
+    console.assert(isASCIIString(str), "asciiEncode requires an ASCII string.");
+    return isomorphicEncode(str);
+}
+exports.asciiEncode = asciiEncode;
+/**
+ * ASCII decodes a byte sequence.
+ *
+ * @param bytes - a byte sequence
+ */
+function asciiDecode(bytes) {
+    var e_4, _a;
+    try {
+        /**
+         * 1. Assert: All bytes in input are ASCII bytes.
+         * 2. Return the isomorphic decoding of input.
+         */
+        for (var bytes_1 = __values(bytes), bytes_1_1 = bytes_1.next(); !bytes_1_1.done; bytes_1_1 = bytes_1.next()) {
+            var byte = bytes_1_1.value;
+            console.assert(Byte_1.isASCIIByte(byte), "asciiDecode requires an ASCII byte sequence.");
+        }
+    }
+    catch (e_4_1) { e_4 = { error: e_4_1 }; }
+    finally {
+        try {
+            if (bytes_1_1 && !bytes_1_1.done && (_a = bytes_1.return)) _a.call(bytes_1);
+        }
+        finally { if (e_4) throw e_4.error; }
+    }
+    return ByteSequence_1.isomorphicDecode(bytes);
+}
+exports.asciiDecode = asciiDecode;
+/**
+ * Strips newline characters from a string.
+ *
+ * @param str - a string
+ */
+function stripNewlines(str) {
+    /**
+     * To strip newlines from a string, remove any U+000A LF and U+000D CR code
+     * points from the string.
+     */
+    return str.replace(/[\n\r]/g, "");
+}
+exports.stripNewlines = stripNewlines;
+/**
+ * Normalizes newline characters in a string by converting consecutive
+ * carriage-return newline characters and also single carriage return characters
+ * into a single newline.
+ *
+ * @param str - a string
+ */
+function normalizeNewlines(str) {
+    /**
+     * To normalize newlines in a string, replace every U+000D CR U+000A LF code
+     * point pair with a single U+000A LF code point, and then replace every
+     * remaining U+000D CR code point with a U+000A LF code point.
+     */
+    return str.replace(/\r\n/g, "\n").replace(/\r/g, "\n");
+}
+exports.normalizeNewlines = normalizeNewlines;
+/**
+ * Removes leading and trailing whitespace characters from a string.
+ *
+ * @param str - a string
+ */
+function stripLeadingAndTrailingASCIIWhitespace(str) {
+    /**
+     * To strip leading and trailing ASCII whitespace from a string, remove all
+     * ASCII whitespace that are at the start or the end of the string.
+     */
+    return str.replace(/^[\t\n\f\r ]+/, "").replace(/[\t\n\f\r ]+$/, "");
+}
+exports.stripLeadingAndTrailingASCIIWhitespace = stripLeadingAndTrailingASCIIWhitespace;
+/**
+ * Removes consecutive newline characters from a string.
+ *
+ * @param str - a string
+ */
+function stripAndCollapseASCIIWhitespace(str) {
+    /**
+     * To strip and collapse ASCII whitespace in a string, replace any sequence of
+     * one or more consecutive code points that are ASCII whitespace in the string
+     * with a single U+0020 SPACE code point, and then remove any leading and
+     * trailing ASCII whitespace from that string.
+     */
+    return stripLeadingAndTrailingASCIIWhitespace(str.replace(/[\t\n\f\r ]{2,}/g, " "));
+}
+exports.stripAndCollapseASCIIWhitespace = stripAndCollapseASCIIWhitespace;
+/**
+ * Collects a sequence of code points matching a given condition from the input
+ * string.
+ *
+ * @param condition - a condition to match
+ * @param input - a string
+ * @param options - starting position
+ */
+function collectASequenceOfCodePoints(condition, input, options) {
+    /**
+     * 1. Let result be the empty string.
+     * 2. While position doesn’t point past the end of input and the code point at
+     * position within input meets the condition condition:
+     * 2.1. Append that code point to the end of result.
+     * 2.2. Advance position by 1.
+     * 3. Return result.
+     */
+    if (!util_1.isArray(input))
+        return collectASequenceOfCodePoints(condition, Array.from(input), options);
+    var result = "";
+    while (options.position < input.length && !!condition.call(null, input[options.position])) {
+        result += input[options.position];
+        options.position++;
+    }
+    return result;
+}
+exports.collectASequenceOfCodePoints = collectASequenceOfCodePoints;
+/**
+ * Skips over ASCII whitespace.
+ *
+ * @param input - input string
+ * @param options - starting position
+ */
+function skipASCIIWhitespace(input, options) {
+    /**
+     * To skip ASCII whitespace within a string input given a position variable
+     * position, collect a sequence of code points that are ASCII whitespace from
+     * input given position. The collected code points are not used, but position
+     * is still updated.
+     */
+    collectASequenceOfCodePoints(function (str) { return CodePoints_1.ASCIIWhiteSpace.test(str); }, input, options);
+}
+exports.skipASCIIWhitespace = skipASCIIWhitespace;
+/**
+ * Solits a string at the given delimiter.
+ *
+ * @param input - input string
+ * @param delimiter - a delimiter string
+ */
+function strictlySplit(input, delimiter) {
+    /**
+     * 1. Let position be a position variable for input, initially pointing at the
+     * start of input.
+     * 2. Let tokens be a list of strings, initially empty.
+     * 3. Let token be the result of collecting a sequence of code points that are
+     * not equal to delimiter from input, given position.
+     * 4. Append token to tokens.
+     * 5. While position is not past the end of input:
+     * 5.1. Assert: the code point at position within input is delimiter.
+     * 5.2. Advance position by 1.
+     * 5.3. Let token be the result of collecting a sequence of code points that
+     * are not equal to delimiter from input, given position.
+     * 5.4. Append token to tokens.
+     * 6. Return tokens.
+     */
+    if (!util_1.isArray(input))
+        return strictlySplit(Array.from(input), delimiter);
+    var options = { position: 0 };
+    var tokens = [];
+    var token = collectASequenceOfCodePoints(function (str) { return delimiter !== str; }, input, options);
+    tokens.push(token);
+    while (options.position < input.length) {
+        console.assert(input[options.position] === delimiter, "strictlySplit found no delimiter in input string.");
+        options.position++;
+        token = collectASequenceOfCodePoints(function (str) { return delimiter !== str; }, input, options);
+        tokens.push(token);
+    }
+    return tokens;
+}
+exports.strictlySplit = strictlySplit;
+/**
+ * Splits a string on ASCII whitespace.
+ *
+ * @param input - a string
+ */
+function splitAStringOnASCIIWhitespace(input) {
+    /**
+     * 1. Let position be a position variable for input, initially pointing at the
+     * start of input.
+     * 2. Let tokens be a list of strings, initially empty.
+     * 3. Skip ASCII whitespace within input given position.
+     * 4. While position is not past the end of input:
+     * 4.1. Let token be the result of collecting a sequence of code points that
+     * are not ASCII whitespace from input, given position.
+     * 4.2. Append token to tokens.
+     * 4.3. Skip ASCII whitespace within input given position.
+     * 5. Return tokens.
+     */
+    if (!util_1.isArray(input))
+        return splitAStringOnASCIIWhitespace(Array.from(input));
+    var options = { position: 0 };
+    var tokens = [];
+    skipASCIIWhitespace(input, options);
+    while (options.position < input.length) {
+        var token = collectASequenceOfCodePoints(function (str) { return !CodePoints_1.ASCIIWhiteSpace.test(str); }, input, options);
+        tokens.push(token);
+        skipASCIIWhitespace(input, options);
+    }
+    return tokens;
+}
+exports.splitAStringOnASCIIWhitespace = splitAStringOnASCIIWhitespace;
+/**
+ * Splits a string on commas.
+ *
+ * @param input - a string
+ */
+function splitAStringOnCommas(input) {
+    /**
+     * 1. Let position be a position variable for input, initially pointing at the
+     * start of input.
+     * 2. Let tokens be a list of strings, initially empty.
+     * 3. While position is not past the end of input:
+     * 3.1. Let token be the result of collecting a sequence of code points that
+     * are not U+002C (,) from input, given position.
+     * 3.2. Strip leading and trailing ASCII whitespace from token.
+     * 3.3. Append token to tokens.
+     * 3.4. If position is not past the end of input, then:
+     * 3.4.1. Assert: the code point at position within input is U+002C (,).
+     * 3.4.2. Advance position by 1.
+     * 4. Return tokens.
+     */
+    if (!util_1.isArray(input))
+        return splitAStringOnCommas(Array.from(input));
+    var options = { position: 0 };
+    var tokens = [];
+    while (options.position < input.length) {
+        var token = collectASequenceOfCodePoints(function (str) { return str !== ','; }, input, options);
+        tokens.push(stripLeadingAndTrailingASCIIWhitespace(token));
+        if (options.position < input.length) {
+            console.assert(input[options.position] === ',', "splitAStringOnCommas found no delimiter in input string.");
+            options.position++;
+        }
+    }
+    return tokens;
+}
+exports.splitAStringOnCommas = splitAStringOnCommas;
+/**
+ * Concatenates a list of strings with the given separator.
+ *
+ * @param list - a list of strings
+ * @param separator - a separator string
+ */
+function concatenate(list, separator) {
+    if (separator === void 0) { separator = ""; }
+    /**
+     * 1. If list is empty, then return the empty string.
+     * 2. If separator is not given, then set separator to the empty string.
+     * 3. Return a string whose contents are list’s items, in order, separated
+     * from each other by separator.
+     */
+    if (list.length === 0)
+        return "";
+    return list.join(separator);
+}
+exports.concatenate = concatenate;
+//# sourceMappingURL=String.js.map

package/node_modules/@oozcitak/infra/lib/String.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"String.js","sourceRoot":"","sources":["../src/String.ts"],"names":[],"mappings":";;;;;;;;;;;;;AAAA,2CAA+C;AAC/C,+CAAiD;AACjD,+BAAoC;AACpC,uCAAwC;AAExC;;;;;GAKG;AACH,SAAgB,gBAAgB,CAAC,CAAS,EAAE,CAAS;IACnD;;;;;;;;;;OAUG;IACH,IAAI,CAAC,GAAG,CAAC,CAAA;IACT,OAAO,IAAI,EAAE;QACX,IAAM,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;QACvD,IAAM,SAAS,GAAG,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;QACvD,IAAI,SAAS,KAAK,IAAI;YAAE,OAAO,IAAI,CAAA;QACnC,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,KAAK,CAAA;QACzC,CAAC,EAAE,CAAA;KACJ;AACH,CAAC;AApBD,4CAoBC;AAED;;;;;GAKG;AACH,SAAgB,kBAAkB,CAAC,CAAS,EAAE,CAAS;IACrD;;;;;;;;;OASG;IACH,IAAI,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC;QAAE,OAAO,KAAK,CAAA;IACxC,IAAI,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC;QAAE,OAAO,IAAI,CAAA;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE;QACrD,IAAM,SAAS,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;QACjC,IAAM,SAAS,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;QACjC,IAAI,SAAS,KAAK,SAAS;YAAE,SAAQ;QACrC,OAAO,CAAC,SAAS,GAAG,SAAS,CAAC,CAAA;KAC/B;IACD,0BAA0B;IAC1B,OAAO,KAAK,CAAA;AACd,CAAC;AArBD,gDAqBC;AAED;;;;GAIG;AACH,SAAgB,gBAAgB,CAAC,GAAW;;IAC1C;;;;OAIG;IACH,IAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IAClC,IAAM,KAAK,GAAG,IAAI,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC,CAAA;IAC/C,IAAI,CAAC,GAAG,CAAC,CAAA;;QACT,KAAwB,IAAA,QAAA,SAAA,GAAG,CAAA,wBAAA,yCAAE;YAAxB,IAAM,SAAS,gBAAA;YAClB,IAAM,IAAI,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAA;YACrC,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,IAAI,MAAM,EAAE,4EAA4E,CAAC,CAAA;YAClI,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,IAAI,MAAM,EAAE;gBACxC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAA;aAClB;SACF;;;;;;;;;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAjBD,4CAiBC;AAED;;;;GAIG;AACH,SAAgB,aAAa,CAAC,GAAW;IACvC;;OAEG;IACH,OAAO,oBAAoB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AACvC,CAAC;AALD,sCAKC;AAED;;;;GAIG;AACH,SAAgB,cAAc,CAAC,GAAW;;IACxC;;;OAGG;IACH,IAAI,MAAM,GAAG,EAAE,CAAA;;QACf,KAAgB,IAAA,QAAA,SAAA,GAAG,CAAA,wBAAA,yCAAE;YAAhB,IAAM,CAAC,gBAAA;YACV,IAAM,IAAI,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAA;YAC7B,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;gBACtD,MAAM,IAAI,MAAM,CAAC,aAAa,CAAC,IAAI,GAAG,IAAI,CAAC,CAAA;aAC5C;iBAAM;gBACL,MAAM,IAAI,CAAC,CAAA;aACZ;SACF;;;;;;;;;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAfD,wCAeC;AAED;;;;GAIG;AACH,SAAgB,cAAc,CAAC,GAAW;;IACxC;;;OAGG;IACH,IAAI,MAAM,GAAG,EAAE,CAAA;;QACf,KAAgB,IAAA,QAAA,SAAA,GAAG,CAAA,wBAAA,yCAAE;YAAhB,IAAM,CAAC,gBAAA;YACV,IAAM,IAAI,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAA;YAC7B,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;gBACtD,MAAM,IAAI,MAAM,CAAC,aAAa,CAAC,IAAI,GAAG,IAAI,CAAC,CAAA;aAC5C;iBAAM;gBACL,MAAM,IAAI,CAAC,CAAA;aACZ;SACF;;;;;;;;;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAfD,wCAeC;AAED;;;;;GAKG;AACH,SAAgB,yBAAyB,CAAC,CAAS,EAAE,CAAS;IAC5D;;;OAGG;IACH,OAAO,cAAc,CAAC,CAAC,CAAC,KAAK,cAAc,CAAC,CAAC,CAAC,CAAA;AAChD,CAAC;AAND,8DAMC;AAED;;;;GAIG;AACH,SAAgB,WAAW,CAAC,GAAW;IACrC;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,uCAAuC,CAAC,CAAA;IAE3E,OAAO,gBAAgB,CAAC,GAAG,CAAC,CAAA;AAC9B,CAAC;AARD,kCAQC;AAED;;;;GAIG;AACH,SAAgB,WAAW,CAAC,KAAiB;;;QAC3C;;;WAGG;QACH,KAAmB,IAAA,UAAA,SAAA,KAAK,CAAA,4BAAA,+CAAE;YAArB,IAAM,IAAI,kBAAA;YACb,OAAO,CAAC,MAAM,CAAC,kBAAW,CAAC,IAAI,CAAC,EAAE,8CAA8C,CAAC,CAAA;SAClF;;;;;;;;;IAED,OAAO,+BAAgB,CAAC,KAAK,CAAC,CAAA;AAChC,CAAC;AAVD,kCAUC;AAED;;;;GAIG;AACH,SAAgB,aAAa,CAAC,GAAW;IACvC;;;OAGG;IACH,OAAO,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAA;AACnC,CAAC;AAND,sCAMC;AAED;;;;;;GAMG;AACH,SAAgB,iBAAiB,CAAC,GAAW;IAC3C;;;;OAIG;IACH,OAAO,GAAG,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;AACxD,CAAC;AAPD,8CAOC;AAED;;;;GAIG;AACH,SAAgB,sCAAsC,CAAC,GAAW;IAChE;;;OAGG;IACH,OAAO,GAAG,CAAC,OAAO,CAAC,eAAe,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,eAAe,EAAE,EAAE,CAAC,CAAA;AACtE,CAAC;AAND,wFAMC;AAED;;;;GAIG;AACH,SAAgB,+BAA+B,CAAC,GAAW;IACzD;;;;;OAKG;IACH,OAAO,sCAAsC,CAAC,GAAG,CAAC,OAAO,CAAC,kBAAkB,EAAE,GAAG,CAAC,CAAC,CAAA;AACrF,CAAC;AARD,0EAQC;AAED;;;;;;;GAOG;AACH,SAAgB,4BAA4B,CAAC,SAAqC,EAChF,KAAwB,EAAE,OAA6B;IACvD;;;;;;;OAOG;IACH,IAAI,CAAC,cAAO,CAAC,KAAK,CAAC;QAAE,OAAO,4BAA4B,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,CAAA;IAE/F,IAAI,MAAM,GAAG,EAAE,CAAA;IACf,OAAO,OAAO,CAAC,QAAQ,GAAG,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE;QACzF,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAA;QACjC,OAAO,CAAC,QAAQ,EAAE,CAAA;KACnB;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAlBD,oEAkBC;AAED;;;;;GAKG;AACH,SAAgB,mBAAmB,CAAC,KAAwB,EAAE,OAA6B;IACzF;;;;;OAKG;IACH,4BAA4B,CAAC,UAAA,GAAG,IAAI,OAAA,4BAAe,CAAC,IAAI,CAAC,GAAG,CAAC,EAAzB,CAAyB,EAAE,KAAK,EAAE,OAAO,CAAC,CAAA;AAChF,CAAC;AARD,kDAQC;AAED;;;;;GAKG;AACH,SAAgB,aAAa,CAAC,KAAwB,EAAE,SAAiB;IACvE;;;;;;;;;;;;;;OAcG;IACH,IAAI,CAAC,cAAO,CAAC,KAAK,CAAC;QAAE,OAAO,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC,CAAA;IAEvE,IAAM,OAAO,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAA;IAC/B,IAAM,MAAM,GAAa,EAAE,CAAA;IAC3B,IAAI,KAAK,GAAG,4BAA4B,CAAC,UAAA,GAAG,IAAI,OAAA,SAAS,KAAK,GAAG,EAAjB,CAAiB,EAAE,KAAK,EAAE,OAAO,CAAC,CAAA;IAClF,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAClB,OAAO,OAAO,CAAC,QAAQ,GAAG,KAAK,CAAC,MAAM,EAAE;QACtC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,SAAS,EAAE,mDAAmD,CAAC,CAAA;QAC1G,OAAO,CAAC,QAAQ,EAAE,CAAA;QAClB,KAAK,GAAG,4BAA4B,CAAC,UAAA,GAAG,IAAI,OAAA,SAAS,KAAK,GAAG,EAAjB,CAAiB,EAAE,KAAK,EAAE,OAAO,CAAC,CAAA;QAC9E,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;KACnB;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AA7BD,sCA6BC;AAED;;;;GAIG;AACH,SAAgB,6BAA6B,CAAC,KAAwB;IACpE;;;;;;;;;;;OAWG;IACH,IAAI,CAAC,cAAO,CAAC,KAAK,CAAC;QAAE,OAAO,6BAA6B,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;IAE5E,IAAM,OAAO,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAA;IAC/B,IAAM,MAAM,GAAa,EAAE,CAAA;IAC3B,mBAAmB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;IACnC,OAAO,OAAO,CAAC,QAAQ,GAAG,KAAK,CAAC,MAAM,EAAE;QACtC,IAAM,KAAK,GAAG,4BAA4B,CAAC,UAAA,GAAG,IAAI,OAAA,CAAC,4BAAe,CAAC,IAAI,CAAC,GAAG,CAAC,EAA1B,CAA0B,EAAE,KAAK,EAAE,OAAO,CAAC,CAAA;QAC7F,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAClB,mBAAmB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;KACpC;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAxBD,sEAwBC;AAED;;;;GAIG;AACH,SAAgB,oBAAoB,CAAC,KAAwB;IAC3D;;;;;;;;;;;;;OAaG;IACH,IAAI,CAAC,cAAO,CAAC,KAAK,CAAC;QAAE,OAAO,oBAAoB,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;IAEnE,IAAM,OAAO,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAA;IAC/B,IAAM,MAAM,GAAa,EAAE,CAAA;IAC3B,OAAO,OAAO,CAAC,QAAQ,GAAG,KAAK,CAAC,MAAM,EAAE;QACtC,IAAM,KAAK,GAAG,4BAA4B,CAAC,UAAA,GAAG,IAAI,OAAA,GAAG,KAAK,GAAG,EAAX,CAAW,EAAE,KAAK,EAAE,OAAO,CAAC,CAAA;QAC9E,MAAM,CAAC,IAAI,CAAC,sCAAsC,CAAC,KAAK,CAAC,CAAC,CAAA;QAC1D,IAAI,OAAO,CAAC,QAAQ,GAAG,KAAK,CAAC,MAAM,EAAE;YACnC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,GAAG,EAAE,0DAA0D,CAAC,CAAA;YAC3G,OAAO,CAAC,QAAQ,EAAE,CAAA;SACnB;KACF;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AA5BD,oDA4BC;AAED;;;;;GAKG;AACH,SAAgB,WAAW,CAAC,IAAc,EAAE,SAAsB;IAAtB,0BAAA,EAAA,cAAsB;IAChE;;;;;OAKG;IACH,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAA;IAChC,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;AAC7B,CAAC;AATD,kCASC"}

package/node_modules/@oozcitak/infra/lib/index.d.ts

@@ -0,0 +1,13 @@
+import * as base64 from './Base64';
+import * as byte from './Byte';
+import * as byteSequence from './ByteSequence';
+import * as codePoint from './CodePoints';
+import * as json from './JSON';
+import * as list from './List';
+import * as map from './Map';
+import * as namespace from './Namespace';
+import * as queue from './Queue';
+import * as set from './Set';
+import * as stack from './Stack';
+import * as string from './String';
+export { base64, byte, byteSequence, codePoint, json, list, map, namespace, queue, set, stack, string };

package/node_modules/@oozcitak/infra/lib/index.js

@@ -0,0 +1,34 @@
+"use strict";
+var __importStar = (this && this.__importStar) || function (mod) {
+    if (mod && mod.__esModule) return mod;
+    var result = {};
+    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
+    result["default"] = mod;
+    return result;
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var base64 = __importStar(require("./Base64"));
+exports.base64 = base64;
+var byte = __importStar(require("./Byte"));
+exports.byte = byte;
+var byteSequence = __importStar(require("./ByteSequence"));
+exports.byteSequence = byteSequence;
+var codePoint = __importStar(require("./CodePoints"));
+exports.codePoint = codePoint;
+var json = __importStar(require("./JSON"));
+exports.json = json;
+var list = __importStar(require("./List"));
+exports.list = list;
+var map = __importStar(require("./Map"));
+exports.map = map;
+var namespace = __importStar(require("./Namespace"));
+exports.namespace = namespace;
+var queue = __importStar(require("./Queue"));
+exports.queue = queue;
+var set = __importStar(require("./Set"));
+exports.set = set;
+var stack = __importStar(require("./Stack"));
+exports.stack = stack;
+var string = __importStar(require("./String"));
+exports.string = string;
+//# sourceMappingURL=index.js.map

package/node_modules/@oozcitak/infra/lib/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;;;;;;;AAAA,+CAAkC;AAcjC,wBAAM;AAbP,2CAA8B;AAarB,oBAAI;AAZb,2DAA8C;AAY/B,oCAAY;AAX3B,sDAAyC;AAWZ,8BAAS;AAVtC,2CAA8B;AAUU,oBAAI;AAT5C,2CAA8B;AASgB,oBAAI;AARlD,yCAA4B;AAQwB,kBAAG;AAPvD,qDAAwC;AAOiB,8BAAS;AANlE,6CAAgC;AAMoC,sBAAK;AALzE,yCAA4B;AAK+C,kBAAG;AAJ9E,6CAAgC;AAK/B,sBAAK;AAJN,+CAAkC;AAI1B,wBAAM"}

package/node_modules/@oozcitak/infra/package.json

@@ -0,0 +1,54 @@
+{
+  "name": "@oozcitak/infra",
+  "version": "1.0.8",
+  "keywords": [
+    "infra",
+    "whatwg"
+  ],
+  "homepage": "http://github.com/oozcitak/infra",
+  "description": "An implementation of the Infra Living Standard",
+  "author": "Ozgur Ozcitak <oozcitak@gmail.com>",
+  "contributors": [],
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/oozcitak/infra.git"
+  },
+  "bugs": {
+    "url": "http://github.com/oozcitak/infra/issues"
+  },
+  "main": "./lib/index",
+  "types": "lib/index.d.ts",
+  "engines": {
+    "node": ">=6.0"
+  },
+  "files": [
+    "lib/**/*"
+  ],
+  "dependencies": {
+    "@oozcitak/util": "8.3.8"
+  },
+  "devDependencies": {
+    "@types/jest": "^24.0.22",
+    "@types/node": "^12.12.6",
+    "coveralls": "^3.0.7",
+    "jest": "^24.9.0",
+    "ts-jest": "^24.1.0",
+    "typescript": "^3.7.2"
+  },
+  "jest": {
+    "transform": {
+      "^.+\\.tsx?$": "ts-jest"
+    },
+    "testRegex": "/test/.*\\.test\\.tsx?$",
+    "testEnvironment": "node",
+    "collectCoverageFrom": [
+      "src/**/*.{ts,tsx}"
+    ]
+  },
+  "scripts": {
+    "compile": "rm -rf lib && tsc --version && tsc",
+    "test": "npm run compile && jest --coverage",
+    "publish-public": "npm run test && npm publish --access public"
+  }
+}

package/node_modules/@oozcitak/url/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2019 Ozgur Ozcitak
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/node_modules/@oozcitak/url/README.md

@@ -0,0 +1,27 @@
+# URL
+A Javascript implementation of the [URL Living Standard](https://url.spec.whatwg.org/).
+
+[![License](http://img.shields.io/npm/l/@oozcitak/url.svg?style=flat-square)](http://opensource.org/licenses/MIT)
+[![NPM Version](http://img.shields.io/npm/v/@oozcitak/url.svg?style=flat-square)](https://www.npmjs.com/package/@oozcitak/url)
+
+[![Travis Build Status](http://img.shields.io/travis/oozcitak/url.svg?style=flat-square)](http://travis-ci.org/oozcitak/url)
+[![AppVeyor Build status](https://ci.appveyor.com/api/projects/status/vmmfuvai1o3yips8?svg=true)](https://ci.appveyor.com/project/oozcitak/url)
+[![Dev Dependency Status](http://img.shields.io/david/dev/oozcitak/url.svg?style=flat-square)](https://david-dm.org/oozcitak/url)
+[![Code Coverage](https://img.shields.io/codecov/c/github/oozcitak/url?style=flat-square)](https://codecov.io/gh/oozcitak/url)
+
+# Version
+Current version implements the standard as of commit [7ae1c69](https://url.spec.whatwg.org/commit-snapshots/7ae1c691c96f0d82fafa24c33aa1e8df9ffbf2bc/).
+
+# Installation
+```
+npm install @oozcitak/url
+```
+
+# Usage
+Create an instance of the `URL` or `URLSearchParams` classes.
+
+```js
+const { URL } = require("@oozcitak/url");
+
+const url = new URL("https://example.org/file.aspx")
+```