IterPlus.ts

/* o:import {IterPlus as SyncIterPlus} from "./IterPlus"; */
/* o:import {PromiseOrValue} from "./util"; */
import {CircularBuffer} from "./CircularBuffer";

/**
 * Tests if an object is an iterator.
 * @param obj The object to test for.
 * @returns If `obj` is an iterator.
 */
export function /* r:isAsyncIter */ isIter(
    obj: any
): obj is /* o:Async- */ Iterator<unknown> {
    return (
        typeof obj === "object" &&
        obj !== null &&
        typeof obj.next === "function"
    );
}

/**
 * Tests if an object is iterable.
 * @param obj The object to test for.
 * @returns If `obj` is an iterable.
 */
export function /* r:canAsyncIter */ canIter(
    obj: any
): obj is /* o:Async- */ Iterable<unknown> {
    return (
        /* o://- */ typeof obj === "string" ||
        (typeof obj === "object" &&
            obj !== null &&
            Symbol./* r:asyncIterator */ iterator in obj)
    );
}

/**
 * Dirty workaround for Prettier moving comments.
 */
type CurIter<T> = /* o:Async- */ Iterator<T>;

/**
 * Dirty workaround for Prettier moving comments.
 */
type CurIterable<T> = /* o:Async- */ Iterable<T>;

/**
 * Typescript-abusing type that wraps every type in a tuple type with an array.
 */
type ArrayMap<T extends unknown[]> = {
    [K in keyof T]: T[K][];
};

/**
 * Typescript-abusing type that wraps every type in a tuple type with an Iterable.
 */
type /* o:Async- */ IterableMap<T extends unknown[]> = {
    [K in keyof T]: CurIterable<T[K]>;
};

/**
 * The value of null to use.
 *
 * Defaults to `null`.
 */
/* o:// */ export const nullVal = null;
/* o:import {nullVal} from "./IterPlus"; */
/**
 * The type of null to use.
 */
/* o://- */ export type Null = typeof nullVal;
/* o:import {Null} from "./IterPlus"; */

/**
 * A wrapper around an iterator to add additional functionality. The types intentionally ignore return value.
 *
 * Many of the methods consume elements of the iterator,
 * so use `tee` the iterator into two first if you want to preserve elements.
 *
 * @typeParam T The item type of the iterator.
 */
