@bodil/monkey-business 0.3.4 → 0.3.5

package/dist/array.d.ts

@@ -0,0 +1,59 @@
+import { type OrderFn } from "@bodil/core/order";
+import type { Present } from "@bodil/core/types";
+import { Option } from "@bodil/opt";
+/**
+ * Insert `value` at `index` in the array.
+ */
+export declare function insert<T>(this: Array<T>, value: T, index: number): Array<T>;
+/**
+ * Insert `value` into the array at the correct position according to
+ * the ordering function `cmp`. The array must already be ordered
+ * accordingly.
+ *
+ * If `duplicates` is `"low"`, the correct position in case of
+ * duplicates is considered to be the index of the first occurrence of a
+ * duplicate. If it is `"high"`, which is the default, the correct
+ * position is considered to be the index after the last occurrence of a
+ * duplicate.
+ */
+export declare function insertOrdered<T>(this: Array<T>, value: T, cmp: OrderFn<T>, duplicates?: "low" | "high"): Array<T>;
+/**
+ * Remove the first occurrence of a given value from an array.
+ *
+ * Returns an {@link Option} containing the removed value, or {@link None} if
+ * no matches were found.
+ */
+export declare function remove<T>(this: Array<T>, value: T): Option<T>;
+/**
+ * Remove the first value for which the provided predicate function
+ * returns `true` from the array.
+ *
+ * Returns an {@link Option} containing the removed value, or {@link None} if
+ * no matches were found.
+ */
+export declare function removeFn<T>(this: Array<T>, predicate: (value: T, index: number, obj: Array<T>) => boolean): Option<T>;
+/**
+ * Remove the value at the given index from the array.
+ *
+ * Returns an {@link Option} containing the removed value, or {@link None} if
+ * the index was out of bounds.
+ */
+export declare function removeIndex<T>(this: Array<T>, index: number): Option<T>;
+/**
+ * Return a copy of the array with any `undefined` values removed.
+ */
+export declare function present<T>(this: Array<T>): Array<Present<T>>;
+/**
+ * Return a copy of the array with any `null` or `undefined` values removed.
+ */
+export declare function nonNullable<T>(this: Array<T>): Array<NonNullable<T>>;
+/**
+ * Checked index operator. Returns {@link None} if an index isn't
+ * present, even for sparse arrays. Returns a {@link Some} if the index
+ * is present, even if the value is `undefined`.
+ */
+export declare function get<T>(this: Array<T>, index: number): Option<T>;
+/**
+ * Test whether a value is an array with the same contents as this one.
+ */
+export declare function equals<T, U = unknown>(this: Array<T>, other: unknown, equalsFn?: (a: T, b: U) => boolean): other is Array<T>;

package/dist/array.js

