@naturalcycles/js-lib 15.66.0 → 15.68.0

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

@@ -197,6 +197,8 @@ export declare function _mapToObject<T, V>(array: Iterable<T>, mapper: (item: T)
  * Based on: https://stackoverflow.com/a/12646864/4919972
  */
 export declare function _shuffle<T>(array: T[], opt?: MutateOptions): T[];
+export declare function _firstLast<T>(array: readonly T[]): [first: T, last: T];
+export declare function _firstLastOrUndefined<T>(array: readonly T[]): [first: T, last: T] | undefined;
 /**
  * Returns last item of non-empty array.
  * Throws if array is empty.

package/dist/array/array.util.js

@@ -363,6 +363,16 @@ export function _shuffle(array, opt = {}) {
     }
     return a;
 }
+export function _firstLast(array) {
+    if (!array.length)
+        throw new Error('_firstLast called on empty array');
+    return [array[0], array[array.length - 1]];
+}
+export function _firstLastOrUndefined(array) {
+    if (!array.length)
+        return;
+    return [array[0], array[array.length - 1]];
+}
 /**
  * Returns last item of non-empty array.
  * Throws if array is empty.

package/dist/object/keySortedMap.d.ts

@@ -19,7 +19,9 @@ export interface KeySortedMapOptions<K> {
  *
  * @experimental
  */
-export declare class KeySortedMap<K, V> implements Map<K, V> {
+export interface KeySortedMap<K, V> extends Map<K, V> {
+}
+export declare class KeySortedMap<K, V> {
     #private;
     private readonly map;
     constructor(entries?: [K, V][], opt?: KeySortedMapOptions<K>);
@@ -52,7 +54,7 @@ export declare class KeySortedMap<K, V> implements Map<K, V> {
     entries(): MapIterator<[K, V]>;
     [Symbol.iterator](): MapIterator<[K, V]>;
     toString(): string;
-    [Symbol.toStringTag]: string;
+    readonly [Symbol.toStringTag] = "KeySortedMap";
     /**
      * Zero-allocation callbacks over sorted data (faster than spreading to arrays).
      */

package/dist/object/keySortedMap.js

@@ -1,15 +1,5 @@
 import { _assert } from '../error/index.js';
-/**
- * Maintains sorted array of keys.
- * Sorts **on insertion**, not on retrieval.
- *
- * - set(): O(log n) search + O(n) splice only when inserting a NEW key
- * - get/has: O(1)
- * - delete: O(log n) search + O(n) splice if present
- * - iteration: O(n) over pre-sorted keys (no sorting at iteration time)
- *
- * @experimental
- */
+// oxlint-disable-next-line no-unsafe-declaration-merging -- Map<K,V> workaround for oxlint TS2420 false positive
 export class KeySortedMap {
     map;
     #sortedKeys;

package/dist/object/lazyKeySortedMap.d.ts

@@ -14,7 +14,9 @@ export interface LazyKeySortedMapOptions<K> {
  *
  * @experimental
  */
-export declare class LazyKeySortedMap<K, V> implements Map<K, V> {
+export interface LazyKeySortedMap<K, V> extends Map<K, V> {
+}
+export declare class LazyKeySortedMap<K, V> {
     #private;
     private readonly map;
     private readonly maybeSortedKeys;
@@ -48,7 +50,7 @@ export declare class LazyKeySortedMap<K, V> implements Map<K, V> {
     values(): MapIterator<V>;
     entries(): MapIterator<[K, V]>;
     [Symbol.iterator](): MapIterator<[K, V]>;
-    [Symbol.toStringTag]: string;
+    readonly [Symbol.toStringTag] = "KeySortedMap";
     /**
      * Zero-allocation callbacks over sorted data (faster than spreading to arrays).
      */

package/dist/object/lazyKeySortedMap.js

@@ -1,10 +1,5 @@
 import { _assert } from '../error/index.js';
-/**
- * Maintains sorted array of keys.
- * Sorts **data access**, not on insertion.
- *
- * @experimental
- */
+// oxlint-disable-next-line no-unsafe-declaration-merging -- Map<K,V> workaround for oxlint TS2420 false positive
 export class LazyKeySortedMap {
     map;
     maybeSortedKeys;

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@naturalcycles/js-lib",
   "type": "module",
-  "version": "15.66.0",
+  "version": "15.68.0",
   "dependencies": {
     "tslib": "^2"
   },

package/src/array/array.util.ts

@@ -426,6 +426,16 @@ export function _shuffle<T>(array: T[], opt: MutateOptions = {}): T[] {
   return a
 }
 
+export function _firstLast<T>(array: readonly T[]): [first: T, last: T] {
+  if (!array.length) throw new Error('_firstLast called on empty array')
+  return [array[0]!, array[array.length - 1]!]
+}
+
+export function _firstLastOrUndefined<T>(array: readonly T[]): [first: T, last: T] | undefined {
+  if (!array.length) return
+  return [array[0]!, array[array.length - 1]!]
+}
+
 /**
  * Returns last item of non-empty array.
  * Throws if array is empty.

package/src/object/keySortedMap.ts

@@ -22,7 +22,11 @@ export interface KeySortedMapOptions<K> {
  *
  * @experimental
  */
-export class KeySortedMap<K, V> implements Map<K, V> {
+// oxlint-disable-next-line no-unsafe-declaration-merging -- Map<K,V> workaround for oxlint TS2420 false positive
+export interface KeySortedMap<K, V> extends Map<K, V> {}
+
+// oxlint-disable-next-line no-unsafe-declaration-merging -- Map<K,V> workaround for oxlint TS2420 false positive
+export class KeySortedMap<K, V> {
   private readonly map: Map<K, V>
   readonly #sortedKeys: K[]
 
@@ -140,7 +144,7 @@ export class KeySortedMap<K, V> implements Map<K, V> {
     return 'abc'
   }
 
-  [Symbol.toStringTag] = 'KeySortedMap'
+  readonly [Symbol.toStringTag] = 'KeySortedMap'
 
   /**
    * Zero-allocation callbacks over sorted data (faster than spreading to arrays).
@@ -148,7 +152,7 @@ export class KeySortedMap<K, V> implements Map<K, V> {
   forEach(cb: (value: V, key: K, map: Map<K, V>) => void, thisArg?: any): void {
     const { map } = this
     for (const k of this.#sortedKeys) {
-      cb.call(thisArg, map.get(k)!, k, this)
+      cb.call(thisArg, map.get(k)!, k, this as unknown as Map<K, V>)
     }
   }
 

package/src/object/lazyKeySortedMap.ts

@@ -17,7 +17,11 @@ export interface LazyKeySortedMapOptions<K> {
  *
  * @experimental
  */
-export class LazyKeySortedMap<K, V> implements Map<K, V> {
+// oxlint-disable-next-line no-unsafe-declaration-merging -- Map<K,V> workaround for oxlint TS2420 false positive
+export interface LazyKeySortedMap<K, V> extends Map<K, V> {}
+
+// oxlint-disable-next-line no-unsafe-declaration-merging -- Map<K,V> workaround for oxlint TS2420 false positive
+export class LazyKeySortedMap<K, V> {
   private readonly map: Map<K, V>
   private readonly maybeSortedKeys: K[]
   private keysAreSorted = false
@@ -117,7 +121,7 @@ export class LazyKeySortedMap<K, V> implements Map<K, V> {
     return this.entries()
   }
 
-  [Symbol.toStringTag] = 'KeySortedMap'
+  readonly [Symbol.toStringTag] = 'KeySortedMap'
 
   /**
    * Zero-allocation callbacks over sorted data (faster than spreading to arrays).
@@ -125,7 +129,7 @@ export class LazyKeySortedMap<K, V> implements Map<K, V> {
   forEach(cb: (value: V, key: K, map: Map<K, V>) => void, thisArg?: any): void {
     const { map } = this
     for (const k of this.getSortedKeys()) {
-      cb.call(thisArg, map.get(k)!, k, this)
+      cb.call(thisArg, map.get(k)!, k, this as unknown as Map<K, V>)
     }
   }