directed-graph-typed 2.1.0 → 2.1.2

package/tsup.config.js

@@ -0,0 +1,28 @@
+import { defineConfig } from 'tsup';
+
+export default defineConfig([
+  {
+    entry: { "directed-graph-typed": "src/index.ts" },
+    target: 'es2018',
+    format: ["iife"],
+    clean: true,
+    sourcemap: true,
+    minify: true,
+    outDir: "dist/umd",
+    globalName: "directedGraphTyped",
+    platform: "browser",
+    outExtension: () => ({ js: '.min.js' }),
+  },
+  {
+    entry: { "directed-graph-typed": "src/index.ts" },
+    target: 'es2018',
+    format: ["iife"],
+    clean: false,
+    sourcemap: true,
+    minify: false,
+    outDir: "dist/umd",
+    globalName: "directedGraphTyped",
+    platform: "browser",
+    outExtension: () => ({ js: '.js' }),
+  }
+]);

package/tsup.node.config.js

@@ -0,0 +1,37 @@
+import { defineConfig } from "tsup";
+
+export default defineConfig([
+  // ESM
+  {
+    entry: { index: "src/index.ts" },
+    format: ["esm"],
+    outDir: "dist/esm",
+    splitting: false,
+    sourcemap: true,
+    minify: false,
+    keepNames: true,
+    treeshake: true,
+    clean: true,
+    target: "es2018",
+    outExtension() {
+      return { js: ".mjs" }
+    },
+  },
+
+  // CJS
+  {
+    entry: { index: "src/index.ts" },
+    format: ["cjs"],
+    outDir: "dist/cjs",
+    splitting: false,
+    sourcemap: true,
+    minify: false,
+    keepNames: true,
+    treeshake: true,
+    clean: false,
+    target: "es2018",
+    outExtension() {
+      return { js: ".cjs" };
+    },
+  },
+]);

package/dist/common/index.js

@@ -1,28 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Range = exports.DFSOperation = void 0;
-const utils_1 = require("../utils");
-var DFSOperation;
-(function (DFSOperation) {
-    DFSOperation[DFSOperation["VISIT"] = 0] = "VISIT";
-    DFSOperation[DFSOperation["PROCESS"] = 1] = "PROCESS";
-})(DFSOperation = exports.DFSOperation || (exports.DFSOperation = {}));
-class Range {
-    constructor(low, high, includeLow = true, includeHigh = true) {
-        this.low = low;
-        this.high = high;
-        this.includeLow = includeLow;
-        this.includeHigh = includeHigh;
-        if (!((0, utils_1.isComparable)(low) && (0, utils_1.isComparable)(high)))
-            throw new RangeError('low or high is not comparable');
-        if (low > high)
-            throw new RangeError('low must be less than or equal to high');
-    }
-    // Determine whether a key is within the range
-    isInRange(key, comparator) {
-        const lowCheck = this.includeLow ? comparator(key, this.low) >= 0 : comparator(key, this.low) > 0;
-        const highCheck = this.includeHigh ? comparator(key, this.high) <= 0 : comparator(key, this.high) < 0;
-        return lowCheck && highCheck;
-    }
-}
-exports.Range = Range;

package/dist/constants/index.js

@@ -1,8 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.DFSOperation = void 0;
-var DFSOperation;
-(function (DFSOperation) {
-    DFSOperation[DFSOperation["VISIT"] = 0] = "VISIT";
-    DFSOperation[DFSOperation["PROCESS"] = 1] = "PROCESS";
-})(DFSOperation = exports.DFSOperation || (exports.DFSOperation = {}));

package/dist/data-structures/base/index.d.ts

@@ -1,2 +0,0 @@
-export * from './iterable-entry-base';
-export * from './iterable-element-base';

package/dist/data-structures/base/index.js

@@ -1,18 +0,0 @@
-"use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __exportStar = (this && this.__exportStar) || function(m, exports) {
-    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-__exportStar(require("./iterable-entry-base"), exports);
-__exportStar(require("./iterable-element-base"), exports);

package/dist/data-structures/base/iterable-element-base.js

