data-structure-typed 2.1.0 → 2.1.1

package/dist/esm/types/data-structures/matrix/index.js

@@ -1,3 +0,0 @@
-export * from './navigator';
-export * from './matrix';
-//# sourceMappingURL=index.js.map

package/dist/esm/types/data-structures/matrix/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/matrix/index.ts"],"names":[],"mappings":"AAAA,cAAc,aAAa,CAAC;AAC5B,cAAc,UAAU,CAAC"}

package/dist/esm/types/data-structures/matrix/matrix.d.ts

@@ -1,7 +0,0 @@
-export type MatrixOptions = {
-    rows?: number;
-    cols?: number;
-    addFn?: (a: number, b: number) => any;
-    subtractFn?: (a: number, b: number) => any;
-    multiplyFn?: (a: number, b: number) => any;
-};

package/dist/esm/types/data-structures/matrix/matrix.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=matrix.js.map

package/dist/esm/types/data-structures/matrix/matrix.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"matrix.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/matrix/matrix.ts"],"names":[],"mappings":""}

package/dist/esm/types/data-structures/matrix/navigator.d.ts

@@ -1,14 +0,0 @@
-export type Direction = 'up' | 'right' | 'down' | 'left';
-export type Turning = {
-    [key in Direction]: Direction;
-};
-export type NavigatorParams<T = any> = {
-    matrix: T[][];
-    turning: Turning;
-    onMove: (cur: [number, number]) => void;
-    init: {
-        cur: [number, number];
-        charDir: Direction;
-        VISITED: T;
-    };
-};

package/dist/esm/types/data-structures/matrix/navigator.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=navigator.js.map

package/dist/esm/types/data-structures/matrix/navigator.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"navigator.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/matrix/navigator.ts"],"names":[],"mappings":""}

package/dist/esm/types/data-structures/priority-queue/index.d.ts

@@ -1,3 +0,0 @@
-export * from './priority-queue';
-export * from './min-priority-queue';
-export * from './max-priority-queue';

package/dist/esm/types/data-structures/priority-queue/index.js

@@ -1,4 +0,0 @@
-export * from './priority-queue';
-export * from './min-priority-queue';
-export * from './max-priority-queue';
-//# sourceMappingURL=index.js.map

package/dist/esm/types/data-structures/priority-queue/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/priority-queue/index.ts"],"names":[],"mappings":"AAAA,cAAc,kBAAkB,CAAC;AACjC,cAAc,sBAAsB,CAAC;AACrC,cAAc,sBAAsB,CAAC"}

package/dist/esm/types/data-structures/priority-queue/max-priority-queue.d.ts

@@ -1 +0,0 @@
-export {};

package/dist/esm/types/data-structures/priority-queue/max-priority-queue.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=max-priority-queue.js.map

package/dist/esm/types/data-structures/priority-queue/max-priority-queue.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"max-priority-queue.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/priority-queue/max-priority-queue.ts"],"names":[],"mappings":""}

package/dist/esm/types/data-structures/priority-queue/min-priority-queue.d.ts

@@ -1 +0,0 @@
-export {};

package/dist/esm/types/data-structures/priority-queue/min-priority-queue.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=min-priority-queue.js.map

package/dist/esm/types/data-structures/priority-queue/min-priority-queue.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"min-priority-queue.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/priority-queue/min-priority-queue.ts"],"names":[],"mappings":""}

package/dist/esm/types/data-structures/priority-queue/priority-queue.d.ts

@@ -1,2 +0,0 @@
-import { HeapOptions } from '../heap';
-export type PriorityQueueOptions<E, R> = HeapOptions<E, R> & {};

package/dist/esm/types/data-structures/priority-queue/priority-queue.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=priority-queue.js.map

package/dist/esm/types/data-structures/priority-queue/priority-queue.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"priority-queue.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/priority-queue/priority-queue.ts"],"names":[],"mappings":""}

package/dist/esm/types/data-structures/queue/deque.d.ts

@@ -1,4 +0,0 @@
-import { LinearBaseOptions } from '../base';
-export type DequeOptions<E, R> = {
-    bucketSize?: number;
-} & LinearBaseOptions<E, R>;

