projen 0.99.2 → 0.99.3

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

@@ -0,0 +1,136 @@
+/**
+ * Adds the given item to the end of the set.
+ *
+ * @param set - a set
+ * @param item - an item
+ */
+export declare function append<T>(set: Set<T>, item: T): void;
+/**
+ * Extends a set by appending all items from another set.
+ *
+ * @param setA - a list to extend
+ * @param setB - a list containing items to append to `setA`
+ */
+export declare function extend<T>(setA: Set<T>, setB: Set<T>): void;
+/**
+ * Inserts the given item to the start of the set.
+ *
+ * @param set - a set
+ * @param item - an item
+ */
+export declare function prepend<T>(set: Set<T>, item: T): void;
+/**
+ * Replaces the given item or all items matching condition with a new item.
+ *
+ * @param set - a set
+ * @param conditionOrItem - an item to replace or a condition matching items
+ * to replace
+ * @param item - an item
+ */
+export declare function replace<T>(set: Set<T>, conditionOrItem: T | ((item: T) => boolean), newItem: T): void;
+/**
+ * Inserts the given item before the given index.
+ *
+ * @param set - a set
+ * @param item - an item
+ */
+export declare function insert<T>(set: Set<T>, item: T, index: number): void;
+/**
+ * Removes the given item or all items matching condition.
+ *
+ * @param set - a set
+ * @param conditionOrItem - an item to remove or a condition matching items
+ * to remove
+ */
+export declare function remove<T>(set: Set<T>, conditionOrItem: T | ((item: T) => boolean)): void;
+/**
+ * Removes all items from the set.
+ */
+export declare function empty<T>(set: Set<T>): void;
+/**
+ * Determines if the set contains the given item or any items matching
+ * condition.
+ *
+ * @param set - a set
+ * @param conditionOrItem - an item to a condition to match
+ */
+export declare function contains<T>(set: Set<T>, conditionOrItem: T | ((item: T) => boolean)): boolean;
+/**
+ * Returns the count of items in the set matching the given condition.
+ *
+ * @param set - a set
+ * @param condition - an optional condition to match
+ */
+export declare function size<T>(set: Set<T>, condition?: ((item: T) => boolean)): number;
+/**
+ * Determines if the set is empty.
+ *
+ * @param set - a set
+ */
+export declare function isEmpty<T>(set: Set<T>): boolean;
+/**
+ * Returns an iterator for the items of the set.
+ *
+ * @param set - a set
+ * @param condition - an optional condition to match
+ */
+export declare function forEach<T>(set: Set<T>, condition?: ((item: T) => boolean)): Generator<T, void, unknown>;
+/**
+ * Creates and returns a shallow clone of set.
+ *
+ * @param set - a set
+ */
+export declare function clone<T>(set: Set<T>): Set<T>;
+/**
+ * Returns a new set containing items from the set sorted in ascending
+ * order.
+ *
+ * @param set - a set
+ * @param lessThanAlgo - a function that returns `true` if its first argument
+ * is less than its second argument, and `false` otherwise.
+ */
+export declare function sortInAscendingOrder<T>(set: Set<T>, lessThanAlgo: ((itemA: T, itemB: T) => boolean)): Set<T>;
+/**
+ * Returns a new set containing items from the set sorted in descending
+ * order.
+ *
+ * @param set - a set
+ * @param lessThanAlgo - a function that returns `true` if its first argument
+ * is less than its second argument, and `false` otherwise.
+ */
+export declare function sortInDescendingOrder<T>(set: Set<T>, lessThanAlgo: ((itemA: T, itemB: T) => boolean)): Set<T>;
+/**
+ * Determines if a set is a subset of another set.
+ *
+ * @param subset - a set
+ * @param superset - a superset possibly containing all items from `subset`.
+ */
+export declare function isSubsetOf<T>(subset: Set<T>, superset: Set<T>): boolean;
+/**
+ * Determines if a set is a superset of another set.
+ *
+ * @param superset - a set
+ * @param subset - a subset possibly contained within `superset`.
+ */
+export declare function isSupersetOf<T>(superset: Set<T>, subset: Set<T>): boolean;
+/**
+ * Returns a new set with items that are contained in both sets.
+ *
+ * @param setA - a set
+ * @param setB - a set
+ */
+export declare function intersection<T>(setA: Set<T>, setB: Set<T>): Set<T>;
+/**
+ * Returns a new set with items from both sets.
+ *
+ * @param setA - a set
+ * @param setB - a set
+ */
+export declare function union<T>(setA: Set<T>, setB: Set<T>): Set<T>;
+/**
+ * Returns a set of integers from `n` to `m` inclusive.
+ *
+ * @param n - starting number
+ * @param m - ending number
+ */
+export declare function range(n: number, m: number): Set<number>;

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

