@tstdl/base 0.87.13 → 0.88.0-alpha1

package/utils/binary-search.js

@@ -1,101 +1,84 @@
-"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 = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
-var binary_search_exports = {};
-__export(binary_search_exports, {
-  binarySearch: () => binarySearch,
-  binarySearchFirst: () => binarySearchFirst,
-  binarySearchFirstIndexEqualOrLarger: () => binarySearchFirstIndexEqualOrLarger,
-  binarySearchInsertionIndex: () => binarySearchInsertionIndex,
-  binarySearchLast: () => binarySearchLast,
-  binarySearchLastIndexEqualOrSmaller: () => binarySearchLastIndexEqualOrSmaller,
-  binarySearchNearestIndex: () => binarySearchNearestIndex
-});
-module.exports = __toCommonJS(binary_search_exports);
-var import_comparison = require("./comparison.js");
+import { compareByValue } from './comparison.js';
 var Position;
-(function(Position2) {
-  Position2[Position2["Undefined"] = 0] = "Undefined";
-  Position2[Position2["First"] = 1] = "First";
-  Position2[Position2["Last"] = 2] = "Last";
+(function (Position) {
+    Position[Position["Undefined"] = 0] = "Undefined";
+    Position[Position["First"] = 1] = "First";
+    Position[Position["Last"] = 2] = "Last";
 })(Position || (Position = {}));
-function binarySearch(values, searchValue, comparator = import_comparison.compareByValue, options) {
-  return _binarySearch(values, searchValue, Position.Undefined, comparator, options);
+export function binarySearch(values, searchValue, comparator = compareByValue, options) {
+    return _binarySearch(values, searchValue, Position.Undefined, comparator, options);
 }
-function binarySearchFirst(values, searchValue, comparator = import_comparison.compareByValue, options) {
-  return _binarySearch(values, searchValue, Position.First, comparator, options);
+export function binarySearchFirst(values, searchValue, comparator = compareByValue, options) {
+    return _binarySearch(values, searchValue, Position.First, comparator, options);
 }
-function binarySearchLast(values, searchValue, comparator = import_comparison.compareByValue, options) {
-  return _binarySearch(values, searchValue, Position.Last, comparator, options);
+export function binarySearchLast(values, searchValue, comparator = compareByValue, options) {
+    return _binarySearch(values, searchValue, Position.Last, comparator, options);
 }
 function _binarySearch(values, searchValue, position, comparator, options) {
-  const { index, comparison } = _binarySearchRawIndex(values, searchValue, position, comparator, options);
-  return comparison == 0 ? index : void 0;
+    const { index, comparison } = _binarySearchRawIndex(values, searchValue, position, comparator, options);
+    return (comparison == 0)
+        ? index
+        : undefined;
 }
-function binarySearchNearestIndex(values, searchValue, comparator = import_comparison.compareByValue, options) {
-  const { index } = _binarySearchRawIndex(values, searchValue, Position.Undefined, comparator, options);
-  return index;
+export function binarySearchNearestIndex(values, searchValue, comparator = compareByValue, options) {
+    const { index } = _binarySearchRawIndex(values, searchValue, Position.Undefined, comparator, options);
+    return index;
 }
-function binarySearchFirstIndexEqualOrLarger(values, searchValue, comparator = import_comparison.compareByValue, options) {
-  const { index, comparison } = _binarySearchRawIndex(values, searchValue, Position.First, comparator, options);
-  if (index == values.length - 1 && comparison < 0) {
-    return void 0;
-  }
-  return index + (comparison < 0);
+export function binarySearchFirstIndexEqualOrLarger(values, searchValue, comparator = compareByValue, options) {
+    const { index, comparison } = _binarySearchRawIndex(values, searchValue, Position.First, comparator, options);
+    if ((index == values.length - 1) && (comparison < 0)) {
+        return undefined;
+    }
+    return index + (comparison < 0);
 }
-function binarySearchLastIndexEqualOrSmaller(values, searchValue, comparator = import_comparison.compareByValue, options) {
-  const { index, comparison } = _binarySearchRawIndex(values, searchValue, Position.Last, comparator, options);
-  if (index == 0 && comparison > 0) {
-    return void 0;
-  }
-  return comparison > 0 ? index - 1 : index;
+export function binarySearchLastIndexEqualOrSmaller(values, searchValue, comparator = compareByValue, options) {
+    const { index, comparison } = _binarySearchRawIndex(values, searchValue, Position.Last, comparator, options);
+    if ((index == 0) && (comparison > 0)) {
+        return undefined;
+    }
+    return (comparison > 0) ? (index - 1) : index;
 }
-function binarySearchInsertionIndex(values, searchValue, comparator = import_comparison.compareByValue) {
-  const { index, comparison } = _binarySearchRawIndex(values, searchValue, Position.Undefined, comparator);
-  return index + Number(comparison <= 0);
+export function binarySearchInsertionIndex(values, searchValue, comparator = compareByValue) {
+    const { index, comparison } = _binarySearchRawIndex(values, searchValue, Position.Undefined, comparator);
+    return index + Number(comparison <= 0);
 }
+// eslint-disable-next-line max-statements, max-lines-per-function
 function _binarySearchRawIndex(values, searchValue, position, comparator, options) {
-  let min = options?.min ?? 0;
-  let max = options?.max ?? values.length - 1;
-  let middle = 0;
-  let value;
-  let comparison;
-  if (values.length == 0) {
-    return { index: 0, comparison: 1 };
-  }
-  const positionComparator = position == Position.First ? () => min != middle : position == Position.Last ? () => max != middle : () => false;
-  const positionSetter = position == Position.First ? () => max = middle : position == Position.Last ? () => min = middle : () => {
-    throw new Error("must not happen");
-  };
-  const integer = position == Position.Last ? Math.ceil : Math.floor;
-  while (min <= max) {
-    middle = integer((min + max) / 2);
-    value = values[middle];
-    comparison = comparator(value, searchValue);
-    if (comparison < 0) {
-      min = middle + 1;
-    } else if (comparison > 0) {
-      max = middle - 1;
-    } else if (positionComparator()) {
-      positionSetter();
-    } else if (comparison == 0) {
-      break;
+    let min = options?.min ?? 0;
+    let max = options?.max ?? values.length - 1;
+    let middle = 0;
+    let value;
+    let comparison;
+    if (values.length == 0) {
+        return { index: 0, comparison: 1 };
+    }
+    const positionComparator = (position == Position.First)
+        ? () => (min != middle)
+        : (position == Position.Last)
+            ? () => (max != middle)
+            : () => false;
+    const positionSetter = (position == Position.First)
+        ? () => (max = middle)
+        : (position == Position.Last)
+            ? () => (min = middle)
+            : () => { throw new Error('must not happen'); };
+    const integer = (position == Position.Last) ? Math.ceil : Math.floor;
+    while (min <= max) {
+        middle = integer((min + max) / 2);
+        value = values[middle];
+        comparison = comparator(value, searchValue);
+        if (comparison < 0) {
+            min = middle + 1;
+        }
+        else if (comparison > 0) {
+            max = middle - 1;
+        }
+        else if (positionComparator()) {
+            positionSetter();
+        }
+        else if (comparison == 0) {
+            break;
+        }
     }
-  }
-  return { index: middle, comparison };
+    return { index: middle, comparison };
 }

package/utils/binary.js

@@ -1,65 +1,54 @@
-"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 = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
-var binary_exports = {};
-__export(binary_exports, {
-  concatArrayBufferViews: () => concatArrayBufferViews,
-  concatArrayBuffers: () => concatArrayBuffers,
-  toArrayBuffer: () => toArrayBuffer,
-  toUint8Array: () => toUint8Array
-});
-module.exports = __toCommonJS(binary_exports);
-var import_supports = require("../supports.js");
-var import_type_guards = require("./type-guards.js");
-function toArrayBuffer(data, clone = false) {
-  if ((0, import_type_guards.isArrayBuffer)(data)) {
-    return clone ? data.slice(0) : data;
-  }
-  if (!clone && data.byteOffset == 0 && data.byteLength == data.buffer.byteLength) {
-    return data.buffer;
-  }
-  return data.buffer.slice(data.byteOffset, data.byteOffset + data.byteLength);
+import { supportsBuffer } from '../supports.js';
+import { assert, isArrayBuffer } from './type-guards.js';
+/**
+ * Get ArrayBuffer from binary data
+ * @param data data to get ArrayBuffer from
+ * @param clone force cloning (might still clone if datas underlying buffer is larger than its view)
+ */
+export function toArrayBuffer(data, clone = false) {
+    if (isArrayBuffer(data)) {
+        return clone ? data.slice(0) : data;
+    }
+    if (!clone && (data.byteOffset == 0) && (data.byteLength == data.buffer.byteLength)) {
+        return data.buffer;
+    }
+    return data.buffer.slice(data.byteOffset, data.byteOffset + data.byteLength);
 }
-function toUint8Array(data, clone = false) {
-  if ((0, import_type_guards.isArrayBuffer)(data)) {
-    return clone ? new Uint8Array(data.slice(0)) : new Uint8Array(data);
-  }
-  const { buffer, byteOffset, byteLength } = data;
-  return clone ? new Uint8Array(buffer.slice(byteOffset, byteOffset + byteLength)) : new Uint8Array(buffer, byteOffset, byteLength);
+/**
+ * eslint-disable-next-line @typescript-eslint/no-shadow
+ * convert to Uint8Array
+ * @param data binary data
+ * @param clone whether to clone buffer or not
+ */
+export function toUint8Array(data, clone = false) {
+    if (isArrayBuffer(data)) {
+        return clone
+            ? new Uint8Array(data.slice(0))
+            : new Uint8Array(data);
+    }
+    const { buffer, byteOffset, byteLength } = data;
+    return clone
+        ? new Uint8Array(buffer.slice(byteOffset, byteOffset + byteLength))
+        : new Uint8Array(buffer, byteOffset, byteLength);
 }
-function concatArrayBuffers(buffers) {
-  const arrays = buffers.map((buffer) => new Uint8Array(buffer));
-  const bytes = concatArrayBufferViews(arrays);
-  return bytes.buffer;
+export function concatArrayBuffers(buffers) {
+    const arrays = buffers.map((buffer) => new Uint8Array(buffer));
+    const bytes = concatArrayBufferViews(arrays);
+    return bytes.buffer;
 }
-function concatArrayBufferViews(arrays, totalLength) {
-  (0, import_type_guards.assert)(arrays.length > 0, "No array provided.");
-  const type = arrays[0].constructor;
-  if (import_supports.supportsBuffer && (type == Buffer || type == Uint8Array)) {
-    return Buffer.concat(arrays, totalLength);
-  }
-  const totalBytes = totalLength ?? arrays.reduce((sum, array) => sum + array.byteLength, 0);
-  const merged = new Uint8Array(totalBytes);
-  let currentIndex = 0;
-  for (const array of arrays) {
-    const uint8Array = toUint8Array(array, false);
-    merged.set(uint8Array, currentIndex);
-    currentIndex += uint8Array.byteLength;
-  }
-  return new type(merged.buffer);
+export function concatArrayBufferViews(arrays, totalLength) {
+    assert(arrays.length > 0, 'No array provided.');
+    const type = arrays[0].constructor;
+    if (supportsBuffer && ((type == Buffer) || (type == Uint8Array))) {
+        return Buffer.concat(arrays, totalLength);
+    }
+    const totalBytes = totalLength ?? arrays.reduce((sum, array) => sum + array.byteLength, 0);
+    const merged = new Uint8Array(totalBytes);
+    let currentIndex = 0;
+    for (const array of arrays) {
+        const uint8Array = toUint8Array(array, false);
+        merged.set(uint8Array, currentIndex);
+        currentIndex += uint8Array.byteLength;
+    }
+    return new type(merged.buffer);
 }

package/utils/clone.js

@@ -1,65 +1,44 @@
-"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 = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
-var clone_exports = {};
-__export(clone_exports, {
-  clone: () => clone
-});
-module.exports = __toCommonJS(clone_exports);
-var import_supports = require("../supports.js");
-var import_object = require("./object/object.js");
-var import_type_guards = require("./type-guards.js");
-function clone(object, deep) {
-  if (import_supports.supportsStructuredClone && deep) {
-    return structuredClone(object);
-  }
-  if ((0, import_type_guards.isPrimitive)(object)) {
-    return object;
-  }
-  if ((0, import_type_guards.isDate)(object)) {
-    return new Date(object);
-  }
-  if ((0, import_type_guards.isRegExp)(object)) {
-    return new RegExp(object.source, object.flags);
-  }
-  if ((0, import_type_guards.isSet)(object)) {
-    return new Set(object);
-  }
-  if ((0, import_type_guards.isMap)(object)) {
-    return new Map(object);
-  }
-  if ((0, import_type_guards.isArrayBuffer)(object)) {
-    return object.slice(0);
-  }
-  if ((0, import_type_guards.isTypedArray)(object)) {
-    return object.slice();
-  }
-  if ((0, import_type_guards.isDataView)(object)) {
-    const clonedBuffer = object.buffer.slice(0);
-    return new DataView(clonedBuffer, object.byteOffset, object.byteLength);
-  }
-  if ((0, import_type_guards.isArray)(object)) {
-    return deep ? object.map((value) => clone(value, true)) : [...object];
-  }
-  (0, import_type_guards.assertObject)(object);
-  if (!deep) {
-    return { ...object };
-  }
-  const entries = (0, import_object.objectEntries)(object).map(([key, value]) => [key, clone(value, true)]);
-  return Object.fromEntries(entries);
+import { supportsStructuredClone } from '../supports.js';
+import { objectEntries } from './object/object.js';
+import { assertObject, isArray, isArrayBuffer, isDataView, isDate, isMap, isPrimitive, isRegExp, isSet, isTypedArray } from './type-guards.js';
+export function clone(object, deep) {
+    if (supportsStructuredClone && deep) {
+        return structuredClone(object);
+    }
+    if (isPrimitive(object)) {
+        return object;
+    }
+    if (isDate(object)) {
+        return new Date(object);
+    }
+    if (isRegExp(object)) {
+        return new RegExp(object.source, object.flags);
+    }
+    if (isSet(object)) {
+        return new Set(object);
+    }
+    if (isMap(object)) {
+        return new Map(object);
+    }
+    if (isArrayBuffer(object)) {
+        return object.slice(0);
+    }
+    if (isTypedArray(object)) {
+        return object.slice();
+    }
+    if (isDataView(object)) {
+        const clonedBuffer = object.buffer.slice(0);
+        return new DataView(clonedBuffer, object.byteOffset, object.byteLength);
+    }
+    if (isArray(object)) {
+        return deep
+            ? object.map((value) => clone(value, true))
+            : [...object];
+    }
+    assertObject(object);
+    if (!deep) {
+        return { ...object };
+    }
+    const entries = objectEntries(object).map(([key, value]) => [key, clone(value, true)]);
+    return Object.fromEntries(entries);
 }

package/utils/comparison.js

@@ -1,105 +1,83 @@
-"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 = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
-var comparison_exports = {};
-__export(comparison_exports, {
-  compareByValue: () => compareByValue,
-  compareByValueDescending: () => compareByValueDescending,
-  compareByValueSelection: () => compareByValueSelection,
-  compareByValueSelectionDescending: () => compareByValueSelectionDescending,
-  compareByValueSelectionOrdered: () => compareByValueSelectionOrdered,
-  compareByValueSelectionToOrder: () => compareByValueSelectionToOrder,
-  compareByValueToOrder: () => compareByValueToOrder
-});
-module.exports = __toCommonJS(comparison_exports);
-function compareByValueSelection(...selectors) {
-  return (a, b) => {
-    for (const selector of selectors) {
-      const selectedA = selector(a);
-      const selectedB = selector(b);
-      const comparison = compareByValue(selectedA, selectedB);
-      if (comparison != 0) {
-        return comparison;
-      }
-    }
-    return 0;
-  };
+export function compareByValueSelection(...selectors) {
+    return (a, b) => {
+        for (const selector of selectors) {
+            const selectedA = selector(a);
+            const selectedB = selector(b);
+            const comparison = compareByValue(selectedA, selectedB);
+            if (comparison != 0) {
+                return comparison;
+            }
+        }
+        return 0;
+    };
 }
-function compareByValueSelectionDescending(...selectors) {
-  return (a, b) => {
-    for (const selector of selectors) {
-      const selectedA = selector(a);
-      const selectedB = selector(b);
-      const comparison = compareByValueDescending(selectedA, selectedB);
-      if (comparison != 0) {
-        return comparison;
-      }
-    }
-    return 0;
-  };
+export function compareByValueSelectionDescending(...selectors) {
+    return (a, b) => {
+        for (const selector of selectors) {
+            const selectedA = selector(a);
+            const selectedB = selector(b);
+            const comparison = compareByValueDescending(selectedA, selectedB);
+            if (comparison != 0) {
+                return comparison;
+            }
+        }
+        return 0;
+    };
 }
-function compareByValueSelectionOrdered(...selectors) {
-  return (a, b) => {
-    for (const [selector, order] of selectors) {
-      const selectedA = selector(a);
-      const selectedB = selector(b);
-      const comparison = order == 1 ? compareByValue(selectedA, selectedB) : compareByValueDescending(selectedA, selectedB);
-      if (comparison != 0) {
-        return comparison;
-      }
-    }
-    return 0;
-  };
+export function compareByValueSelectionOrdered(...selectors) {
+    return (a, b) => {
+        for (const [selector, order] of selectors) {
+            const selectedA = selector(a);
+            const selectedB = selector(b);
+            const comparison = (order == 1)
+                ? compareByValue(selectedA, selectedB)
+                : compareByValueDescending(selectedA, selectedB);
+            if (comparison != 0) {
+                return comparison;
+            }
+        }
+        return 0;
+    };
 }
-function compareByValueToOrder(order) {
-  return compareByValueSelectionToOrder(order, (item) => item);
+export function compareByValueToOrder(order) {
+    return compareByValueSelectionToOrder(order, (item) => item);
 }
-function compareByValueSelectionToOrder(order, selector) {
-  const indexMapEntries = order.map((orderItem, index) => [orderItem, index]);
-  const indexMap = new Map(indexMapEntries);
-  return function compareByValueSelectionToOrder2(a, b) {
-    const selectedA = selector(a);
-    const selectedB = selector(b);
-    const indexA = indexMap.get(selectedA);
-    const indexB = indexMap.get(selectedB);
-    if (indexA == void 0 || indexB == void 0) {
-      throw new Error("value not defined in order");
-    }
-    return compareByValue(indexA, indexB);
-  };
+export function compareByValueSelectionToOrder(order, selector) {
+    const indexMapEntries = order.map((orderItem, index) => [orderItem, index]);
+    const indexMap = new Map(indexMapEntries);
+    // eslint-disable-next-line @typescript-eslint/no-shadow
+    return function compareByValueSelectionToOrder(a, b) {
+        const selectedA = selector(a);
+        const selectedB = selector(b);
+        const indexA = indexMap.get(selectedA);
+        const indexB = indexMap.get(selectedB);
+        if (indexA == undefined || indexB == undefined) {
+            throw new Error('value not defined in order');
+        }
+        return compareByValue(indexA, indexB);
+    };
 }
-function compareByValue(a, b) {
-  if (a === b) {
-    return 0;
-  } else if (a > b) {
-    return 1;
-  } else if (b > a) {
-    return -1;
-  }
-  throw new Error("objects not comparable");
+export function compareByValue(a, b) {
+    if (a === b) {
+        return 0;
+    }
+    else if (a > b) {
+        return 1;
+    }
+    else if (b > a) {
+        return -1;
+    }
+    throw new Error('objects not comparable');
 }
-function compareByValueDescending(a, b) {
-  if (a === b) {
-    return 0;
-  } else if (a > b) {
-    return -1;
-  } else if (b > a) {
-    return 1;
-  }
-  throw new Error("objects not comparable");
+export function compareByValueDescending(a, b) {
+    if (a === b) {
+        return 0;
+    }
+    else if (a > b) {
+        return -1;
+    }
+    else if (b > a) {
+        return 1;
+    }
+    throw new Error('objects not comparable');
 }