package/dist/esm/types/data-structures/queue/deque.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=deque.js.map

package/dist/esm/types/data-structures/queue/deque.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"deque.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/queue/deque.ts"],"names":[],"mappings":""}

package/dist/esm/types/data-structures/queue/index.d.ts

@@ -1,2 +0,0 @@
-export * from './queue';
-export * from './deque';

package/dist/esm/types/data-structures/queue/index.js

@@ -1,3 +0,0 @@
-export * from './queue';
-export * from './deque';
-//# sourceMappingURL=index.js.map

package/dist/esm/types/data-structures/queue/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/queue/index.ts"],"names":[],"mappings":"AAAA,cAAc,SAAS,CAAC;AACxB,cAAc,SAAS,CAAC"}

package/dist/esm/types/data-structures/queue/queue.d.ts

@@ -1,4 +0,0 @@
-import { LinearBaseOptions } from '../base';
-export type QueueOptions<E, R> = LinearBaseOptions<E, R> & {
-    autoCompactRatio?: number;
-};

package/dist/esm/types/data-structures/queue/queue.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=queue.js.map

package/dist/esm/types/data-structures/queue/queue.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"queue.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/queue/queue.ts"],"names":[],"mappings":""}

package/dist/esm/types/data-structures/stack/index.d.ts

@@ -1 +0,0 @@
-export * from './stack';

package/dist/esm/types/data-structures/stack/index.js

@@ -1,2 +0,0 @@
-export * from './stack';
-//# sourceMappingURL=index.js.map

package/dist/esm/types/data-structures/stack/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/stack/index.ts"],"names":[],"mappings":"AAAA,cAAc,SAAS,CAAC"}

package/dist/esm/types/data-structures/stack/stack.d.ts

@@ -1,2 +0,0 @@
-import { IterableElementBaseOptions } from '../base';
-export type StackOptions<E, R> = IterableElementBaseOptions<E, R> & {};

package/dist/esm/types/data-structures/stack/stack.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=stack.js.map

package/dist/esm/types/data-structures/stack/stack.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"stack.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/stack/stack.ts"],"names":[],"mappings":""}

package/dist/esm/types/data-structures/tree/index.d.ts

@@ -1 +0,0 @@
-export * from './tree';

package/dist/esm/types/data-structures/tree/index.js

@@ -1,2 +0,0 @@
-export * from './tree';
-//# sourceMappingURL=index.js.map

package/dist/esm/types/data-structures/tree/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/tree/index.ts"],"names":[],"mappings":"AAAA,cAAc,QAAQ,CAAC"}

package/dist/esm/types/data-structures/tree/tree.d.ts

@@ -1 +0,0 @@
-export {};

package/dist/esm/types/data-structures/tree/tree.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=tree.js.map

package/dist/esm/types/data-structures/tree/tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tree.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/tree/tree.ts"],"names":[],"mappings":""}

package/dist/esm/types/data-structures/trie/index.d.ts

@@ -1 +0,0 @@
-export * from './trie';

package/dist/esm/types/data-structures/trie/index.js

@@ -1,2 +0,0 @@
-export * from './trie';
-//# sourceMappingURL=index.js.map

package/dist/esm/types/data-structures/trie/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/trie/index.ts"],"names":[],"mappings":"AAAA,cAAc,QAAQ,CAAC"}

package/dist/esm/types/data-structures/trie/trie.d.ts

@@ -1,4 +0,0 @@
-import { IterableElementBaseOptions } from '../base';
-export type TrieOptions<R> = {
-    caseSensitive?: boolean;
-} & IterableElementBaseOptions<string, R>;

package/dist/esm/types/data-structures/trie/trie.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=trie.js.map

package/dist/esm/types/data-structures/trie/trie.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"trie.js","sourceRoot":"","sources":["../../../../../src/types/data-structures/trie/trie.ts"],"names":[],"mappings":""}

package/dist/esm/types/index.d.ts

@@ -1,3 +0,0 @@
-export * from './data-structures';
-export * from './common';
-export * from './utils';

package/dist/esm/types/index.js

@@ -1,4 +0,0 @@
-export * from './data-structures';
-export * from './common';
-export * from './utils';
-//# sourceMappingURL=index.js.map

