data-structure-typed 2.1.0 → 2.1.2

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

@@ -1,247 +0,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.
- */
-export 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');
-        }
-    }
-    /**
-     * The converter used to transform a raw element (`R`) into a public element (`E`).
-     *
-     * @remarks
-     * Time O(1), Space O(1).
-     */
-    _toElementFn;
-    /**
-     * 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());
-    }
-}
-//# sourceMappingURL=iterable-element-base.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"iterable-element-base.js","sourceRoot":"","sources":["../../../../src/data-structures/base/iterable-element-base.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AACH,MAAM,OAAgB,mBAAmB;IACvC;;;;;;;;OAQG;IACH,YAAsB,OAA0C;QAC9D,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,EAAE,WAAW,EAAE,GAAG,OAAO,CAAC;YAChC,IAAI,OAAO,WAAW,KAAK,UAAU;gBAAE,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;iBAClE,IAAI,WAAW;gBAAE,MAAM,IAAI,SAAS,CAAC,qCAAqC,CAAC,CAAC;QACnF,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACO,YAAY,CAAwB;IAE9C;;;;;;OAMG;IACH,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED;;;;;;;;OAQG;IACH,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAe;QACnC,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC,CAAC;IACpC,CAAC;IAED;;;;;;OAMG;IACH,CAAC,MAAM;QACL,KAAK,MAAM,IAAI,IAAI,IAAI;YAAE,MAAM,IAAI,CAAC;IACtC,CAAC;IAED;;;;;;;;;;OAUG;IACH,KAAK,CAAC,SAAyC,EAAE,OAAiB;QAChE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC;oBAAE,OAAO,KAAK,CAAC;YACpD,CAAC;iBAAM,CAAC;gBACN,MAAM,EAAE,GAAG,SAAoE,CAAC;gBAChF,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC;oBAAE,OAAO,KAAK,CAAC;YAC3D,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;OASG;IACH,IAAI,CAAC,SAAyC,EAAE,OAAiB;QAC/D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,IAAI,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC;oBAAE,OAAO,IAAI,CAAC;YAClD,CAAC;iBAAM,CAAC;gBACN,MAAM,EAAE,GAAG,SAAoE,CAAC;gBAChF,IAAI,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC;oBAAE,OAAO,IAAI,CAAC;YACzD,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;;;OASG;IACH,OAAO,CAAC,UAAuC,EAAE,OAAiB;QAChE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC;YAClC,CAAC;iBAAM,CAAC;gBACN,MAAM,EAAE,GAAG,UAAkE,CAAC;gBAC9E,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;IACH,CAAC;IAuBD,2BAA2B;IAC3B,IAAI,CAAC,SAAyC,EAAE,OAAiB;QAC/D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC1B,IAAI,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC;oBAAE,OAAO,IAAI,CAAC;YAClD,CAAC;iBAAM,CAAC;gBACN,MAAM,EAAE,GAAG,SAAoE,CAAC;gBAChF,IAAI,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC;oBAAE,OAAO,IAAI,CAAC;YACzD,CAAC;QACH,CAAC;QACD,OAAO;IACT,CAAC;IAED;;;;;;;;OAQG;IACH,GAAG,CAAC,OAAU;QACZ,KAAK,MAAM,GAAG,IAAI,IAAI;YAAE,IAAI,GAAG,KAAK,OAAO;gBAAE,OAAO,IAAI,CAAC;QACzD,OAAO,KAAK,CAAC;IACf,CAAC;IAMD;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,MAAM,CAAI,UAA0C,EAAE,YAAgB;QACpE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QACrC,IAAI,GAAM,CAAC;QAEX,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC1B,GAAG,GAAG,YAAiB,CAAC;QAC1B,CAAC;aAAM,CAAC;YACN,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YAC1B,IAAI,KAAK,CAAC,IAAI;gBAAE,MAAM,IAAI,SAAS,CAAC,iDAAiD,CAAC,CAAC;YACvF,GAAG,GAAG,KAAK,CAAC,KAAqB,CAAC;YAClC,KAAK,GAAG,CAAC,CAAC;QACZ,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,IAA8B,EAAE,CAAC;YACnD,GAAG,GAAG,UAAU,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;;OAMG;IACH,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACH,QAAQ;QACN,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;IACnB,CAAC;IAED;;;;;;OAMG;IACH,KAAK;QACH,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC/B,CAAC;CAkFF"}

package/dist/esm/data-structures/base/iterable-entry-base.d.ts

@@ -1,144 +0,0 @@
-import type { EntryCallback, ReduceEntryCallback } from '../../types';
-/**
- * Iterable view over key-value entries.
- * @template K - Key type.
- * @template V - Value type.
- * @remarks Time O(1), Space O(1)
- */
-export declare abstract class IterableEntryBase<K = any, V = any> {
-    /**
-     * Total number of entries.
-     * @returns Entry count.
-     * @remarks Time O(1), Space O(1)
-     */
-    abstract get size(): number;
-    /**
-     * Default iterator yielding `[key, value]` entries.
-     * @returns Iterator of `[K, V]`.
-     * @remarks Time O(n) to iterate, Space O(1)
-     */
-    [Symbol.iterator](...args: any[]): IterableIterator<[K, V]>;
-    /**
-     * Iterate over `[key, value]` pairs (may yield `undefined` values).
-     * @returns Iterator of `[K, V | undefined]`.
-     * @remarks Time O(n), Space O(1)
-     */
-    entries(): IterableIterator<[K, V | undefined]>;
-    /**
-     * Iterate over keys only.
-     * @returns Iterator of keys.
-     * @remarks Time O(n), Space O(1)
-     */
-    keys(): IterableIterator<K>;
-    /**
-     * Iterate over values only.
-     * @returns Iterator of values.
-     * @remarks Time O(n), Space O(1)
-     */
-    values(): IterableIterator<V>;
-    /**
-     * 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: EntryCallback<K, V, boolean>, thisArg?: any): boolean;
-    /**
-     * 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: EntryCallback<K, V, boolean>, thisArg?: any): boolean;
-    /**
-     * 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: EntryCallback<K, V, void>, thisArg?: any): void;
-    /**
-     * 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: EntryCallback<K, V, boolean>, thisArg?: any): [K, V] | undefined;
-    /**
-     * 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: K): boolean;
-    /**
-     * 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: V): boolean;
-    /**
-     * 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: K): V | undefined;
-    /**
-     * 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<U>(callbackfn: ReduceEntryCallback<K, V, U>, initialValue: U): U;
-    /**
-     * 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(): [K, V][] | string;
-    /**
-     * Print a human-friendly representation to the console.
-     * @remarks Time O(n), Space O(n)
-     */
-    print(): void;
-    /**
-     * Whether there are no entries.
-     * @returns `true` if empty; `false` otherwise.
-     * @remarks Time O(1) typical, Space O(1)
-     */
-    abstract isEmpty(): boolean;
-    /**
-     * Remove all entries.
-     * @remarks Time O(n) typical, Space O(1)
-     */
-    abstract clear(): void;
-    /**
-     * Deep clone preserving the concrete subtype.
-     * @returns A new instance of the same concrete class (`this` type).
-     * @remarks Time O(n) typical, Space O(n)
-     */
-    abstract clone(): this;
-    /**
-     * Map entries using an implementation-specific strategy.
-     * @remarks Time O(n), Space O(n)
-     */
-    abstract map(...args: any[]): any;
-    /**
-     * Filter entries and return the same-species structure.
-     * @returns A new instance of the same concrete class (`this` type).
-     * @remarks Time O(n), Space O(n)
-     */
-    abstract filter(...args: any[]): this;
-    /**
-     * Underlying iterator for the default iteration protocol.
-     * @returns Iterator of `[K, V]`.
-     * @remarks Time O(n), Space O(1)
-     */
-    protected abstract _getIterator(...args: any[]): IterableIterator<[K, V]>;
-}

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

