@naturalcycles/js-lib 15.74.0 → 15.76.0

package/dist/array/array.util.d.ts

@@ -217,6 +217,15 @@ export declare function _first<T>(array: readonly T[]): T;
  * Returns first item of the array (or undefined if array is empty).
  */
 export declare function _firstOrUndefined<T>(array: readonly T[]): T | undefined;
+/**
+ * Returns the first item of an iterable (Set, Map.values(), generator, etc.),
+ * or `undefined` if the iterable is empty.
+ *
+ * Avoids the `Array.from(iter)[0]` pattern that materialises the entire iterable.
+ * `for...of` with an early return advances the iterator exactly once; if the
+ * iterator implements `return()` (generators, etc.), it is invoked for cleanup.
+ */
+export declare function _firstFromIterable<T>(iter: Iterable<T>): T | undefined;
 export declare function _minOrUndefined<T>(array: readonly T[]): NonNullable<T> | undefined;
 /**
  * Filters out nullish values (undefined and null).

package/dist/array/array.util.js

@@ -23,7 +23,7 @@ export function _chunk(array, size = 1) {
  * Removes duplicates from given array.
  */
 export function _uniq(a) {
-    return [...new Set(a)];
+    return Array.from(new Set(a));
 }
 /**
  * Pushes an item to an array if it's not already there.
@@ -84,7 +84,7 @@ export function _uniqBy(arr, mapper) {
         if (!map.has(key))
             map.set(key, item);
     }
-    return [...map.values()];
+    return Array.from(map.values());
 }
 /**
  * const a = [
@@ -174,7 +174,7 @@ export function _find(items, predicate) {
  * - in iOS Safari since 15.4
  */
 export function _findLast(items, predicate) {
-    return _find(items.slice().reverse(), predicate);
+    return _find(items.toReversed(), predicate);
 }
 export function _takeWhile(items, predicate) {
     let proceed = true;
@@ -182,7 +182,7 @@ export function _takeWhile(items, predicate) {
 }
 export function _takeRightWhile(items, predicate) {
     let proceed = true;
-    return [...items].reverse().filter((v, index) => (proceed &&= predicate(v, index)));
+    return items.toReversed().filter((v, index) => (proceed &&= predicate(v, index)));
 }
 export function _dropWhile(items, predicate) {
     let proceed = false;
@@ -190,8 +190,8 @@ export function _dropWhile(items, predicate) {
 }
 export function _dropRightWhile(items, predicate) {
     let proceed = false;
-    return [...items]
-        .reverse()
+    return items
+        .toReversed()
         .filter((v, index) => (proceed ||= !predicate(v, index)))
         .reverse();
 }
@@ -356,7 +356,7 @@ export function _mapToObject(array, mapper) {
  * Based on: https://stackoverflow.com/a/12646864/4919972
  */
 export function _shuffle(array, opt = {}) {
-    const a = opt.mutate ? array : [...array];
+    const a = opt.mutate ? array : array.slice();
     for (let i = a.length - 1; i > 0; i--) {
         const j = Math.floor(Math.random() * (i + 1));
         [a[i], a[j]] = [a[j], a[i]];
@@ -403,6 +403,19 @@ export function _first(array) {
 export function _firstOrUndefined(array) {
     return array[0];
 }
+/**
+ * Returns the first item of an iterable (Set, Map.values(), generator, etc.),
+ * or `undefined` if the iterable is empty.
+ *
+ * Avoids the `Array.from(iter)[0]` pattern that materialises the entire iterable.
+ * `for...of` with an early return advances the iterator exactly once; if the
+ * iterator implements `return()` (generators, etc.), it is invoked for cleanup.
+ */
+export function _firstFromIterable(iter) {
+    for (const item of iter)
+        return item;
+    return undefined;
+}
 export function _minOrUndefined(array) {
     let min;
     for (const item of array) {

package/dist/array/array2.js

@@ -8,7 +8,7 @@ export class Array2 extends Array {
     static of(...items) {
         return new Array2(...items);
     }
-    // eslint-disable-next-line @typescript-eslint/class-literal-property-style
+    // oxlint-disable-next-line @typescript-eslint/class-literal-property-style
     get [Symbol.toStringTag]() {
         return 'Array2';
     }

package/dist/array/sort.js

@@ -51,7 +51,8 @@ export const comparators = new Comparators();
  * _sortBy([{age: 20}, {age: 10}], o => o.age)
  */
 export function _sortBy(items, mapper, opt = {}) {
-    return (opt.mutate ? items : [...items]).sort(comparators.by(mapper, opt));
+    const cmp = comparators.by(mapper, opt);
+    return opt.mutate ? items.sort(cmp) : items.toSorted(cmp);
 }
 /**
  * Like _stringMapValues, but values are sorted.

package/dist/browser/analytics.util.js

@@ -32,7 +32,7 @@ export function loadHotjar(hjid) {
     if (isServerSide()) {
         return;
     }
-    /* eslint-disable */
+    /* oxlint-disable */
     // oxfmt-ignore
     ;
     ((h, o, t, j, a, r) => {
@@ -49,5 +49,5 @@ export function loadHotjar(hjid) {
         r.src = t + h._hjSettings.hjid + j + h._hjSettings.hjsv;
         a.append(r);
     })(globalThis, document, 'https://static.hotjar.com/c/hotjar-', '.js?sv=');
-    /* eslint-enable */
+    /* oxlint-enable */
 }

package/dist/browser/bot.js

@@ -98,7 +98,7 @@ export class BotDetectionService {
             return false;
         let cdpCheck1 = false;
         try {
-            /* eslint-disable */
+            /* oxlint-disable */
             const e = new window.Error();
             window.Object.defineProperty(e, 'stack', {
                 configurable: false,
@@ -110,7 +110,7 @@ export class BotDetectionService {
             });
             // This is part of the detection and shouldn't be deleted
             window.console.debug(e);
-            /* eslint-enable */
+            /* oxlint-enable */
         }
         catch { }
         return cdpCheck1;

package/dist/datetime/localDate.js

@@ -615,7 +615,8 @@ class LocalDateFactory {
      */
     sort(items, opt = {}) {
         const mod = opt.dir === 'desc' ? -1 : 1;
-        return (opt.mutate ? items : [...items]).sort((a, b) => a.compare(b) * mod);
+        const cmp = (a, b) => a.compare(b) * mod;
+        return opt.mutate ? items.sort(cmp) : items.toSorted(cmp);
     }
     /**
      * Returns the earliest (min) LocalDate from the array, or undefined if the array is empty.

package/dist/datetime/localTime.js

@@ -1,3 +1,4 @@
+import { comparators } from '../array/sort.js';
 import { _assert } from '../error/assert.js';
 import { localDate } from './localDate.js';
 import { _ms } from './time.util.js';
@@ -868,14 +869,8 @@ class LocalTimeFactory {
         return Intl.supportedValuesOf('timeZone').includes(tz);
     }
     sort(items, dir = 'asc', opt = {}) {
-        const mod = dir === 'desc' ? -1 : 1;
-        return (opt.mutate ? items : [...items]).sort((a, b) => {
-            const v1 = a.$date.valueOf();
-            const v2 = b.$date.valueOf();
-            if (v1 === v2)
-                return 0;
-            return (v1 < v2 ? -1 : 1) * mod;
-        });
+        const cmp = comparators.by((lt) => lt.$date.valueOf(), { dir });
+        return opt.mutate ? items.sort(cmp) : items.toSorted(cmp);
     }
     minOrUndefined(items) {
         let min;

package/dist/decorators/asyncMemo.decorator.js

@@ -92,7 +92,7 @@ export const _AsyncMemo = (opt) => (target, key, descriptor) => {
     _objectAssign(descriptor.value, {
         clear: async () => {
             logger.log(`${methodSignature} @_AsyncMemo.clear()`);
-            await Promise.all([...instanceCache.values()].map(c => c.clear()));
+            await Promise.all(Array.from(instanceCache.values(), c => c.clear()));
             instanceCache.clear();
         },
         getInstanceCache: () => instanceCache,

package/dist/is.util.js

@@ -33,10 +33,20 @@ export function _isPrimitive(v) {
         typeof v === 'symbol');
 }
 export function _isEmptyObject(obj) {
-    return Object.keys(obj).length === 0;
+    // for...in with early return avoids allocating the full Object.keys array.
+    // Object.hasOwn matches Object.keys() semantics (own enumerable keys only).
+    for (const k in obj) {
+        if (Object.hasOwn(obj, k))
+            return false;
+    }
+    return true;
 }
 export function _isNotEmptyObject(obj) {
-    return Object.keys(obj).length > 0;
+    for (const k in obj) {
+        if (Object.hasOwn(obj, k))
+            return true;
+    }
+    return false;
 }
 /**
  * Object is considered empty if it's one of:
@@ -58,7 +68,11 @@ export function _isEmpty(obj) {
         return obj.size === 0;
     }
     if (typeof obj === 'object') {
-        return Object.keys(obj).length === 0;
+        for (const k in obj) {
+            if (Object.hasOwn(obj, k))
+                return false;
+        }
+        return true;
     }
     return false;
 }

package/dist/iter/iterable2.js

@@ -22,7 +22,7 @@ export class Iterable2 {
         return this.it[Symbol.iterator]();
     }
     toArray() {
-        return [...this.it];
+        return Array.from(this.it);
     }
     forEach(cb) {
         let i = 0;

package/dist/math/math.util.js

@@ -104,5 +104,8 @@ export function _percentiles(values, pcs) {
  * // 2.5
  */
 export function _median(values) {
-    return _percentile(values, 50);
+    const sorted = values.toSorted(comparators.numericAsc);
+    const len = sorted.length;
+    const mid = Math.floor(len / 2);
+    return len % 2 ? sorted[mid] : (sorted[mid - 1] + sorted[mid]) / 2;
 }

package/dist/object/keySortedMap.js

@@ -5,7 +5,7 @@ export class KeySortedMap {
     constructor(entries = [], opt = {}) {
         this.#comparator = opt.comparator;
         this.map = new Map(entries);
-        this.#sortedKeys = [...this.map.keys()];
+        this.#sortedKeys = Array.from(this.map.keys());
         this.sortKeys();
     }
     #comparator;

package/dist/object/lazyKeySortedMap.js

@@ -6,7 +6,7 @@ export class LazyKeySortedMap {
     constructor(entries = [], opt = {}) {
         this.#comparator = opt.comparator;
         this.map = new Map(entries);
-        this.maybeSortedKeys = [...this.map.keys()];
+        this.maybeSortedKeys = Array.from(this.map.keys());
     }
     #comparator;
     /**

package/dist/object/object.util.d.ts

@@ -87,6 +87,29 @@ export declare function _mapKeys<T extends AnyObject>(obj: T, mapper: ObjectMapp
  */
 export declare function _mapObject<OUT = unknown, IN extends AnyObject = AnyObject>(obj: IN, mapper: ObjectMapper<IN, KeyValueTuple<string, any> | typeof SKIP>): OUT;
 export declare function _findKeyByValue<T extends AnyObject>(obj: T, v: ValueOf<T>): keyof T | undefined;
+/**
+ * Returns the first key of the object, or `undefined` if the object is empty.
+ *
+ * Performance-optimised: uses `for...in` with an early return to avoid
+ * allocating the full `Object.keys(obj)` array. The `Object.hasOwn` filter
+ * matches `Object.keys()` semantics (own enumerable string keys only) and
+ * satisfies the `guard-for-in` lint rule; cost is a single check before
+ * the early return. Iteration order matches `Object.keys()` for plain
+ * objects (integer-like keys ascending first, then string keys in
+ * insertion order).
+ */
+export declare function _firstKey<T extends AnyObject>(obj: T): keyof T | undefined;
+/**
+ * Returns the first value of the object, or `undefined` if the object is empty.
+ * See `_firstKey` for the iteration-order contract.
+ */
+export declare function _firstValue<T extends AnyObject>(obj: T): ValueOf<T> | undefined;
+/**
+ * Returns the first [key, value] tuple of the object,
+ * or `undefined` if the object is empty.
+ * See `_firstKey` for the iteration-order contract.
+ */
+export declare function _firstEntry<T extends AnyObject>(obj: T): [keyof T, ValueOf<T>] | undefined;
 export declare function _objectNullValuesToUndefined<T extends AnyObject>(obj: T, opt?: MutateOptions): T;
 /**
  * Deep copy object (by json parse/stringify, since it has unbeatable performance+simplicity combo).

package/dist/object/object.util.js

@@ -191,6 +191,47 @@ export function _mapObject(obj, mapper) {
 export function _findKeyByValue(obj, v) {
     return Object.entries(obj).find(([_, value]) => value === v)?.[0];
 }
+/**
+ * Returns the first key of the object, or `undefined` if the object is empty.
+ *
+ * Performance-optimised: uses `for...in` with an early return to avoid
+ * allocating the full `Object.keys(obj)` array. The `Object.hasOwn` filter
+ * matches `Object.keys()` semantics (own enumerable string keys only) and
+ * satisfies the `guard-for-in` lint rule; cost is a single check before
+ * the early return. Iteration order matches `Object.keys()` for plain
+ * objects (integer-like keys ascending first, then string keys in
+ * insertion order).
+ */
+export function _firstKey(obj) {
+    for (const k in obj) {
+        if (Object.hasOwn(obj, k))
+            return k;
+    }
+    return undefined;
+}
+/**
+ * Returns the first value of the object, or `undefined` if the object is empty.
+ * See `_firstKey` for the iteration-order contract.
+ */
+export function _firstValue(obj) {
+    for (const k in obj) {
+        if (Object.hasOwn(obj, k))
+            return obj[k];
+    }
+    return undefined;
+}
+/**
+ * Returns the first [key, value] tuple of the object,
+ * or `undefined` if the object is empty.
+ * See `_firstKey` for the iteration-order contract.
+ */
+export function _firstEntry(obj) {
+    for (const k in obj) {
+        if (Object.hasOwn(obj, k))
+            return [k, obj[k]];
+    }
+    return undefined;
+}
 export function _objectNullValuesToUndefined(obj, opt = {}) {
     return _mapValues(obj, (_k, v) => (v === null ? undefined : v), opt);
 }
@@ -392,7 +433,7 @@ export function _set(obj, path, value) {
             a[c]
         : // No: create the key. Is the next key a potential array-index?
             (a[c] =
-                // oxlint-disable-next-line no-bitwise no-implicit-coercion unicorn/prefer-math-trunc
+                // oxlint-disable-next-line no-bitwise, no-implicit-coercion, unicorn/prefer-math-trunc
                 Math.abs(path[i + 1]) >> 0 === +path[i + 1]
                     ? [] // Yes: assign a new array object
                     : {}), // No: assign a new plain object

package/dist/object/set2.js

@@ -30,12 +30,12 @@ export class Set2 extends Set {
     // Last is not implemented, because it requires to traverse the whole Set - not optimal
     // last(): T {
     toArray() {
-        return [...this];
+        return Array.from(this);
     }
     toJSON() {
-        return [...this];
+        return Array.from(this);
     }
     toString() {
-        return `Set2(${this.size}) ${JSON.stringify([...this])}`;
+        return `Set2(${this.size}) ${JSON.stringify(Array.from(this))}`;
     }
 }

package/dist/promise/pFilter.js

@@ -1,5 +1,5 @@
 export async function pFilter(iterable, filterFn) {
-    const items = [...iterable];
+    const items = Array.from(iterable);
     const predicates = await Promise.all(items.map((item, i) => filterFn(item, i)));
     return items.filter((_item, i) => predicates[i]);
 }

package/dist/promise/pMap.js

@@ -35,7 +35,7 @@ import { END, SKIP } from '../types.js';
  * })();
  */
 export async function pMap(iterable, mapper, opt = {}) {
-    const items = [...iterable];
+    const items = Array.from(iterable);
     const itemsLength = items.length;
     if (itemsLength === 0)
         return []; // short circuit

package/dist/semver.js

@@ -120,7 +120,8 @@ class SemverFactory {
      */
     sort(items, opt = {}) {
         const mod = opt.dir === 'desc' ? -1 : 1;
-        return (opt.mutate ? items : [...items]).sort((a, b) => a.compare(b) * mod);
+        const cmp = (a, b) => a.compare(b) * mod;
+        return opt.mutate ? items.sort(cmp) : items.toSorted(cmp);
     }
 }
 const semverFactory = new SemverFactory();

package/dist/string/stringify.js

@@ -88,7 +88,7 @@ export function _stringify(obj, opt = {}) {
             obj = Object.fromEntries(obj);
         }
         else if (obj instanceof Set) {
-            obj = [...obj];
+            obj = Array.from(obj);
         }
         try {
             const { stringifyFn = globalStringifyFunction } = opt;

package/dist/typeFest.js

@@ -1,2 +1,2 @@
-/* eslint-disable */
+/* oxlint-disable */
 export {};

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@naturalcycles/js-lib",
   "type": "module",
-  "version": "15.74.0",
+  "version": "15.76.0",
   "dependencies": {
     "tslib": "^2"
   },
@@ -17,7 +17,7 @@
     "@types/crypto-js": "^4",
     "@types/node": "^25",
     "@types/semver": "^7",
-    "@typescript/native-preview": "7.0.0-dev.20260401.1",
+    "@typescript/native-preview": "beta",
     "crypto-js": "^4",
     "dayjs": "^1",
     "@naturalcycles/dev-lib": "18.4.2"

package/src/array/array.util.ts

@@ -33,7 +33,7 @@ export function _chunk<T>(array: readonly T[], size = 1): T[][] {
  * Removes duplicates from given array.
  */
 export function _uniq<T>(a: readonly T[]): T[] {
-  return [...new Set(a)]
+  return Array.from(new Set(a))
 }
 
 /**
@@ -95,7 +95,7 @@ export function _uniqBy<T>(arr: readonly T[], mapper: Mapper<T, any>): T[] {
     const key = item === undefined || item === null ? item : mapper(item)
     if (!map.has(key)) map.set(key, item)
   }
-  return [...map.values()]
+  return Array.from(map.values())
 }
 
 /**
@@ -192,7 +192,7 @@ export function _find<T>(items: readonly T[], predicate: AbortablePredicate<T>):
  * - in iOS Safari since 15.4
  */
 export function _findLast<T>(items: readonly T[], predicate: AbortablePredicate<T>): T | undefined {
-  return _find(items.slice().reverse(), predicate)
+  return _find(items.toReversed(), predicate)
 }
 
 export function _takeWhile<T>(items: readonly T[], predicate: Predicate<T>): T[] {
@@ -202,7 +202,7 @@ export function _takeWhile<T>(items: readonly T[], predicate: Predicate<T>): T[]
 
 export function _takeRightWhile<T>(items: readonly T[], predicate: Predicate<T>): T[] {
   let proceed = true
-  return [...items].reverse().filter((v, index) => (proceed &&= predicate(v, index)))
+  return items.toReversed().filter((v, index) => (proceed &&= predicate(v, index)))
 }
 
 export function _dropWhile<T>(items: readonly T[], predicate: Predicate<T>): T[] {
@@ -212,8 +212,8 @@ export function _dropWhile<T>(items: readonly T[], predicate: Predicate<T>): T[]
 
 export function _dropRightWhile<T>(items: readonly T[], predicate: Predicate<T>): T[] {
   let proceed = false
-  return [...items]
-    .reverse()
+  return items
+    .toReversed()
     .filter((v, index) => (proceed ||= !predicate(v, index)))
     .reverse()
 }
@@ -416,7 +416,7 @@ export function _mapToObject<T, V>(
  * Based on: https://stackoverflow.com/a/12646864/4919972
  */
 export function _shuffle<T>(array: T[], opt: MutateOptions = {}): T[] {
-  const a = opt.mutate ? array : [...array]
+  const a = opt.mutate ? array : array.slice()
 
   for (let i = a.length - 1; i > 0; i--) {
     const j = Math.floor(Math.random() * (i + 1))
@@ -468,6 +468,19 @@ export function _firstOrUndefined<T>(array: readonly T[]): T | undefined {
   return array[0]
 }
 
+/**
+ * Returns the first item of an iterable (Set, Map.values(), generator, etc.),
+ * or `undefined` if the iterable is empty.
+ *
+ * Avoids the `Array.from(iter)[0]` pattern that materialises the entire iterable.
+ * `for...of` with an early return advances the iterator exactly once; if the
+ * iterator implements `return()` (generators, etc.), it is invoked for cleanup.
+ */
+export function _firstFromIterable<T>(iter: Iterable<T>): T | undefined {
+  for (const item of iter) return item
+  return undefined
+}
+
 export function _minOrUndefined<T>(array: readonly T[]): NonNullable<T> | undefined {
   let min: NonNullable<T> | undefined
   for (const item of array) {

package/src/array/array2.ts

@@ -10,7 +10,7 @@ export class Array2<T> extends Array<T> {
     return new Array2(...items)
   }
 
-  // eslint-disable-next-line @typescript-eslint/class-literal-property-style
+  // oxlint-disable-next-line @typescript-eslint/class-literal-property-style
   get [Symbol.toStringTag](): string {
     return 'Array2'
   }

package/src/array/sort.ts

@@ -76,7 +76,8 @@ export function _sortBy<T, COMPARE_TYPE extends string | number>(
   mapper: Mapper<T, COMPARE_TYPE>,
   opt: SortOptions = {},
 ): T[] {
-  return (opt.mutate ? items : [...items]).sort(comparators.by(mapper, opt))
+  const cmp = comparators.by(mapper, opt)
+  return opt.mutate ? items.sort(cmp) : items.toSorted(cmp)
 }
 
 /**

package/src/browser/analytics.util.ts

@@ -44,7 +44,7 @@ export function loadHotjar(hjid: number): void {
     return
   }
 
-  /* eslint-disable */
+  /* oxlint-disable */
   // oxfmt-ignore
   ;((h: any, o, t, j, a?: any, r?: any) => {
     h.hj =
@@ -59,5 +59,5 @@ export function loadHotjar(hjid: number): void {
     r.src = t + h._hjSettings.hjid + j + h._hjSettings.hjsv
     a.append(r)
   })(globalThis, document, 'https://static.hotjar.com/c/hotjar-', '.js?sv=')
-  /* eslint-enable */
+  /* oxlint-enable */
 }

package/src/browser/bot.ts

@@ -131,7 +131,7 @@ export class BotDetectionService {
     if (isServerSide()) return false
     let cdpCheck1 = false
     try {
-      /* eslint-disable */
+      /* oxlint-disable */
       const e = new window.Error()
       window.Object.defineProperty(e, 'stack', {
         configurable: false,
@@ -143,7 +143,7 @@ export class BotDetectionService {
       })
       // This is part of the detection and shouldn't be deleted
       window.console.debug(e)
-      /* eslint-enable */
+      /* oxlint-enable */
     } catch {}
     return cdpCheck1
   }

package/src/datetime/localDate.ts

@@ -721,7 +721,8 @@ class LocalDateFactory {
    */
   sort(items: LocalDate[], opt: SortOptions = {}): LocalDate[] {
     const mod = opt.dir === 'desc' ? -1 : 1
-    return (opt.mutate ? items : [...items]).sort((a, b) => a.compare(b) * mod)
+    const cmp = (a: LocalDate, b: LocalDate): number => a.compare(b) * mod
+    return opt.mutate ? items.sort(cmp) : items.toSorted(cmp)
   }
 
   /**

package/src/datetime/localTime.ts

@@ -1,3 +1,4 @@
+import { comparators } from '../array/sort.js'
 import { _assert } from '../error/assert.js'
 import type {
   IANATimezone,
@@ -1017,13 +1018,8 @@ class LocalTimeFactory {
   }
 
   sort(items: LocalTime[], dir: SortDirection = 'asc', opt: MutateOptions = {}): LocalTime[] {
-    const mod = dir === 'desc' ? -1 : 1
-    return (opt.mutate ? items : [...items]).sort((a, b) => {
-      const v1 = a.$date.valueOf()
-      const v2 = b.$date.valueOf()
-      if (v1 === v2) return 0
-      return (v1 < v2 ? -1 : 1) * mod
-    })
+    const cmp = comparators.by((lt: LocalTime) => lt.$date.valueOf(), { dir })
+    return opt.mutate ? items.sort(cmp) : items.toSorted(cmp)
   }
 
   minOrUndefined(items: LocalTimeInputNullable[]): LocalTime | undefined {

package/src/decorators/asyncMemo.decorator.ts

@@ -148,7 +148,7 @@ export const _AsyncMemo =
     _objectAssign(descriptor.value as AsyncMemoInstance, {
       clear: async () => {
         logger.log(`${methodSignature} @_AsyncMemo.clear()`)
-        await Promise.all([...instanceCache.values()].map(c => c.clear()))
+        await Promise.all(Array.from(instanceCache.values(), c => c.clear()))
         instanceCache.clear()
       },
       getInstanceCache: () => instanceCache,

package/src/is.util.ts

@@ -45,11 +45,19 @@ export function _isPrimitive(v: any): v is Primitive {
 }
 
 export function _isEmptyObject(obj: AnyObject): boolean {
-  return Object.keys(obj).length === 0
+  // for...in with early return avoids allocating the full Object.keys array.
+  // Object.hasOwn matches Object.keys() semantics (own enumerable keys only).
+  for (const k in obj) {
+    if (Object.hasOwn(obj, k)) return false
+  }
+  return true
 }
 
 export function _isNotEmptyObject(obj: AnyObject): boolean {
-  return Object.keys(obj).length > 0
+  for (const k in obj) {
+    if (Object.hasOwn(obj, k)) return true
+  }
+  return false
 }
 
 /**
@@ -74,7 +82,10 @@ export function _isEmpty(obj: any): boolean {
   }
 
   if (typeof obj === 'object') {
-    return Object.keys(obj).length === 0
+    for (const k in obj) {
+      if (Object.hasOwn(obj, k)) return false
+    }
+    return true
   }
 
   return false

package/src/iter/iterable2.ts

@@ -25,7 +25,7 @@ export class Iterable2<T> implements Iterable<T> {
   }
 
   toArray(): T[] {
-    return [...this.it]
+    return Array.from(this.it)
   }
 
   forEach(cb: (v: T, i: number) => any | typeof END): void {

package/src/math/math.util.ts

@@ -117,5 +117,8 @@ export function _percentiles(values: number[], pcs: number[]): Record<number, nu
  * // 2.5
  */
 export function _median(values: number[]): number {
-  return _percentile(values, 50)
+  const sorted = values.toSorted(comparators.numericAsc)
+  const len = sorted.length
+  const mid = Math.floor(len / 2)
+  return len % 2 ? sorted[mid]! : (sorted[mid - 1]! + sorted[mid]!) / 2
 }

package/src/object/keySortedMap.ts

@@ -32,7 +32,7 @@ export class KeySortedMap<K, V> {
   constructor(entries: [K, V][] = [], opt: KeySortedMapOptions<K> = {}) {
     this.#comparator = opt.comparator
     this.map = new Map(entries)
-    this.#sortedKeys = [...this.map.keys()]
+    this.#sortedKeys = Array.from(this.map.keys())
     this.sortKeys()
   }
 

package/src/object/lazyKeySortedMap.ts

@@ -28,7 +28,7 @@ export class LazyKeySortedMap<K, V> {
   constructor(entries: [K, V][] = [], opt: LazyKeySortedMapOptions<K> = {}) {
     this.#comparator = opt.comparator
     this.map = new Map(entries)
-    this.maybeSortedKeys = [...this.map.keys()]
+    this.maybeSortedKeys = Array.from(this.map.keys())
   }
 
   readonly #comparator: Comparator<K> | undefined

package/src/object/object.util.ts

@@ -242,6 +242,47 @@ export function _findKeyByValue<T extends AnyObject>(obj: T, v: ValueOf<T>): key
   return Object.entries(obj).find(([_, value]) => value === v)?.[0] as keyof T
 }
 
+/**
+ * Returns the first key of the object, or `undefined` if the object is empty.
+ *
+ * Performance-optimised: uses `for...in` with an early return to avoid
+ * allocating the full `Object.keys(obj)` array. The `Object.hasOwn` filter
+ * matches `Object.keys()` semantics (own enumerable string keys only) and
+ * satisfies the `guard-for-in` lint rule; cost is a single check before
+ * the early return. Iteration order matches `Object.keys()` for plain
+ * objects (integer-like keys ascending first, then string keys in
+ * insertion order).
+ */
+export function _firstKey<T extends AnyObject>(obj: T): keyof T | undefined {
+  for (const k in obj) {
+    if (Object.hasOwn(obj, k)) return k as keyof T
+  }
+  return undefined
+}
+
+/**
+ * Returns the first value of the object, or `undefined` if the object is empty.
+ * See `_firstKey` for the iteration-order contract.
+ */
+export function _firstValue<T extends AnyObject>(obj: T): ValueOf<T> | undefined {
+  for (const k in obj) {
+    if (Object.hasOwn(obj, k)) return obj[k] as ValueOf<T>
+  }
+  return undefined
+}
+
+/**
+ * Returns the first [key, value] tuple of the object,
+ * or `undefined` if the object is empty.
+ * See `_firstKey` for the iteration-order contract.
+ */
+export function _firstEntry<T extends AnyObject>(obj: T): [keyof T, ValueOf<T>] | undefined {
+  for (const k in obj) {
+    if (Object.hasOwn(obj, k)) return [k as keyof T, obj[k] as ValueOf<T>]
+  }
+  return undefined
+}
+
 export function _objectNullValuesToUndefined<T extends AnyObject>(
   obj: T,
   opt: MutateOptions = {},
@@ -467,7 +508,7 @@ export function _set<T extends AnyObject>(obj: T, path: PropertyPath, value: any
           a[c]
         : // No: create the key. Is the next key a potential array-index?
           (a[c] =
-            // oxlint-disable-next-line no-bitwise no-implicit-coercion unicorn/prefer-math-trunc
+            // oxlint-disable-next-line no-bitwise, no-implicit-coercion, unicorn/prefer-math-trunc
             Math.abs(path[i + 1]) >> 0 === +path[i + 1]
               ? [] // Yes: assign a new array object
               : {}), // No: assign a new plain object

package/src/object/set2.ts

@@ -34,15 +34,15 @@ export class Set2<T = any> extends Set<T> {
   // last(): T {
 
   toArray(): T[] {
-    return [...this]
+    return Array.from(this)
   }
 
   toJSON(): T[] {
-    return [...this]
+    return Array.from(this)
   }
 
   override toString(): string {
-    return `Set2(${this.size}) ${JSON.stringify([...this])}`
+    return `Set2(${this.size}) ${JSON.stringify(Array.from(this))}`
   }
 
   // todo: consider more helpful .toString() ?

package/src/promise/pFilter.ts

@@ -1,7 +1,7 @@
 import type { AsyncPredicate } from '../types.js'
 
 export async function pFilter<T>(iterable: Iterable<T>, filterFn: AsyncPredicate<T>): Promise<T[]> {
-  const items = [...iterable]
+  const items = Array.from(iterable)
   const predicates = await Promise.all(items.map((item, i) => filterFn(item, i)))
   return items.filter((_item, i) => predicates[i])
 }

package/src/promise/pMap.ts

@@ -67,7 +67,7 @@ export async function pMap<IN, OUT>(
   mapper: AbortableAsyncMapper<IN, OUT>,
   opt: PMapOptions = {},
 ): Promise<OUT[]> {
-  const items = [...iterable]
+  const items = Array.from(iterable)
   const itemsLength = items.length
   if (itemsLength === 0) return [] // short circuit
 

package/src/semver.ts

@@ -136,7 +136,8 @@ class SemverFactory {
    */
   sort(items: Semver[], opt: SortOptions = {}): Semver[] {
     const mod = opt.dir === 'desc' ? -1 : 1
-    return (opt.mutate ? items : [...items]).sort((a, b) => a.compare(b) * mod)
+    const cmp = (a: Semver, b: Semver): number => a.compare(b) * mod
+    return opt.mutate ? items.sort(cmp) : items.toSorted(cmp)
   }
 }
 

package/src/string/stringify.ts

@@ -131,7 +131,7 @@ export function _stringify(obj: any, opt: StringifyOptions = {}): string {
 
       obj = Object.fromEntries(obj)
     } else if (obj instanceof Set) {
-      obj = [...obj]
+      obj = Array.from(obj)
     }
 
     try {

package/src/typeFest.ts

@@ -1,4 +1,4 @@
-/* eslint-disable */
+/* oxlint-disable */
 
 /**
  * @file Old inclusion of 3rd party `type-fest` lib inlined here.