@@ -0,0 +1,100 @@
+import { bisectHigh, bisectLow } from "@bodil/core/order";
+import { None, Option } from "@bodil/opt";
+import { get as objectGet } from "./object";
+/**
+ * Insert `value` at `index` in the array.
+ */
+export function insert(value, index) {
+    if (!Number.isInteger(index)) {
+        throw new TypeError(`Array.insert(): index ${index} is not an integer`);
+    }
+    if (index > this.length || index < 0) {
+        throw new RangeError(`Array.insert: index ${index} out of bounds`);
+    }
+    this.splice(index, 0, value);
+    return this;
+}
+/**
+ * Insert `value` into the array at the correct position according to
+ * the ordering function `cmp`. The array must already be ordered
+ * accordingly.
+ *
+ * If `duplicates` is `"low"`, the correct position in case of
+ * duplicates is considered to be the index of the first occurrence of a
+ * duplicate. If it is `"high"`, which is the default, the correct
+ * position is considered to be the index after the last occurrence of a
+ * duplicate.
+ */
+export function insertOrdered(value, cmp, duplicates = "high") {
+    return (insert).call(this, value, (duplicates === "low" ? bisectLow : bisectHigh)(cmp, this, value));
+}
+/**
+ * Remove the first occurrence of a given value from an array.
+ *
+ * Returns an {@link Option} containing the removed value, or {@link None} if
+ * no matches were found.
+ */
+export function remove(value) {
+    return (removeIndex).call(this, this.indexOf(value));
+}
+/**
+ * Remove the first value for which the provided predicate function
+ * returns `true` from the array.
+ *
+ * Returns an {@link Option} containing the removed value, or {@link None} if
+ * no matches were found.
+ */
+export function removeFn(predicate) {
+    return (removeIndex).call(this, this.findIndex(predicate));
+}
+/**
+ * Remove the value at the given index from the array.
+ *
+ * Returns an {@link Option} containing the removed value, or {@link None} if
+ * the index was out of bounds.
+ */
+export function removeIndex(index) {
+    if (!Number.isInteger(index)) {
+        throw new TypeError(`Array.removeIndex(): index ${index} is not an integer`);
+    }
+    if (index < 0 || index >= this.length) {
+        return None;
+    }
+    const removed = this.splice(index, 1).pop();
+    return Option.from(removed);
+}
+/**
+ * Return a copy of the array with any `undefined` values removed.
+ */
+export function present() {
+    return this.filter((value) => value !== undefined);
+}
+/**
+ * Return a copy of the array with any `null` or `undefined` values removed.
+ */
+export function nonNullable() {
+    return this.filter((value) => value !== undefined && value !== null);
+}
+/**
+ * Checked index operator. Returns {@link None} if an index isn't
+ * present, even for sparse arrays. Returns a {@link Some} if the index
+ * is present, even if the value is `undefined`.
+ */
+export function get(index) {
+    return objectGet(this, index);
+}
+/**
+ * Test whether a value is an array with the same contents as this one.
+ */
+export function equals(other, equalsFn = Object.is) {
+    if (!Array.isArray(other) || this.length !== other.length) {
+        return false;
+    }
+    for (let index = 0; index < this.length; index++) {
+        if (!equalsFn(this[index], other[index])) {
+            return false;
+        }
+    }
+    return true;
+}
+//# sourceMappingURL=array.js.map

package/dist/array.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.js","sourceRoot":"","sources":["../src/array.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,SAAS,EAAgB,MAAM,mBAAmB,CAAC;AAExE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAa,MAAM,YAAY,CAAC;AAErD,OAAO,EAAE,GAAG,IAAI,SAAS,EAAE,MAAM,UAAU,CAAC;AAE5C;;GAEG;AACH,MAAM,UAAU,MAAM,CAAoB,KAAQ,EAAE,KAAa;IAC7D,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,SAAS,CAAC,yBAAyB,KAAK,oBAAoB,CAAC,CAAC;IAC5E,CAAC;IACD,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACnC,MAAM,IAAI,UAAU,CAAC,uBAAuB,KAAK,gBAAgB,CAAC,CAAC;IACvE,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IAC7B,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,aAAa,CAEzB,KAAQ,EACR,GAAe,EACf,aAA6B,MAAM;IAEnC,OAAO,CAAC,MAAS,CAAC,CAAC,IAAI,CACnB,IAAI,EACJ,KAAK,EACL,CAAC,UAAU,KAAK,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CACpE,CAAC;AACN,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,MAAM,CAAoB,KAAQ;IAC9C,OAAO,CAAC,WAAc,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;AAC5D,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,QAAQ,CAEpB,SAA8D;IAE9D,OAAO,CAAC,WAAc,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC;AAClE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAoB,KAAa;IACxD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,SAAS,CAAC,8BAA8B,KAAK,oBAAoB,CAAC,CAAC;IACjF,CAAC;IACD,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QACpC,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;IAC5C,OAAO,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAChC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,OAAO;IACnB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,KAAQ,EAAuB,EAAE,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC;AAC/E,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW;IACvB,OAAO,IAAI,CAAC,MAAM,CACd,CAAC,KAAQ,EAA2B,EAAE,CAAC,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,CAC/E,CAAC;AACN,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,GAAG,CAAoB,KAAa;IAChD,OAAO,SAAS,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAClC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,MAAM,CAElB,KAAc,EACd,WAAoC,MAAM,CAAC,EAAE;IAE7C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QACxD,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QAC/C,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACvC,OAAO,KAAK,CAAC;QACjB,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAC;AAChB,CAAC"}

package/dist/index.d.ts

@@ -1,206 +1,99 @@
-import { Option } from "@bodil/opt";
-import { type OrderFn } from "@bodil/core/order";
+import type { OrderFn } from "@bodil/core/order";
 import type { Present } from "@bodil/core/types";
