@limitlesspc/std 0.21.0 → 0.22.0

package/package.json

@@ -1,109 +1,107 @@
 {
   "name": "@limitlesspc/std",
   "type": "module",
-  "version": "0.21.0",
+  "version": "0.22.0",
+  "packageManager": "pnpm@10.25.0",
   "description": "A standard library for JavaScript",
   "license": "MIT",
-  "publishConfig": {
-    "access": "public"
-  },
   "exports": {
     "./package.json": "./package.json",
     "./async": {
-      "default": "./dist/async/index.js",
-      "types": "./dist/async/index.d.ts"
+      "types": "./dist/async/index.d.ts",
+      "default": "./dist/async/index.js"
     },
     "./cmath": {
-      "default": "./dist/cmath/index.js",
-      "types": "./dist/cmath/index.d.ts"
+      "types": "./dist/cmath/index.d.ts",
+      "default": "./dist/cmath/index.js"
     },
     "./fn": {
-      "default": "./dist/fn/index.js",
-      "types": "./dist/fn/index.d.ts"
+      "types": "./dist/fn/index.d.ts",
+      "default": "./dist/fn/index.js"
     },
     "./gfx": {
-      "default": "./dist/gfx/index.js",
-      "types": "./dist/gfx/index.d.ts"
+      "types": "./dist/gfx/index.d.ts",
+      "default": "./dist/gfx/index.js"
     },
     "./iter": {
-      "default": "./dist/iter/index.js",
-      "types": "./dist/iter/index.d.ts"
+      "types": "./dist/iter/index.d.ts",
+      "default": "./dist/iter/index.js"
     },
     "./math": {
-      "default": "./dist/math/index.js",
-      "types": "./dist/math/index.d.ts"
+      "types": "./dist/math/index.d.ts",
+      "default": "./dist/math/index.js"
     },
     "./string": {
-      "default": "./dist/string/index.js",
-      "types": "./dist/string/index.d.ts"
+      "types": "./dist/string/index.d.ts",
+      "default": "./dist/string/index.js"
     },
     "./structs": {
-      "default": "./dist/structs/index.js",
-      "types": "./dist/structs/index.d.ts"
+      "types": "./dist/structs/index.d.ts",
+      "default": "./dist/structs/index.js"
     },
     "./time": {
-      "default": "./dist/time/index.js",
-      "types": "./dist/time/index.d.ts"
+      "types": "./dist/time/index.d.ts",
+      "default": "./dist/time/index.js"
     },
     "./array": {
-      "default": "./dist/array.js",
-      "types": "./dist/array.d.ts"
+      "types": "./dist/array.d.ts",
+      "default": "./dist/array.js"
     },
     "./bytes": {
-      "default": "./dist/bytes.js",
-      "types": "./dist/bytes.d.ts"
+      "types": "./dist/bytes.d.ts",
+      "default": "./dist/bytes.js"
     },
     "./cmp": {
-      "default": "./dist/cmp.js",
-      "types": "./dist/cmp.d.ts"
+      "types": "./dist/cmp.d.ts",
+      "default": "./dist/cmp.js"
     },
     "./csv": {
-      "default": "./dist/csv.js",
-      "types": "./dist/csv.d.ts"
-    },
-    "./easing": {
-      "default": "./dist/easing.js",
-      "types": "./dist/easing.d.ts"
+      "types": "./dist/csv.d.ts",
+      "default": "./dist/csv.js"
     },
     "./events": {
-      "default": "./dist/events.js",
-      "types": "./dist/events.d.ts"
+      "types": "./dist/events.d.ts",
+      "default": "./dist/events.js"
     },
     "./object": {
-      "default": "./dist/object.js",
-      "types": "./dist/object.d.ts"
+      "types": "./dist/object.d.ts",
+      "default": "./dist/object.js"
     },
     "./random": {
-      "default": "./dist/random.js",
-      "types": "./dist/random.d.ts"
+      "types": "./dist/random.d.ts",
+      "default": "./dist/random.js"
     },
     "./types": {
-      "default": "./dist/types.js",
-      "types": "./dist/types.d.ts"
+      "types": "./dist/types.d.ts",
+      "default": "./dist/types.js"
     }
   },
   "files": [
     "dist"
   ],
   "prettier": "@limitlesspc/prettier-config",
-  "devDependencies": {
-    "@limitlesspc/eslint-config": "^0.16.2",
-    "@limitlesspc/prettier-config": "^1.1.1",
-    "bumpp": "^9.8.1",
-    "tsup": "^8.3.5",
-    "typescript": "^5.7.2",
-    "vitest": "^2.1.6"
-  },
   "scripts": {
     "build": "tsup",
-    "test": "vitest",
     "fmt": "prettier . --write --cache --ignore-unknown",
     "fmt:check": "prettier . --check --cache --ignore-unknown",
     "lint": "eslint",
     "lint:fix": "eslint --fix",
     "lint:fix-dry": "eslint --fix-dry-run",
-    "check-exports": "attw --pack . --ignore-rules=cjs-resolves-to-esm",
+    "test": "vitest",
+    "coverage": "vitest run --coverage",
+    "prepack": "nr build",
     "release": "bumpp && pnpm publish",
     "typecheck": "tsc --noEmit"
+  },
+  "devDependencies": {
+    "@limitlesspc/eslint-config": "^0.18.4",
+    "@limitlesspc/prettier-config": "^1.2.1",
+    "@vitest/coverage-v8": "^4.0.16",
+    "bumpp": "^10.3.2",
+    "eslint": "^9.39.2",
+    "prettier": "^3.7.4",
+    "tsup": "^8.5.1",
+    "typescript": "^5.9.3",
+    "vitest": "^4.0.15"
   }
-}
+}