@@ -0,0 +1,289 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.append = append;
+exports.extend = extend;
+exports.prepend = prepend;
+exports.replace = replace;
+exports.insert = insert;
+exports.remove = remove;
+exports.empty = empty;
+exports.contains = contains;
+exports.size = size;
+exports.isEmpty = isEmpty;
+exports.forEach = forEach;
+exports.clone = clone;
+exports.sortInAscendingOrder = sortInAscendingOrder;
+exports.sortInDescendingOrder = sortInDescendingOrder;
+exports.isSubsetOf = isSubsetOf;
+exports.isSupersetOf = isSupersetOf;
+exports.intersection = intersection;
+exports.union = union;
+exports.range = range;
+const util_1 = require("@oozcitak/util");
+/**
+ * Adds the given item to the end of the set.
+ *
+ * @param set - a set
+ * @param item - an item
+ */
+function append(set, item) {
+    set.add(item);
+}
+/**
+ * Extends a set by appending all items from another set.
+ *
+ * @param setA - a list to extend
+ * @param setB - a list containing items to append to `setA`
+ */
+function extend(setA, setB) {
+    setB.forEach(setA.add, setA);
+}
+/**
+ * Inserts the given item to the start of the set.
+ *
+ * @param set - a set
+ * @param item - an item
+ */
+function prepend(set, item) {
+    const cloned = new Set(set);
+    set.clear();
+    set.add(item);
+    cloned.forEach(set.add, set);
+}
+/**
+ * Replaces the given item or all items matching condition with a new item.
+ *
+ * @param set - a set
+ * @param conditionOrItem - an item to replace or a condition matching items
+ * to replace
+ * @param item - an item
+ */
+function replace(set, conditionOrItem, newItem) {
+    const newSet = new Set();
+    for (const oldItem of set) {
+        if ((0, util_1.isFunction)(conditionOrItem)) {
+            if (!!conditionOrItem.call(null, oldItem)) {
+                newSet.add(newItem);
+            }
+            else {
+                newSet.add(oldItem);
+            }
+        }
+        else if (oldItem === conditionOrItem) {
+            newSet.add(newItem);
+        }
+        else {
+            newSet.add(oldItem);
+        }
+    }
+    set.clear();
+    newSet.forEach(set.add, set);
+}
+/**
+ * Inserts the given item before the given index.
+ *
+ * @param set - a set
+ * @param item - an item
+ */
+function insert(set, item, index) {
+    const newSet = new Set();
+    let i = 0;
+    for (const oldItem of set) {
+        if (i === index)
+            newSet.add(item);
+        newSet.add(oldItem);
+        i++;
+    }
+    set.clear();
+    newSet.forEach(set.add, set);
+}
+/**
+ * Removes the given item or all items matching condition.
+ *
+ * @param set - a set
+ * @param conditionOrItem - an item to remove or a condition matching items
+ * to remove
+ */
+function remove(set, conditionOrItem) {
+    if (!(0, util_1.isFunction)(conditionOrItem)) {
+        set.delete(conditionOrItem);
+    }
+    else {
+        const toRemove = [];
+        for (const item of set) {
+            if (!!conditionOrItem.call(null, item)) {
+                toRemove.push(item);
+            }
+        }
+        for (const oldItem of toRemove) {
+            set.delete(oldItem);
+        }
+    }
+}
+/**
+ * Removes all items from the set.
+ */
+function empty(set) {
+    set.clear();
+}
+/**
+ * Determines if the set contains the given item or any items matching
+ * condition.
+ *
+ * @param set - a set
+ * @param conditionOrItem - an item to a condition to match
+ */
+function contains(set, conditionOrItem) {
+    if (!(0, util_1.isFunction)(conditionOrItem)) {
+        return set.has(conditionOrItem);
+    }
+    else {
+        for (const oldItem of set) {
+            if (!!conditionOrItem.call(null, oldItem)) {
+                return true;
+            }
+        }
+    }
+    return false;
+}
+/**
+ * Returns the count of items in the set matching the given condition.
+ *
+ * @param set - a set
+ * @param condition - an optional condition to match
+ */
+function size(set, condition) {
+    if (condition === undefined) {
+        return set.size;
+    }
+    else {
+        let count = 0;
+        for (const item of set) {
+            if (!!condition.call(null, item)) {
+                count++;
+            }
+        }
+        return count;
+    }
+}
+/**
+ * Determines if the set is empty.
+ *
+ * @param set - a set
+ */
+function isEmpty(set) {
+    return set.size === 0;
+}
+/**
+ * Returns an iterator for the items of the set.
+ *
+ * @param set - a set
+ * @param condition - an optional condition to match
+ */
+function* forEach(set, condition) {
+    if (condition === undefined) {
+        yield* set;
+    }
+    else {
+        for (const item of set) {
+            if (!!condition.call(null, item)) {
+                yield item;
+            }
+        }
+    }
+}
+/**
+ * Creates and returns a shallow clone of set.
+ *
+ * @param set - a set
+ */
+function clone(set) {
+    return new Set(set);
+}
+/**
+ * Returns a new set containing items from the set sorted in ascending
+ * order.
+ *
+ * @param set - a set
+ * @param lessThanAlgo - a function that returns `true` if its first argument
+ * is less than its second argument, and `false` otherwise.
+ */
+function sortInAscendingOrder(set, lessThanAlgo) {
+    const list = new Array(...set);
+    list.sort((itemA, itemB) => lessThanAlgo.call(null, itemA, itemB) ? -1 : 1);
+    return new Set(list);
+}
+/**
+ * Returns a new set containing items from the set sorted in descending
+ * order.
+ *
+ * @param set - a set
+ * @param lessThanAlgo - a function that returns `true` if its first argument
+ * is less than its second argument, and `false` otherwise.
+ */
+function sortInDescendingOrder(set, lessThanAlgo) {
+    const list = new Array(...set);
+    list.sort((itemA, itemB) => lessThanAlgo.call(null, itemA, itemB) ? 1 : -1);
+    return new Set(list);
+}
+/**
+ * Determines if a set is a subset of another set.
+ *
+ * @param subset - a set
+ * @param superset - a superset possibly containing all items from `subset`.
+ */
+function isSubsetOf(subset, superset) {
+    for (const item of subset) {
+        if (!superset.has(item))
+            return false;
+    }
+    return true;
+}
+/**
+ * Determines if a set is a superset of another set.
+ *
+ * @param superset - a set
+ * @param subset - a subset possibly contained within `superset`.
+ */
+function isSupersetOf(superset, subset) {
+    return isSubsetOf(subset, superset);
+}
+/**
+ * Returns a new set with items that are contained in both sets.
+ *
+ * @param setA - a set
+ * @param setB - a set
+ */
+function intersection(setA, setB) {
+    const newSet = new Set();
+    for (const item of setA) {
+        if (setB.has(item))
+            newSet.add(item);
+    }
+    return newSet;
+}
+/**
+ * Returns a new set with items from both sets.
+ *
+ * @param setA - a set
+ * @param setB - a set
+ */
+function union(setA, setB) {
+    const newSet = new Set(setA);
+    setB.forEach(newSet.add, newSet);
+    return newSet;
+}
+/**
+ * Returns a set of integers from `n` to `m` inclusive.
+ *
+ * @param n - starting number
+ * @param m - ending number
+ */
+function range(n, m) {
+    const newSet = new Set();
+    for (let i = n; i <= m; i++) {
+        newSet.add(i);
+    }
+    return newSet;
+}
+//# sourceMappingURL=Set.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Set.js","sourceRoot":"","sources":["../src/Set.ts"],"names":[],"mappings":";;AAQA,wBAEC;AAQD,wBAEC;AAQD,0BAKC;AAUD,0BAkBC;AAQD,wBAUC;AASD,wBAcC;AAKD,sBAEC;AASD,4BAWC;AAQD,oBAYC;AAOD,0BAEC;AAQD,0BAUC;AAOD,sBAEC;AAUD,oDAMC;AAUD,sDAMC;AAQD,gCAKC;AAQD,oCAEC;AAQD,oCAMC;AAQD,sBAIC;AAQD,sBAMC;AAxRD,yCAA2C;AAE3C;;;;;GAKG;AACH,SAAgB,MAAM,CAAI,GAAW,EAAE,IAAO;IAC5C,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;AACf,CAAC;AAED;;;;;GAKG;AACH,SAAgB,MAAM,CAAI,IAAY,EAAE,IAAY;IAClD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;AAC9B,CAAC;AAED;;;;;GAKG;AACH,SAAgB,OAAO,CAAI,GAAW,EAAE,IAAO;IAC7C,MAAM,MAAM,GAAG,IAAI,GAAG,CAAI,GAAG,CAAC,CAAA;IAC9B,GAAG,CAAC,KAAK,EAAE,CAAA;IACX,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACb,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;AAC9B,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,OAAO,CAAI,GAAW,EAAE,eAA2C,EACjF,OAAU;IACV,MAAM,MAAM,GAAG,IAAI,GAAG,EAAK,CAAA;IAC3B,KAAK,MAAM,OAAO,IAAI,GAAG,EAAE,CAAC;QAC1B,IAAI,IAAA,iBAAU,EAAC,eAAe,CAAC,EAAE,CAAC;YAChC,IAAI,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;gBAC1C,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YACrB,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YACrB,CAAC;QACH,CAAC;aAAM,IAAI,OAAO,KAAK,eAAe,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QACrB,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QACrB,CAAC;IACH,CAAC;IACD,GAAG,CAAC,KAAK,EAAE,CAAA;IACX,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;AAC9B,CAAC;AAED;;;;;GAKG;AACH,SAAgB,MAAM,CAAI,GAAW,EAAE,IAAO,EAAE,KAAa;IAC3D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAK,CAAA;IAC3B,IAAI,CAAC,GAAG,CAAC,CAAA;IACT,KAAK,MAAM,OAAO,IAAI,GAAG,EAAE,CAAC;QAC1B,IAAI,CAAC,KAAK,KAAK;YAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACjC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QACnB,CAAC,EAAE,CAAA;IACL,CAAC;IACD,GAAG,CAAC,KAAK,EAAE,CAAA;IACX,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAA;AAC9B,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,MAAM,CAAI,GAAW,EAAE,eAA2C;IAChF,IAAI,CAAC,IAAA,iBAAU,EAAC,eAAe,CAAC,EAAE,CAAC;QACjC,GAAG,CAAC,MAAM,CAAC,eAAe,CAAC,CAAA;IAC7B,CAAC;SAAM,CAAC;QACN,MAAM,QAAQ,GAAa,EAAE,CAAA;QAC7B,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,IAAI,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;gBACvC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACrB,CAAC;QACH,CAAC;QACD,KAAI,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC9B,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;QACrB,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAgB,KAAK,CAAI,GAAW;IAClC,GAAG,CAAC,KAAK,EAAE,CAAA;AACb,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,QAAQ,CAAI,GAAW,EAAE,eAA2C;IAClF,IAAI,CAAC,IAAA,iBAAU,EAAC,eAAe,CAAC,EAAE,CAAC;QACjC,OAAO,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC,CAAA;IACjC,CAAC;SAAM,CAAC;QACN,KAAK,MAAM,OAAO,IAAI,GAAG,EAAE,CAAC;YAC1B,IAAI,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;gBAC1C,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;;GAKG;AACH,SAAgB,IAAI,CAAI,GAAW,EAAE,SAAkC;IACrE,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,OAAO,GAAG,CAAC,IAAI,CAAA;IACjB,CAAC;SAAM,CAAC;QACN,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,IAAI,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;gBACjC,KAAK,EAAE,CAAA;YACT,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAgB,OAAO,CAAI,GAAW;IACpC,OAAO,GAAG,CAAC,IAAI,KAAK,CAAC,CAAA;AACvB,CAAC;AAED;;;;;GAKG;AACH,QAAgB,CAAC,CAAA,OAAO,CAAI,GAAW,EAAE,SAAkC;IACzE,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,KAAK,CAAC,CAAC,GAAG,CAAA;IACZ,CAAC;SAAM,CAAC;QACN,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,IAAI,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;gBACjC,MAAM,IAAI,CAAA;YACZ,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAgB,KAAK,CAAI,GAAW;IAClC,OAAO,IAAI,GAAG,CAAI,GAAG,CAAC,CAAA;AACxB,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,oBAAoB,CAAI,GAAW,EACjD,YAA+C;IAC/C,MAAM,IAAI,GAAG,IAAI,KAAK,CAAI,GAAG,GAAG,CAAC,CAAA;IACjC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAQ,EAAE,KAAQ,EAAE,EAAE,CAC/B,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACjD,OAAO,IAAI,GAAG,CAAI,IAAI,CAAC,CAAA;AACzB,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,qBAAqB,CAAI,GAAW,EAClD,YAA+C;IAC/C,MAAM,IAAI,GAAG,IAAI,KAAK,CAAI,GAAG,GAAG,CAAC,CAAA;IACjC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAQ,EAAE,KAAQ,EAAE,EAAE,CAC/B,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACjD,OAAO,IAAI,GAAG,CAAI,IAAI,CAAC,CAAA;AACzB,CAAC;AAED;;;;;GAKG;AACH,SAAgB,UAAU,CAAI,MAAc,EAAE,QAAgB;IAC5D,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAA;IACvC,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;;GAKG;AACH,SAAgB,YAAY,CAAI,QAAgB,EAAE,MAAc;IAC9D,OAAO,UAAU,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;AACrC,CAAC;AAED;;;;;GAKG;AACH,SAAgB,YAAY,CAAI,IAAY,EAAE,IAAY;IACxD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAK,CAAA;IAC3B,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACtC,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;;;;GAKG;AACH,SAAgB,KAAK,CAAI,IAAY,EAAE,IAAY;IACjD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAI,IAAI,CAAC,CAAA;IAC/B,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;IAChC,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;;;;GAKG;AACH,SAAgB,KAAK,CAAC,CAAS,EAAE,CAAS;IACxC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAA;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACf,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC"}

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