package/dist/esm/types/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/types/index.ts"],"names":[],"mappings":"AAAA,cAAc,mBAAmB,CAAC;AAClC,cAAc,UAAU,CAAC;AACzB,cAAc,SAAS,CAAC"}

package/dist/esm/types/utils/index.d.ts

@@ -1,2 +0,0 @@
-export * from './utils';
-export * from './validate-type';

package/dist/esm/types/utils/index.js

@@ -1,3 +0,0 @@
-export * from './utils';
-export * from './validate-type';
-//# sourceMappingURL=index.js.map

package/dist/esm/types/utils/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/types/utils/index.ts"],"names":[],"mappings":"AAAA,cAAc,SAAS,CAAC;AACxB,cAAc,iBAAiB,CAAC"}

package/dist/esm/types/utils/utils.d.ts

@@ -1,22 +0,0 @@
-export type SpecifyOptional<T, K extends keyof T> = Omit<T, K> & Partial<Pick<T, K>>;
-export type Any = string | number | bigint | boolean | symbol | undefined | object;
-export type Arithmetic = number | bigint;
-export type ElemOf<T> = T extends (infer U)[] ? U : never;
-export type ComparablePrimitive = number | bigint | string | boolean;
-export interface BaseComparableObject {
-    [key: string]: unknown;
-}
-export interface ValueComparableObject extends BaseComparableObject {
-    valueOf: () => ComparablePrimitive | ValueComparableObject;
-    toString?: () => string;
-}
-export interface StringComparableObject extends BaseComparableObject {
-    toString: () => string;
-}
-export type ComparableObject = ValueComparableObject | StringComparableObject;
-export type Comparable = ComparablePrimitive | Date | ComparableObject;
-export type TrampolineThunk<T> = {
-    readonly isThunk: true;
-    readonly fn: () => Trampoline<T>;
-};
-export type Trampoline<T> = T | TrampolineThunk<T>;

package/dist/esm/types/utils/utils.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=utils.js.map

package/dist/esm/types/utils/utils.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"utils.js","sourceRoot":"","sources":["../../../../src/types/utils/utils.ts"],"names":[],"mappings":""}

package/dist/esm/types/utils/validate-type.d.ts

@@ -1,19 +0,0 @@
-export type KeyValueObject = {
-    [key: string]: any;
-};
-export type KeyValueObjectWithKey = {
-    [key: string]: any;
-    key: string | number | symbol;
-};
-export type NonNumberNonObjectButDefined = string | boolean | symbol | null;
-export type ObjectWithoutKey = Omit<KeyValueObject, 'key'>;
-export type ObjectWithNonNumberKey = {
-    [key: string]: any;
-    key: string | boolean | symbol | null | object | undefined;
-};
-export type ObjectWithNumberKey = {
-    [key: string]: any;
-    key: number;
-};
-export type RestrictValByKey = NonNumberNonObjectButDefined | ObjectWithoutKey | ObjectWithNonNumberKey | ObjectWithNumberKey;
-export type DummyAny = string | number | boolean | null | undefined | object | symbol | void | ((...args: []) => any) | never;

package/dist/esm/types/utils/validate-type.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=validate-type.js.map

package/dist/esm/types/utils/validate-type.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"validate-type.js","sourceRoot":"","sources":["../../../../src/types/utils/validate-type.ts"],"names":[],"mappings":""}

package/dist/esm/utils/index.d.ts

@@ -1,2 +0,0 @@
-export * from './utils';
-export * from './number';

package/dist/esm/utils/index.js

@@ -1,3 +0,0 @@
-export * from './utils';
-export * from './number';
-//# sourceMappingURL=index.js.map

package/dist/esm/utils/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/utils/index.ts"],"names":[],"mappings":"AAAA,cAAc,SAAS,CAAC;AACxB,cAAc,UAAU,CAAC"}

package/dist/esm/utils/number.d.ts