@@ -1,180 +0,0 @@
-/**
- * Iterable view over key-value entries.
- * @template K - Key type.
- * @template V - Value type.
- * @remarks Time O(1), Space O(1)
- */
-export 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());
-    }
-}
-//# sourceMappingURL=iterable-entry-base.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"iterable-entry-base.js","sourceRoot":"","sources":["../../../../src/data-structures/base/iterable-entry-base.ts"],"names":[],"mappings":"AAEA;;;;;GAKG;AACH,MAAM,OAAgB,iBAAiB;IAQrC;;;;OAIG;IACH,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAW;QAC/B,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACH,CAAC,OAAO;QACN,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,IAAI,CAAC;QACb,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,CAAC,IAAI;QACH,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,CAAC,MAAM;QACL,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,SAAuC,EAAE,OAAa;QAC1D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;gBAC9D,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACH,IAAI,CAAC,SAAuC,EAAE,OAAa;QACzD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,IAAI,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC;gBAC7D,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAC,UAAqC,EAAE,OAAa;QAC1D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC;YAC1B,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC;QACtD,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,IAAI,CAAC,UAAwC,EAAE,OAAa;QAC1D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC;YAC1B,IAAI,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;QACvE,CAAC;QACD,OAAO;IACT,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,GAAM;QACR,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC;YACvB,IAAI,OAAO,KAAK,GAAG;gBAAE,OAAO,IAAI,CAAC;QACnC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACH,QAAQ,CAAC,KAAQ;QACf,KAAK,MAAM,CAAC,EAAE,YAAY,CAAC,IAAI,IAAI,EAAE,CAAC;YACpC,IAAI,YAAY,KAAK,KAAK;gBAAE,OAAO,IAAI,CAAC;QAC1C,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,GAAM;QACR,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC;YAC9B,IAAI,OAAO,KAAK,GAAG;gBAAE,OAAO,KAAK,CAAC;QACpC,CAAC;QACD,OAAO;IACT,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CAAI,UAAwC,EAAE,YAAe;QACjE,IAAI,WAAW,GAAG,YAAY,CAAC;QAC/B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;YACxB,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC;YAC1B,WAAW,GAAG,UAAU,CAAC,WAAW,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC;QACnE,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACH,QAAQ;QACN,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;IACnB,CAAC;IAED;;;OAGG;IACH,KAAK;QACH,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;IAC/B,CAAC;CAyCF"}