projen 0.99.0 → 0.99.2

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

@@ -1,184 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.URLSearchParamsImpl = void 0;
-const util_1 = require("@oozcitak/util");
-const URLAlgorithm_1 = require("./URLAlgorithm");
-/**
- * Represents URL query parameters.
- */
-class URLSearchParamsImpl {
-    _list = [];
-    _urlObject = null;
-    /**
-     * Initializes a new `URLSearchParams`.
-     *
-     * @param init - initial values of query parameters
-     */
-    constructor(init = "") {
-        /**
-         * 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 ((0, util_1.isArray)(init)) {
-            for (const item of init) {
-                if (item.length !== 2) {
-                    throw new TypeError("Each item of init must be a two-tuple.");
-                }
-                this._list.push([item[0], item[1]]);
-            }
-        }
-        else if ((0, util_1.isObject)(init)) {
-            for (const name in init) {
-                /* istanbul ignore else */
-                if (init.hasOwnProperty(name)) {
-                    this._list.push([name, init[name]]);
-                }
-            }
-        }
-        else {
-            this._list = (0, URLAlgorithm_1.urlEncodedStringParser)(init);
-        }
-    }
-    /**
-     * Runs the update steps.
-     */
-    _updateSteps() {
-        /**
-         * 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.
-         */
-        let query = (0, URLAlgorithm_1.urlEncodedSerializer)(this._list);
-        if (query === "")
-            query = null;
-        if (this._urlObject !== null)
-            this._urlObject._url.query = query;
-    }
-    /** @inheritdoc */
-    append(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 */
-    delete(name) {
-        /**
-         * 1. Remove all name-value pairs whose name is name from list.
-         * 2. Run the update steps.
-         */
-        for (let i = this._list.length - 1; i >= 0; i--) {
-            if (this._list[i][0] === name)
-                this._list.splice(i, 1);
-        }
-        this._updateSteps();
-    }
-    /** @inheritdoc */
-    get(name) {
-        /**
-         * 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 (const item of this._list) {
-            if (item[0] === name)
-                return item[1];
-        }
-        return null;
-    }
-    /** @inheritdoc */
-    getAll(name) {
-        /**
-         * 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.
-         */
-        const values = [];
-        for (const item of this._list) {
-            if (item[0] === name)
-                values.push(item[1]);
-        }
-        return values;
-    }
-    /** @inheritdoc */
-    has(name) {
-        /**
-         * 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 (const item of this._list) {
-            if (item[0] === name)
-                return true;
-        }
-        return false;
-    }
-    /** @inheritdoc */
-    set(name, value) {
-        /**
-         * 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.
-         */
-        const toRemove = [];
-        let found = false;
-        for (let 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]);
-        }
-        for (const i of toRemove) {
-            this._list.splice(i, 1);
-        }
-    }
-    /** @inheritdoc */
-    sort() {
-        /**
-         * 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((a, b) => (a[0] < b[0] ? -1 : a[0] > b[0] ? 1 : 0));
-        this._updateSteps();
-    }
-    /** @inheritdoc */
-    *[Symbol.iterator]() {
-        /**
-         * The value pairs to iterate over are the list name-value pairs with the
-         * key being the name and the value being the value.
-         */
-        for (const item of this._list) {
-            yield item;
-        }
-    }
-    /** @inheritdoc */
-    toString() {
-        return (0, URLAlgorithm_1.urlEncodedSerializer)(this._list);
-    }
-}
-exports.URLSearchParamsImpl = URLSearchParamsImpl;
-//# sourceMappingURL=URLSearchParamsImpl.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"URLSearchParamsImpl.js","sourceRoot":"","sources":["../src/URLSearchParamsImpl.ts"],"names":[],"mappings":";;;AACA,yCAAkD;AAClD,iDAA6E;AAE7E;;GAEG;AACH,MAAa,mBAAmB;IAE9B,KAAK,GAAuB,EAAE,CAAA;IAC9B,UAAU,GAAe,IAAI,CAAA;IAE7B;;;;OAIG;IACH,YAAY,OAAwD,EAAE;QACpE;;;;;;;;;;;;WAYG;QACH,IAAI,IAAA,cAAO,EAAC,IAAI,CAAC,EAAE,CAAC;YAClB,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;gBACxB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACtB,MAAM,IAAI,SAAS,CAAC,wCAAwC,CAAC,CAAA;gBAC/D,CAAC;gBACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACrC,CAAC;QACH,CAAC;aAAM,IAAI,IAAA,eAAQ,EAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;gBACxB,0BAA0B;gBAC1B,IAAI,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC9B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gBACrC,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,KAAK,GAAG,IAAA,qCAAsB,EAAC,IAAI,CAAC,CAAA;QAC3C,CAAC;IACH,CAAC;IAED;;OAEG;IACH,YAAY;QACV;;;;WAIG;QACH,IAAI,KAAK,GAAkB,IAAA,mCAAoB,EAAC,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,MAAM,CAAC,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,MAAM,CAAC,IAAY;QACjB;;;WAGG;QACH,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI;gBAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACxD,CAAC;QACD,IAAI,CAAC,YAAY,EAAE,CAAA;IACrB,CAAC;IAED,kBAAkB;IAClB,GAAG,CAAC,IAAY;QACd;;;;WAIG;QACH,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC,CAAC,CAAC,CAAA;QACtC,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,kBAAkB;IAClB,MAAM,CAAC,IAAY;QACjB;;;;WAIG;QACH,MAAM,MAAM,GAAa,EAAE,CAAA;QAC3B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI;gBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;QAC5C,CAAC;QACD,OAAO,MAAM,CAAA;IACf,CAAC;IAED,kBAAkB;IAClB,GAAG,CAAC,IAAY;QACd;;;WAGG;QACH,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAA;QACnC,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED,kBAAkB;IAClB,GAAG,CAAC,IAAY,EAAE,KAAa;QAC7B;;;;;;;WAOG;QACH,MAAM,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,CAAC;YAC3C,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;gBAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;oBACX,KAAK,GAAG,IAAI,CAAA;oBACZ,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAA;gBAC1B,CAAC;qBAAM,CAAC;oBACN,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAA;QAChC,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACzB,CAAC;IACH,CAAC;IAED,kBAAkB;IAClB,IAAI;QACF;;;;;WAKG;QACH,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,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,CAAC,CAAA;QACnE,IAAI,CAAC,YAAY,EAAE,CAAA;IACrB,CAAC;IAED,kBAAkB;IAClB,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC;QAChB;;;WAGG;QACH,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,MAAM,IAAI,CAAA;QACZ,CAAC;IACH,CAAC;IAED,kBAAkB;IAClB,QAAQ;QACN,OAAO,IAAA,mCAAoB,EAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACzC,CAAC;CAEF;AAjLD,kDAiLC"}

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

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

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

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

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

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

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

@@ -1,195 +0,0 @@
-/**
- * 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 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 type Origin = [string, Host, number | null, string | null];
-export declare const OpaqueOrigin: Origin;

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

@@ -1,32 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.OpaqueOrigin = exports.ParserState = void 0;
-/**
- * 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 = ParserState = {}));
-exports.OpaqueOrigin = ["", "", null, null];
-//# sourceMappingURL=interfaces.js.map

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

@@ -1 +0,0 @@
-{"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,2BAAX,WAAW,QAsBtB;AAoBY,QAAA,YAAY,GAAW,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA"}

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

@@ -1,42 +0,0 @@
-{
-  "name": "@oozcitak/url",
-  "version": "3.0.0",
-  "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": ">=20.0"
-  },
-  "files": [
-    "lib/**/*"
-  ],
-  "dependencies": {
-    "@oozcitak/util": "^10.0.0",
-    "@oozcitak/infra": "^2.0.2"
-  },
-  "devDependencies": {
-    "@types/node": "^24.7.0",
-    "tsx": "^4.20.6",
-    "typescript": "^5.9.3"
-  },
-  "scripts": {
-    "test": "tsc && tsx --test --experimental-test-coverage test/**/*test.ts",
-    "cover": "tsc && tsx --test --experimental-test-coverage --test-reporter=lcov --test-reporter-destination=./coverage/lcov.info test/*test.ts",
-    "publish-public": "tsc && npm run cover && npm publish --access public"
-  }
-}