package/dist/chunk-DYKZK6B5.js

@@ -1,523 +0,0 @@
-import {
-  swap
-} from "./chunk-65SNM7MP.js";
-import {
-  ascend,
-  descend
-} from "./chunk-TMLWLR46.js";
-
-// src/structs/doubly-linked-list.ts
-var DoublyLinkedList = class _DoublyLinkedList {
-  head;
-  tail;
-  size = 0;
-  static from(values) {
-    const list = new _DoublyLinkedList();
-    for (const value of values) {
-      list.push(value);
-    }
-    return list;
-  }
-  get length() {
-    return this.size;
-  }
-  *[Symbol.iterator]() {
-    let current = this.head;
-    while (current) {
-      yield current.value;
-      current = current.next;
-    }
-  }
-  getNode(index) {
-    let current = this.head;
-    let i = 0;
-    while (current) {
-      if (i === index) {
-        return current;
-      }
-      current = current.next;
-      i++;
-    }
-    return void 0;
-  }
-  get(index) {
-    return this.getNode(index)?.value;
-  }
-  set(index, value) {
-    const node = this.getNode(index);
-    if (!node) {
-      return void 0;
-    }
-    const { value: oldValue } = node;
-    node.value = value;
-    return oldValue;
-  }
-  push(value) {
-    const node = { value };
-    if (this.tail) {
-      this.tail.next = node;
-      this.tail = node;
-    } else {
-      this.head = node;
-      this.tail = node;
-    }
-    return ++this.size;
-  }
-  pop() {
-    if (!this.tail) {
-      return void 0;
-    }
-    const { value } = this.tail;
-    this.tail = this.tail.prev;
-    if (!this.tail) {
-      this.head = void 0;
-    }
-    this.size--;
-    return value;
-  }
-  unshift(value) {
-    const node = { value };
-    if (this.head) {
-      this.head.prev = node;
-      this.head = node;
-    } else {
-      this.head = node;
-      this.tail = node;
-    }
-    return ++this.size;
-  }
-  shift() {
-    if (!this.head) {
-      return void 0;
-    }
-    const { value } = this.head;
-    this.head = this.head.next;
-    if (!this.head) {
-      this.tail = void 0;
-    }
-    this.size--;
-    return value;
-  }
-  reverse() {
-    let current = this.head;
-    let previous;
-    let next;
-    while (current) {
-      ({ next } = current);
-      current.next = previous;
-      current.prev = next;
-      previous = current;
-      current = next;
-    }
-    this.tail = this.head;
-    this.head = previous;
-    return this;
-  }
-  remove(index) {
-    const node = this.getNode(index);
-    if (!node) {
-      return void 0;
-    }
-    if (node.prev) {
-      node.prev.next = node.next;
-    }
-    if (node.next) {
-      node.next.prev = node.prev;
-    }
-    if (node === this.head) {
-      this.head = node.next;
-    }
-    if (node === this.tail) {
-      this.tail = node.prev;
-    }
-    this.size--;
-    return node.value;
-  }
-  splice(index, count, ...values) {
-    const removed = [];
-    for (let i = 0; i < count; i++) {
-      const value = this.remove(index);
-      if (value) {
-        removed.push(value);
-      }
-    }
-    for (const value of values) {
-      this.set(index, value);
-    }
-    return removed;
-  }
-};
-
-// src/structs/heaps/heap.ts
-var Heap = class _Heap {
-  constructor(compare, data = [], heapify = true) {
-    this.compare = compare;
-    if (heapify) {
-      this.data = [];
-      this.push(...data);
-    } else {
-      this.data = data;
-    }
-  }
-  data;
-  get length() {
-    return this.data.length;
-  }
-  get height() {
-    return Math.floor(Math.log2(this.length)) + 1;
-  }
-  valueOf() {
-    return this.peek();
-  }
-  copy() {
-    return new _Heap(this.compare, [...this.data], false);
-  }
-  /**
-   * Returns the first value in the heap
-   */
-  peek() {
-    return this.data[0];
-  }
-  /**
-   * Removes the first value from the heap and returns it
-   */
-  pop() {
-    const first = this.data[0];
-    swap(this.data, 0, this.length - 1);
-    this.data.pop();
-    this.heapify();
-    return first;
-  }
-  /**
-   * Inserts values into the heap and makes sure the first value is the min/max
-   * @param values
-   * @returns The new length of the heap
-   */
-  push(...values) {
-    const { data, compare } = this;
-    for (const value of values) {
-      data.push(value);
-      let i = data.length - 1;
-      let parent = Math.floor((i - 1) / 2);
-      while (i > 0 && compare(data[i], data[parent]) < 0) {
-        swap(data, i, parent);
-        i = parent;
-        parent = Math.floor((i - 1) / 2);
-      }
-    }
-    return data.length;
-  }
-  *drain() {
-    while (this.length) {
-      yield this.pop();
-    }
-  }
-  [Symbol.iterator]() {
-    return this.data.values();
-  }
-  heapify(i = 0) {
-    const { length, compare, data } = this;
-    const left = 2 * i + 1;
-    const right = 2 * i + 2;
-    let largest = i;
-    if (left < length && compare(data[left], data[largest]) < 0) {
-      largest = left;
-    }
-    if (right < length && compare(data[right], data[largest]) < 0) {
-      largest = right;
-    }
-    if (largest !== i) {
-      swap(data, i, largest);
-      this.heapify(largest);
-    }
-  }
-};
-
-// src/structs/heaps/max-heap.ts
-var MaxHeap = class _MaxHeap extends Heap {
-  constructor(data, heapify) {
-    super(descend, data, heapify);
-  }
-  copy() {
-    return new _MaxHeap([...this.data], false);
-  }
-};
-
-// src/structs/heaps/min-heap.ts
-var MinHeap = class _MinHeap extends Heap {
-  constructor(data, heapify) {
-    super(ascend, data, heapify);
-  }
-  copy() {
-    return new _MinHeap([...this.data], false);
-  }
-};
-
-// src/structs/linked-list.ts
-var LinkedList = class _LinkedList {
-  node;
-  static from(values) {
-    const list = new _LinkedList();
-    let node;
-    for (const value of values) {
-      const child = { value };
-      if (node) {
-        node.next = child;
-      }
-      node = child;
-    }
-    list.node = node;
-    return list;
-  }
-  get length() {
-    let { node } = this;
-    let length = 0;
-    while (node) {
-      length++;
-      node = node.next;
-    }
-    return length;
-  }
-  *[Symbol.iterator]() {
-    let { node } = this;
-    while (node) {
-      yield node.value;
-      node = node.next;
-    }
-  }
-  get tail() {
-    let { node } = this;
-    while (node) {
-      node = node.next;
-    }
-    return node;
-  }
-  getNode(index) {
-    let current = this.node;
-    let i = 0;
-    while (current) {
-      if (i === index) {
-        return current;
-      }
-      current = current.next;
-      i++;
-    }
-  }
-  get(index) {
-    return this.getNode(index)?.value;
-  }
-  set(index, value) {
-    const node = this.getNode(index);
-    if (!node) {
-      return;
-    }
-    const { value: oldValue } = node;
-    node.value = value;
-    return oldValue;
-  }
-  push(value) {
-    const { tail } = this;
-    const node = { value };
-    if (tail) {
-      tail.next = node;
-    } else {
-      this.node = node;
-    }
-  }
-  pop() {
-    let current = this.node;
-    let parent;
-    while (current) {
-      if (!current.next) {
-        delete parent?.next;
-        return current;
-      }
-      parent = current;
-      current = current.next;
-    }
-  }
-  unshift(value) {
-    const node = { value };
-    if (this.node) {
-      node.next = this.node;
-      this.node = node;
-    }
-    this.node = node;
-  }
-  shift() {
-    const { node } = this;
-    this.node = node?.next;
-    return node;
-  }
-};
-
-// src/structs/queue.ts
-var Queue = class {
-  constructor(items = []) {
-    this.items = items;
-  }
-  get size() {
-    return this.items.length;
-  }
-  enqueue(item) {
-    return this.items.push(item);
-  }
-  dequeue() {
-    return this.items.shift();
-  }
-  *[Symbol.iterator]() {
-    let item;
-    while (item = this.dequeue()) {
-      yield item;
-    }
-  }
-};
-
-// src/structs/sorted-array.ts
-var SortedArray = class _SortedArray {
-  constructor(data = [], compare = ascend, sort = true) {
-    this.data = data;
-    this.compare = compare;
-    if (sort) {
-      this.data.sort(compare);
-    }
-  }
-  valueOf() {
-    return this.at(0);
-  }
-  keys() {
-    return this.data.keys();
-  }
-  values() {
-    return this.data.values();
-  }
-  entries() {
-    return this.data.entries();
-  }
-  [Symbol.iterator]() {
-    return this.values();
-  }
-  length() {
-    return this.data.length;
-  }
-  at(index) {
-    return this.data[index];
-  }
-  copy() {
-    return new _SortedArray([...this.data], this.compare, false);
-  }
-  /**
-   * Returns the index of the value if it exists, otherwise -1
-   * @param value
-   */
-  indexOf(value) {
-    const { data } = this;
-    let low = 0;
-    let high = data.length - 1;
-    while (low <= high) {
-      const mid = Math.floor((low + high) / 2);
-      const cmp = this.compare(value, data[mid]);
-      if (cmp < 0) {
-        high = mid - 1;
-      } else if (cmp > 0) {
-        low = mid + 1;
-      } else {
-        return mid;
-      }
-    }
-    return -1;
-  }
-  /**
-   * Returns if the array has the value
-   * @param value
-   */
-  has(value) {
-    return this.data.includes(value);
-  }
-  /**
-   * Binary inserts a value into the array while maintaining sorted order
-   * @param value
-   * @returns the index of where the value was inserted
-   */
-  push(value) {
-    const { data, compare } = this;
-    let low = 0;
-    let high = data.length - 1;
-    while (low <= high) {
-      const mid = Math.floor((low + high) / 2);
-      const cmp = compare(value, data[mid]);
-      if (cmp < 0) {
-        high = mid - 1;
-      } else if (cmp > 0) {
-        low = mid + 1;
-      } else {
-        data.splice(mid, 0, value);
-        return mid;
-      }
-    }
-    data.splice(low, 0, value);
-    return low;
-  }
-};
-
-// src/structs/unordered-array.ts
-var UnorderedArray = class _UnorderedArray extends Array {
-  copy() {
-    return new _UnorderedArray(...this);
-  }
-  /**
-   * Inserts new elements at the end of an unordered array, and returns the new length of the unordered array.
-   * @param items Elements to insert at the end of the array.
-   */
-  unshift(...items) {
-    return super.push(...items);
-  }
-  /**
-   * Removes the last element from an array and returns it.
-   * If the array is empty, undefined is returned and the array is not modified.
-   */
-  shift() {
-    return super.pop();
-  }
-  /**
-   * Removes an item by index
-   * @param index the index of the item to remove
-   * @returns the removed item, if it exists
-   */
-  removeIndex(index) {
-    swap(this, index, this.length - 1);
-    return this.pop();
-  }
-  splice(start, deleteCount = this.length - start, ...items) {
-    const spliced = [];
-    for (let i = 0; i < deleteCount; i++) {
-      const replacement = items[i];
-      let removed;
-      if (replacement) {
-        removed = this[start + i];
-        this[start + i] = replacement;
-      } else {
-        removed = this.removeIndex(start);
-      }
-      if (removed) {
-        spliced.push(removed);
-      }
-    }
-    return spliced;
-  }
-  toSpliced(start, deleteCount = this.length - start, ...items) {
-    const copy = this.copy();
-    copy.splice(start, deleteCount, ...items);
-    return copy;
-  }
-};
-
-export {
-  DoublyLinkedList,
-  MaxHeap,
-  MinHeap,
-  LinkedList,
-  Queue,
-  SortedArray,
-  UnorderedArray
-};