@@ -0,0 +1,13 @@
+/**
+ * Pushes the given item to the stack.
+ *
+ * @param list - a list
+ * @param item - an item
+ */
+export declare function push<T>(list: Array<T>, item: T): void;
+/**
+ * Pops and returns an item from the stack.
+ *
+ * @param list - a list
+ */
+export declare function pop<T>(list: Array<T>): NonNullable<T> | null;

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

@@ -0,0 +1,22 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.push = push;
+exports.pop = pop;
+/**
+ * Pushes the given item to the stack.
+ *
+ * @param list - a list
+ * @param item - an item
+ */
+function push(list, item) {
+    list.push(item);
+}
+/**
+ * Pops and returns an item from the stack.
+ *
+ * @param list - a list
+ */
+function pop(list) {
+    return list.pop() || null;
+}
+//# sourceMappingURL=Stack.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Stack.js","sourceRoot":"","sources":["../src/Stack.ts"],"names":[],"mappings":";;AAMA,oBAEC;AAOD,kBAEC;AAjBD;;;;;GAKG;AACH,SAAgB,IAAI,CAAI,IAAc,EAAE,IAAO;IAC7C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACjB,CAAC;AAED;;;;GAIG;AACH,SAAgB,GAAG,CAAI,IAAc;IACnC,OAAO,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAA;AAC3B,CAAC"}

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

