@depthbomb/common 1.0.0 → 1.1.0

package/dist/queue.cjs

@@ -1 +1 @@
-const e=require(`./queue-QKkKGMY-.cjs`);exports.Queue=e.t;
+function e(t){"@babel/helpers - typeof";return e=typeof Symbol==`function`&&typeof Symbol.iterator==`symbol`?function(e){return typeof e}:function(e){return e&&typeof Symbol==`function`&&e.constructor===Symbol&&e!==Symbol.prototype?`symbol`:typeof e},e(t)}function t(t,n){if(e(t)!=`object`||!t)return t;var r=t[Symbol.toPrimitive];if(r!==void 0){var i=r.call(t,n||`default`);if(e(i)!=`object`)return i;throw TypeError(`@@toPrimitive must return a primitive value.`)}return(n===`string`?String:Number)(t)}function n(n){var r=t(n,`string`);return e(r)==`symbol`?r:r+``}function r(e,t,r){return(t=n(t))in e?Object.defineProperty(e,t,{value:r,enumerable:!0,configurable:!0,writable:!0}):e[t]=r,e}let i;i=Symbol.iterator;var a=class{constructor(e){r(this,`items`,[]),e&&(this.items=[...e])}get size(){return this.items.length}get isEmpty(){return this.items.length===0}enqueue(e){this.items.push(e)}dequeue(){return this.items.shift()}peek(){return this.items[0]}clear(){this.items=[]}[i](){return this.items[Symbol.iterator]()}toArray(){return[...this.items]}};exports.Queue=a;

package/dist/queue.d.cts

@@ -3,46 +3,46 @@ declare class Queue<T> {
   private items;
   constructor(initial?: Iterable<T>);
   /**
-       * Get the number of items in the queue.
-       */
+   * Get the number of items in the queue.
+   */
   get size(): number;
   /**
-       * Check if the queue is empty.
-       */
+   * Check if the queue is empty.
+   */
   get isEmpty(): boolean;
   /**
-       * Add an item to the end of the queue.
-       *
-       * @param item Item to add to the end of the queue
-       */
+   * Add an item to the end of the queue.
+   *
+   * @param item Item to add to the end of the queue
+   */
   enqueue(item: T): void;
   /**
-       * Remove and return the item at the front of the queue.
-       *
-       * @returns The item at the front of the queue, or undefined if the queue is empty
-       */
+   * Remove and return the item at the front of the queue.
+   *
+   * @returns The item at the front of the queue, or undefined if the queue is empty
+   */
   dequeue(): T | undefined;
   /**
-       * Return the item at the front of the queue without removing it.
-       *
-       * @returns The item at the front of the queue without removing it, or undefined if the queue is empty
-       */
+   * Return the item at the front of the queue without removing it.
+   *
+   * @returns The item at the front of the queue without removing it, or undefined if the queue is empty
+   */
   peek(): T | undefined;
   /**
-       * Clear all items from the queue.
-       */
+   * Clear all items from the queue.
+   */
   clear(): void;
   /**
-       * Get an iterator for the items in the queue.
-       *
-       * @returns An iterator for the items in the queue
-       */
+   * Get an iterator for the items in the queue.
+   *
+   * @returns An iterator for the items in the queue
+   */
   [Symbol.iterator](): Iterator<T>;
   /**
-       * Convert the queue to an array.
-       *
-       * @returns An array containing all items in the queue in order
-       */
+   * Convert the queue to an array.
+   *
+   * @returns An array containing all items in the queue in order
+   */
   toArray(): T[];
 }
 //#endregion

package/dist/queue.d.mts

@@ -3,46 +3,46 @@ declare class Queue<T> {
   private items;
   constructor(initial?: Iterable<T>);
   /**
-       * Get the number of items in the queue.
-       */
+   * Get the number of items in the queue.
+   */
   get size(): number;
   /**
-       * Check if the queue is empty.
-       */
+   * Check if the queue is empty.
+   */
   get isEmpty(): boolean;
   /**
-       * Add an item to the end of the queue.
-       *
-       * @param item Item to add to the end of the queue
-       */
+   * Add an item to the end of the queue.
+   *
+   * @param item Item to add to the end of the queue
+   */
   enqueue(item: T): void;
   /**
-       * Remove and return the item at the front of the queue.
-       *
-       * @returns The item at the front of the queue, or undefined if the queue is empty
-       */
+   * Remove and return the item at the front of the queue.
+   *
+   * @returns The item at the front of the queue, or undefined if the queue is empty
+   */
   dequeue(): T | undefined;
   /**
-       * Return the item at the front of the queue without removing it.
-       *
-       * @returns The item at the front of the queue without removing it, or undefined if the queue is empty
-       */
+   * Return the item at the front of the queue without removing it.
+   *
+   * @returns The item at the front of the queue without removing it, or undefined if the queue is empty
+   */
   peek(): T | undefined;
   /**
-       * Clear all items from the queue.
-       */
+   * Clear all items from the queue.
+   */
   clear(): void;
   /**
-       * Get an iterator for the items in the queue.
-       *
-       * @returns An iterator for the items in the queue
-       */
+   * Get an iterator for the items in the queue.
+   *
+   * @returns An iterator for the items in the queue
+   */
   [Symbol.iterator](): Iterator<T>;
   /**
-       * Convert the queue to an array.
-       *
-       * @returns An array containing all items in the queue in order
-       */
+   * Convert the queue to an array.
+   *
+   * @returns An array containing all items in the queue in order
+   */
   toArray(): T[];
 }
 //#endregion

