@pokash/n8n-nodes-ksef 0.2.12 → 0.2.16

package/node_modules/@oozcitak/url/lib/URLSearchParamsImpl.js

@@ -0,0 +1,303 @@
+"use strict";
+var __generator = (this && this.__generator) || function (thisArg, body) {
+    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
+    return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
+    function verb(n) { return function (v) { return step([n, v]); }; }
+    function step(op) {
+        if (f) throw new TypeError("Generator is already executing.");
+        while (_) try {
+            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+            if (y = 0, t) op = [op[0] & 2, t.value];
+            switch (op[0]) {
+                case 0: case 1: t = op; break;
+                case 4: _.label++; return { value: op[1], done: false };
+                case 5: _.label++; y = op[1]; op = [0]; continue;
+                case 7: op = _.ops.pop(); _.trys.pop(); continue;
+                default:
+                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
+                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
+                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
+                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
+                    if (t[2]) _.ops.pop();
+                    _.trys.pop(); continue;
+            }
+            op = body.call(thisArg, _);
+        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
+        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
+    }
+};
+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 util_1 = require("@oozcitak/util");
+var URLAlgorithm_1 = require("./URLAlgorithm");
+/**
+ * Represents URL query parameters.
+ */
+var URLSearchParamsImpl = /** @class */ (function () {
+    /**
+     * Initializes a new `URLSearchParams`.
+     *
+     * @param init - initial values of query parameters
+     */
+    function URLSearchParamsImpl(init) {
+        var e_1, _a;
+        if (init === void 0) { init = ""; }
+        this._list = [];
+        this._urlObject = null;
+        /**
+         * 1. Let query be a new URLSearchParams object.
+         * 2. If init is a sequence, then for each pair in init:
+         * 3. If pair does not contain exactly two items, then throw a TypeError.
+         * 4. Append a new name-value pair whose name is pair’s first item, and
+         * value is pair’s second item, to query’s list.
+         * 5. Otherwise, if init is a record, then for each name → value in init,
+         * append a new name-value pair whose name is name and value is value, to
+         * query’s list.
+         * 6. Otherwise, init is a string, then set query’s list to the result of
+         * parsing init.
+         * 7. Return query.
+         */
+        if (util_1.isArray(init)) {
+            try {
+                for (var init_1 = __values(init), init_1_1 = init_1.next(); !init_1_1.done; init_1_1 = init_1.next()) {
+                    var item = init_1_1.value;
+                    if (item.length !== 2) {
+                        throw new TypeError("Each item of init must be a two-tuple.");
+                    }
+                    this._list.push([item[0], item[1]]);
+                }
+            }
+            catch (e_1_1) { e_1 = { error: e_1_1 }; }
+            finally {
+                try {
+                    if (init_1_1 && !init_1_1.done && (_a = init_1.return)) _a.call(init_1);
+                }
+                finally { if (e_1) throw e_1.error; }
+            }
+        }
+        else if (util_1.isObject(init)) {
+            for (var name in init) {
+                /* istanbul ignore else */
+                if (init.hasOwnProperty(name)) {
+                    this._list.push([name, init[name]]);
+                }
+            }
+        }
+        else {
+            this._list = URLAlgorithm_1.urlEncodedStringParser(init);
+        }
+    }
+    /**
+     * Runs the update steps.
+     */
+    URLSearchParamsImpl.prototype._updateSteps = function () {
+        /**
+         * 1. Let query be the serialization of URLSearchParams object’s list.
+         * 2. If query is the empty string, then set query to null.
+         * 3. Set url object’s url’s query to query.
+         */
+        var query = URLAlgorithm_1.urlEncodedSerializer(this._list);
+        if (query === "")
+            query = null;
+        if (this._urlObject !== null)
+            this._urlObject._url.query = query;
+    };
+    /** @inheritdoc */
+    URLSearchParamsImpl.prototype.append = function (name, value) {
+        /**
+         * 1. Append a new name-value pair whose name is name and value is value,
+         * to list.
+         * 2. Run the update steps.
+         */
+        this._list.push([name, value]);
+        this._updateSteps();
+    };
+    /** @inheritdoc */
+    URLSearchParamsImpl.prototype.delete = function (name) {
+        /**
+         * 1. Remove all name-value pairs whose name is name from list.
+         * 2. Run the update steps.
+         */
+        for (var i = this._list.length - 1; i >= 0; i--) {
+            if (this._list[i][0] === name)
+                this._list.splice(i, 1);
+        }
+        this._updateSteps();
+    };
+    /** @inheritdoc */
+    URLSearchParamsImpl.prototype.get = function (name) {
+        var e_2, _a;
+        try {
+            /**
+             * The get(name) method, when invoked, must return the value of the
+             * first name-value pair whose name is name in list, if there is such
+             * a pair, and null otherwise.
+             */
+            for (var _b = __values(this._list), _c = _b.next(); !_c.done; _c = _b.next()) {
+                var item = _c.value;
+                if (item[0] === name)
+                    return item[1];
+            }
+        }
+        catch (e_2_1) { e_2 = { error: e_2_1 }; }
+        finally {
+            try {
+                if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
+            }
+            finally { if (e_2) throw e_2.error; }
+        }
+        return null;
+    };
+    /** @inheritdoc */
+    URLSearchParamsImpl.prototype.getAll = function (name) {
+        var e_3, _a;
+        /**
+         * The getAll(name) method, when invoked, must return the values of all
+         * name-value pairs whose name is name, in list, in list order, and the
+         * empty sequence otherwise.
+         */
+        var values = [];
+        try {
+            for (var _b = __values(this._list), _c = _b.next(); !_c.done; _c = _b.next()) {
+                var item = _c.value;
+                if (item[0] === name)
+                    values.push(item[1]);
+            }
+        }
+        catch (e_3_1) { e_3 = { error: e_3_1 }; }
+        finally {
+            try {
+                if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
+            }
+            finally { if (e_3) throw e_3.error; }
+        }
+        return values;
+    };
+    /** @inheritdoc */
+    URLSearchParamsImpl.prototype.has = function (name) {
+        var e_4, _a;
+        try {
+            /**
+             * The has(name) method, when invoked, must return true if there is
+             * a name-value pair whose name is name in list, and false otherwise.
+             */
+            for (var _b = __values(this._list), _c = _b.next(); !_c.done; _c = _b.next()) {
+                var item = _c.value;
+                if (item[0] === name)
+                    return true;
+            }
+        }
+        catch (e_4_1) { e_4 = { error: e_4_1 }; }
+        finally {
+            try {
+                if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
+            }
+            finally { if (e_4) throw e_4.error; }
+        }
+        return false;
+    };
+    /** @inheritdoc */
+    URLSearchParamsImpl.prototype.set = function (name, value) {
+        var e_5, _a;
+        /**
+         * 1. If there are any name-value pairs whose name is name, in list,
+         * set the value of the first such name-value pair to value and remove
+         * the others.
+         * 2. Otherwise, append a new name-value pair whose name is name and value
+         * is value, to list.
+         * 3. Run the update steps.
+         */
+        var toRemove = [];
+        var found = false;
+        for (var i = 0; i < this._list.length; i++) {
+            if (this._list[i][0] === name) {
+                if (!found) {
+                    found = true;
+                    this._list[i][1] = value;
+                }
+                else {
+                    toRemove.push(i);
+                }
+            }
+        }
+        if (!found) {
+            this._list.push([name, value]);
+        }
+        try {
+            for (var toRemove_1 = __values(toRemove), toRemove_1_1 = toRemove_1.next(); !toRemove_1_1.done; toRemove_1_1 = toRemove_1.next()) {
+                var i = toRemove_1_1.value;
+                this._list.splice(i, 1);
+            }
+        }
+        catch (e_5_1) { e_5 = { error: e_5_1 }; }
+        finally {
+            try {
+                if (toRemove_1_1 && !toRemove_1_1.done && (_a = toRemove_1.return)) _a.call(toRemove_1);
+            }
+            finally { if (e_5) throw e_5.error; }
+        }
+    };
+    /** @inheritdoc */
+    URLSearchParamsImpl.prototype.sort = function () {
+        /**
+         * 1. Sort all name-value pairs, if any, by their names. Sorting must be
+         * done by comparison of code units. The relative order between name-value
+         * pairs with equal names must be preserved.
+         * 2. Run the update steps.
+         */
+        this._list.sort(function (a, b) { return (a[0] < b[0] ? -1 : a[0] > b[0] ? 1 : 0); });
+        this._updateSteps();
+    };
+    /** @inheritdoc */
+    URLSearchParamsImpl.prototype[Symbol.iterator] = function () {
+        var _a, _b, item, e_6_1;
+        var e_6, _c;
+        return __generator(this, function (_d) {
+            switch (_d.label) {
+                case 0:
+                    _d.trys.push([0, 5, 6, 7]);
+                    _a = __values(this._list), _b = _a.next();
+                    _d.label = 1;
+                case 1:
+                    if (!!_b.done) return [3 /*break*/, 4];
+                    item = _b.value;
+                    return [4 /*yield*/, item];
+                case 2:
+                    _d.sent();
+                    _d.label = 3;
+                case 3:
+                    _b = _a.next();
+                    return [3 /*break*/, 1];
+                case 4: return [3 /*break*/, 7];
+                case 5:
+                    e_6_1 = _d.sent();
+                    e_6 = { error: e_6_1 };
+                    return [3 /*break*/, 7];
+                case 6:
+                    try {
+                        if (_b && !_b.done && (_c = _a.return)) _c.call(_a);
+                    }
+                    finally { if (e_6) throw e_6.error; }
+                    return [7 /*endfinally*/];
+                case 7: return [2 /*return*/];
+            }
+        });
+    };
+    /** @inheritdoc */
+    URLSearchParamsImpl.prototype.toString = function () {
+        return URLAlgorithm_1.urlEncodedSerializer(this._list);
+    };
+    return URLSearchParamsImpl;
+}());
+exports.URLSearchParamsImpl = URLSearchParamsImpl;
+//# sourceMappingURL=URLSearchParamsImpl.js.map

package/node_modules/@oozcitak/url/lib/URLSearchParamsImpl.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"URLSearchParamsImpl.js","sourceRoot":"","sources":["../src/URLSearchParamsImpl.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AACA,uCAAkD;AAClD,+CAA6E;AAE7E;;GAEG;AACH;IAKE;;;;OAIG;IACH,6BAAY,IAA0D;;QAA1D,qBAAA,EAAA,SAA0D;QARtE,UAAK,GAAuB,EAAE,CAAA;QAC9B,eAAU,GAAe,IAAI,CAAA;QAQ3B;;;;;;;;;;;;WAYG;QACH,IAAI,cAAO,CAAC,IAAI,CAAC,EAAE;;gBACjB,KAAmB,IAAA,SAAA,SAAA,IAAI,CAAA,0BAAA,4CAAE;oBAApB,IAAM,IAAI,iBAAA;oBACb,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;wBACrB,MAAM,IAAI,SAAS,CAAC,wCAAwC,CAAC,CAAA;qBAC9D;oBACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;iBACpC;;;;;;;;;SACF;aAAM,IAAI,eAAQ,CAAC,IAAI,CAAC,EAAE;YACzB,KAAK,IAAM,IAAI,IAAI,IAAI,EAAE;gBACvB,0BAA0B;gBAC1B,IAAI,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE;oBAC7B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;iBACpC;aACF;SACF;aAAM;YACL,IAAI,CAAC,KAAK,GAAG,qCAAsB,CAAC,IAAI,CAAC,CAAA;SAC1C;IACH,CAAC;IAED;;OAEG;IACH,0CAAY,GAAZ;QACE;;;;WAIG;QACH,IAAI,KAAK,GAAkB,mCAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAC3D,IAAI,KAAK,KAAK,EAAE;YAAE,KAAK,GAAG,IAAI,CAAA;QAC9B,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI;YAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;IAClE,CAAC;IAED,kBAAkB;IAClB,oCAAM,GAAN,UAAO,IAAY,EAAE,KAAa;QAChC;;;;WAIG;QACH,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAA;QAC9B,IAAI,CAAC,YAAY,EAAE,CAAA;IACrB,CAAC;IAED,kBAAkB;IAClB,oCAAM,GAAN,UAAO,IAAY;QACjB;;;WAGG;QACH,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC9C,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI;gBAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;SACvD;QACD,IAAI,CAAC,YAAY,EAAE,CAAA;IACrB,CAAC;IAED,kBAAkB;IAClB,iCAAG,GAAH,UAAI,IAAY;;;YACd;;;;eAIG;YACH,KAAmB,IAAA,KAAA,SAAA,IAAI,CAAC,KAAK,CAAA,gBAAA,4BAAE;gBAA1B,IAAM,IAAI,WAAA;gBACb,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI;oBAAE,OAAO,IAAI,CAAC,CAAC,CAAC,CAAA;aACrC;;;;;;;;;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,kBAAkB;IAClB,oCAAM,GAAN,UAAO,IAAY;;QACjB;;;;WAIG;QACH,IAAM,MAAM,GAAa,EAAE,CAAA;;YAC3B,KAAmB,IAAA,KAAA,SAAA,IAAI,CAAC,KAAK,CAAA,gBAAA,4BAAE;gBAA1B,IAAM,IAAI,WAAA;gBACb,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI;oBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;aAC3C;;;;;;;;;QACD,OAAO,MAAM,CAAA;IACf,CAAC;IAED,kBAAkB;IAClB,iCAAG,GAAH,UAAI,IAAY;;;YACd;;;eAGG;YACH,KAAmB,IAAA,KAAA,SAAA,IAAI,CAAC,KAAK,CAAA,gBAAA,4BAAE;gBAA1B,IAAM,IAAI,WAAA;gBACb,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI;oBAAE,OAAO,IAAI,CAAA;aAClC;;;;;;;;;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED,kBAAkB;IAClB,iCAAG,GAAH,UAAI,IAAY,EAAE,KAAa;;QAC7B;;;;;;;WAOG;QACH,IAAM,QAAQ,GAAa,EAAE,CAAA;QAC7B,IAAI,KAAK,GAAG,KAAK,CAAA;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC1C,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE;gBAC7B,IAAI,CAAC,KAAK,EAAE;oBACV,KAAK,GAAG,IAAI,CAAA;oBACZ,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAA;iBACzB;qBAAM;oBACL,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;iBACjB;aACF;SACF;QACD,IAAI,CAAC,KAAK,EAAE;YACV,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAA;SAC/B;;YACD,KAAgB,IAAA,aAAA,SAAA,QAAQ,CAAA,kCAAA,wDAAE;gBAArB,IAAM,CAAC,qBAAA;gBACV,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;aACxB;;;;;;;;;IACH,CAAC;IAED,kBAAkB;IAClB,kCAAI,GAAJ;QACE;;;;;WAKG;QACH,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAC,CAAC,EAAE,CAAC,IAAK,OAAA,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAxC,CAAwC,CAAC,CAAA;QACnE,IAAI,CAAC,YAAY,EAAE,CAAA;IACrB,CAAC;IAED,kBAAkB;IACjB,8BAAC,MAAM,CAAC,QAAQ,CAAC,GAAlB;;;;;;;oBAKqB,KAAA,SAAA,IAAI,CAAC,KAAK,CAAA;;;;oBAAlB,IAAI;oBACb,qBAAM,IAAI,EAAA;;oBAAV,SAAU,CAAA;;;;;;;;;;;;;;;;;;;KAEb;IAED,kBAAkB;IAClB,sCAAQ,GAAR;QACE,OAAO,mCAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACzC,CAAC;IAEH,0BAAC;AAAD,CAAC,AAjLD,IAiLC;AAjLY,kDAAmB"}

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

@@ -0,0 +1,2 @@
+export { URLImpl as URL } from "./URLImpl";
+export { URLSearchParamsImpl as URLSearchParams } from "./URLSearchParamsImpl";

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

@@ -0,0 +1,7 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+var URLImpl_1 = require("./URLImpl");
+exports.URL = URLImpl_1.URLImpl;
+var URLSearchParamsImpl_1 = require("./URLSearchParamsImpl");
+exports.URLSearchParams = URLSearchParamsImpl_1.URLSearchParamsImpl;
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;AAAA,qCAA0C;AAAjC,wBAAA,OAAO,CAAO;AACvB,6DAA8E;AAArE,gDAAA,mBAAmB,CAAmB"}

package/node_modules/@oozcitak/url/lib/interfaces.d.ts

@@ -0,0 +1,195 @@
+/**
+ * Represents an URL.
+ */
+export interface URL {
+    /**
+     * Gets the serialization of url.
+     */
+    readonly href: string;
+    /**
+     * Gets the serialization of url's origin.
+     */
+    readonly origin: string;
+    /**
+     * Gets or sets the url's scheme, followed by `":"`.
+     */
+    protocol: string;
+    /**
+     * Gets or sets the url's username.
+     */
+    username: string;
+    /**
+     * Gets or sets the url's password.
+     */
+    password: string;
+    /**
+     * Gets or sets the url's host.
+     */
+    host: string;
+    /**
+     * Gets or sets the url's hostname.
+     */
+    hostname: string;
+    /**
+     * Gets or sets the url's port.
+     */
+    port: string;
+    /**
+     * Gets or sets the url's path name.
+     */
+    pathname: string;
+    /**
+     * Gets or sets the url's query string.
+     */
+    search: string;
+    /**
+     * Gets the url's query parameters.
+     */
+    readonly searchParams: URLSearchParams;
+    /**
+     * Gets or sets the url's hash.
+     */
+    hash: string;
+    /**
+     * Returns the serialization of url.
+     */
+    toJSON(): string;
+    _url: URLRecord;
+    _queryObject: URLSearchParams;
+}
+/**
+ * Represents an URL record.
+ */
+export interface URLRecord {
+    /**
+     * The type of URL
+     */
+    scheme: string;
+    /**
+     * Username
+     */
+    username: string;
+    /**
+     * Password
+     */
+    password: string;
+    /**
+     * Host
+     */
+    host: Host | null;
+    /**
+     * Port
+     */
+    port: number | null;
+    /**
+     * Path
+     */
+    path: string[];
+    /**
+     * Query string
+     */
+    query: string | null;
+    /**
+     * Fragment
+     */
+    fragment: string | null;
+    _cannotBeABaseURLFlag: boolean;
+    _blobURLEntry: any | null;
+}
+/**
+ * Represents URL query parameters.
+ */
+export interface URLSearchParams extends Iterable<[string, string]> {
+    /**
+     * Appends a new name/value pair to the query parameters.
+     *
+     * @param name - query string name
+     * @param value - query string value
+     */
+    append(name: string, value: string): void;
+    /**
+     * Removes all query parameters with the given name.
+     *
+     * @param name - query string name
+     */
+    delete(name: string): void;
+    /**
+     * Gets the value of the first query parameter with the given name.
+     *
+     * @param name - query string name
+     */
+    get(name: string): string | null;
+    /**
+     * Gets the values of all query parameters with the given name.
+     *
+     * @param name - query string name
+     */
+    getAll(name: string): string[];
+    /**
+     * Determines whether a query parameter with the given name exists.
+     *
+     * @param name - query string name
+     */
+    has(name: string): boolean;
+    /**
+     * Replaces all query parameter with the given name with the given value.
+     *
+     * @param name - query string name
+     * @param value - query string value
+     */
+    set(name: string, value: string): void;
+    /**
+     * Sorts all query parameters with their name.
+     */
+    sort(): void;
+    /**
+     * Converts query parameters to a string.
+     */
+    toString(): string;
+    _list: [string, string][];
+    _urlObject: URL | null;
+}
+/**
+ * Represents the state of the URL parser.
+ */
+export declare enum ParserState {
+    SchemeStart = 0,
+    Scheme = 1,
+    NoScheme = 2,
+    SpecialRelativeOrAuthority = 3,
+    PathOrAuthority = 4,
+    Relative = 5,
+    RelativeSlash = 6,
+    SpecialAuthoritySlashes = 7,
+    SpecialAuthorityIgnoreSlashes = 8,
+    Authority = 9,
+    Host = 10,
+    Hostname = 11,
+    Port = 12,
+    File = 13,
+    FileSlash = 14,
+    FileHost = 15,
+    PathStart = 16,
+    Path = 17,
+    CannotBeABaseURLPath = 18,
+    Query = 19,
+    Fragment = 20
+}
+/**
+ * Represents an URL's host as either of:
+ * - a domain as a string
+ * - an IPv4 address as a number
+ * - an IPv6 address as a list of eight numbers
+ * - an opaque host as a string
+ * - or an empty host the an empty string `""`
+ */
+export declare type Host = string | number | number[];
+/**
+ * Represents an origin as a tuple of:
+ * - A scheme (a scheme).
+ * - A host (a host).
+ * - A port (a port).
+ * - A domain (null or a domain). Null unless stated otherwise.
+ */
+export declare type Origin = [string, Host, number | null, string | null];
+export declare const OpaqueOrigin: Origin;

package/node_modules/@oozcitak/url/lib/interfaces.js

@@ -0,0 +1,31 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Represents the state of the URL parser.
+ */
+var ParserState;
+(function (ParserState) {
+    ParserState[ParserState["SchemeStart"] = 0] = "SchemeStart";
+    ParserState[ParserState["Scheme"] = 1] = "Scheme";
+    ParserState[ParserState["NoScheme"] = 2] = "NoScheme";
+    ParserState[ParserState["SpecialRelativeOrAuthority"] = 3] = "SpecialRelativeOrAuthority";
+    ParserState[ParserState["PathOrAuthority"] = 4] = "PathOrAuthority";
+    ParserState[ParserState["Relative"] = 5] = "Relative";
+    ParserState[ParserState["RelativeSlash"] = 6] = "RelativeSlash";
+    ParserState[ParserState["SpecialAuthoritySlashes"] = 7] = "SpecialAuthoritySlashes";
+    ParserState[ParserState["SpecialAuthorityIgnoreSlashes"] = 8] = "SpecialAuthorityIgnoreSlashes";
+    ParserState[ParserState["Authority"] = 9] = "Authority";
+    ParserState[ParserState["Host"] = 10] = "Host";
+    ParserState[ParserState["Hostname"] = 11] = "Hostname";
+    ParserState[ParserState["Port"] = 12] = "Port";
+    ParserState[ParserState["File"] = 13] = "File";
+    ParserState[ParserState["FileSlash"] = 14] = "FileSlash";
+    ParserState[ParserState["FileHost"] = 15] = "FileHost";
+    ParserState[ParserState["PathStart"] = 16] = "PathStart";
+    ParserState[ParserState["Path"] = 17] = "Path";
+    ParserState[ParserState["CannotBeABaseURLPath"] = 18] = "CannotBeABaseURLPath";
+    ParserState[ParserState["Query"] = 19] = "Query";
+    ParserState[ParserState["Fragment"] = 20] = "Fragment";
+})(ParserState = exports.ParserState || (exports.ParserState = {}));
+exports.OpaqueOrigin = ["", "", null, null];
+//# sourceMappingURL=interfaces.js.map

package/node_modules/@oozcitak/url/lib/interfaces.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"interfaces.js","sourceRoot":"","sources":["../src/interfaces.ts"],"names":[],"mappings":";;AA6JA;;GAEG;AACH,IAAY,WAsBX;AAtBD,WAAY,WAAW;IACrB,2DAAW,CAAA;IACX,iDAAM,CAAA;IACN,qDAAQ,CAAA;IACR,yFAA0B,CAAA;IAC1B,mEAAe,CAAA;IACf,qDAAQ,CAAA;IACR,+DAAa,CAAA;IACb,mFAAuB,CAAA;IACvB,+FAA6B,CAAA;IAC7B,uDAAS,CAAA;IACT,8CAAI,CAAA;IACJ,sDAAQ,CAAA;IACR,8CAAI,CAAA;IACJ,8CAAI,CAAA;IACJ,wDAAS,CAAA;IACT,sDAAQ,CAAA;IACR,wDAAS,CAAA;IACT,8CAAI,CAAA;IACJ,8EAAoB,CAAA;IACpB,gDAAK,CAAA;IACL,sDAAQ,CAAA;AACV,CAAC,EAtBW,WAAW,GAAX,mBAAW,KAAX,mBAAW,QAsBtB;AAoBY,QAAA,YAAY,GAAW,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA"}

