@rimbu/base 1.1.0 → 2.0.1

package/dist/bun/arr.mts

@@ -1,12 +1,18 @@
-import { Update, TraverseState, type ArrayNonEmpty } from '@rimbu/common';
+import { TraverseState, Update, type ArrayNonEmpty } from '@rimbu/common';
 
-// Returns a copy of the array with the given value appended
-export function append<T>(array: readonly T[], value: T): ArrayNonEmpty<T> {
+export function _appendNew<T>(array: readonly T[], value: T): ArrayNonEmpty<T> {
+  return array.toSpliced(array.length, 0, value) as ArrayNonEmpty<T>;
+}
+
+export function _appendOld<T>(array: readonly T[], value: T): ArrayNonEmpty<T> {
   const clone = array.slice();
   clone.push(value);
   return clone as ArrayNonEmpty<T>;
 }
 
+// Returns a copy of the array with the given value appended
+export const append = `toSpliced` in Array.prototype ? _appendNew : _appendOld;
+
 // Returns the concatenation of the two arrays, potentially reusing the input array if one of the arrays is empty
 export function concat<T>(
   first: readonly T[],
@@ -17,23 +23,41 @@ export function concat<T>(
   return first.concat(second);
 }
 
-// Returns an copy of the array between the start and end indices, with the elements in reversed order.
-export function reverse<T>(
+export function _reverseNew<T>(
+  array: readonly T[],
+  start?: number,
+  end?: number
+): T[] {
+  const source =
+    undefined !== start || undefined !== end
+      ? array.slice(start ?? 0, (end ?? array.length - 1) + 1)
+      : array;
+
+  return source.toReversed();
+}
+
+export function _reverseOld<T>(
   array: readonly T[],
-  start = 0,
-  end = array.length - 1
+  start?: number,
+  end?: number
 ): T[] {
-  const length = end - start + 1;
+  const _start = start ?? 0;
+  const _end = end ?? array.length - 1;
+  const length = _end - _start + 1;
   const res = [] as T[];
 
-  let arrayIndex = start - 1;
+  let arrayIndex = _start - 1;
   let resIndex = length - 1;
 
-  while (++arrayIndex <= end) res[resIndex--] = array[arrayIndex];
+  while (++arrayIndex <= _end) res[resIndex--] = array[arrayIndex];
 
   return res;
 }
 
+// Returns an copy of the array between the start and end indices, with the elements in reversed order.
+export const reverse =
+  'toReversed' in Array.prototype ? _reverseNew : _reverseOld;
+
 // Performs given function on each element of the array, in reverse order if 'reversed' is true.
 export function forEach<T>(
   array: readonly T[],
@@ -67,6 +91,11 @@ export function map<T, R>(
   f: (value: T, index: number) => R,
   indexOffset = 0
 ): R[] {
+  if (indexOffset === 0) {
+    // without offset, can use standard array map
+    return array.map(f);
+  }
+
   const result: R[] = [];
 
   let index = indexOffset;
@@ -95,59 +124,136 @@ export function reverseMap<T, R>(
   return result;
 }
 
-// Returns a copy of the given array with the given value added at the start
-export function prepend<T>(array: readonly T[], value: T): ArrayNonEmpty<T> {
+export function _prependNew<T>(
+  array: readonly T[],
+  value: T
+): ArrayNonEmpty<T> {
+  return array.toSpliced(0, 0, value) as ArrayNonEmpty<T>;
+}
+
+export function _prependOld<T>(
+  array: readonly T[],
+  value: T
+): ArrayNonEmpty<T> {
   const clone = array.slice();
   clone.unshift(value);
   return clone as ArrayNonEmpty<T>;
 }
 
-// Returns the last element of the array
-export function last<T>(arr: readonly T[]): T {
+// Returns a copy of the given array with the given value added at the start
+export const prepend =
+  `toSpliced` in Array.prototype ? _prependNew : _prependOld;
+
+export function _lastNew<T>(arr: readonly T[]): T {
+  return arr.at(-1)!;
+}
+
+export function _lastOld<T>(arr: readonly T[]): T {
   return arr[arr.length - 1];
 }
 
-// Returns a copy of the array where the element at given index is replaced by the given updater.
-// If the new element is the same as the old element, the original array is returned
-export function update<T>(
+// Returns the last element of the array
+export const last = `at` in Array.prototype ? _lastNew : _lastOld;
+
+export function _updateNew<T>(
+  arr: readonly T[],
+  index: number,
+  updater: Update<T>
+): readonly T[] {
+  if (index < 0 || index >= arr.length) {
+    return arr;
+  }
+  const curValue = arr[index];
+
+  const newValue = Update(curValue, updater);
+  if (Object.is(newValue, curValue)) {
+    return arr;
+  }
+
+  return arr.with(index, newValue);
+}
+
+export function _updateOld<T>(
   arr: readonly T[],
   index: number,
   updater: Update<T>
 ): readonly T[] {
-  if (index < 0 || index >= arr.length) return arr;
+  if (index < 0 || index >= arr.length) {
+    return arr;
+  }
   const curValue = arr[index];
 
   const newValue = Update(curValue, updater);
-  if (Object.is(newValue, curValue)) return arr;
+  if (Object.is(newValue, curValue)) {
+    return arr;
+  }
+
   const newArr = arr.slice();
   newArr[index] = newValue;
   return newArr;
 }
 
-// Returns a copy of the array where the element at given index is replaced by applying given function.
+// Returns a copy of the array where the element at given index is replaced by the given updater.
 // If the new element is the same as the old element, the original array is returned
-export function mod<T>(
+export const update = `with` in Array.prototype ? _updateNew : _updateOld;
+
+export function _modNew<T>(
   arr: readonly T[],
   index: number,
   f: (value: T) => T
 ): readonly T[] {
-  if (index < 0 || index >= arr.length) return arr;
+  if (index < 0 || index >= arr.length) {
+    return arr;
+  }
 
   const curValue = arr[index];
   const newValue = f(curValue);
-  if (Object.is(newValue, curValue)) return arr;
+
+  if (Object.is(newValue, curValue)) {
+    return arr;
+  }
+
+  return arr.with(index, newValue);
+}
+
+export function _modOld<T>(
+  arr: readonly T[],
+  index: number,
+  f: (value: T) => T
+): readonly T[] {
+  if (index < 0 || index >= arr.length) {
+    return arr;
+  }
+
+  const curValue = arr[index];
+  const newValue = f(curValue);
+
+  if (Object.is(newValue, curValue)) {
+    return arr;
+  }
+
   const newArr = arr.slice();
   newArr[index] = newValue;
   return newArr;
 }
 
-// Returns a copy of the array where at given index the given value is inserted
-export function insert<T>(arr: readonly T[], index: number, value: T): T[] {
+// Returns a copy of the array where the element at given index is replaced by applying given function.
+// If the new element is the same as the old element, the original array is returned
+export const mod = `with` in Array.prototype ? _modNew : _modOld;
+
+export function _insertNew<T>(arr: readonly T[], index: number, value: T): T[] {
+  return arr.toSpliced(index, 0, value);
+}
+
+export function _insertOld<T>(arr: readonly T[], index: number, value: T): T[] {
   const clone = arr.slice();
   clone.splice(index, 0, value);
   return clone;
 }
 
+// Returns a copy of the array where at given index the given value is inserted
+export const insert = `toSpliced` in Array.prototype ? _insertNew : _insertOld;
+
 // Returns a copy of the array, without its first element
 export function tail<T>(arr: readonly T[]): T[] {
   return arr.slice(1);
@@ -158,8 +264,16 @@ export function init<T>(arr: readonly T[]): T[] {
   return arr.slice(0, arr.length - 1);
 }
 
-// Immutable version of the array .splice command, always returns a new array
-export function splice<T>(
+export function _spliceNew<T>(
+  arr: readonly T[],
+  start: number,
+  deleteCount: number,
+  ...items: T[]
+): T[] {
+  return arr.toSpliced(start, deleteCount, ...items);
+}
+
+export function _spliceOld<T>(
   arr: readonly T[],
   start: number,
   deleteCount: number,
@@ -170,6 +284,9 @@ export function splice<T>(
   return clone;
 }
 
+// Immutable version of the array .splice command, always returns a new array
+export const splice = `toSpliced` in Array.prototype ? _spliceNew : _spliceOld;
+
 // Returns a copy of the array, where its 'sparse' property is kept (sparse = not all indices have a value)
 export function copySparse<T>(arr: readonly T[]): T[] {
   const clone: T[] = [];

package/dist/cjs/arr.cjs

@@ -1,177 +1,240 @@
 "use strict";
-var __defProp = Object.defineProperty;
-var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
-var __getOwnPropNames = Object.getOwnPropertyNames;
-var __hasOwnProp = Object.prototype.hasOwnProperty;
-var __export = (target, all) => {
-  for (var name in all)
-    __defProp(target, name, { get: all[name], enumerable: true });
-};
-var __copyProps = (to, from, except, desc) => {
-  if (from && typeof from === "object" || typeof from === "function") {
-    for (let key of __getOwnPropNames(from))
-      if (!__hasOwnProp.call(to, key) && key !== except)
-        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
-  }
-  return to;
-};
-var __toCommonJS = (mod2) => __copyProps(__defProp({}, "__esModule", { value: true }), mod2);
-
-// src/arr.mts
-var arr_exports = {};
-__export(arr_exports, {
-  append: () => append,
-  concat: () => concat,
-  copySparse: () => copySparse,
-  forEach: () => forEach,
-  init: () => init,
-  insert: () => insert,
-  last: () => last,
-  map: () => map,
-  mapSparse: () => mapSparse,
-  mod: () => mod,
-  prepend: () => prepend,
-  reverse: () => reverse,
-  reverseMap: () => reverseMap,
-  splice: () => splice,
-  tail: () => tail,
-  update: () => update
-});
-module.exports = __toCommonJS(arr_exports);
-var import_common = require("@rimbu/common");
-function append(array, value) {
-  const clone = array.slice();
-  clone.push(value);
-  return clone;
-}
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.mapSparse = exports.copySparse = exports.splice = exports._spliceOld = exports._spliceNew = exports.init = exports.tail = exports.insert = exports._insertOld = exports._insertNew = exports.mod = exports._modOld = exports._modNew = exports.update = exports._updateOld = exports._updateNew = exports.last = exports._lastOld = exports._lastNew = exports.prepend = exports._prependOld = exports._prependNew = exports.reverseMap = exports.map = exports.forEach = exports.reverse = exports._reverseOld = exports._reverseNew = exports.concat = exports.append = exports._appendOld = exports._appendNew = void 0;
+var tslib_1 = require("tslib");
+var common_1 = require("@rimbu/common");
+function _appendNew(array, value) {
+    return array.toSpliced(array.length, 0, value);
+}
+exports._appendNew = _appendNew;
+function _appendOld(array, value) {
+    var clone = array.slice();
+    clone.push(value);
+    return clone;
+}
+exports._appendOld = _appendOld;
+// Returns a copy of the array with the given value appended
+exports.append = "toSpliced" in Array.prototype ? _appendNew : _appendOld;
+// Returns the concatenation of the two arrays, potentially reusing the input array if one of the arrays is empty
 function concat(first, second) {
-  if (first.length === 0)
-    return second;
-  if (second.length === 0)
-    return first;
-  return first.concat(second);
-}
-function reverse(array, start = 0, end = array.length - 1) {
-  const length = end - start + 1;
-  const res = [];
-  let arrayIndex = start - 1;
-  let resIndex = length - 1;
-  while (++arrayIndex <= end)
-    res[resIndex--] = array[arrayIndex];
-  return res;
-}
-function forEach(array, f, state = (0, import_common.TraverseState)(), reversed = false) {
-  if (state.halted)
-    return;
-  const { halt } = state;
-  if (reversed) {
-    let i = array.length;
-    while (!state.halted && --i >= 0) {
-      f(array[i], state.nextIndex(), halt);
-    }
-  } else {
-    const length = array.length;
-    let i = -1;
-    while (!state.halted && ++i < length) {
-      f(array[i], state.nextIndex(), halt);
-    }
-  }
-}
-function map(array, f, indexOffset = 0) {
-  const result = [];
-  let index = indexOffset;
-  let i = -1;
-  const length = array.length;
-  while (++i < length) {
-    result[i] = f(array[i], index++);
-  }
-  return result;
-}
-function reverseMap(array, f, indexOffset = 0) {
-  const result = [];
-  let index = indexOffset;
-  let arrayIndex = array.length;
-  let resultIndex = 0;
-  while (--arrayIndex >= 0)
-    result[resultIndex++] = f(array[arrayIndex], index++);
-  return result;
-}
-function prepend(array, value) {
-  const clone = array.slice();
-  clone.unshift(value);
-  return clone;
-}
-function last(arr) {
-  return arr[arr.length - 1];
-}
-function update(arr, index, updater) {
-  if (index < 0 || index >= arr.length)
-    return arr;
-  const curValue = arr[index];
-  const newValue = (0, import_common.Update)(curValue, updater);
-  if (Object.is(newValue, curValue))
-    return arr;
-  const newArr = arr.slice();
-  newArr[index] = newValue;
-  return newArr;
-}
-function mod(arr, index, f) {
-  if (index < 0 || index >= arr.length)
-    return arr;
-  const curValue = arr[index];
-  const newValue = f(curValue);
-  if (Object.is(newValue, curValue))
-    return arr;
-  const newArr = arr.slice();
-  newArr[index] = newValue;
-  return newArr;
-}
-function insert(arr, index, value) {
-  const clone = arr.slice();
-  clone.splice(index, 0, value);
-  return clone;
+    if (first.length === 0)
+        return second;
+    if (second.length === 0)
+        return first;
+    return first.concat(second);
+}
+exports.concat = concat;
+function _reverseNew(array, start, end) {
+    var source = undefined !== start || undefined !== end
+        ? array.slice(start !== null && start !== void 0 ? start : 0, (end !== null && end !== void 0 ? end : array.length - 1) + 1)
+        : array;
+    return source.toReversed();
+}
+exports._reverseNew = _reverseNew;
+function _reverseOld(array, start, end) {
+    var _start = start !== null && start !== void 0 ? start : 0;
+    var _end = end !== null && end !== void 0 ? end : array.length - 1;
+    var length = _end - _start + 1;
+    var res = [];
+    var arrayIndex = _start - 1;
+    var resIndex = length - 1;
+    while (++arrayIndex <= _end)
+        res[resIndex--] = array[arrayIndex];
+    return res;
+}
+exports._reverseOld = _reverseOld;
+// Returns an copy of the array between the start and end indices, with the elements in reversed order.
+exports.reverse = 'toReversed' in Array.prototype ? _reverseNew : _reverseOld;
+// Performs given function on each element of the array, in reverse order if 'reversed' is true.
+function forEach(array, f, state, reversed) {
+    if (state === void 0) { state = (0, common_1.TraverseState)(); }
+    if (reversed === void 0) { reversed = false; }
+    if (state.halted)
+        return;
+    var halt = state.halt;
+    if (reversed) {
+        var i = array.length;
+        while (!state.halted && --i >= 0) {
+            f(array[i], state.nextIndex(), halt);
+        }
+    }
+    else {
+        var length = array.length;
+        var i = -1;
+        while (!state.halted && ++i < length) {
+            f(array[i], state.nextIndex(), halt);
+        }
+    }
+}
+exports.forEach = forEach;
+// Returns a copy of the array where given function is applied to each element
+function map(array, f, indexOffset) {
+    if (indexOffset === void 0) { indexOffset = 0; }
+    if (indexOffset === 0) {
+        // without offset, can use standard array map
+        return array.map(f);
+    }
+    var result = [];
+    var index = indexOffset;
+    var i = -1;
+    var length = array.length;
+    while (++i < length) {
+        result[i] = f(array[i], index++);
+    }
+    return result;
+}
+exports.map = map;
+// Returns a copy of the array where given functio is applied to each element in reverse order
+function reverseMap(array, f, indexOffset) {
+    if (indexOffset === void 0) { indexOffset = 0; }
+    var result = [];
+    var index = indexOffset;
+    var arrayIndex = array.length;
+    var resultIndex = 0;
+    while (--arrayIndex >= 0)
+        result[resultIndex++] = f(array[arrayIndex], index++);
+    return result;
+}
+exports.reverseMap = reverseMap;
+function _prependNew(array, value) {
+    return array.toSpliced(0, 0, value);
+}
+exports._prependNew = _prependNew;
+function _prependOld(array, value) {
+    var clone = array.slice();
+    clone.unshift(value);
+    return clone;
+}
+exports._prependOld = _prependOld;
+// Returns a copy of the given array with the given value added at the start
+exports.prepend = "toSpliced" in Array.prototype ? _prependNew : _prependOld;
+function _lastNew(arr) {
+    return arr.at(-1);
+}
+exports._lastNew = _lastNew;
+function _lastOld(arr) {
+    return arr[arr.length - 1];
+}
+exports._lastOld = _lastOld;
+// Returns the last element of the array
+exports.last = "at" in Array.prototype ? _lastNew : _lastOld;
+function _updateNew(arr, index, updater) {
+    if (index < 0 || index >= arr.length) {
+        return arr;
+    }
+    var curValue = arr[index];
+    var newValue = (0, common_1.Update)(curValue, updater);
+    if (Object.is(newValue, curValue)) {
+        return arr;
+    }
+    return arr.with(index, newValue);
+}
+exports._updateNew = _updateNew;
+function _updateOld(arr, index, updater) {
+    if (index < 0 || index >= arr.length) {
+        return arr;
+    }
+    var curValue = arr[index];
+    var newValue = (0, common_1.Update)(curValue, updater);
+    if (Object.is(newValue, curValue)) {
+        return arr;
+    }
+    var newArr = arr.slice();
+    newArr[index] = newValue;
+    return newArr;
+}
+exports._updateOld = _updateOld;
+// Returns a copy of the array where the element at given index is replaced by the given updater.
+// If the new element is the same as the old element, the original array is returned
+exports.update = "with" in Array.prototype ? _updateNew : _updateOld;
+function _modNew(arr, index, f) {
+    if (index < 0 || index >= arr.length) {
+        return arr;
+    }
+    var curValue = arr[index];
+    var newValue = f(curValue);
+    if (Object.is(newValue, curValue)) {
+        return arr;
+    }
+    return arr.with(index, newValue);
 }
+exports._modNew = _modNew;
+function _modOld(arr, index, f) {
+    if (index < 0 || index >= arr.length) {
+        return arr;
+    }
+    var curValue = arr[index];
+    var newValue = f(curValue);
+    if (Object.is(newValue, curValue)) {
+        return arr;
+    }
+    var newArr = arr.slice();
+    newArr[index] = newValue;
+    return newArr;
+}
+exports._modOld = _modOld;
+// Returns a copy of the array where the element at given index is replaced by applying given function.
+// If the new element is the same as the old element, the original array is returned
+exports.mod = "with" in Array.prototype ? _modNew : _modOld;
+function _insertNew(arr, index, value) {
+    return arr.toSpliced(index, 0, value);
+}
+exports._insertNew = _insertNew;
+function _insertOld(arr, index, value) {
+    var clone = arr.slice();
+    clone.splice(index, 0, value);
+    return clone;
+}
+exports._insertOld = _insertOld;
+// Returns a copy of the array where at given index the given value is inserted
+exports.insert = "toSpliced" in Array.prototype ? _insertNew : _insertOld;
+// Returns a copy of the array, without its first element
 function tail(arr) {
-  return arr.slice(1);
+    return arr.slice(1);
 }
+exports.tail = tail;
+// Returns a copy of the array, without its last element
 function init(arr) {
-  return arr.slice(0, arr.length - 1);
+    return arr.slice(0, arr.length - 1);
 }
-function splice(arr, start, deleteCount, ...items) {
-  const clone = arr.slice();
-  clone.splice(start, deleteCount, ...items);
-  return clone;
+exports.init = init;
+function _spliceNew(arr, start, deleteCount) {
+    var items = [];
+    for (var _i = 3; _i < arguments.length; _i++) {
+        items[_i - 3] = arguments[_i];
+    }
+    return arr.toSpliced.apply(arr, tslib_1.__spreadArray([start, deleteCount], tslib_1.__read(items), false));
 }
+exports._spliceNew = _spliceNew;
+function _spliceOld(arr, start, deleteCount) {
+    var items = [];
+    for (var _i = 3; _i < arguments.length; _i++) {
+        items[_i - 3] = arguments[_i];
+    }
+    var clone = arr.slice();
+    clone.splice.apply(clone, tslib_1.__spreadArray([start, deleteCount], tslib_1.__read(items), false));
+    return clone;
+}
+exports._spliceOld = _spliceOld;
+// Immutable version of the array .splice command, always returns a new array
+exports.splice = "toSpliced" in Array.prototype ? _spliceNew : _spliceOld;
+// Returns a copy of the array, where its 'sparse' property is kept (sparse = not all indices have a value)
 function copySparse(arr) {
-  const clone = [];
-  for (const key in arr) {
-    clone[key] = arr[key];
-  }
-  return clone;
+    var clone = [];
+    for (var key in arr) {
+        clone[key] = arr[key];
+    }
+    return clone;
 }
+exports.copySparse = copySparse;
+// Returns a copy of the array with given function applied to each element, where its 'sparse' property is kept
+// (sparse = not all indices have a value)
 function mapSparse(arr, f) {
-  const result = Array(arr.length);
-  for (const key in arr) {
-    result[key] = f(arr[key], key);
-  }
-  return result;
-}
-// Annotate the CommonJS export names for ESM import in node:
-0 && (module.exports = {
-  append,
-  concat,
-  copySparse,
-  forEach,
-  init,
-  insert,
-  last,
-  map,
-  mapSparse,
-  mod,
-  prepend,
-  reverse,
-  reverseMap,
-  splice,
-  tail,
-  update
-});
+    var result = Array(arr.length);
+    for (var key in arr) {
+        result[key] = f(arr[key], key);
+    }
+    return result;
+}
+exports.mapSparse = mapSparse;
+//# sourceMappingURL=arr.cjs.map