package/dist/queue.mjs

@@ -1 +1 @@
-import{t as e}from"./queue-CX1hK7A0.mjs";export{e as Queue};
+function e(t){"@babel/helpers - typeof";return e=typeof Symbol==`function`&&typeof Symbol.iterator==`symbol`?function(e){return typeof e}:function(e){return e&&typeof Symbol==`function`&&e.constructor===Symbol&&e!==Symbol.prototype?`symbol`:typeof e},e(t)}function t(t,n){if(e(t)!=`object`||!t)return t;var r=t[Symbol.toPrimitive];if(r!==void 0){var i=r.call(t,n||`default`);if(e(i)!=`object`)return i;throw TypeError(`@@toPrimitive must return a primitive value.`)}return(n===`string`?String:Number)(t)}function n(n){var r=t(n,`string`);return e(r)==`symbol`?r:r+``}function r(e,t,r){return(t=n(t))in e?Object.defineProperty(e,t,{value:r,enumerable:!0,configurable:!0,writable:!0}):e[t]=r,e}let i;i=Symbol.iterator;var a=class{constructor(e){r(this,`items`,[]),e&&(this.items=[...e])}get size(){return this.items.length}get isEmpty(){return this.items.length===0}enqueue(e){this.items.push(e)}dequeue(){return this.items.shift()}peek(){return this.items[0]}clear(){this.items=[]}[i](){return this.items[Symbol.iterator]()}toArray(){return[...this.items]}};export{a as Queue};

package/package.json