export class /* o:Async- */ IterPlus<T>
    implements CurIter<T>, /* o:Async- */ Iterable<T>
{
    /**
     * The internal iterator that this wraps around.
     */
    protected internal: /* o:Async- */ Iterator<T>;

    /**
     * Instantiates an `IterPlus` from any iterator.
     *
     * @param iter The iterator to wrap around.
     */
    constructor(iter: /* o:Async- */ Iterator<T>) {
        this.internal = iter;
    }

    /**
     * Yields the next element in the iterator.
     *
     * @returns The next element.
     */
    /* o:async */ next(): /* o:Promise<- */ IteratorResult<T> /* o:-> */ {
        return /* o:await */ this.internal.next();
    }

    /**
     * Returns the next value, or null if the iterator ended.
     *
     * @returns The next value, or null if the iterator ended.
     */
    /* o:async */ nextVal(): /* o:Promise<- */ T | Null /* o:-> */ {
        const elem = /* o:await */ this.next();
        if (elem.done) {
            return nullVal;
        }
        return elem.value;
    }

    /**
     * Makes the iterator work as an iterable.
     *
     * @returns The same iterator.
     */
    [Symbol./* r: asyncIterator */ iterator](): /* o:Async- */ Iterator<T> {
        return this;
    }

    // ==== STATIC METHODS ====
    /**
     * Generates an empty iterator.
     *
     * @typeParam T The item yielded by the iterator.
     * @returns The generated iterator.
     */
    static empty<T>(): /* o:Async- */ IterPlus<T> {
        /* o:async */ function* ret() {}
        return new /* o:Async- */ IterPlus<T>(ret());
    }

    /**
     * Generates an iterator that yields values from a function and ends once the function returns null.
     *
     * @typeParam T The item type of the iterator.
     * @param func The function to yield values, or null to end the iterator.
     * @returns The generated iterator.
     */
    static fromFunction<T>(
        func: () => /* o:PromiseOrValue<- */ T | Null /* o:-> */
    ): /* o:Async- */ IterPlus<T> {
        /* o:async */ function* ret() {
            while (true) {
                const val = /* o:await */ func();
                if (val === nullVal) {
                    break;
                }
                yield val;
            }
        }
        return new /* o:Async- */ IterPlus<T>(ret());
    }

    /**
     * Generates an iterator that lazily yields a single value.
     *
     * @typeParam T The item type of the iterator.
     * @param func The function to generate a single value.
     * @returns The generated iterator.
     */
    static onceWith<T>(
        func: () => /* o:PromiseOrValue<- */ T /* o:-> */
    ): /* o:Async- */ IterPlus<T> {
        /* o:async */ function* ret() {
            yield /* o:await */ func();
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Generates an iterator that yields a single value.
     *
     * @typeParam T The item type of the iterator.
     * @param val The value to yield.
     * @returns The generated iterator.
     */
    static once<T>(
        val: /* o:PromiseOrValue<- */ T /* o:-> */
    ): /* o:Async- */ IterPlus<T> {
        /* o:async */ function* ret() {
            yield /* o:await */ val;
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Generates an iterator that endlessly calls a function.
     *
     * @typeParam T The item type of the iterator.
     * @param func The function to generate values.
     * @returns The generated iterator.
     */
    static repeatWith<T>(
        func: () => /* o:PromiseOrValue<- */ T /* o:-> */
    ): /* o:Async- */ IterPlus<T> {
        /* o:async */ function* ret() {
            while (true) {
                yield /* o:await */ func();
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Generates an iterator that endlessly repeats a value.
     *
     * @typeParam T The item type of the iterator.
     * @param val The value to yield.
     * @returns The generated iterator.
     */
    static repeat<T>(
        val: /* o:PromiseOrValue<- */ T /* o:-> */
    ): /* o:Async- */ IterPlus<T> {
        /* o:async */ function* ret() {
            while (true) {
                yield /* o:await */ val;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Generates an iterator that generates values based on the previous value.
     *
     * @typeParam T The item type of the iterator.
     * @param first The initial value.
     * @param func The function to generate new values.
     * @returns The generated iterator.
     */
    static successors<T>(
        first: /* o:PromiseOrValue<- */ T | Null /* o:-> */,
        func: (prev: T) => /* o:PromiseOrValue<- */ T | Null /* o:-> */
    ): /* o:Async- */ IterPlus<T> {
        /* o:async */ function* ret() {
            let val = /* o:await */ first;
            while (true) {
                if (val === nullVal) {
                    break;
                }
                yield val;
                val = /* o:await */ func(val);
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    static unfold<T, A>(
        func: (accum: A) => /* o:PromiseOrValue<- */ [T, A] | Null /* o:-> */,
        init: /* o:PromiseOrValue<- */ A /* o:-> */
    ): /* o:Async- */ IterPlus<T> {
        /* o:async */ function* ret() {
            let accum: A = /* o:await */ init;
            while (true) {
                const pair = /* o:await */ func(accum);
                if (pair === nullVal) {
                    break;
                }
                yield pair[0];
                accum = pair[1];
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Generates an iterator that cycles through an iterable.
     *
     * While this **does** work on infinite iterators,
     * it should be avoided as it stores all elements,
     * leading to an ever-growing memory usage.
     *
     * @typeParam T The item type of the iterator.
     * @param data The iterable to cycle through.
     * @returns The generated iterator.
     */
    static cycle<T>(
        data: /* o:Async- */ Iterable<T>
    ): /* o:Async- */ IterPlus<T> {
        /* o:async */ function* ret() {
            const cache = [];
            /* r:for await */ for (const item of data) {
                yield item;
                cache.push(item);
            }
            while (true) {
                yield* cache;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Generates an iterator that iterates through lexicographically sorted combinations without repetition of a dataset.
     *
     * @typeParam T The item type of the iterator.
     * @param data The data to generate combinations from.
     * @param count The number of elements in each combination.
     * @returns The generated iterator.
     */
    static combinations<T>(
        data: T[],
        count: number = data.length
    ): /* o:Async- */ IterPlus<T[]> {
        /* o:async */ function* ret() {
            if (count > data.length || count < 0) {
                return;
            }
            const indices: number[] = [];
            for (let i = 0; i < count; i++) {
                indices.push(i);
            }
            while (true) {
                yield indices.map((v) => data[v]);
                let i;
                for (i = 0; i < indices.length; i++) {
                    if (indices[indices.length - i - 1] < data.length - i - 1) {
                        indices[indices.length - i - 1]++;
                        break;
                    }
                }
                if (i === indices.length) {
                    break;
                }
                i--;
                while (i >= 0) {
                    indices[indices.length - i - 1] =
                        indices[indices.length - i - 2] + 1;
                    i--;
                }
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Generates an iterator that iterates through lexicographically sorted combinations with repetition of a dataset.
     *
     * @typeParam T The item type of the iterator.
     * @param data The data to generate combinations from.
     * @param count The number of elements in each combination.
     * @returns The generated iterator.
     */
    static combinationsWithRepetition<T>(
        data: T[],
        count: number = data.length
    ): /* o:Async- */ IterPlus<T[]> {
        /* o:async */ function* ret() {
            if (data.length <= 0 || count < 0) {
                return;
            }
            const indices: number[] = [];
            for (let i = 0; i < count; i++) {
                indices.push(0);
            }
            while (true) {
                yield indices.map((v) => data[v]);
                let i;
                for (i = 0; i < indices.length; i++) {
                    if (indices[indices.length - i - 1] < data.length - 1) {
                        indices[indices.length - i - 1]++;
                        break;
                    }
                }
                if (i === indices.length) {
                    break;
                }
                i--;
                while (i >= 0) {
                    indices[indices.length - i - 1] =
                        indices[indices.length - i - 2];
                    i--;
                }
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Generates an iterator that iterates through lexicographically sorted permutations without repetition of a dataset.
     *
     * @typeParam T The item type of the iterator.
     * @param data The data to generate permutations from.
     * @param count The number of elements in each permutations.
     * @returns The generated iterator.
     */
    static permutations<T>(
        data: T[],
        count: number = data.length
    ): /* o:Async- */ IterPlus<T[]> {
        /* o:async */ function* ret() {
            if (count > data.length || count < 0) {
                return;
            }
            if (count === 0) {
                yield [];
                return;
            }
            const indices: number[] = [];
            const cycles: number[] = [];
            for (let i = 0; i < data.length; i++) {
                indices.push(i);
            }
            for (let i = data.length; i > data.length - count; i--) {
                cycles.push(i);
            }
            yield indices.slice(0, count).map((v) => data[v]);
            while (true) {
                let i;
                for (i = count - 1; i >= 0; i--) {
                    cycles[i]--;
                    if (cycles[i] === 0) {
                        const first = indices[i];
                        for (let j = i; j < indices.length - 1; j++) {
                            indices[j] = indices[j + 1];
                        }
                        indices[indices.length - 1] = first;
                        cycles[i] = data.length - i;
                    } else {
                        const temp = indices[i];
                        indices[i] = indices[indices.length - cycles[i]];
                        indices[indices.length - cycles[i]] = temp;
                        yield indices.slice(0, count).map((v) => data[v]);
                        break;
                    }
                }
                if (i < 0) {
                    return;
                }
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Generates an iterator that iterates through lexicographically sorted permutations with repetition of a dataset.
     *
     * @typeParam T The item type of the iterator.
     * @param data The data to generate permutations from.
     * @param count The number of elements in each permutations.
     * @returns The generated iterator.
     */
    static permutationsWithRepetition<T>(
        data: T[],
        count: number = data.length
    ): /* o:Async- */ IterPlus<T[]> {
        /* o:async */ function* ret() {
            if (data.length <= 0 || count < 0) {
                return;
            }
            if (count === 0) {
                yield [];
                return;
            }
            const indices: number[] = [];
            for (let i = 0; i < count; i++) {
                indices.push(0);
            }
            while (true) {
                yield indices.map((v) => data[v]);
                let i;
                for (i = 0; i < indices.length; i++) {
                    if (indices[indices.length - i - 1] < data.length - 1) {
                        indices[indices.length - i - 1]++;
                        break;
                    }
                }
                if (i === indices.length) {
                    break;
                }
                i--;
                while (i >= 0) {
                    indices[indices.length - i - 1] = 0;
                    i--;
                }
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Generates an iterator that iterates through the lexicographically sorted powerset of a dataset.
     *
     * @typeParam T The item type of the iterator.
     * @param data The data to get the powerset of.
     * @return The generated iterator.
     */
    static powerset<T>(data: T[]): /* o:Async- */ IterPlus<T[]> {
        /* o:async */ function* ret() {
            for (let i = 0; i <= data.length; i++) {
                yield* /* o:Async- */ IterPlus.combinations(data, i);
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Generates an iterator that generates a lexicographically sorted cartesian product.
     *
     * @typeParam T The item type of the iterator.
     * @param data The iterators to take the product of.
     * @returns The generated iterator.
     */
    static product<T extends unknown[]>(
        ...data: ArrayMap<T>
    ): /* o:Async- */ IterPlus<T> {
        /* o:async */ function* ret() {
            if (data.length <= 0) {
                return;
            }
            const indices: number[] = [];
            for (let i = 0; i < data.length; i++) {
                if (data[i].length === 0) {
                    return;
                }
                indices.push(0);
            }
            while (true) {
                yield indices.map((v, i) => data[i][v]) as T;
                let i;
                for (i = 0; i < indices.length; i++) {
                    if (
                        indices[data.length - i - 1] <
                        data[data.length - i - 1].length - 1
                    ) {
                        indices[data.length - i - 1]++;
                        break;
                    }
                }
                if (i === indices.length) {
                    break;
                }
                i--;
                while (i >= 0) {
                    indices[data.length - i - 1] = 0;
                    i--;
                }
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Checks if every element in the iterator matches a predicate.
     *
     * This function is short-circuiting,
     * so if any element returns `false`,
     * the function immediately returns `false`.
     *
     * @param pred The predicate function.
     * @returns If every element satisfies the predicate.
     */
    /* o:async */ every(
        pred: (elem: T) => /* o:PromiseOrValue<- */ boolean /* o:-> */
    ): /* o:Promise<- */ boolean /* o:-> */ {
        /* r:for await */ for (const elem of this) {
            if (!(/* o:await */ pred(elem))) {
                return false;
            }
        }
        return true;
    }

    /**
     * Checks if some element in the iterator matches a predicate.
     *
     * This function is short-circuiting,
     * so if any element returns `true`,
     * the function immediately returns `true`.
     *
     * @param pred The predicate function.
     * @returns If some element satisfies the predicate.
     */
    /* o:async */ some(
        pred: (elem: T) => /* o:PromiseOrValue<- */ boolean /* o:-> */
    ): /* o:Promise<- */ boolean /* o:-> */ {
        /* r:for await */ for (const elem of this) {
            if (/* o:await */ pred(elem)) {
                return true;
            }
        }
        return false;
    }

    /**
     * Concatenates one or more iterables to this iterator,
     * creating an iterator that yields their elements in sequentual order.
     *
     * @param iters The iterables to chain to this one.
     * @returns The generated iterator.
     */
    concat(...iters: /* o:Async- */ Iterable<T>[]): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            for (const iter of [that, ...iters]) {
                /* r:for await */ for (const val of iter) {
                    yield val;
                }
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Lexicographically compares this iterator with another using a comparison function.
     *
     * This function is short-circuiting,
     * so it stops on the first inequality.
     *
     * @typeParam O The type of the other iterator.
     * @param other Iterable to compare to.
     * @param cmp A function that should return a negative for less than, zero for equal to,
     * and positive for greater than.
     * @returns -1 if this is less than the other, 0 if it's equal, and 1 if it's greater than.
     */
    /* o:async */ compareBy<O>(
        other: /* o:Async- */ Iterable<O>,
        cmp: (first: T, second: O) => /* o:PromiseOrValue<- */ number /* o:-> */
    ): /* o:Promise<- */ number /* o:-> */ {
        const iter = other[Symbol./* r:asyncIterator */ iterator]();
        while (true) {
            const a = /* o:await */ this.next();
            const b = /* o:await */ iter.next();
            if (a.done && b.done) {
                return 0;
            } else if (a.done) {
                return -1;
            } else if (b.done) {
                return 1;
            } else {
                const diff = /* o:await */ cmp(a.value, b.value);
                if (diff < 0) {
                    return -1;
                } else if (diff > 0) {
                    return 1;
                }
            }
        }
    }

    /**
     * Lexicographically compares this iterator with another using a key.
     *
     * This function is short-circuiting,
     * so it stops on the first inequality.
     *
     * @typeParam K The type of the key.
     * @param other Iterable to compare to.
     * @param key Function to generate a key to compare with from an element.
     * @returns -1 if this is less than the other, 0 if it's equal, and 1 if it's greater than.
     */
    /* o:async */ compareWith<K>(
        other: /* o:Async- */ Iterable<T>,
        key: (elem: T) => /* o:PromiseOrValue<- */ K /* o:-> */
    ): /* o:Promise<- */ number /* o:-> */ {
        return this.compareBy(
            other,
            /* o:async */ function (a, b) {
                const ak = /* o:await */ key(a);
                const bk = /* o:await */ key(b);
                if (ak < bk) {
                    return -1;
                }
                if (ak > bk) {
                    return 1;
                }
                return 0;
            }
        );
    }

    /**
     * Lexicographically compares this iterator with another.
     *
     * This function is short-circuiting,
     * so it stops on the first inequality.
     *
     * @param other Iterable to compare to.
     * @returns -1 if this is less than the other, 0 if it's equal, and 1 if it's greater than.
     */
    /* o:async */ compare(
        other: /* o:Async- */ Iterable<T>
    ): /* o:Promise<- */ number /* o:-> */ {
        return this.compareBy(
            other,
            /* o:async */ function (a, b) {
                if (a < b) {
                    return -1;
                }
                if (a > b) {
                    return 1;
                }
                return 0;
            }
        );
    }

    /**
     * Collects the items in this iterator into an array.
     *
     * @returns An array with the items in the iterator.
     */
    /* o:async */ collect(): /* o:Promise<- */ T[] /* o:-> */ {
        const ret: T[] = [];
        /* r:for await */ for (const item of this) {
            ret.push(item);
        }
        return ret;
    }

    /**
     * Calls a specified collector function with this iterator as its only argument.
     *
     * @param collector The collector to use.
     * @returns The return value of the collector.
     */
    collectWith<R>(collector: (iter: /* o:Async- */ IterPlus<T>) => R): R {
        return collector(this);
    }

    /**
     * Calls a specified constructor with this iterator as its only argument.
     *
     * @param ctor The constructor to use.
     * @returns The constructed value.
     */
    construct<R>(ctor: new (item: /* o:Async- */ IterPlus<T>) => R): R {
        return new ctor(this);
    }

    /**
     * Counts the number of items in this iterator.
     *
     * @returns The number of items in the iterator.
     */
    /* o:async */ count(): /* o:Promise<- */ number /* o:-> */ {
        let ret: number = 0;
        /* r:for await */ for (const item of this) {
            ret++;
        }
        return ret;
    }

    /**
     * Generates an iterator that yields a 2 element array with the index and the element.
     *
     * @returns The generated iterator.
     */
    enumerate(): /* o:Async- */ IterPlus<[number, T]> {
        const that = this;
        /* o:async */ function* ret() {
            let count = 0;
            /* r:for await */ for (const item of that) {
                yield [count, item] as [number, T];
                count++;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Checks if this iterator is equal to another using a comparison function.
     *
     * This function is short-circuiting,
     * so it stops on the first inequality.
     *
     * @typeParam O The type of the other iterable.
     * @param other Iterable to compare to.
     * @param cmp A function that checks if elements are equal.
     * @returns If the two iterators are equal.
     */
    /* o:async */ equalsBy<O>(
        other: /* o:Async- */ Iterable<O>,
        cmp: (
            first: T,
            second: O
        ) => /* o:PromiseOrValue<- */ boolean /* o:-> */
    ): /* o:Promise<- */ boolean /* o:-> */ {
        const iter = other[Symbol./* r:asyncIterator */ iterator]();
        while (true) {
            const a = /* o:await */ this.next();
            const b = /* o:await */ iter.next();
            if (a.done && b.done) {
                return true;
            } else if (a.done || b.done) {
                return false;
            } else {
                const eq = /* o:await */ cmp(a.value, b.value);
                if (!eq) {
                    return false;
                }
            }
        }
    }

    /**
     * Checks if this iterator is equal to another using a key.
     *
     * This function is short-circuiting,
     * so it stops on the first inequality.
     *
     * @typeParam K The type of the key.
     * @param other Iterable to compare to.
     * @param key Function to generate a key to compare with from an element.
     * @returns If the two iterators are equal.
     */
    /* o:async */ equalsWith<K>(
        other: /* o:Async- */ Iterable<T>,
        key: (elem: T) => /* o:PromiseOrValue<- */ K /* o:-> */
    ): /* o:Promise<- */ boolean /* o:-> */ {
        const iter = other[Symbol./* r:asyncIterator */ iterator]();
        while (true) {
            const a = /* o:await */ this.next();
            const b = /* o:await */ iter.next();
            if (a.done && b.done) {
                return true;
            } else if (a.done || b.done) {
                return false;
            } else {
                const eq =
                    /* o:await */ key(a.value) === /* o:await */ key(b.value);
                if (!eq) {
                    return false;
                }
            }
        }
    }

    /**
     * Checks if this iterator is equal to another.
     *
     * This function is short-circuiting,
     * so it stops on the first inequality.
     *
     * @param other Iterable to compare to.
     * @returns If the two iterators are equal.
     */
    /* o:async */ equals(
        other: /* o:Async- */ Iterable<T>
    ): /* o:Promise<- */ boolean /* o:-> */ {
        const iter = other[Symbol./* r:asyncIterator */ iterator]();
        while (true) {
            const a = /* o:await */ this.next();
            const b = /* o:await */ iter.next();
            if (a.done && b.done) {
                return true;
            } else if (a.done || b.done) {
                return false;
            } else {
                const eq = a.value === b.value;
                if (!eq) {
                    return false;
                }
            }
        }
    }

    /**
     * Generates an iterator that only yields elements that match a predicate.
     *
     * @param pred The predicate function.
     * @returns The generated iterator.
     */
    filter(
        pred: (elem: T) => /* o:PromiseOrValue<- */ boolean /* o:-> */
    ): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            /* r:for await */ for (const elem of that) {
                if (/* o:await */ pred(elem)) {
                    yield elem;
                }
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Generates a mapped iterator that yields non-null elements.
     *
     * @typeParam K The resulting type.
     * @typeParam N The type of the null value.
     * @param func The mapping function.
     * @returns The generated iterator.
     */
    filterMap<K>(
        func: (elem: T) => /* o:PromiseOrValue<- */ K | Null /* o:-> */
    ): /* o:Async- */ IterPlus<K> {
        const that = this;
        /* o:async */ function* ret() {
            /* r:for await */ for (const elem of that) {
                const val = /* o:await */ func(elem);
                if (val !== nullVal) {
                    yield val as K;
                }
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Finds an element that satisfies a predicate.
     *
     * This function is short-circuiting,
     * so it stops on the first match.
     *
     * @param pred The predicate function.
     * @returns The element, or null if none was found.
     */
    /* o:async */ find(
        pred: (elem: T) => /* o:PromiseOrValue<- */ boolean /* o:-> */
    ): /* o:Promise<- */ T | Null /* o:-> */ {
        /* r:for await */ for (const elem of this) {
            if (/* o:await */ pred(elem)) {
                return elem;
            }
        }
        return nullVal;
    }

    /**
     * Runs a function on every element and returns the first non-null element.
     *
     * This function is short-circuiting,
     * so it stops on the first match.
     *
     * @typeParam K The resulting type.
     * @typeParam N The type of the null value.
     * @param func The mapping function.
     * @returns The element, or null if none was found.
     */
    /* o:async */ findMap<K>(
        func: (elem: T) => /* o:PromiseOrValue<- */ K | Null /* o:-> */
    ): /* o:Promise<- */ K | Null /* o:-> */ {
        /* r:for await */ for (const elem of this) {
            const val = /* o:await */ func(elem);
            if (val !== nullVal) {
                return val as K;
            }
        }
        return nullVal;
    }

    /**
     * Flattens an iterator of iterables,
     * yielding an iterator that sequentially produces their elements.
     *
     * @typeParam K The internal type.
     * @returns The generated iterator.
     */
    flatten<K>(
        this: /* o:Async- */ IterPlus</* o:Iterable<K> | Async- */ Iterable<K>>
    ): /* o:Async- */ IterPlus<K> {
        const that = this;
        /* o:async */ function* ret() {
            /* r:for await */ for (const iterable of that) {
                yield* iterable;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Lazily maps an iterator, creating a new iterator where each element has been modified by a function.
     *
     * If you want to immediately run a function on all elements of the iterator, use `forEach` instead.
     *
     * @typeParam K The resulting type.
     * @param func The mapping function.
     * @returns The generated iterator.
     */
    map<K>(
        func: (elem: T) => /* o:PromiseOrValue<- */ K /* o:-> */
    ): /* o:Async- */ IterPlus<K> {
        const that = this;
        /* o:async */ function* ret() {
            /* r:for await */ for (const elem of that) {
                yield /* o:await */ func(elem);
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Maps an iterator of iterables,
     * and calls a function with the contents of the iterable as the argument.
     *
     * @typeParam K The iterable type.
     * @typeParam R The resulting type.
     * @param func The mapping function.
     * @returns The generated iterator.
     */
    starmap<K, R>(
        this: /* o:Async- */ IterPlus<Iterable<K>>,
        func: (...args: K[]) => /* o:PromiseOrValue<- */ R /* o:-> */
    ): /* o:Async- */ IterPlus<R> {
        const that = this;
        /* o:async */ function* ret() {
            /* r:for await */ for (const elem of that) {
                yield /* o:await */ func(...elem);
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Maps then flattens an iterator.
     *
     * @typeParam K The resulting type.
     * @param func The mapping function.
     * @returns The generated iterator.
     */
    flatMap<K>(
        func: (
            elem: T
        ) => /* o:Iterable<K> | AsyncIterable<K> | Promise<Iterable<K> | Async- */ Iterable<K> /* o:-> */
    ): /* o:Async- */ IterPlus<K> {
        const that = this;
        /* o:async */ function* ret() {
            /* r:for await */ for (const elem of that) {
                yield* /* o:await */ func(elem);
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Runs a function for every element of the iterator, keeping track of an accumulator.
     *
     * @typeParam A The type of the accumulator.
     * @param func The reducing function.
     * @param initializer The initial accumulator.
     * @returns The final accumulator.
     */
    /* o: async */ reduce<A>(
        func: (accum: A, elem: T) => /* o:PromiseOrValue<- */ A /* o:-> */,
        initializer: A
    ): /* o:Promise<- */ A /* o:-> */;
    /**
     * Runs a function for every element of the iterator, keeping track of an accumulator.
     *
     * Uses the first element as the initial accumulator,
     * and it will be skipped over in the reduction.
     *
     * @param func The reducing function.
     * @throws If the iterator is empty,
     * then an error will be thrown.
     * @returns The final accumulator.
     */
    reduce(
        func: (accum: T, elem: T) => /* o:PromiseOrValue<- */ T /* o:-> */
    ): /* o:Promise<- */ T /* o:-> */;
    /* o: async */ reduce<A>(
        func: (accum: A, elem: T) => /* o:PromiseOrValue<- */ A /* o:-> */,
        initializer?: A
    ): /* o:Promise<- */ A /* o:-> */ {
        let accum: A;
        if (initializer === undefined) {
            const next = /* o: await */ this.next();
            if (next.done) {
                throw new TypeError(
                    "Reduce of empty iterator with no initializer."
                );
            }
            accum = next.value as unknown as A;
        } else {
            accum = initializer as A;
        }
        /* r:for await */ for (const elem of this) {
            accum = /* o:await */ func(accum, elem);
        }
        return accum;
    }

    /**
     * Runs a function on each element of an iterator.
     *
     * This is equivalent to running a for loop on the iterator.
     * If you want to obtain the values, consider using `.map(func).collect()` instead.
     *
     * @param func The function to run.
     */
    /* o:async */ forEach(
        func: (elem: T) => /* o:PromiseOrValue<- */ unknown /* o:-> */
    ): /* o:Promise<- */ void /* o:-> */ {
        /* r:for await */ for (const elem of this) {
            /* o:await */ func(elem);
        }
    }

    /**
     * Generates an iterator that is guaranteed to never yield a value after finishing.
     *
     * @returns The generated iterator.
     */
    fuse(): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            /* r:for await */ for (const elem of that) {
                yield elem;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Lazily runs functions on an iterator, returning a new iterator with unmodified elements.
     *
     * This function is primarily used as a debugging tool to inspect elements in the middle of an iterator function chain.
     *
     * @param func The function to call.
     * @returns The generated iterator.
     */
    inspect(
        func: (elem: T) => /* o:PromiseOrValue<- */ unknown /* o:-> */
    ): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            /* r:for await */ for (const elem of that) {
                /* o:await */ func(elem);
                yield elem;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Determines if an iterator is partitioned by a predicate
     * (Items that return true come before items that return false).
     *
     * This function is short-circuiting,
     * so it stops on the first non-partitioned element.
     *
     * @param pred The predicate function.
     * @returns If the iterator is partitioned.
     */
    /* o:async */ isPartitioned(
        pred: (elem: T) => /* o:PromiseOrValue<- */ boolean /* o:-> */
    ): /* o:Promise<- */ boolean /* o:-> */ {
        let seenFalse = false;
        /* r:for await */ for (const elem of this) {
            if (/* o:await */ pred(elem)) {
                if (seenFalse) {
                    return false;
                }
            } else {
                seenFalse = true;
            }
        }
        return true;
    }

    /**
     * Determines if an iterator is sorted increasingly by a comparison function.
     *
     * This function is short-circuiting,
     * so it stops on the first non-sorted element.
     *
     * @param cmp A function that should return a negative for less than, zero for equal to,
     * and positive for greater than.
     * @returns If the iterator is sorted.
     */
    /* o:async */ isSortedBy(
        cmp: (first: T, second: T) => /* o:PromiseOrValue<- */ number /* o:-> */
    ): /* o:Promise<- */ boolean /* o:-> */ {
        const first = /* o:await */ this.next();
        if (first.done) {
            return true;
        }
        let prev = first.value;
        /* r:for await */ for (const elem of this) {
            if (/* o:await */ cmp(prev, elem) > 0) {
                return false;
            }
            prev = elem;
        }
        return true;
    }

    /**
     * Determines if an iterator is sorted increasingly by a key.
     *
     * This function is short-circuiting,
     * so it stops on the first non-sorted element.
     *
     * @typeParam K The type of the key.
     * @param key The key function.
     * @returns If the iterator is sorted.
     */
    /* o:async */ isSortedWith<K>(
        key: (elem: T) => /* o:PromiseOrValue<- */ K /* o:-> */
    ): /* o:Promise<- */ boolean /* o:-> */ {
        const first = /* o:await */ this.next();
        if (first.done) {
            return true;
        }
        let prev = /* o:await */ key(first.value);
        /* r:for await */ for (const elem of this) {
            const elKey = /* o:await */ key(elem);
            if (prev > elKey) {
                return false;
            }
            prev = elKey;
        }
        return true;
    }

    /**
     * Determines if an iterator is sorted increasingly.
     *
     * This function is short-circuiting,
     * so it stops on the first non-sorted element.
     *
     * @returns If the iterator is sorted.
     */
    isSorted(): /* o:Promise<- */ boolean /* o:-> */ {
        return this.isSortedWith(/* o:async */ (x) => x);
    }

    /**
     * Finds the last element in an iterator.
     *
     * @returns The last element of the iterator, or null if the iterator is empty.
     */
    /* o:async */ last(): /* o:Promise<- */ T | Null /* o:-> */ {
        let last: T | Null = nullVal;
        /* r:for await */ for (const elem of this) {
            last = elem;
        }
        return last;
    }

    /**
     * Lazily maps an iterator until it encounters null.
     *
     * @typeParam K The resulting type.
     * @param func The mapping function.
     * @returns The generated iterator.
     */
    mapWhile<K>(
        func: (elem: T) => /* o:PromiseOrValue<- */ K | Null /* o:-> */
    ): /* o:Async- */ IterPlus<K> {
        const that = this;
        /* o:async */ function* ret() {
            /* r:for await */ for (const elem of that) {
                const val = /* o:await */ func(elem);
                if (val === null) {
                    break;
                }
                yield val as K;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Finds the maximum value of an iterator with a comparison function.
     *
     * @param cmp A function that should return a negative for less than, zero for equal to,
     * and positive for greater than.
     * @param overwrite If `true`, elements will be counted as the new maximum if they are equal to the maximum.
     * Defaults to `false`.
     * @returns The maximum element, or null if the iterator is empty.
     */
    /* o: async */ maxBy(
        cmp: (
            first: T,
            second: T
        ) => /* o:PromiseOrValue<- */ number /* o:-> */,
        overwrite: boolean = false
    ): /* o:Promise<- */ T | null /* o:-> */ {
        const next = /* o: await */ this.next();
        if (next.done) {
            return null;
        }
        let curMax = next.value;
        /* r:for await */ for (const elem of this) {
            const diff = /* o: await */ cmp(elem, curMax);
            if (diff > 0 || (overwrite && diff === 0)) {
                curMax = elem;
            }
        }
        return curMax;
    }

    /**
     * Finds the maximum value of an iterator with a key.
     *
     * @typeParam K The type of the key.
     * @param key The key function.
     * @param overwrite If `true`, elements will be counted as the new maximum if they are equal to the maximum.
     * Defaults to `false`.
     * @returns The maximum element, or null if the iterator is empty.
     */
    /* o: async */ maxWith<K>(
        key: (elem: T) => /* o:PromiseOrValue<- */ K /* o:-> */,
        overwrite: boolean = false
    ): /* o:Promise<- */ T | null /* o:-> */ {
        const next = /* o: await */ this.next();
        if (next.done) {
            return null;
        }
        let curMax = next.value;
        let curMaxKey: K = /* o:await */ key(curMax);
        /* r:for await */ for (const elem of this) {
            const elemKey = /* o:await */ key(elem);
            if (elemKey > curMaxKey || (overwrite && elemKey === curMaxKey)) {
                curMax = elem;
                curMaxKey = elemKey;
            }
        }
        return curMax;
    }

    /**
     * Finds the maximum value of an iterator.
     *
     * @param overwrite If `true`, elements will be counted as the new maximum if they are equal to the maximum.
     * Defaults to `false`.
     * @returns The maximum element, or null if the iterator is empty.
     */
    max(overwrite: boolean = false): /* o:Promise<- */ T | Null /* o:-> */ {
        return this.maxWith(/* o:async */ (x) => x, overwrite);
    }

    /**
     * Finds the minimum value of an iterator with a comparison function.
     *
     * @param cmp A function that should return a negative for less than, zero for equal to,
     * and positive for greater than.
     * @param overwrite If `true`, elements will be counted as the new minimum if they are equal to the minimum.
     * Defaults to `false`.
     * @returns The minimum element, or null if the iterator is empty.
     */
    /* o: async */ minBy(
        cmp: (
            first: T,
            second: T
        ) => /* o:PromiseOrValue<- */ number /* o:-> */,
        overwrite: boolean = false
    ): /* o:Promise<- */ T | null /* o:-> */ {
        const next = /* o: await */ this.next();
        if (next.done) {
            return null;
        }
        let curMax = next.value;
        /* r:for await */ for (const elem of this) {
            const diff = /* o: await */ cmp(elem, curMax);
            if (diff < 0 || (overwrite && diff === 0)) {
                curMax = elem;
            }
        }
        return curMax;
    }

    /**
     * Finds the minimum value of an iterator with a key.
     *
     * @typeParam K The type of the key.
     * @param key The key function.
     * @param overwrite If `true`, elements will be counted as the new minimum if they are equal to the minimum.
     * Defaults to `false`.
     * @returns The minimum element, or null if the iterator is empty.
     */
    /* o: async */ minWith<K>(
        key: (elem: T) => /* o:PromiseOrValue<- */ K /* o:-> */,
        overwrite: boolean = false
    ): /* o:Promise<- */ T | null /* o:-> */ {
        const next = /* o: await */ this.next();
        if (next.done) {
            return null;
        }
        let curMax = next.value;
        let curMaxKey: K = /* o:await */ key(curMax);
        /* r:for await */ for (const elem of this) {
            const elemKey = /* o:await */ key(elem);
            if (elemKey < curMaxKey || (overwrite && elemKey === curMaxKey)) {
                curMax = elem;
                curMaxKey = elemKey;
            }
        }
        return curMax;
    }

    /**
     * Finds the minimum value of an iterator.
     *
     * @param overwrite If `true`, elements will be counted as the new minimum if they are equal to the minimum.
     * Defaults to `false`.
     * @returns The minimum element, or null if the iterator is empty.
     */
    min(overwrite: boolean = false): /* o:Promise<- */ T | Null /* o:-> */ {
        return this.minWith(/* o:async */ (x) => x, overwrite);
    }

    /**
     * Finds the nth element in an iterator.
     *
     * @param n The number element to get.
     * @returns The nth element of the iterator, or null if the iterator is too short.
     */
    /* o:async */ nth(n: number): /* o:Promise<- */ T | Null /* o:-> */ {
        if (n < 0) {
            return nullVal;
        }
        /* r:for await */ for (const elem of this) {
            if (n <= 0) {
                return elem;
            }
            n--;
        }
        return nullVal;
    }

    /**
     * Partitions an iterator into two groups.
     *
     * @param pred The predicate function.
     * @returns An array with two elements:
     *  - The elements where the predicate returned true.
     *  - The elements where the predicate returned false.
     */
    /* o:async */ partition(
        pred: (elem: T) => /* o:PromiseOrValue<- */ boolean /* o:-> */
    ): /* o:Promise<- */ [T[], T[]] /* o:-> */ {
        const truePart: T[] = [];
        const falsePart: T[] = [];
        /* r:for await */ for (const elem of this) {
            if (/* o:await */ pred(elem)) {
                truePart.push(elem);
            } else {
                falsePart.push(elem);
            }
        }
        return [truePart, falsePart];
    }

    /**
     * Generates a `Peekable` iterator.
     *
     * @returns The peekable iterator.
     */
    peekable(): /* o:Async- */ Peekable<T> {
        return new /* o:Async- */ Peekable(this);
    }

    /**
     * Finds the index of an element that satisfies a predicate.
     *
     * If you want to find the value and the index, consider using `enumerate`
     * then using `find`.
     *
     * This function is short-circuiting,
     * so it stops on the first match.
     *
     * @param pred The predicate function.
     * @returns The index, or -1 if none was found.
     */
    /* o:async */ findIndex(
        pred: (elem: T) => /* o:PromiseOrValue<- */ boolean /* o:-> */
    ): /* o:Promise<- */ number /* o:-> */ {
        let count = 0;
        /* r:for await */ for (const elem of this) {
            if (/* o:await */ pred(elem)) {
                return count;
            }
            count++;
        }
        return -1;
    }

    /**
     * Returns the product of all elements in the iterator.
     *
     * @param empty The default value for an empty iterator. Defaults to 1.
     * @returns The product.
     */
    /* o: async */ product(
        this: /* o:Async- */ IterPlus<number>,
        empty?: number
    ): /* o:Promise<- */ number /* o:-> */;
    /**
     * Returns the product of all elements in the iterator.
     *
     * @param empty The default value for an empty iterator.
     * **For bigint iterators it's advised to explicitly set this to 1n or another bigint.**
     * @returns The product.
     */
    /* o: async */ product(
        this: /* o:Async- */ IterPlus<bigint>,
        empty: bigint
    ): /* o:Promise<- */ bigint /* o:-> */;
    /* o: async */ product(empty: any = 1): /* o:Promise<- */ any /* o:-> */ {
        let accum: any;
        let typechecked = false;
        /* r:for await */ for (const elem of this) {
            if (!typechecked) {
                accum = elem;
                typechecked = true;
            } else {
                accum = accum * (elem as unknown as number);
            }
        }
        if (accum === undefined) {
            return empty;
        }
        return accum as unknown as T;
    }

    /**
     * Returns the sum of all elements in the iterator.
     *
     * @param empty The default value for an empty iterator. Defaults to 0.
     * @returns The sum.
     */
    /* o: async */ sum(
        this: /* o:Async- */ IterPlus<number>,
        empty?: number
    ): /* o:Promise<- */ number /* o:-> */;
    /**
     * Returns the sum of all elements in the iterator.
     *
     * @param empty The default value for an empty iterator.
     * **For bigint iterators it's advised to explicitly set this to 0n or another bigint.**
     * @returns The sum.
     */
    /* o: async */ sum(
        this: /* o:Async- */ IterPlus<bigint>,
        empty: bigint
    ): /* o:Promise<- */ bigint /* o:-> */;
    /**
     * Returns the sum of all elements in the iterator.
     *
     * @param empty The default value for an empty iterator.
     * **For string iterators it's advised to explicitly set this to "" or another string.**
     * @returns The sum.
     */
    /* o: async */ sum(
        this: /* o:Async- */ IterPlus<string>,
        empty: string
    ): /* o:Promise<- */ string /* o:-> */;
    /* o: async */ sum(empty: any = 0): /* o:Promise<- */ any /* o:-> */ {
        let accum: any;
        let typechecked = false;
        /* r:for await */ for (const elem of this) {
            if (!typechecked) {
                accum = elem;
                typechecked = true;
            } else {
                accum += elem;
            }
        }
        if (accum === undefined) {
            return empty;
        }
        return accum as unknown as T;
    }

    /**
     * Consumes the iterator and reverses it.
     *
     * This has to immediately resolve every element in the iterator,
     * so it is equivalent to collecting to an array and revsersing the array,
     * so it is very inefficient on memory and should be avoided.
     *
     * @returns The reversed iterator.
     */
    /* o: async */ reverse(): /* o:Promise<Sync- */ IterPlus<T> /* o:-> */ {
        const collected: T[] = [];
        /* r:for await */ for (const item of this) {
            collected.push(item);
        }
        return new /* o:Sync- */ IterPlus(collected.reverse().values());
    }

    /**
     * Skips the first n elements of an iterator.
     *
     * @param n The number of elements to skip.
     * @returns The generated iterator.
     */
    skip(n: number): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            for (let i = 0; i < n; i++) {
                const val = /* o:await */ that.next();
                if (val.done) {
                    return;
                }
            }
            yield* that;
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Skips elements of an iterator while a predicate is met.
     *
     * @param pred The predicate function.
     * @returns The generated iterator.
     */
    skipWhile(
        pred: (elem: T) => /* o:PromiseOrValue<- */ boolean /* o:-> */
    ): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            while (true) {
                const val = /* o:await */ that.next();
                if (val.done) {
                    return;
                }
                if (!pred(val.value)) {
                    yield val.value;
                    break;
                }
            }
            yield* that;
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Takes the first n elements of an iterator.
     *
     * @param n The number of elements to take.
     * @returns The generated iterator.
     */
    take(n: number): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            for (let i = 0; i < n; i++) {
                const val = /* o:await */ that.next();
                if (val.done) {
                    return;
                }
                yield val.value;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Takes elements of an iterator while a predicate is met.
     *
     * @param pred The predicate function.
     * @returns The generated iterator.
     */
    takeWhile(
        pred: (elem: T) => /* o:PromiseOrValue<- */ boolean /* o:-> */
    ): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            while (true) {
                const val = /* o:await */ that.next();
                if (val.done) {
                    return;
                }
                if (!pred(val.value)) {
                    return;
                }
                yield val.value;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * "Unzips" an iterator of tuples into a tuple of arrays.
     *
     * @typeParam K The tuple type.
     * @returns A tuple with the individual elements.
     */
    /* o:async */ unzip<K extends unknown[]>(
        this: /* o:Async- */ IterPlus<K>
    ): /* o:Promise<- */ ArrayMap<K> /* o:-> */ {
        const ret: any[][] = [];
        /* r:for await */ for (const elem of this) {
            while (elem.length > ret.length) {
                ret.push([]);
            }
            for (let i = 0; i < elem.length; i++) {
                ret[i].push(elem[i]);
            }
        }
        return ret as ArrayMap<K>;
    }

    /**
     * Zips one or more iterables with this iterator using a function.
     *
     * Stops once any one of the iterators stop.
     *
     * @typeParam K The types of the other iterables.
     * @typeParam R The resulting value.
     * @param func The function to use when zipping.
     * @param iters The iterables to zip with this one.
     * @returns The generated iterator.
     */
    zipWith<K extends unknown[], R>(
        func: (...args: [T, ...K]) => /* o:PromiseOrValue<- */ R /* o:-> */,
        ...iters: /* o:Async- */ IterableMap<K>
    ): /* o:Async- */ IterPlus<R> {
        const that = this;
        /* o:async */ function* ret() {
            const zippers = [
                that,
                ...iters.map((v) => v[Symbol./* r:asyncIterator */ iterator]()),
            ];
            while (true) {
                const tot = [];
                for (const iter of zippers) {
                    const val = /* o:await */ iter.next();
                    if (val.done) {
                        return;
                    }
                    tot.push(val.value);
                }
                yield /* o:await */ func(...(tot as [T, ...K]));
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Zips one or more iterables with this iterator.
     *
     * @typeParam K The types of the other iterables.
     * @param iters The iterables to zip with this one.
     * @returns The generated iterator.
     */
    zip<K extends unknown[]>(
        ...iters: /* o:Async- */ IterableMap<K>
    ): /* o:Async- */ IterPlus<[T, ...K]> {
        const that = this;
        /* o:async */ function* ret() {
            const zippers = [
                that,
                ...iters.map((v) => v[Symbol./* r:asyncIterator */ iterator]()),
            ];
            while (true) {
                const tot = [];
                for (const iter of zippers) {
                    const val = /* o:await */ iter.next();
                    if (val.done) {
                        return;
                    }
                    tot.push(val.value);
                }
                yield tot as [T, ...K];
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Splits an iterator into multiple, where advancing one iterator does not advance the others.
     *
     * Functions by storing old values and removing when no longer needed,
     * so only tee as many iterators as you need in order for memory to be cleaned properly.
     *
     * The original iterator will still be advanced,
     * so only used the iterators returned by `tee`.
     *
     * @param count The number of iterators to split into.
     * @returns An array of length `count` with separate iterators.
     */
    tee(count: number = 2): /* o:Async- */ IterPlus<T>[] {
        if (count <= 0) {
            return [];
        }
        const stored: CircularBuffer<
            /* o:Promise<- */ IteratorResult<T> /* o:-> */
        > = new CircularBuffer();
        let init = 0;
        let finished = false;
        const that = this;
        const tot: /* o:Async- */ IterPlus<T>[] = [];
        const indices: number[] = [];
        /* o:async */ function* ret(index: number) {
            let n = 0;
            while (true) {
                if (n >= init + stored.size()) {
                    if (finished) {
                        return;
                    }
                    const prom = that.next();
                    stored.pushEnd(prom);
                    const elem = /* o:await */ prom;
                    if (elem.done) {
                        finished = true;
                        return;
                    }
                    yield elem.value;
                } else {
                    const elem = /* o:await */ stored.get(n - init);
                    if (elem.done) {
                        return;
                    }
                    yield elem.value;
                    const minind = Math.min(...indices);
                    while (minind > init) {
                        init++;
                        stored.popStart();
                    }
                }
                n++;
                indices[index] = n;
            }
        }
        for (let i = 0; i < count; i++) {
            indices.push(0);
            tot.push(new /* o:Async- */ IterPlus(ret(i)));
        }
        return tot;
    }

    /**
     * Returns the average of all elements in the iterator.
     *
     * @throws A RangeError on an empty iterator.
     * @returns The average.
     */
    /* o: async */ average(
        this: /* o:Async- */ IterPlus<number> | /* o:Async- */ IterPlus<bigint>
    ): /* o:Promise<- */ T /* o:-> */ {
        let accum: any = 0;
        let typechecked = false;
        let bigint = false;
        let count = 0;
        /* r:for await */ for (const elem of this) {
            if (!typechecked) {
                if (typeof elem === "bigint") {
                    bigint = true;
                    accum = BigInt(accum);
                }
                typechecked = true;
            }
            accum = accum + (elem as number);
            count++;
        }
        if (bigint) {
            count = BigInt(count) as unknown as number;
        }
        if (count === 0) {
            throw new RangeError("Cannot average an empty iterator.");
        }
        return (accum / count) as unknown as T;
    }

    /**
     * Returns an iterator yielding non-overlapping chunks of the iterator.
     *
     * If there aren't enough elements to fill a chunk,
     * the last chunk will be smaller than the chunk size.
     *
     * If you want gaps between the chunks,
     * consider using `windows` with the appropriate interval instead.
     *
     * @param chunkSize The chunk size.
     * @returns An iterator that yields the chunks.
     */
    chunks(chunkSize: number): /* o:Async- */ IterPlus<T[]> {
        const that = this;
        /* o:async */ function* ret() {
            while (true) {
                const eles: T[] = [];
                for (let i = 0; i < chunkSize; i++) {
                    const val = /* o:await */ that.next();
                    if (val.done) {
                        if (eles.length > 0) {
                            yield eles;
                        }
                        return;
                    }
                    eles.push(val.value);
                }
                yield eles;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Returns an iterator yielding non-overlapping chunks of the iterator.
     *
     * If there aren't enough elements to fill a chunk,
     * the extra elements will be omitted.
     *
     * If you want gaps between the chunks,
     * consider using `windows` with the appropriate interval instead.
     *
     * @param chunkSize The chunk size.
     * @returns An iterator that yields the chunks.
     */
    chunksExact(chunkSize: number): /* o:Async- */ IterPlus<T[]> {
        const that = this;
        /* o:async */ function* ret() {
            while (true) {
                const eles: T[] = [];
                for (let i = 0; i < chunkSize; i++) {
                    const val = /* o:await */ that.next();
                    if (val.done) {
                        if (eles.length === chunkSize) {
                            yield eles;
                        }
                        return;
                    }
                    eles.push(val.value);
                }
                yield eles;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Creates an iterator that repeats the contents of the current iterator a certain number of times.
     *
     * @param n The number of times to repeat.
     * @returns An iterator that repeats itself n times.
     */
    repeat(n: number): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            const eles: T[] = [];
            /* r:for await */ for (const item of that) {
                eles.push(item);
            }
            if (eles.length === 0) {
                return;
            }
            for (let i = 0; i < n; i++) {
                yield* eles;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Creates an iterator that's rotated left a certain amount,
     * so elements at the start end up at the end.
     *
     * This **does not** handle negative numbers due to right rotation being significantly slower.
     * If you want negatives, please do the checks yourself and use rotateRight when appropriate.
     *
     * @param amount Amount to rotate by.
     * @throws A RangeError when the amount is negative.
     * @returns The rotated iterator.
     */
    rotateLeft(amount: number): /* o:Async- */ IterPlus<T> {
        if (amount < 0) {
            throw new RangeError("Cannot left rotate by a negative amount.");
        }
        const that = this;
        /* o:async */ function* ret() {
            const eles: T[] = [];
            for (let i = 0; i < amount; i++) {
                const val = /* o:await */ that.next();
                if (val.done) {
                    if (eles.length > 0) {
                        amount %= eles.length;
                        yield* [
                            ...eles.slice(amount),
                            ...eles.slice(0, amount),
                        ];
                    }
                    return;
                }
                eles.push(val.value);
            }
            yield* that;
            yield* eles;
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Creates an iterator that's rotated right a certain amount,
     * so elements at the end end up at the start.
     *
     * **Due to the one-directional nature of iterators, this is not lazy and therefore much slower than `rotateLeft`.**
     *
     * This **does not** handle negative numbers to be consistent with `rotateLeft`.
     * If you want negatives, please do the checks yourself and use rotateRight when appropriate.
     *
     * @param amount Amount to rotate by.
     * @throws A RangeError when the amount is negative.
     * @returns The rotated iterator.
     */
    rotateRight(amount: number): /* o:Async- */ IterPlus<T> {
        if (amount < 0) {
            throw new RangeError("Cannot right rotate by a negative amount.");
        }
        const that = this;
        /* o:async */ function* ret() {
            const eles: T[] = [];
            while (true) {
                const val = /* o:await */ that.next();
                if (val.done) {
                    break;
                }
                eles.push(val.value);
            }
            if (eles.length > 0) {
                amount %= eles.length;
                yield* [...eles.slice(-amount), ...eles.slice(0, -amount)];
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Splits an iterator on an element.
     *
     * @param ele The element to split on.
     * @param limit The maximum number of chunks to make.
     * @returns The iterator with the split chunks.
     */
    split(
        elem: /* o:PromiseOrValue<- */ T /* o:-> */,
        limit: number = Infinity
    ): /* o:Async- */ IterPlus<T[]> {
        const that = this;
        /* o:async */ function* ret() {
            const awaited = /* o:await */ elem;
            let foundEle = false;
            let chunks = 1;
            let eles: T[] = [];
            while (true) {
                const val = /* o:await */ that.next();
                if (val.done) {
                    if (foundEle) {
                        yield eles;
                    }
                    break;
                }
                foundEle = true;
                if (chunks < limit && val.value === awaited) {
                    yield eles;
                    eles = [];
                    chunks++;
                } else {
                    eles.push(val.value);
                }
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Splits an iterator on a predicate.
     *
     * @param pred The predicate to split with.
     * @param limit The maximum number of chunks to make.
     * @returns The iterator with the split chunks.
     */
    splitPred(
        pred: (elem: T) => /* o:PromiseOrValue<- */ boolean /* o:-> */,
        limit: number = Infinity
    ): /* o:Async- */ IterPlus<T[]> {
        const that = this;
        /* o:async */ function* ret() {
            let foundEle = false;
            let chunks = 1;
            let eles: T[] = [];
            while (true) {
                const val = /* o:await */ that.next();
                if (val.done) {
                    if (foundEle) {
                        yield eles;
                    }
                    break;
                }
                foundEle = true;
                if (chunks < limit && /* o:await */ pred(val.value)) {
                    yield eles;
                    eles = [];
                    chunks++;
                } else {
                    eles.push(val.value);
                }
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Splits an iterator on an element,
     * including the matched element as the last element of the chunk.
     *
     * Unlike the exclusive split,
     * this does not create an empty chunk on the end when ending with the matched element.
     *
     * @param ele The element to split on.
     * @param limit The maximum number of chunks to make.
     * @returns The iterator with the split chunks.
     */
    splitInclusive(
        elem: /* o:PromiseOrValue<- */ T /* o:-> */,
        limit: number = Infinity
    ): /* o:Async- */ IterPlus<T[]> {
        const that = this;
        /* o:async */ function* ret() {
            const awaited = /* o:await */ elem;
            let foundEle = false;
            let chunks = 1;
            let eles: T[] = [];
            while (true) {
                const val = /* o:await */ that.next();
                if (val.done) {
                    if (foundEle && eles.length > 0) {
                        yield eles;
                    }
                    break;
                }
                foundEle = true;
                eles.push(val.value);
                if (chunks < limit && val.value === awaited) {
                    yield eles;
                    eles = [];
                    chunks++;
                }
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Splits an iterator on a predicate,
     * including the matched element as the last element of the chunk.
     *
     * Unlike the exclusive split,
     * this does not create an empty chunk on the end when ending with the matched element.
     *
     * @param pred The predicate to split with.
     * @param limit The maximum number of chunks to make.
     * @returns The iterator with the split chunks.
     */
    splitPredInclusive(
        pred: (elem: T) => /* o:PromiseOrValue<- */ boolean /* o:-> */,
        limit: number = Infinity
    ): /* o:Async- */ IterPlus<T[]> {
        const that = this;
        /* o:async */ function* ret() {
            let foundEle = false;
            let chunks = 1;
            let eles: T[] = [];
            while (true) {
                const val = /* o:await */ that.next();
                if (val.done) {
                    if (foundEle && eles.length > 0) {
                        yield eles;
                    }
                    break;
                }
                foundEle = true;
                eles.push(val.value);
                if (chunks < limit && /* o:await */ pred(val.value)) {
                    yield eles;
                    eles = [];
                    chunks++;
                }
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Returns an iterator yielding overlapping windows of the iterator.
     *
     * If there aren't enough elements to fill a window,
     * no windows will be yielded.
     *
     * @param windowSize The window size.
     * @param interval The increment between the starts of windows. Defaults to 1.
     * @returns An iterator that yields the windows.
     */
    windows(
        windowSize: number,
        interval: number = 1
    ): /* o:Async- */ IterPlus<T[]> {
        const that = this;
        /* o:async */ function* ret() {
            const eles: CircularBuffer<T> = new CircularBuffer();
            for (let i = 0; i < windowSize; i++) {
                const val = /* o:await */ that.next();
                if (val.done) {
                    return;
                }
                eles.pushEnd(val.value);
            }
            while (true) {
                yield eles.toArray();
                for (let i = 0; i < interval; i++) {
                    const val = /* o:await */ that.next();
                    if (val.done) {
                        return;
                    }
                    eles.popStart();
                    eles.pushEnd(val.value);
                }
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Removes elements of an iterator that are equal to the previous one.
     * @returns An iterator with no consecutive duplicates.
     */
    dedup(): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            const val = /* o:await */ that.next();
            if (val.done) {
                return;
            }
            yield val.value;
            let prev = val.value;
            /* r:for await */ for (const item of that) {
                if (item !== prev) {
                    yield item;
                }
                prev = item;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Removes elements of an iterator that are equal to the previous one with a key.
     *
     * @typeParam K The type of the key.
     * @param key The key function.
     * @returns An iterator with no consecutive duplicates.
     */
    dedupWith<K>(
        key: (elem: T) => /* o:PromiseOrValue<- */ K /* o:-> */
    ): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            const val = /* o:await */ that.next();
            if (val.done) {
                return;
            }
            yield val.value;
            let prev = /* o:await */ key(val.value);
            /* r:for await */ for (const item of that) {
                const keyItem = /* o:await */ key(item);
                if (keyItem !== prev) {
                    yield item;
                }
                prev = keyItem;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Removes elements of an iterator that are equal to the previous one with a comparison function.
     *
     * @param cmp A function that checks if elements are equal.
     * @returns An iterator with no consecutive duplicates.
     */
    dedupBy(
        cmp: (
            first: T,
            second: T
        ) => /* o:PromiseOrValue<- */ boolean /* o:-> */
    ): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            const val = /* o:await */ that.next();
            if (val.done) {
                return;
            }
            yield val.value;
            let prev = val.value;
            /* r:for await */ for (const item of that) {
                if (!cmp(prev, item)) {
                    yield item;
                }
                prev = item;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Intersperses an element between every element of the iterator.
     *
     * @param elem The element to intersperse.
     * @returns The new iterator.
     */
    intersperse(
        elem: /* o:PromiseOrValue<- */ T /* o:-> */
    ): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            const awaited = /* o:await */ elem;
            const val = /* o:await */ that.next();
            if (val.done) {
                return;
            }
            yield val.value;
            /* r:for await */ for (const item of that) {
                yield awaited;
                yield item;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Intersperses multiple elements between every element of the iterator.
     *
     * @param elems The elements to intersperse.
     * @returns The new iterator.
     */
    intersperseMultiple(
        elems: /* o:Async- */ Iterable<T>
    ): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            const awaited: T[] = [];
            /* r:for await */ for (const item of elems) {
                awaited.push(item);
            }
            const val = /* o:await */ that.next();
            if (val.done) {
                return;
            }
            yield val.value;
            /* r:for await */ for (const item of that) {
                yield* awaited;
                yield item;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Joins an iterator of iterables with an element.
     *
     * @typeParam K The internal type.
     * @param elem The element to join with.
     * @returns The joined iterator.
     */
    join<K>(
        this: /* o:Async- */ IterPlus</* o:Iterable<K> | Async- */ Iterable<K>>,
        elem: /* o:PromiseOrValue<- */ K /* o:-> */
    ): /* o:Async- */ IterPlus<K> {
        const that = this;
        /* o:async */ function* ret() {
            const awaited = /* o:await */ elem;
            const val = /* o:await */ that.next();
            if (val.done) {
                return;
            }
            yield* val.value;
            /* r:for await */ for (const item of that) {
                yield awaited;
                yield* item;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Joins an iterator of iterables with multiple elements.
     *
     * @typeParam K The internal type.
     * @param elems The elements to intersperse.
     * @returns The joined iterator.
     */
    joinMultiple<K>(
        this: /* o:Async- */ IterPlus</* o:Iterable<K> | Async- */ Iterable<K>>,
        elems: /* o:Async- */ Iterable<K>
    ): /* o:Async- */ IterPlus<K> {
        const that = this;
        /* o:async */ function* ret() {
            const awaited: K[] = [];
            /* r:for await */ for (const item of elems) {
                awaited.push(item);
            }
            const val = /* o:await */ that.next();
            if (val.done) {
                return;
            }
            yield* val.value;
            /* r:for await */ for (const item of that) {
                yield* awaited;
                yield* item;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Converts an iterator of key-value pairs into an object.
     *
     * @typeParam K The key type.
     * @typeParam V The value type.
     * @param duplicate How to handle duplicate keys.
     * `"overwrite"` replaces values with the new value.
     * `"maintain"` maintains the old value.
     * `"error"` throws an error.
     * Defaults to `"overwrite"`.
     * @throws A RangeError if `duplicate` is `"error"` and a duplicate key is encountered.
     * @returns The generated object.
     */
    /* o:async */ toObject<K, V>(
        this: /* o:Async- */ IterPlus<[K, V]>,
        duplicate: "overwrite" | "maintain" | "error" = "overwrite"
    ): /* o:Promise<- */ {[key: string]: V} /* o:-> */ {
        const ret: {[key: string]: V} = {};
        /* r:for await */ for (const [key, val] of this) {
            if (duplicate !== "overwrite" && key in ret) {
                if (duplicate === "error") {
                    throw new RangeError("Duplicate key encountered.");
                } else if (duplicate === "maintain") {
                    // do nothing
                } else {
                    ret[key as unknown as string] = val;
                }
            } else {
                ret[key as unknown as string] = val;
            }
        }
        return ret;
    }

    /**
     * Converts an iterator of key-value pairs into a map.
     *
     * @typeParam K The key type.
     * @typeParam V The value type.
     * @param duplicate How to handle duplicate keys.
     * `"overwrite"` replaces values with the new value.
     * `"maintain"` maintains the old value.
     * `"error"` throws an error.
     * Defaults to `"overwrite"`.
     * @throws A RangeError if `duplicate` is `"error"` and a duplicate key is encountered.
     * @returns The generated map.
     */
    /* o:async */ toMap<K, V>(
        this: /* o:Async- */ IterPlus<[K, V]>,
        duplicate: "overwrite" | "maintain" | "error" = "overwrite"
    ): /* o:Promise<- */ Map<K, V> /* o:-> */ {
        const ret: Map<K, V> = new Map();
        /* r:for await */ for (const [key, val] of this) {
            if (duplicate !== "overwrite" && ret.has(key)) {
                if (duplicate === "error") {
                    throw new RangeError("Duplicate key encountered.");
                } else if (duplicate === "maintain") {
                    // do nothing
                } else {
                    ret.set(key, val);
                }
            } else {
                ret.set(key, val);
            }
        }
        return ret;
    }

    /**
     * Converts an iterator into a set.
     *
     * @returns The generated set.
     */
    /* o:async */ toSet(): /* o:Promise<- */ Set<T> /* o:-> */ {
        const ret: Set<T> = new Set();
        /* r:for await */ for (const val of this) {
            ret.add(val);
        }
        return ret;
    }

    /**
     * Converts an iterator into an array.
     *
     * @returns The generated array.
     */
    /* o:async */ toArray(): /* o:Promise<- */ T[] /* o:-> */ {
        const ret: T[] = [];
        /* r:for await */ for (const item of this) {
            ret.push(item);
        }
        return ret;
    }

    /**
     * Interleaves one or more iterables with this iterator.
     *
     * @param iters The iterables to interleave with this one.
     *
     * @returns The interleaved iterator, yielding elements in the iterators in order.
     */
    interleave(
        ...iters: /* o:Async- */ Iterable<T>[]
    ): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            const iterList = [
                that,
                ...iters.map((v) => v[Symbol./* r:asyncIterator */ iterator]()),
            ].map((v) => ({
                done: false,
                iter: v,
            }));
            while (true) {
                let found = false;
                for (const obj of iterList) {
                    if (obj.done) {
                        continue;
                    }
                    found = true;
                    const val = /* o:await */ obj.iter.next();
                    if (val.done) {
                        obj.done = true;
                        continue;
                    }
                    yield val.value;
                }
                if (!found) {
                    break;
                }
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Runs a function for every element of the iterator, keeping track of an accumulator.
     *
     * @typeParam A The type of the accumulator.
     * @typeParam V The resulting type.
     * @param func The mapping function.
     * @param initializer The initial accumulator.
     * @returns The mapped iterator.
     */
    mapAccum<A, V>(
        func: (accum: A, elem: T) => /* o:PromiseOrValue<- */ [A, V] /* o:-> */,
        initializer: A
    ): /* o:Async- */ IterPlus<V> {
        const that = this;
        /* o:async */ function* ret() {
            let accum: A = initializer;
            /* r:for await */ for (const elem of that) {
                const [newAccum, newElem] = /* o:await */ func(accum, elem);
                yield newElem;
                accum = newAccum;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Counts the number of items in this iterator that match a predicate.
     *
     * @param pred The predicate function.
     * @returns The number of matched items in the iterator.
     */
    /* o:async */ countIf(
        pred: (elem: T) => /* o:PromiseOrValue<- */ boolean /* o:-> */
    ): /* o:Promise<- */ number /* o:-> */ {
        let ret: number = 0;
        /* r:for await */ for (const item of this) {
            if (/* o:await */ pred(item)) {
                ret++;
            }
        }
        return ret;
    }

    /**
     * Runs a function for every element of the iterator, keeping track of an accumulator.
     *
     * @typeParam A The type of the accumulator.
     * @param func The reducing function.
     * @param initializer The initial accumulator.
     * @returns The iterator containing all intermediate accumulators.
     */
    scan<A>(
        func: (accum: A, elem: T) => /* o:PromiseOrValue<- */ A /* o:-> */,
        initializer: A
    ): /* o:Async- */ IterPlus<A>;
    /**
     * Runs a function for every element of the iterator, keeping track of an accumulator.
     *
     * Uses the first element as the initial accumulator,
     * and it will be skipped over in the scan.
     *
     * @param func The reducing function.
     * @throws If the iterator is empty,
     * then an error will be thrown.
     * @returns The iterator containing all intermediate accumulators.
     */
    scan(
        func: (accum: T, elem: T) => /* o:PromiseOrValue<- */ T /* o:-> */
    ): /* o:Async- */ IterPlus<T>;
    scan<A>(
        func: (accum: A, elem: T) => /* o:PromiseOrValue<- */ A /* o:-> */,
        initializer?: A
    ): /* o:Async- */ IterPlus<A> {
        const that = this;
        /* o: async */ function* ret() {
            let accum: A;
            if (initializer === undefined) {
                const next = /* o: await */ that.next();
                if (next.done) {
                    throw new TypeError(
                        "Scan of empty iterator with no initializer."
                    );
                }
                accum = next.value as unknown as A;
            } else {
                accum = initializer as A;
            }
            /* r:for await */ for (const elem of that) {
                yield accum;
                accum = /* o:await */ func(accum, elem);
            }
            yield accum;
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Checks if this iterator is equal to another,
     * while they both yield elements, using a comparison function.
     *
     * This function is short-circuiting,
     * so it stops on the first inequality.
     *
     * However, if the first iterator terminates,
     * a value will still be yielded from the second so that `headEquals` is commutative.
     *
     * @typeParam O The type of the other iterable.
     * @param other Iterable to compare to.
     * @param cmp A function that checks if elements are equal.
     * @returns If the two iterators are equal.
     */
    /* o:async */ headEqualsBy<O>(
        other: /* o:Async- */ Iterable<O>,
        cmp: (
            first: T,
            second: O
        ) => /* o:PromiseOrValue<- */ boolean /* o:-> */
    ): /* o:Promise<- */ boolean /* o:-> */ {
        const iter = other[Symbol./* r:asyncIterator */ iterator]();
        while (true) {
            const a = /* o:await */ this.next();
            const b = /* o:await */ iter.next();
            if (a.done || b.done) {
                return true;
            } else {
                const eq = /* o:await */ cmp(a.value, b.value);
                if (!eq) {
                    return false;
                }
            }
        }
    }

    /**
     * Checks if this iterator is equal to another,
     * while they both yield elements, using a key.
     *
     * This function is short-circuiting,
     * so it stops on the first inequality.
     *
     * However, if the first iterator terminates,
     * a value will still be yielded from the second so that `headEquals` is commutative.
     *
     * @typeParam K The type of the key.
     * @param other Iterable to compare to.
     * @param key The key function.
     * @returns If the two iterators are equal.
     */
    /* o:async */ headEqualsWith<K>(
        other: /* o:Async- */ Iterable<T>,
        key: (elem: T) => /* o:PromiseOrValue<- */ K /* o:-> */
    ): /* o:Promise<- */ boolean /* o:-> */ {
        const iter = other[Symbol./* r:asyncIterator */ iterator]();
        while (true) {
            const a = /* o:await */ this.next();
            const b = /* o:await */ iter.next();
            if (a.done || b.done) {
                return true;
            } else {
                const eq =
                    /* o:await */ key(a.value) === /* o:await */ key(b.value);
                if (!eq) {
                    return false;
                }
            }
        }
    }
    /**
     * Checks if this iterator is equal to another,
     * while they both yield elements.
     *
     * This function is short-circuiting,
     * so it stops on the first inequality.
     *
     * However, if the first iterator terminates,
     * a value will still be yielded from the second so that `headEquals` is commutative.
     *
     * @param other Iterable to compare to.
     * @returns If the two iterators are equal.
     */
    /* o:async */ headEquals(
        other: /* o:Async- */ Iterable<T>
    ): /* o:Promise<- */ boolean /* o:-> */ {
        const iter = other[Symbol./* r:asyncIterator */ iterator]();
        while (true) {
            const a = /* o:await */ this.next();
            const b = /* o:await */ iter.next();
            if (a.done || b.done) {
                return true;
            }
            const eq = a.value === b.value;
            if (!eq) {
                return false;
            }
        }
    }

    /**
     * Checks if this iterator is equal to another,
     * while the second iterator still yields elements, using a comparison function.
     *
     * This function is short-circuiting,
     * so it stops on the first inequality.
     *
     * @typeParam O The type of the other iterable.
     * @param other Iterable to compare to.
     * @param cmp A function that checks if elements are equal.
     * @returns If the first iterator starts with the second iterator.
     */
    /* o:async */ hasPrefixBy<O>(
        other: /* o:Async- */ Iterable<O>,
        cmp: (
            first: T,
            second: O
        ) => /* o:PromiseOrValue<- */ boolean /* o:-> */
    ): /* o:Promise<- */ boolean /* o:-> */ {
        const iter = other[Symbol./* r:asyncIterator */ iterator]();
        while (true) {
            const a = /* o:await */ this.next();
            const b = /* o:await */ iter.next();
            if (b.done) {
                return true;
            }
            if (a.done) {
                return false;
            }
            const eq = /* o:await */ cmp(a.value, b.value);
            if (!eq) {
                return false;
            }
        }
    }

    /**
     * Checks if this iterator is equal to another,
     * while the second iterator still yields elements, with a key function.
     *
     * This function is short-circuiting,
     * so it stops on the first inequality.
     *
     * @typeParam K The type of the key.
     * @param other Iterable to compare to.
     * @param key The key function.
     * @returns If the first iterator starts with the second iterator.
     */
    /* o:async */ hasPrefixWith<K>(
        other: /* o:Async- */ Iterable<T>,
        key: (elem: T) => /* o:PromiseOrValue<- */ K /* o:-> */
    ): /* o:Promise<- */ boolean /* o:-> */ {
        const iter = other[Symbol./* r:asyncIterator */ iterator]();
        while (true) {
            const a = /* o:await */ this.next();
            const b = /* o:await */ iter.next();
            if (b.done) {
                return true;
            }
            if (a.done) {
                return false;
            }
            const eq =
                /* o:await */ key(a.value) === /* o:await */ key(b.value);
            if (!eq) {
                return false;
            }
        }
    }

    /**
     * Checks if this iterator is equal to another,
     * while the second iterator still yields elements.
     *
     * This function is short-circuiting,
     * so it stops on the first inequality.
     *
     * @param other Iterable to compare to.
     * @returns If the first iterator starts with the second iterator.
     */
    /* o:async */ hasPrefix(
        other: /* o:Async- */ Iterable<T>
    ): /* o:Promise<- */ boolean /* o:-> */ {
        const iter = other[Symbol./* r:asyncIterator */ iterator]();
        while (true) {
            const a = /* o:await */ this.next();
            const b = /* o:await */ iter.next();
            if (b.done) {
                return true;
            }
            if (a.done) {
                return false;
            }
            const eq = a.value === b.value;
            if (!eq) {
                return false;
            }
        }
    }

    /**
     * Checks if every element in this iterator is equal, using a comparison function.
     *
     * This function is short-circuiting,
     * so it stops on the first inequality.
     *
     * @param cmp A function that checks if elements are equal.
     * @returns If every element is equal, or true if the iterator has one or less elements.
     */
    /* o:async */ allEqualBy(
        cmp: (
            first: T,
            second: T
        ) => /* o:PromiseOrValue<- */ boolean /* o:-> */
    ): /* o:Promise<- */ boolean /* o:-> */ {
        const firstItem = /* o:await */ this.next();
        if (firstItem.done) {
            return true;
        }
        const first = firstItem.value;
        while (true) {
            const item = /* o:await */ this.next();
            if (item.done) {
                return true;
            }
            const eq = /* o:await */ cmp(item.value, first);
            if (!eq) {
                return false;
            }
        }
    }

    /**
     * Checks if every element in this iterator is equal, using a key function.
     *
     * This function is short-circuiting,
     * so it stops on the first inequality.
     *
     * @typeParam K The type of the key.
     * @param key The key function.
     * @returns If every element is equal, or true if the iterator has one or less elements.
     */
    /* o:async */ allEqualWith<K>(
        key: (elem: T) => /* o:PromiseOrValue<- */ K /* o:-> */
    ): /* o:Promise<- */ boolean /* o:-> */ {
        const firstItem = /* o:await */ this.next();
        if (firstItem.done) {
            return true;
        }
        const first = /* o:await */ key(firstItem.value);
        while (true) {
            const item = /* o:await */ this.next();
            if (item.done) {
                return true;
            }
            const eq = /* o:await */ key(item.value) === first;
            if (!eq) {
                return false;
            }
        }
    }

    /**
     * Checks if every element in this iterator is equal.
     *
     * This function is short-circuiting,
     * so it stops on the first inequality.
     *
     * @returns If every element is equal, or true if the iterator has one or less elements.
     */
    /* o:async */ allEqual(): /* o:Promise<- */ boolean /* o:-> */ {
        const firstItem = /* o:await */ this.next();
        if (firstItem.done) {
            return true;
        }
        const first = firstItem.value;
        while (true) {
            const item = /* o:await */ this.next();
            if (item.done) {
                return true;
            }
            const eq = item.value === first;
            if (!eq) {
                return false;
            }
        }
    }

    /**
     * Removes duplicates from an iterator, including non-consecutive ones, with a comparison function.
     *
     * Unlike `nubWith` and `nub`, this does not use a set, so it is significantly slower.
     *
     * @param cmp A function that checks if elements are equal.
     * @returns The nubbed iterator.
     */
    nubBy(
        cmp: (
            first: T,
            second: T
        ) => /* o:PromiseOrValue<- */ boolean /* o:-> */
    ): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            const seen: T[] = [];
            outer: /* r:for await */ for (const elem of that) {
                for (const item of seen) {
                    if (/* o:await */ cmp(elem, item)) {
                        continue outer;
                    }
                }
                seen.push(elem);
                yield elem;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Removes duplicates from an iterator, including non-consecutive ones, with a key function.
     *
     * @typeParam K The type of the key.
     * @param key The key function.
     * @returns The nubbed iterator.
     */
    nubWith<K>(
        key: (elem: T) => /* o:PromiseOrValue<- */ K /* o:-> */
    ): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            const seen = new Set();
            /* r:for await */ for (const elem of that) {
                const keyVal = /* o:await */ key(elem);
                if (seen.has(keyVal)) {
                    continue;
                }
                seen.add(keyVal);
                yield elem;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Removes duplicates from an iterator, including non-consecutive ones.
     *
     * @returns The nubbed iterator.
     */
    nub(): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            const seen = new Set();
            /* r:for await */ for (const elem of that) {
                if (seen.has(elem)) {
                    continue;
                }
                seen.add(elem);
                yield elem;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Groups elements of an iterator together with a key function.
     *
     * @typeParam K The type of the key.
     * @param cmp A function that checks if elements are equal.
     * @returns An object mapping keys to arrays of matching items.
     */
    /* o:async */ group<K extends string | number | symbol>(
        key: (elem: T) => /* o:PromiseOrValue<- */ K /* o:-> */
    ): /* o:Promise<- */ Record<K, T[]> /* o:-> */ {
        const ret = {} as Record<K, T[]>;
        /* r:for await */ for (const elem of this) {
            const keyVal = /* o:await */ key(elem);
            if (keyVal in ret) {
                ret[keyVal].push(elem);
            } else {
                ret[keyVal] = [elem];
            }
        }
        return ret;
    }

    /**
     * Tallies elements of an iterator together with a key function.
     *
     * @typeParam K The type of the key.
     * @param key The key function.
     * @returns An object mapping keys to the number of times they appeared.
     */
    /* o:async */ tallyWith<K extends string | number | symbol>(
        key: (elem: T) => /* o:PromiseOrValue<- */ K /* o:-> */
    ): /* o:Promise<- */ Record<K, number> /* o:-> */ {
        const ret = {} as Record<K, number>;
        /* r:for await */ for (const elem of this) {
            const keyVal = /* o:await */ key(elem);
            if (keyVal in ret) {
                ret[keyVal] += 1;
            } else {
                ret[keyVal] = 1;
            }
        }
        return ret;
    }

    /**
     * Tallies elements of an iterator together.
     *
     * @returns An object mapping keys to the number of times they appeared.
     */
    /* o:async */ tally(
        this: /* o:Async- */ IterPlus<string | number | symbol>
    ): /* o:Promise<- */ Record<string, number> /* o:-> */ {
        const ret = {} as Record<string, number>;
        /* r:for await */ for (const elem of this) {
            if (elem in ret) {
                ret[elem.toString()] += 1;
            } else {
                ret[elem.toString()] = 1;
            }
        }
        return ret;
    }

    /**
     * Globs elements of an iterator together, with a comparison function.
     *
     * @param cmp A function that checks if elements are equal.
     * @returns An iterator where every element is an array of consecutively equal elements.
     */
    globBy(
        cmp: (
            first: T,
            second: T
        ) => /* o:PromiseOrValue<- */ boolean /* o:-> */
    ): /* o:Async- */ IterPlus<T[]> {
        const that = this;
        /* o:async */ function* ret() {
            let curGlob: T[] = [];
            /* r:for await */ for (const elem of that) {
                if (
                    curGlob.length === 0 ||
                    /* o:await */ cmp(curGlob[curGlob.length - 1], elem)
                ) {
                    curGlob.push(elem);
                } else {
                    yield curGlob;
                    curGlob = [elem];
                }
            }
            if (curGlob.length > 0) {
                yield curGlob;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Globs elements of an iterator together, with a key function.
     *
     * @typeParam K The type of the key.
     * @param key The key function.
     * @returns An iterator where every element is an array of consecutively equal elements.
     */
    globWith<K>(
        key: (elem: T) => /* o:PromiseOrValue<- */ K /* o:-> */
    ): /* o:Async- */ IterPlus<T[]> {
        const that = this;
        /* o:async */ function* ret() {
            let curGlob: T[] = [];
            let prevKey: K = undefined as unknown as K;
            /* r:for await */ for (const elem of that) {
                const elemKey = /* o:await */ key(elem);
                if (curGlob.length === 0 || prevKey === elemKey) {
                    curGlob.push(elem);
                } else {
                    yield curGlob;
                    curGlob = [elem];
                }
                prevKey = elemKey;
            }
            if (curGlob.length > 0) {
                yield curGlob;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Globs elements of an iterator together.
     *
     * @returns An iterator where every element is an array of consecutively equal elements.
     */
    glob(): /* o:Async- */ IterPlus<T[]> {
        const that = this;
        /* o:async */ function* ret() {
            let curGlob: T[] = [];
            /* r:for await */ for (const elem of that) {
                if (
                    curGlob.length === 0 ||
                    elem === curGlob[curGlob.length - 1]
                ) {
                    curGlob.push(elem);
                } else {
                    yield curGlob;
                    curGlob = [elem];
                }
            }
            if (curGlob.length > 0) {
                yield curGlob;
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Steps through an iterator by a certain amount, starting from the first.
     *
     * A step of 2 would yield the first element, then the third, then the fifth, and so on.
     *
     * @param step The step size.
     * @returns An iterator that advances by the given step size.
     */
    stepBy(step: number): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            while (true) {
                const next = /* o:await */ that.next();
                if (next.done) {
                    return;
                }
                yield next.value;
                for (let i = 0; i < step - 1; i++) {
                    const skipped = /* o:await */ that.next();
                    if (skipped.done) {
                        return;
                    }
                }
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }

    /**
     * Drops elements from the iterator **from the end**.
     *
     * This uses memory proportional to the number of elements dropped,
     * as the iterator must look ahead and store elements to know that it has not reached the end.
     *
     * @param n The number of elements to drop.
     * @returns An iterator with the specified number of elements removed from the end.
     */
    dropEnd(n: number): /* o:Async- */ IterPlus<T> {
        const that = this;
        /* o:async */ function* ret() {
            if (n <= 0) {
                yield* that;
                return;
            }
            const lookahead: CircularBuffer<T> = new CircularBuffer();
            for (let i = 0; i < n; i++) {
                const next = /* o:await */ that.next();
                if (next.done) {
                    return;
                }
                lookahead.pushEnd(next.value);
            }
            while (true) {
                const next = /* o:await */ that.next();
                if (next.done) {
                    return;
                }
                yield lookahead.popStart();
                lookahead.pushEnd(next.value);
            }
        }
        return new /* o:Async- */ IterPlus(ret());
    }
}

/**
 * An iterator with a `peek`. method that can look one element in advance.
 *
 * Do not instantiate this directly, instead use the `peekable` method in `IterPlus` or `AsyncIterPlus`.
 *
 * @typeParam T The item type of the iterator.
 */
export class /* o:Async- */ Peekable<
    T
> /* r:extends Async- */ extends IterPlus<T> {
    private storedVal:
        | {has: true; val: IteratorResult<T>}
        | {has: false; val: unknown};

    constructor(iter: /* o:Async- */ Iterator<T>) {
        super(iter);
        this.storedVal = {
            has: false,
            val: undefined,
        };
    }

    /**
     * Yields the next element in the iterator.
     *
     * @returns The next element.
     */
    /* o:async */ next(): /* o:Promise<- */ IteratorResult<T> /* o:-> */ {
        if (this.storedVal.has) {
            const ret = this.storedVal.val;
            this.storedVal = {
                has: false,
                val: undefined,
            };
            return ret;
        }
        return /* o:await */ this.internal.next();
    }

    /**
     * Peeks the next element in the iterator and does not consume it.
     *
     * @returns The next element as an iterator result.
     */
    /* o:async */ peek(): /* o:Promise<- */ IteratorResult<T> /* o:-> */ {
        if (this.storedVal.has) {
            return this.storedVal.val;
        }
        this.storedVal = {has: true, val: /* o:await */ this.internal.next()};
        return this.storedVal.val;
    }

    /**
     * Peeks the next element in the iterator and does not consume it.
     *
     * Nullable version of `peek`.
     *
     * @returns The next element, or `null` if the iterator is finished.
     */
    /* o:async */ peekVal(): /* o:Promise<- */ T | Null /* o:-> */ {
        const res = /* o:await */ this.peek();
        if (res.done) {
            return nullVal;
        }
        return res.value;
    }

    /**
     * Checks if there's a value cached from a previous `peek`.
     *
     * Will return `true` even if the cached value is the end of the iterator.
     *
     * @returns If there's a value cached.
     */
    hasCached() {
        return this.storedVal.has;
    }
}