package/node_modules/@oozcitak/util/LICENSE

@@ -1,21 +0,0 @@
-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

@@ -1,8 +0,0 @@
-# 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)
-
-[![Node.js CI](https://github.com/oozcitak/util/workflows/build/badge.svg)](https://github.com/oozcitak/util/actions)
-[![Code Coverage](https://codecov.io/gh/oozcitak/util/branch/master/graph/badge.svg)](https://codecov.io/gh/oozcitak/util)

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

@@ -1,32 +0,0 @@
-/**
- * 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;
-}

package/node_modules/@oozcitak/util/lib/CompareCache.js

@@ -1,59 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.CompareCache = void 0;
-/**
- * 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.
- */
-class CompareCache {
-    _limit;
-    _items = new Map();
-    /**
-     * 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 = 1000) {
-        this._limit = limit;
-    }
-    /**
-     * 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, objB) {
-        if (this._items.get(objA) === objB)
-            return true;
-        else if (this._items.get(objB) === objA)
-            return false;
-        const result = (Math.random() < 0.5);
-        if (result) {
-            this._items.set(objA, objB);
-        }
-        else {
-            this._items.set(objB, objA);
-        }
-        if (this._items.size > this._limit) {
-            const it = this._items.keys().next();
-            /* istanbul ignore else */
-            if (!it.done) {
-                this._items.delete(it.value);
-            }
-        }
-        return result;
-    }
-}
-exports.CompareCache = CompareCache;
-//# sourceMappingURL=CompareCache.js.map

package/node_modules/@oozcitak/util/lib/CompareCache.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"CompareCache.js","sourceRoot":"","sources":["../src/CompareCache.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;;GAYG;AACH,MAAa,YAAY;IAEf,MAAM,CAAQ;IACd,MAAM,GAAG,IAAI,GAAG,EAAQ,CAAA;IAEhC;;;;;OAKG;IACH,YAAmB,KAAK,GAAG,IAAI;QAC7B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAA;IACrB,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,IAAO,EAAE,IAAO;QACpB,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI;YAChC,OAAO,IAAI,CAAA;aACR,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI;YACrC,OAAO,KAAK,CAAA;QAEd,MAAM,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAA;QACpC,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QAC7B,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QAC7B,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YACnC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAA;YACpC,0BAA0B;YAC1B,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;gBACb,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;YAC9B,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAA;IACf,CAAC;CAEF;AA9CD,oCA8CC"}

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

@@ -1,64 +0,0 @@
-/**
- * Represents a set of objects with a size limit.
- */
-export declare class FixedSizeSet<T> {
-    private _limit;
-    private _items;
-    /**
-     * Initializes a new instance of `FixedSizeSet`.
-     *
-     * @param limit - maximum number of items to keep in the set. When the limit
-     * is exceeded the first item is removed from the set.
-     */
-    constructor(limit?: number);
-    /**
-     * Adds a new item to the set.
-     *
-     * @param item - an item
-     */
-    add(item: T): this;
-    /**
-     * Removes an item from the set.
-     *
-     * @param item - an item
-     */
-    delete(item: T): boolean;
-    /**
-     * Determines if an item is in the set.
-     *
-     * @param item - an item
-     */
-    has(item: T): boolean;
-    /**
-     * Removes all items from the set.
-     */
-    clear(): void;
-    /**
-     * Gets the number of items in the set.
-     */
-    get size(): number;
-    /**
-     * Applies the given callback function to all elements of the set.
-     */
-    forEach(callback: (value: T, value2: T, set: this) => void, thisArg?: any): void;
-    /**
-     * Iterates through the items in the set.
-     */
-    keys(): Generator<T, void, unknown>;
-    /**
-     * Iterates through the items in the set.
-     */
-    values(): Generator<T, void, unknown>;
-    /**
-     * Iterates through the items in the set.
-     */
-    entries(): Generator<[T, T], void, unknown>;
-    /**
-     * Iterates through the items in the set.
-     */
-    [Symbol.iterator](): Generator<T, void, unknown>;
-    /**
-     * Returns the string tag of the set.
-     */
-    get [Symbol.toStringTag](): string;
-}