package/node_modules/@oozcitak/url/package.json

@@ -0,0 +1,55 @@
+{
+  "name": "@oozcitak/url",
+  "version": "1.0.4",
+  "keywords": [
+    "url",
+    "whatwg"
+  ],
+  "homepage": "http://github.com/oozcitak/url",
+  "description": "An implementation of the URL Living Standard",
+  "author": "Ozgur Ozcitak <oozcitak@gmail.com>",
+  "contributors": [],
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/oozcitak/url.git"
+  },
+  "bugs": {
+    "url": "http://github.com/oozcitak/url/issues"
+  },
+  "main": "./lib/index",
+  "types": "lib/index.d.ts",
+  "engines": {
+    "node": ">=8.0"
+  },
+  "files": [
+    "lib/**/*"
+  ],
+  "dependencies": {
+    "@oozcitak/util": "8.3.8",
+    "@oozcitak/infra": "1.0.8"
+  },
+  "devDependencies": {
+    "typescript": "*",
+    "jest": "*",
+    "ts-jest": "*",
+    "coveralls": "*",
+    "@types/node": "*",
+    "@types/jest": "*"
+  },
+  "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/util/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/util/README.md

@@ -0,0 +1,10 @@
+# util
+Utility functions used by [@oozcitak/dom](http://github.com/oozcitak/dom) and related packages.
+
+[![License](http://img.shields.io/npm/l/@oozcitak/util.svg?style=flat-square)](http://opensource.org/licenses/MIT)
+[![NPM Version](http://img.shields.io/npm/v/@oozcitak/util.svg?style=flat-square)](https://www.npmjs.com/package/@oozcitak/util)
+
+[![Travis Build Status](http://img.shields.io/travis/oozcitak/util.svg?style=flat-square)](http://travis-ci.org/oozcitak/util)
+[![AppVeyor Build status](https://ci.appveyor.com/api/projects/status/n7pq9g2n9eipuh98?svg=true)](https://ci.appveyor.com/project/oozcitak/util)
+[![Dev Dependency Status](http://img.shields.io/david/dev/oozcitak/util.svg?style=flat-square)](https://david-dm.org/oozcitak/util)
+[![Code Coverage](https://img.shields.io/codecov/c/github/oozcitak/util?style=flat-square)](https://codecov.io/gh/oozcitak/util)

package/node_modules/@oozcitak/util/lib/CompareCache.d.ts

@@ -0,0 +1,32 @@
+/**
+ * Represents a cache for storing order between equal objects.
+ *
+ * This cache is used when an algorithm compares two objects and finds them to
+ * be equal but still needs to establish an order between those two objects.
+ * When two such objects `a` and `b` are passed to the `check` method, a random
+ * number is generated with `Math.random()`. If the random number is less than
+ * `0.5` it is assumed that `a < b` otherwise `a > b`. The random number along
+ * with `a` and `b` is stored in the cache, so that subsequent checks result
+ * in the same consistent result.
+ *
+ * The cache has a size limit which is defined on initialization.
+ */
+export declare class CompareCache<T> {
+    private _limit;
+    private _items;
+    /**
+     * Initializes a new instance of `CompareCache`.
+     *
+     * @param limit - maximum number of items to keep in the cache. When the limit
+     * is exceeded the first item is removed from the cache.
+     */
+    constructor(limit?: number);
+    /**
+     * Compares and caches the given objects. Returns `true` if `objA < objB` and
+     * `false` otherwise.
+     *
+     * @param objA - an item to compare
+     * @param objB - an item to compare
+     */
+    check(objA: T, objB: T): boolean;
+}