@@ -1,243 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.IterableElementBase = void 0;
-/**
- * Base class that makes a data structure iterable and provides common
- * element-wise utilities (e.g., map/filter/reduce/find).
- *
- * @template E The public element type yielded by the structure.
- * @template R The underlying "raw" element type used internally or by converters.
- *
- * @remarks
- * This class implements the JavaScript iteration protocol (via `Symbol.iterator`)
- * and offers array-like helpers with predictable time/space complexity.
- */
-class IterableElementBase {
-    /**
-     * Create a new iterable base.
-     *
-     * @param options Optional behavior overrides. When provided, a `toElementFn`
-     * is used to convert a raw element (`R`) into a public element (`E`).
-     *
-     * @remarks
-     * Time O(1), Space O(1).
-     */
-    constructor(options) {
-        if (options) {
-            const { toElementFn } = options;
-            if (typeof toElementFn === 'function')
-                this._toElementFn = toElementFn;
-            else if (toElementFn)
-                throw new TypeError('toElementFn must be a function type');
-        }
-    }
-    /**
-     * Exposes the current `toElementFn`, if configured.
-     *
-     * @returns The converter function or `undefined` when not set.
-     * @remarks
-     * Time O(1), Space O(1).
-     */
-    get toElementFn() {
-        return this._toElementFn;
-    }
-    /**
-     * Returns an iterator over the structure's elements.
-     *
-     * @param args Optional iterator arguments forwarded to the internal iterator.
-     * @returns An `IterableIterator<E>` that yields the elements in traversal order.
-     *
-     * @remarks
-     * Producing the iterator is O(1); consuming the entire iterator is Time O(n) with O(1) extra space.
-     */
-    *[Symbol.iterator](...args) {
-        yield* this._getIterator(...args);
-    }
-    /**
-     * Returns an iterator over the values (alias of the default iterator).
-     *
-     * @returns An `IterableIterator<E>` over all elements.
-     * @remarks
-     * Creating the iterator is O(1); full iteration is Time O(n), Space O(1).
-     */
-    *values() {
-        for (const item of this)
-            yield item;
-    }
-    /**
-     * Tests whether all elements satisfy the predicate.
-     *
-     * @template TReturn
-     * @param predicate Function invoked for each element with signature `(value, index, self)`.
-     * @param thisArg Optional `this` binding for the predicate.
-     * @returns `true` if every element passes; otherwise `false`.
-     *
-     * @remarks
-     * Time O(n) in the worst case; may exit early when the first failure is found. Space O(1).
-     */
-    every(predicate, thisArg) {
-        let index = 0;
-        for (const item of this) {
-            if (thisArg === undefined) {
-                if (!predicate(item, index++, this))
-                    return false;
-            }
-            else {
-                const fn = predicate;
-                if (!fn.call(thisArg, item, index++, this))
-                    return false;
-            }
-        }
-        return true;
-    }
-    /**
-     * Tests whether at least one element satisfies the predicate.
-     *
-     * @param predicate Function invoked for each element with signature `(value, index, self)`.
-     * @param thisArg Optional `this` binding for the predicate.
-     * @returns `true` if any element passes; otherwise `false`.
-     *
-     * @remarks
-     * Time O(n) in the worst case; may exit early on first success. Space O(1).
-     */
-    some(predicate, thisArg) {
-        let index = 0;
-        for (const item of this) {
-            if (thisArg === undefined) {
-                if (predicate(item, index++, this))
-                    return true;
-            }
-            else {
-                const fn = predicate;
-                if (fn.call(thisArg, item, index++, this))
-                    return true;
-            }
-        }
-        return false;
-    }
-    /**
-     * Invokes a callback for each element in iteration order.
-     *
-     * @param callbackfn Function invoked per element with signature `(value, index, self)`.
-     * @param thisArg Optional `this` binding for the callback.
-     * @returns `void`.
-     *
-     * @remarks
-     * Time O(n), Space O(1).
-     */
-    forEach(callbackfn, thisArg) {
-        let index = 0;
-        for (const item of this) {
-            if (thisArg === undefined) {
-                callbackfn(item, index++, this);
-            }
-            else {
-                const fn = callbackfn;
-                fn.call(thisArg, item, index++, this);
-            }
-        }
-    }
-    // Implementation signature
-    find(predicate, thisArg) {
-        let index = 0;
-        for (const item of this) {
-            if (thisArg === undefined) {
-                if (predicate(item, index++, this))
-                    return item;
-            }
-            else {
-                const fn = predicate;
-                if (fn.call(thisArg, item, index++, this))
-                    return item;
-            }
-        }
-        return;
-    }
-    /**
-     * Checks whether a strictly-equal element exists in the structure.
-     *
-     * @param element The element to test with `===` equality.
-     * @returns `true` if an equal element is found; otherwise `false`.
-     *
-     * @remarks
-     * Time O(n) in the worst case. Space O(1).
-     */
-    has(element) {
-        for (const ele of this)
-            if (ele === element)
-                return true;
-        return false;
-    }
-    /**
-     * Reduces all elements to a single accumulated value.
-     *
-     * @overload
-     * @param callbackfn Reducer of signature `(acc, value, index, self) => nextAcc`. The first element is used as the initial accumulator.
-     * @returns The final accumulated value typed as `E`.
-     *
-     * @overload
-     * @param callbackfn Reducer of signature `(acc, value, index, self) => nextAcc`.
-     * @param initialValue The initial accumulator value of type `E`.
-     * @returns The final accumulated value typed as `E`.
-     *
-     * @overload
-     * @template U The accumulator type when it differs from `E`.
-     * @param callbackfn Reducer of signature `(acc: U, value, index, self) => U`.
-     * @param initialValue The initial accumulator value of type `U`.
-     * @returns The final accumulated value typed as `U`.
-     *
-     * @remarks
-     * Time O(n), Space O(1). Throws if called on an empty structure without `initialValue`.
-     */
-    reduce(callbackfn, initialValue) {
-        let index = 0;
-        const iter = this[Symbol.iterator]();
-        let acc;
-        if (arguments.length >= 2) {
-            acc = initialValue;
-        }
-        else {
-            const first = iter.next();
-            if (first.done)
-                throw new TypeError('Reduce of empty structure with no initial value');
-            acc = first.value;
-            index = 1;
-        }
-        for (const value of iter) {
-            acc = callbackfn(acc, value, index++, this);
-        }
-        return acc;
-    }
-    /**
-     * Materializes the elements into a new array.
-     *
-     * @returns A shallow array copy of the iteration order.
-     * @remarks
-     * Time O(n), Space O(n).
-     */
-    toArray() {
-        return [...this];
-    }
-    /**
-     * Returns a representation of the structure suitable for quick visualization.
-     * Defaults to an array of elements; subclasses may override to provide richer visuals.
-     *
-     * @returns A visual representation (array by default).
-     * @remarks
-     * Time O(n), Space O(n).
-     */
-    toVisual() {
-        return [...this];
-    }
-    /**
-     * Prints `toVisual()` to the console. Intended for quick debugging.
-     *
-     * @returns `void`.
-     * @remarks
-     * Time O(n) due to materialization, Space O(n) for the intermediate representation.
-     */
-    print() {
-        console.log(this.toVisual());
-    }
-}
-exports.IterableElementBase = IterableElementBase;