-import "es-iterator-helpers/Iterator.concat/auto";
-import "es-iterator-helpers/Iterator.zip/auto";
-import "es-iterator-helpers/Iterator.zipKeyed/auto";
-import "es-iterator-helpers/Iterator.prototype.chunks/auto";
+import type { Option } from "@bodil/opt";
 declare global {
     /**
      * Added methods on the {@link Object} global object.
      */
     interface ObjectConstructor {
-        /**
-         * Checked key lookup. Returns {@link None} if a key isn't present.
-         * Returns a {@link Some} if the key is present, even if the value is
-         * `undefined`.
-         */
+        /** {@inheritDoc object.get} */
         get<O extends object, K extends keyof O>(obj: O, key: K): Option<O[K]>;
-        /**
-         * Create a new object by mapping an existing object's `Object.entries`
-         * through a function.
-         */
+        /** {@inheritDoc object.mapEntries} */
         mapEntries<A, B>(obj: Record<string, A>, fn: (entry: [key: string, value: A]) => [string, B]): Record<string, B>;
     }
     /**
      * Added methods on {@link Map}s.
      */
     interface Map<K, V> {
-        /**
-         * If `key` exists in the map, return the value associated with it.
-         * Otherwise, call `defaultValue()` to create a new value, insert that
-         * into the map under `key`, and return it.
-         */
+        /** {@inheritDoc map.getOrInsertComputed} */
         getOrInsertComputed(key: K, defaultValue: (key: K) => V): V;
-        /**
-         * If `key` exists in the map, remove the key/value pair from the map
-         * and return the removed value. Otherwise, return {@link None}.
-         *
-         * @see {@link Map.delete}
-         */
+        /** {@inheritDoc map.getOrSet} */
+        getOrSet(key: K, defaultValue: (key: K) => V): V;
+        /** {@inheritDoc map.remove} */
         remove(key: K): Option<V>;
     }
     /**
      * Added methods on {@link WeakMap}s.
      */
     interface WeakMap<K extends WeakKey, V> {
-        /**
-         * If `key` exists in the map, return the value associated with it.
-         * Otherwise, call `defaultValue()` to create a new value, insert that
-         * into the map under `key`, and return it.
-         */
+        /** {@inheritDoc weakmap.getOrInsertComputed} */
         getOrInsertComputed(key: K, defaultValue: (key: K) => V): V;
-        /**
-         * If `key` exists in the map, remove the key/value pair from the map
-         * and return the removed value. Otherwise, return {@link None}.
-         *
-         * @see {@link WeakMap.delete}
-         */
+        /** {@inheritDoc weakmap.getOrSet} */
+        getOrSet(key: K, defaultValue: (key: K) => V): V;
+        /** {@inheritDoc weakmap.remove} */
         remove(key: K): Option<V>;
     }
     /**
      * Added methods on {@link Array}s.
      */
     interface Array<T> {
-        /**
-         * Insert `value` at `index` in the array.
-         */
+        /** {@inheritDoc array.insert} */
         insert(value: T, index: number): Array<T>;
-        /**
-         * Insert `value` into the array at the correct position according to
-         * the ordering function `cmp`. The array must already be ordered
-         * accordingly.
-         *
-         * If `duplicates` is `"low"`, the correct position in case of
-         * duplicates is considered to be the index of the first occurrence of a
-         * duplicate. If it is `"high"`, which is the default, the correct
-         * position is considered to be the index after the last occurrence of a
-         * duplicate.
-         */
+        /** {@inheritDoc array.insertOrdered} */
         insertOrdered(value: T, cmp: OrderFn<T>, duplicates?: "low" | "high"): Array<T>;
-        /**
-         * Remove the first occurrence of a given value from an array.
-         *
-         * Returns an {@link Option} containing the removed value, or {@link None} if
-         * no matches were found.
-         */
+        /** {@inheritDoc array.remove} */
         remove(value: T): Option<T>;
-        /**
-         * Remove the first value for which the provided predicate function
-         * returns `true` from the array.
-         *
-         * Returns an {@link Option} containing the removed value, or {@link None} if
-         * no matches were found.
-         */
+        /** {@inheritDoc array.removeFn} */
         removeFn(predicate: (value: T, index: number, obj: Array<T>) => boolean): Option<T>;
-        /**
-         * Remove the value at the given index from the array.
-         *
-         * Returns an {@link Option} containing the removed value, or {@link None} if
-         * the index was out of bounds.
-         */
+        /** {@inheritDoc array.removeIndex} */
         removeIndex(index: number): Option<T>;
-        /**
-         * Return a copy of the array with any `undefined` values removed.
-         */
+        /** {@inheritDoc array.present} */
         present(): Array<Present<T>>;
-        /**
-         * Return a copy of the array with any `null` or `undefined` values removed.
-         */
+        /** {@inheritDoc array.nonNullable} */
         nonNullable(): Array<NonNullable<T>>;
-        /**
-         * Checked index operator. Returns {@link None} if an index isn't
-         * present, even for sparse arrays. Returns a {@link Some} if the index
-         * is present, even if the value is `undefined`.
-         */
+        /** {@inheritDoc array.get} */
         get(index: number): Option<T>;
-        /**
-         * Test whether a value is an array with the same contents as this one.
-         */
+        /** {@inheritDoc array.equals} */
         equals<U = unknown>(other: unknown, equalsFn?: (a: T, b: U) => boolean): other is Array<T>;
     }
     /**
      * Added methods on the {@link Iterator} global object.
      */
     interface IteratorConstructor {
-        /**
-         * Construct an empty iterator.
-         */
+        /** {@inheritDoc iterator.empty} */
         empty<T>(): IteratorObject<T>;
-        /**
-         * Sequence multiple iterators into a single one.
-         * @see https://github.com/tc39/proposal-iterator-sequencing
-         */
+        /** {@inheritDoc iterator.concat} */
         concat<T>(...inputs: Array<Iterable<T>>): IteratorObject<T>;
-        /**
-         * @see https://github.com/tc39/proposal-joint-iteration
-         */
+        /** {@inheritDoc iterator.zip} */
         zip<T>(inputs: Iterable<Iterable<T>>): IteratorObject<Array<T>>;
-        /**
-         * @see https://github.com/tc39/proposal-joint-iteration
-         */
+        /** {@inheritDoc iterator.zipKeyed} */
         zipKeyed<T>(inputs: Record<string, Iterable<T>>): IteratorObject<Record<string, T>>;
     }
     /**
      * Added methods on {@link IteratorObject}s.
      */
     interface IteratorObject<T, TReturn, TNext> {
-        /**
-         * Get the next value from the iterator, wrapped in an {@link Option}
-         * type. If the iterator has no more values, return {@link None}.
-         */
+        /** {@inheritDoc iterator.takeOne} */
         takeOne(): Option<T>;
-        /**
-         * Take items from the iterator only until the first time `predicate` returns false.
-         */
+        /** {@inheritDoc iterator.takeWhile} */
         takeWhile<S extends T>(predicate: (value: T, index: number) => value is S): IteratorObject<S, undefined>;
         /** @ignore */
         takeWhile(predicate: (value: T, index: number) => boolean): IteratorObject<T, undefined>;
-        /**
-         * Ignore all items matching `predicate` until the first item that
-         * doesn't match.
-         */
+        /** {@inheritDoc iterator.skipWhile} */
         skipWhile(predicate: (value: T, index: number) => boolean): IteratorObject<T, undefined>;
-        /**
-         * Iterate until calling `mapFn` on an item returns a value, then return
-         * that value. Return `undefined` if `mapFn` never returns a value.
-         */
+        /** {@inheritDoc iterator.findMap} */
         findMap<U>(mapFn: (value: T) => NonNullable<U> | undefined): NonNullable<U> | undefined;
-        /**
-         * Split the input up into arrays of at most `size` items.
-         */
+        /** {@inheritDoc iterator.chunks} */
         chunks(size: number): IteratorObject<Array<T>, undefined>;
-        /**
-         * Split the input up into arrays of at most `size` items.
-         *
-         * @deprecated This has been standardised as {@link IteratorObject#chunks}.
-         */
+        /** {@inheritDoc iterator.partition} */
         partition(size: number): IteratorObject<Array<T>, undefined>;
-        /**
-         * As {@link IteratorObject#partition}, but if the input length isn't
-         * divisible by `size`, ensure the *first* array is the shortest one
-         * rather than the last.
-         *
-         * Be warned that this requires the entire input iterable to be read up
-         * front to decide its length, so this function is not lazy.
-         */
+        /** {@inheritDoc iterator.frontBiasedPartition} */
         frontBiasedPartition(size: number): Array<Array<T>>;
-        /**
-         * Filter out any items which are `undefined`.
-         */
+        /** {@inheritDoc iterator.present} */
         present(): IteratorObject<Present<T>, undefined>;
-        /**
-         * Filter out any items which are `null` or `undefined`.
-         */
+        /** {@inheritDoc iterator.nonNullable} */
         nonNullable(): IteratorObject<NonNullable<T>, undefined>;
-        /**
-         * Test whether the given Iterable has the same contents as this
-         * iterator.
-         *
-         * Note that this will consume this iterator up to the point
-         * where the values diverge. You should not rely on any particular state
-         * of the iterator afterwards, but consider it spent.
-         */
+        /** {@inheritDoc iterator.equals} */
         equals<T = unknown, U = unknown>(value: Iterable<U>, equalsFn?: (a: T, b: U) => boolean): boolean;
     }
 }