@@ -1,14 +0,0 @@
-/**
- * The function `toBinaryString` converts a number to a binary string representation with a specified
- * number of digits.
- * @param {number} num - The `num` parameter in the `toBinaryString` function represents the number
- * that you want to convert to a binary string.
- * @param [digit=32] - The `digit` parameter in the `toBinaryString` function represents the number of
- * digits the binary string should have. By default, it is set to 32, meaning that the binary string
- * will be padded with zeros at the beginning to ensure it is 32 bits long. You can provide a
- * @returns The function `toBinaryString` takes a number as input and converts it to a binary string
- * representation with a specified number of digits (default is 32). The binary string is padded with
- * zeros at the beginning to ensure it has the specified number of digits. The function returns the
- * binary string representation of the input number.
- */
-export declare function toBinaryString(num: number, digit?: number): string;

package/dist/esm/utils/number.js

@@ -1,21 +0,0 @@
-/**
- * The function `toBinaryString` converts a number to a binary string representation with a specified
- * number of digits.
- * @param {number} num - The `num` parameter in the `toBinaryString` function represents the number
- * that you want to convert to a binary string.
- * @param [digit=32] - The `digit` parameter in the `toBinaryString` function represents the number of
- * digits the binary string should have. By default, it is set to 32, meaning that the binary string
- * will be padded with zeros at the beginning to ensure it is 32 bits long. You can provide a
- * @returns The function `toBinaryString` takes a number as input and converts it to a binary string
- * representation with a specified number of digits (default is 32). The binary string is padded with
- * zeros at the beginning to ensure it has the specified number of digits. The function returns the
- * binary string representation of the input number.
- */
-export function toBinaryString(num, digit = 32) {
-    // Convert number to binary string
-    let binaryString = (num >>> 0).toString(2); // Use the unsigned right shift operator to ensure you get a binary representation of a 32-bit unsigned integer
-    // Use pad Start to ensure the string length is 32 bits
-    binaryString = binaryString.padStart(digit, '0');
-    return binaryString;
-}
-//# sourceMappingURL=number.js.map

package/dist/esm/utils/number.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"number.js","sourceRoot":"","sources":["../../../src/utils/number.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,cAAc,CAAC,GAAW,EAAE,KAAK,GAAG,EAAE;IACpD,kCAAkC;IAClC,IAAI,YAAY,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,+GAA+G;IAE3J,uDAAuD;IACvD,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAEjD,OAAO,YAAY,CAAC;AACtB,CAAC"}

package/dist/esm/utils/utils.d.ts