package/dist/data-structures/base/iterable-entry-base.js

@@ -1,183 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.IterableEntryBase = void 0;
-/**
- * Iterable view over key-value entries.
- * @template K - Key type.
- * @template V - Value type.
- * @remarks Time O(1), Space O(1)
- */
-class IterableEntryBase {
-    /**
-     * Default iterator yielding `[key, value]` entries.
-     * @returns Iterator of `[K, V]`.
-     * @remarks Time O(n) to iterate, Space O(1)
-     */
-    *[Symbol.iterator](...args) {
-        yield* this._getIterator(...args);
-    }
-    /**
-     * Iterate over `[key, value]` pairs (may yield `undefined` values).
-     * @returns Iterator of `[K, V | undefined]`.
-     * @remarks Time O(n), Space O(1)
-     */
-    *entries() {
-        for (const item of this) {
-            yield item;
-        }
-    }
-    /**
-     * Iterate over keys only.
-     * @returns Iterator of keys.
-     * @remarks Time O(n), Space O(1)
-     */
-    *keys() {
-        for (const item of this) {
-            yield item[0];
-        }
-    }
-    /**
-     * Iterate over values only.
-     * @returns Iterator of values.
-     * @remarks Time O(n), Space O(1)
-     */
-    *values() {
-        for (const item of this) {
-            yield item[1];
-        }
-    }
-    /**
-     * Test whether all entries satisfy the predicate.
-     * @param predicate - `(key, value, index, self) => boolean`.
-     * @param thisArg - Optional `this` for callback.
-     * @returns `true` if all pass; otherwise `false`.
-     * @remarks Time O(n), Space O(1)
-     */
-    every(predicate, thisArg) {
-        let index = 0;
-        for (const item of this) {
-            if (!predicate.call(thisArg, item[0], item[1], index++, this)) {
-                return false;
-            }
-        }
-        return true;
-    }
-    /**
-     * Test whether any entry satisfies the predicate.
-     * @param predicate - `(key, value, index, self) => boolean`.
-     * @param thisArg - Optional `this` for callback.
-     * @returns `true` if any passes; otherwise `false`.
-     * @remarks Time O(n), Space O(1)
-     */
-    some(predicate, thisArg) {
-        let index = 0;
-        for (const item of this) {
-            if (predicate.call(thisArg, item[0], item[1], index++, this)) {
-                return true;
-            }
-        }
-        return false;
-    }
-    /**
-     * Visit each entry, left-to-right.
-     * @param callbackfn - `(key, value, index, self) => void`.
-     * @param thisArg - Optional `this` for callback.
-     * @remarks Time O(n), Space O(1)
-     */
-    forEach(callbackfn, thisArg) {
-        let index = 0;
-        for (const item of this) {
-            const [key, value] = item;
-            callbackfn.call(thisArg, key, value, index++, this);
-        }
-    }
-    /**
-     * Find the first entry that matches a predicate.
-     * @param callbackfn - `(key, value, index, self) => boolean`.
-     * @param thisArg - Optional `this` for callback.
-     * @returns Matching `[key, value]` or `undefined`.
-     * @remarks Time O(n), Space O(1)
-     */
-    find(callbackfn, thisArg) {
-        let index = 0;
-        for (const item of this) {
-            const [key, value] = item;
-            if (callbackfn.call(thisArg, key, value, index++, this))
-                return item;
-        }
-        return;
-    }
-    /**
-     * Whether the given key exists.
-     * @param key - Key to test.
-     * @returns `true` if found; otherwise `false`.
-     * @remarks Time O(n) generic, Space O(1)
-     */
-    has(key) {
-        for (const item of this) {
-            const [itemKey] = item;
-            if (itemKey === key)
-                return true;
-        }
-        return false;
-    }
-    /**
-     * Whether there exists an entry with the given value.
-     * @param value - Value to test.
-     * @returns `true` if found; otherwise `false`.
-     * @remarks Time O(n), Space O(1)
-     */
-    hasValue(value) {
-        for (const [, elementValue] of this) {
-            if (elementValue === value)
-                return true;
-        }
-        return false;
-    }
-    /**
-     * Get the value under a key.
-     * @param key - Key to look up.
-     * @returns Value or `undefined`.
-     * @remarks Time O(n) generic, Space O(1)
-     */
-    get(key) {
-        for (const item of this) {
-            const [itemKey, value] = item;
-            if (itemKey === key)
-                return value;
-        }
-        return;
-    }
-    /**
-     * Reduce entries into a single accumulator.
-     * @param callbackfn - `(acc, value, key, index, self) => acc`.
-     * @param initialValue - Initial accumulator.
-     * @returns Final accumulator.
-     * @remarks Time O(n), Space O(1)
-     */
-    reduce(callbackfn, initialValue) {
-        let accumulator = initialValue;
-        let index = 0;
-        for (const item of this) {
-            const [key, value] = item;
-            accumulator = callbackfn(accumulator, value, key, index++, this);
-        }
-        return accumulator;
-    }
-    /**
-     * Visualize the iterable as an array of `[key, value]` pairs (or a custom string).
-     * @returns Array of entries (default) or a string.
-     * @remarks Time O(n), Space O(n)
-     */
-    toVisual() {
-        return [...this];
-    }
-    /**
-     * Print a human-friendly representation to the console.
-     * @remarks Time O(n), Space O(n)
-     */
-    print() {
-        console.log(this.toVisual());
-    }
-}
-exports.IterableEntryBase = IterableEntryBase;