package/dist/index.js

@@ -1,100 +1,38 @@
-/* eslint-disable @typescript-eslint/no-this-alias */
-// deno-lint-ignore-file no-this-alias
-import { None, Option, Some } from "@bodil/opt";
-import { bisectHigh, bisectLow } from "@bodil/core/order";
-import { assert } from "@bodil/core/assert";
 import defineProperties from "define-properties";
 import shimUnscopables from "es-shim-unscopables";
-import "es-iterator-helpers/Iterator.concat/auto";
-import "es-iterator-helpers/Iterator.zip/auto";
-import "es-iterator-helpers/Iterator.zipKeyed/auto";
-import "es-iterator-helpers/Iterator.prototype.chunks/auto";
+import * as array from "./array";
+import * as iterator from "./iterator";
+import * as map from "./map";
+import * as object from "./object";
+import * as weakmap from "./weakmap";
 // Object
 defineProperties(Object, {
-    get(obj, key) {
-        return Object.hasOwn(obj, key) ? Some(obj[key]) : None;
-    },
-    mapEntries(obj, fn) {
-        return Object.fromEntries(Object.entries(obj).map(fn));
-    },
+    get: object.get,
+    mapEntries: object.mapEntries,
 });
 // Map
 defineProperties(Map.prototype, {
-    getOrInsertComputed(key, defaultValue) {
-        const result = this.get(key);
-        if (result !== undefined) {
-            return result;
-        }
-        const newValue = defaultValue(key);
-        this.set(key, newValue);
-        return newValue;
-    },
-    remove(key) {
-        const result = this.get(key);
-        return this.delete(key) ? Some(result) : None;
-    },
+    getOrInsertComputed: map.getOrInsertComputed,
+    getOrSet: map.getOrSet,
+    remove: map.remove,
 });
 // WeakMap
 defineProperties(WeakMap.prototype, {
-    getOrInsertComputed(key, defaultValue) {
-        const result = this.get(key);
-        if (result !== undefined) {
-            return result;
-        }
-        const newValue = defaultValue(key);
-        this.set(key, newValue);
-        return newValue;
-    },
-    remove(key) {
-        const result = this.get(key);
-        return this.delete(key) ? Some(result) : None;
-    },
+    getOrInsertComputed: weakmap.getOrInsertComputed,
+    getOrSet: weakmap.getOrSet,
+    remove: weakmap.remove,
 });
 // Array
 defineProperties(Array.prototype, {
-    remove(value) {
-        return this.removeIndex(this.indexOf(value));
-    },
-    removeFn(predicate) {
-        return this.removeIndex(this.findIndex(predicate));
-    },
-    removeIndex(index) {
-        if (!Number.isInteger(index)) {
-            throw new TypeError(`Array.removeIndex(): index ${index} is not an integer`);
-        }
-        if (index < 0 || index >= this.length) {
-            return None;
-        }
-        const removed = this.splice(index, 1).pop();
-        return Option.from(removed);
-    },
-    insert(value, index) {
-        if (!Number.isInteger(index)) {
-            throw new TypeError(`Array.insert(): index ${index} is not an integer`);
-        }
-        if (index > this.length || index < 0) {
-            throw new RangeError(`Array.insert: index ${index} out of bounds`);
-        }
-        this.splice(index, 0, value);
-        return this;
-    },
-    insertOrdered(value, cmp, duplicates = "high") {
-        return this.insert(value, (duplicates === "low" ? bisectLow : bisectHigh)(cmp, this, value));
-    },
-    present() {
-        return this.filter((value) => value !== undefined);
-    },
-    nonNullable() {
-        return this.filter((value) => value !== undefined);
-    },
-    get(index) {
-        return Object.get(this, index);
-    },
-    equals(other, equalsFn) {
-        return (Array.isArray(other) &&
-            this.length === other.length &&
-            Iterator.from(this).equals(other, equalsFn));
-    },
+    remove: array.remove,
+    removeFn: array.removeFn,
+    removeIndex: array.removeIndex,
+    insert: array.insert,
+    insertOrdered: array.insertOrdered,
+    present: array.present,
+    nonNullable: array.nonNullable,
+    get: array.get,
+    equals: array.equals,
 });
 shimUnscopables("remove");
 shimUnscopables("removeFn");