@@ -1,209 +0,0 @@
-/**
- * data-structure-typed
- *
- * @author Pablo Zeng
- * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-import type { Comparable, Trampoline, TrampolineThunk } from '../types';
-/**
- * The function generates a random UUID (Universally Unique Identifier) in TypeScript.
- * @returns A randomly generated UUID (Universally Unique Identifier) in the format
- * 'xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx' where each 'x' is replaced with a random hexadecimal
- * character.
- */
-export declare const uuidV4: () => string;
-/**
- * The `arrayRemove` function removes elements from an array based on a specified predicate function
- * and returns the removed elements.
- * @param {T[]} array - An array of elements that you want to filter based on the provided predicate
- * function.
- * @param predicate - The `predicate` parameter is a function that takes three arguments:
- * @returns The `arrayRemove` function returns an array containing the elements that satisfy the given
- * `predicate` function.
- */
-export declare const arrayRemove: <T>(array: T[], predicate: (item: T, index: number, array: T[]) => boolean) => T[];
-/**
- * The function `getMSB` returns the most significant bit of a given number.
- * @param {number} value - The `value` parameter is a number for which we want to find the position of
- * the Most Significant Bit (MSB). The function `getMSB` takes this number as input and calculates the
- * position of the MSB in its binary representation.
- * @returns The function `getMSB` returns the most significant bit (MSB) of the input `value`. If the
- * input value is less than or equal to 0, it returns 0. Otherwise, it calculates the position of the
- * MSB using the `Math.clz32` function and bitwise left shifts 1 to that position.
- */
-export declare const getMSB: (value: number) => number;
-/**
- * The `rangeCheck` function in TypeScript is used to validate if an index is within a specified range
- * and throws a `RangeError` with a custom message if it is out of bounds.
- * @param {number} index - The `index` parameter represents the value that you want to check if it
- * falls within a specified range.
- * @param {number} min - The `min` parameter represents the minimum value that the `index` should be
- * compared against in the `rangeCheck` function.
- * @param {number} max - The `max` parameter in the `rangeCheck` function represents the maximum value
- * that the `index` parameter is allowed to have. If the `index` is greater than this `max` value, a
- * `RangeError` will be thrown.
- * @param [message=Index out of bounds.] - The `message` parameter is a string that represents the
- * error message to be thrown if the index is out of bounds. By default, if no message is provided when
- * calling the `rangeCheck` function, the message "Index out of bounds." will be used.
- */
-export declare const rangeCheck: (index: number, min: number, max: number, message?: string) => void;
-/**
- * The function `throwRangeError` throws a RangeError with a custom message if called.
- * @param [message=The value is off-limits.] - The `message` parameter is a string that represents the
- * error message to be displayed when a `RangeError` is thrown. If no message is provided, the default
- * message is 'The value is off-limits.'.
- */
-export declare const throwRangeError: (message?: string) => void;
-/**
- * The function `isWeakKey` checks if the input is an object or a function in TypeScript.
- * @param {unknown} input - The `input` parameter in the `isWeakKey` function is of type `unknown`,
- * which means it can be any type. The function checks if the `input` is an object (excluding `null`)
- * or a function, and returns a boolean indicating whether the `input` is a weak
- * @returns The function `isWeakKey` returns a boolean value indicating whether the input is an object
- * or a function.
- */
-export declare const isWeakKey: (input: unknown) => input is object;
-/**
- * The function `calcMinUnitsRequired` calculates the minimum number of units required to accommodate a
- * given total quantity based on a specified unit size.
- * @param {number} totalQuantity - The `totalQuantity` parameter represents the total quantity of items
- * that need to be processed or handled.
- * @param {number} unitSize - The `unitSize` parameter represents the size of each unit or package. It
- * is used in the `calcMinUnitsRequired` function to calculate the minimum number of units required to
- * accommodate a total quantity of items.
- */
-export declare const calcMinUnitsRequired: (totalQuantity: number, unitSize: number) => number;
-/**
- * The `roundFixed` function in TypeScript rounds a number to a specified number of decimal places.
- * @param {number} num - The `num` parameter is a number that you want to round to a certain number of
- * decimal places.
- * @param {number} [digit=10] - The `digit` parameter in the `roundFixed` function specifies the number
- * of decimal places to round the number to. By default, it is set to 10 if not provided explicitly.
- * @returns The function `roundFixed` returns a number that is rounded to the specified number of
- * decimal places (default is 10 decimal places).
- */
-export declare const roundFixed: (num: number, digit?: number) => number;
-/**
- * The function `isComparable` in TypeScript checks if a value is comparable, handling primitive values
- * and objects with optional force comparison.
- * @param {unknown} value - The `value` parameter in the `isComparable` function represents the value
- * that you want to check if it is comparable. It can be of any type (`unknown`), and the function will
- * determine if it is comparable based on certain conditions.
- * @param [isForceObjectComparable=false] - The `isForceObjectComparable` parameter in the
- * `isComparable` function is a boolean flag that determines whether to treat non-primitive values as
- * comparable objects. When set to `true`, it forces the function to consider non-primitive values as
- * comparable objects, regardless of their type.
- * @returns The function `isComparable` returns a boolean value indicating whether the `value` is
- * considered comparable or not.
- */
-export declare function isComparable(value: unknown, isForceObjectComparable?: boolean): value is Comparable;
-/**
- * Creates a trampoline thunk object.
- *
- * A "thunk" is a deferred computation — instead of performing a recursive call immediately,
- * it wraps the next step of the computation in a function. This allows recursive processes
- * to be executed iteratively, preventing stack overflows.
- *
- * @template T - The type of the final computation result.
- * @param computation - A function that, when executed, returns the next trampoline step.
- * @returns A TrampolineThunk object containing the deferred computation.
- */
-export declare const makeTrampolineThunk: <T>(computation: () => Trampoline<T>) => TrampolineThunk<T>;
-/**
- * Type guard to check whether a given value is a TrampolineThunk.
- *
- * This function is used to distinguish between a final computation result (value)
- * and a deferred computation (thunk).
- *
- * @template T - The type of the value being checked.
- * @param value - The value to test.
- * @returns True if the value is a valid TrampolineThunk, false otherwise.
- */
-export declare const isTrampolineThunk: <T>(value: Trampoline<T>) => value is TrampolineThunk<T>;
-/**
- * Executes a trampoline computation until a final (non-thunk) result is obtained.
- *
- * The trampoline function repeatedly invokes the deferred computations (thunks)
- * in an iterative loop. This avoids deep recursive calls and prevents stack overflow,
- * which is particularly useful for implementing recursion in a stack-safe manner.
- *
- * @template T - The type of the final result.
- * @param initial - The initial Trampoline value or thunk to start execution from.
- * @returns The final result of the computation (a non-thunk value).
- */
-export declare function trampoline<T>(initial: Trampoline<T>): T;
-/**
- * Wraps a recursive function inside a trampoline executor.
- *
- * This function transforms a potentially recursive function (that returns a Trampoline<Result>)
- * into a *stack-safe* function that executes iteratively using the `trampoline` runner.
- *
- * In other words, it allows you to write functions that look recursive,
- * but actually run in constant stack space.
- *
- * @template Args - The tuple type representing the argument list of the original function.
- * @template Result - The final return type after all trampoline steps are resolved.
- *
- * @param fn - A function that performs a single step of computation
- *             and returns a Trampoline (either a final value or a deferred thunk).
- *
- * @returns A new function with the same arguments, but which automatically
- *          runs the trampoline process and returns the *final result* instead
- *          of a Trampoline.
- *
- * @example
- * // Example: Computing factorial in a stack-safe way
- * const factorial = makeTrampoline(function fact(n: number, acc: number = 1): Trampoline<number> {
- *   return n === 0
- *     ? acc
- *     : makeTrampolineThunk(() => fact(n - 1, acc * n));
- * });
- *
- * console.log(factorial(100000)); // Works without stack overflow
- */
-export declare function makeTrampoline<Args extends any[], Result>(fn: (...args: Args) => Trampoline<Result>): (...args: Args) => Result;
-/**
- * Executes an asynchronous trampoline computation until a final (non-thunk) result is obtained.
- *
- * This function repeatedly invokes asynchronous deferred computations (thunks)
- * in an iterative loop. Each thunk may return either a Trampoline<T> or a Promise<Trampoline<T>>.
- *
- * It ensures that asynchronous recursive functions can run without growing the call stack,
- * making it suitable for stack-safe async recursion.
- *
- * @template T - The type of the final result.
- * @param initial - The initial Trampoline or Promise of Trampoline to start execution from.
- * @returns A Promise that resolves to the final result (a non-thunk value).
- */
-export declare function asyncTrampoline<T>(initial: Trampoline<T> | Promise<Trampoline<T>>): Promise<T>;
-/**
- * Wraps an asynchronous recursive function inside an async trampoline executor.
- *
- * This helper transforms a recursive async function that returns a Trampoline<Result>
- * (or Promise<Trampoline<Result>>) into a *stack-safe* async function that executes
- * iteratively via the `asyncTrampoline` runner.
- *
- * @template Args - The tuple type representing the argument list of the original function.
- * @template Result - The final return type after all async trampoline steps are resolved.
- *
- * @param fn - An async or sync function that performs a single step of computation
- *             and returns a Trampoline (either a final value or a deferred thunk).
- *
- * @returns An async function with the same arguments, but which automatically
- *          runs the trampoline process and resolves to the *final result*.
- *
- * @example
- * // Example: Async factorial using trampoline
- * const asyncFactorial = makeAsyncTrampoline(async function fact(
- *   n: number,
- *   acc: number = 1
- * ): Promise<Trampoline<number>> {
- *   return n === 0
- *     ? acc
- *     : makeTrampolineThunk(() => fact(n - 1, acc * n));
- * });
- *
- * asyncFactorial(100000).then(console.log); // Works without stack overflow
- */
-export declare function makeAsyncTrampoline<Args extends any[], Result>(fn: (...args: Args) => Trampoline<Result> | Promise<Trampoline<Result>>): (...args: Args) => Promise<Result>;