@@ -1,6 +1,6 @@
 {
 	"name": "@depthbomb/common",
-	"version": "1.0.0",
+	"version": "1.1.0",
 	"description": "A set of common utilities for TypeScript/JavaScript",
 	"license": "MIT",
 	"engines": {
@@ -11,10 +11,6 @@
 		"utilities"
 	],
 	"exports": {
-		".": {
-			"require": "./dist/index.cjs",
-			"import": "./dist/index.mjs"
-		},
 		"./async": {
 			"require": "./dist/async.cjs",
 			"import": "./dist/async.mjs"
@@ -65,12 +61,12 @@
 	},
 	"devDependencies": {
 		"@types/eslint": "^9.6.1",
-		"@types/node": "^22.19.7",
-		"@typescript-eslint/eslint-plugin": "^8.53.0",
-		"@typescript-eslint/parser": "^8.53.0",
+		"@types/node": "^24.10.9",
+		"@typescript-eslint/eslint-plugin": "^8.54.0",
+		"@typescript-eslint/parser": "^8.54.0",
 		"eslint": "^9.39.2",
-		"release-it": "^19.2.3",
-		"tsdown": "^0.20.0-beta.3",
+		"release-it": "^19.2.4",
+		"tsdown": "^0.20.1",
 		"typescript": "^5.9.3"
 	},
 	"packageManager": "yarn@4.12.0"

package/dist/index.cjs

@@ -1 +0,0 @@
-const e=require(`./async.cjs`),t=require(`./decorators.cjs`),n=require(`./fn.cjs`),r=require(`./lazy.cjs`),i=require(`./queue-QKkKGMY-.cjs`),a=require(`./types.cjs`);exports.Queue=i.t,exports.allSettledSuccessful=e.allSettledSuccessful,exports.assume=a.assume,exports.cache=t.cache,exports.cast=a.cast,exports.lazy=r.lazy,exports.lazyAsync=r.lazyAsync,exports.once=n.once,exports.pollUntil=e.pollUntil,exports.rejectionTimeout=e.rejectionTimeout,exports.resettableLazy=r.resettableLazy,exports.sequential=e.sequential,exports.timeout=e.timeout,exports.typedEntries=a.typedEntries,exports.withTimeout=e.withTimeout;

package/dist/index.d.cts

@@ -1,7 +0,0 @@
-import { allSettledSuccessful, pollUntil, rejectionTimeout, sequential, timeout, withTimeout } from "./async.cjs";
-import { cache } from "./decorators.cjs";
-import { once } from "./fn.cjs";
-import { lazy, lazyAsync, resettableLazy } from "./lazy.cjs";
-import { Queue } from "./queue.cjs";
-import { Awaitable, Maybe, Nullable, assume, cast, typedEntries } from "./types.cjs";
-export { Awaitable, Maybe, Nullable, Queue, allSettledSuccessful, assume, cache, cast, lazy, lazyAsync, once, pollUntil, rejectionTimeout, resettableLazy, sequential, timeout, typedEntries, withTimeout };

package/dist/index.d.mts

@@ -1,7 +0,0 @@
-import { allSettledSuccessful, pollUntil, rejectionTimeout, sequential, timeout, withTimeout } from "./async.mjs";
-import { cache } from "./decorators.mjs";
-import { once } from "./fn.mjs";
-import { lazy, lazyAsync, resettableLazy } from "./lazy.mjs";
-import { Queue } from "./queue.mjs";
-import { Awaitable, Maybe, Nullable, assume, cast, typedEntries } from "./types.mjs";
-export { Awaitable, Maybe, Nullable, Queue, allSettledSuccessful, assume, cache, cast, lazy, lazyAsync, once, pollUntil, rejectionTimeout, resettableLazy, sequential, timeout, typedEntries, withTimeout };

package/dist/index.mjs

@@ -1 +0,0 @@
-import{allSettledSuccessful as e,pollUntil as t,rejectionTimeout as n,sequential as r,timeout as i,withTimeout as a}from"./async.mjs";import{cache as o}from"./decorators.mjs";import{once as s}from"./fn.mjs";import{lazy as c,lazyAsync as l,resettableLazy as u}from"./lazy.mjs";import{t as d}from"./queue-CX1hK7A0.mjs";import{assume as f,cast as p,typedEntries as m}from"./types.mjs";export{d as Queue,e as allSettledSuccessful,f as assume,o as cache,p as cast,c as lazy,l as lazyAsync,s as once,t as pollUntil,n as rejectionTimeout,u as resettableLazy,r as sequential,i as timeout,m as typedEntries,a as withTimeout};

package/dist/queue-CX1hK7A0.mjs

@@ -1 +0,0 @@
-function e(t){"@babel/helpers - typeof";return e=typeof Symbol==`function`&&typeof Symbol.iterator==`symbol`?function(e){return typeof e}:function(e){return e&&typeof Symbol==`function`&&e.constructor===Symbol&&e!==Symbol.prototype?`symbol`:typeof e},e(t)}function t(t,n){if(e(t)!=`object`||!t)return t;var r=t[Symbol.toPrimitive];if(r!==void 0){var i=r.call(t,n||`default`);if(e(i)!=`object`)return i;throw TypeError(`@@toPrimitive must return a primitive value.`)}return(n===`string`?String:Number)(t)}function n(n){var r=t(n,`string`);return e(r)==`symbol`?r:r+``}function r(e,t,r){return(t=n(t))in e?Object.defineProperty(e,t,{value:r,enumerable:!0,configurable:!0,writable:!0}):e[t]=r,e}let i;i=Symbol.iterator;var a=class{constructor(e){r(this,`items`,[]),e&&(this.items=[...e])}get size(){return this.items.length}get isEmpty(){return this.items.length===0}enqueue(e){this.items.push(e)}dequeue(){return this.items.shift()}peek(){return this.items[0]}clear(){this.items=[]}[i](){return this.items[Symbol.iterator]()}toArray(){return[...this.items]}};export{a as t};

package/dist/queue-QKkKGMY-.cjs

@@ -1 +0,0 @@
-function e(t){"@babel/helpers - typeof";return e=typeof Symbol==`function`&&typeof Symbol.iterator==`symbol`?function(e){return typeof e}:function(e){return e&&typeof Symbol==`function`&&e.constructor===Symbol&&e!==Symbol.prototype?`symbol`:typeof e},e(t)}function t(t,n){if(e(t)!=`object`||!t)return t;var r=t[Symbol.toPrimitive];if(r!==void 0){var i=r.call(t,n||`default`);if(e(i)!=`object`)return i;throw TypeError(`@@toPrimitive must return a primitive value.`)}return(n===`string`?String:Number)(t)}function n(n){var r=t(n,`string`);return e(r)==`symbol`?r:r+``}function r(e,t,r){return(t=n(t))in e?Object.defineProperty(e,t,{value:r,enumerable:!0,configurable:!0,writable:!0}):e[t]=r,e}let i;i=Symbol.iterator;var a=class{constructor(e){r(this,`items`,[]),e&&(this.items=[...e])}get size(){return this.items.length}get isEmpty(){return this.items.length===0}enqueue(e){this.items.push(e)}dequeue(){return this.items.shift()}peek(){return this.items[0]}clear(){this.items=[]}[i](){return this.items[Symbol.iterator]()}toArray(){return[...this.items]}};Object.defineProperty(exports,`t`,{enumerable:!0,get:function(){return a}});