@@ -107,108 +45,22 @@ shimUnscopables("get");
 shimUnscopables("equals");
 // Iterator
 defineProperties(Iterator, {
-    empty() {
-        return Iterator.from([]);
-    },
+    empty: iterator.empty,
+    concat: iterator.concat,
+    zip: iterator.zip,
+    zipKeyed: iterator.zipKeyed,
 });
 defineProperties(Iterator.prototype, {
-    takeOne() {
-        const result = this.next();
-        return result.done === true ? None : Some(result.value);
-    },
-    takeWhile(predicate) {
-        const iter = this;
-        let index = 0;
-        let done = false;
-        return Iterator.from({
-            next() {
-                if (!done) {
-                    const result = iter.next();
-                    if (result.done === true) {
-                        return result;
-                    }
-                    if (predicate(result.value, index++)) {
-                        return result;
-                    }
-                }
-                done = true;
-                return { done: true, value: undefined };
-            },
-        });
-    },
-    skipWhile(predicate) {
-        const iter = this;
-        let index = 0;
-        let skipped = false;
-        return Iterator.from({
-            next() {
-                if (skipped) {
-                    return iter.next();
-                }
-                while (true) {
-                    const result = iter.next();
-                    if (result.done === true) {
-                        return result;
-                    }
-                    if (!predicate(result.value, index++)) {
-                        skipped = true;
-                        return result;
-                    }
-                }
-            },
-        });
-    },
-    findMap(mapFn) {
-        let index = 0;
-        while (true) {
-            const result = this.next();
-            if (result.done === true) {
-                return undefined;
-            }
-            const mapped = mapFn(result.value, index++);
-            if (mapped !== undefined) {
-                return mapped;
-            }
-        }
-    },
-    partition(size) {
-        return this.chunks(size);
-    },
-    frontBiasedPartition(size) {
-        const input = this.toArray();
-        let inputPos = 0;
-        const firstLength = input.length % size;
-        const output = [];
-        if (firstLength > 0) {
-            output.push(input.slice(0, firstLength));
-            inputPos = firstLength;
-        }
-        while (inputPos < input.length) {
-            output.push(input.slice(inputPos, inputPos + size));
-            inputPos += size;
-        }
-        assert(inputPos === input.length);
-        return output;
-    },
-    present() {
-        return Iterator.from(this.filter((item) => item !== undefined));
-    },
-    nonNullable() {
-        return Iterator.from(this.filter((item) => item !== undefined && item !== null));
-    },
-    equals(value, equalsFn = Object.is) {
-        const other = Iterator.from(value);
-        while (true) {
-            const a = this.next();
-            const b = other.next();
-            if (a.done !== b.done ||
-                (a.done === false && b.done === false && !equalsFn(a.value, b.value))) {
-                return false;
-            }
-            if (a.done === true && b.done === true) {
-                return true;
-            }
-        }
-    },
+    chunks: iterator.chunks,
+    takeOne: iterator.takeOne,
+    takeWhile: iterator.takeWhile,
+    skipWhile: iterator.skipWhile,
+    findMap: iterator.findMap,
+    // eslint-disable-next-line @typescript-eslint/no-deprecated
+    partition: iterator.partition,
+    frontBiasedPartition: iterator.frontBiasedPartition,
+    present: iterator.present,
+    nonNullable: iterator.nonNullable,
+    equals: iterator.equals,
 });
 //# sourceMappingURL=index.js.map