@@ -0,0 +1,129 @@
+/**
+ * Determines if the string `a` is a code unit prefix of string `b`.
+ *
+ * @param a - a string
+ * @param b - a string
+ */
+export declare function isCodeUnitPrefix(a: string, b: string): boolean;
+/**
+ * Determines if the string `a` is a code unit less than string `b`.
+ *
+ * @param a - a string
+ * @param b - a string
+ */
+export declare function isCodeUnitLessThan(a: string, b: string): boolean;
+/**
+ * Isomorphic encodes the given string.
+ *
+ * @param str - a string
+ */
+export declare function isomorphicEncode(str: string): Uint8Array<ArrayBuffer>;
+/**
+ * Determines if the given string is An ASCII string.
+ *
+ * @param str - a string
+ */
+export declare function isASCIIString(str: string): boolean;
+/**
+ * Converts all uppercase ASCII code points to lowercase.
+ *
+ * @param str - a string
+ */
+export declare function asciiLowercase(str: string): string;
+/**
+ * Converts all uppercase ASCII code points to uppercase.
+ *
+ * @param str - a string
+ */
+export declare function asciiUppercase(str: string): string;
+/**
+ * Compares two ASCII strings case-insensitively.
+ *
+ * @param a - a string
+ * @param b - a string
+ */
+export declare function asciiCaseInsensitiveMatch(a: string, b: string): boolean;
+/**
+ * ASCII encodes a string.
+ *
+ * @param str - a string
+ */
+export declare function asciiEncode(str: string): Uint8Array<ArrayBuffer>;
+/**
+ * ASCII decodes a byte sequence.
+ *
+ * @param bytes - a byte sequence
+ */
+export declare function asciiDecode(bytes: Uint8Array): string;
+/**
+ * Strips newline characters from a string.
+ *
+ * @param str - a string
+ */
+export declare function stripNewlines(str: string): string;
+/**
+ * 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
+ */
+export declare function normalizeNewlines(str: string): string;
+/**
+ * Removes leading and trailing whitespace characters from a string.
+ *
+ * @param str - a string
+ */
+export declare function stripLeadingAndTrailingASCIIWhitespace(str: string): string;
+/**
+ * Removes consecutive newline characters from a string.
+ *
+ * @param str - a string
+ */
+export declare function stripAndCollapseASCIIWhitespace(str: string): string;
+/**
+ * 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
+ */
+export declare function collectASequenceOfCodePoints(condition: ((str: string) => boolean), input: string | string[], options: {
+    position: number;
+}): string;
+/**
+ * Skips over ASCII whitespace.
+ *
+ * @param input - input string
+ * @param options - starting position
+ */
+export declare function skipASCIIWhitespace(input: string | string[], options: {
+    position: number;
+}): void;
+/**
+ * Solits a string at the given delimiter.
+ *
+ * @param input - input string
+ * @param delimiter - a delimiter string
+ */
+export declare function strictlySplit(input: string | string[], delimiter: string): string[];
+/**
+ * Splits a string on ASCII whitespace.
+ *
+ * @param input - a string
+ */
+export declare function splitAStringOnASCIIWhitespace(input: string | string[]): string[];
+/**
+ * Splits a string on commas.
+ *
+ * @param input - a string
+ */
+export declare function splitAStringOnCommas(input: string | string[]): string[];
+/**
+ * Concatenates a list of strings with the given separator.
+ *
+ * @param list - a list of strings
+ * @param separator - a separator string
+ */
+export declare function concatenate(list: string[], separator?: string): string;