✨ (datastructure) added queue (#7)

packages/datastructure/CHANGELOG.md

@@ -1,5 +1,11 @@
 # @ultify/datastructure
 
+## 0.2.0
+
+### Minor Changes
+
+- Added Queue
+
 ## 0.1.0
 
 ### Minor Changes

packages/datastructure/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@ultify/datastructure",
-  "version": "0.1.0",
+  "version": "0.2.0",
   "main": "./dist/index.cjs",
   "module": "./dist/index.js",
   "types": "./dist/index.d.ts",

packages/datastructure/src/index.ts

@@ -1 +1,2 @@
 export * from './stack';
+export * from './queue';

packages/datastructure/src/queue/index.ts

@@ -0,0 +1 @@
+export * from './queue';

packages/datastructure/src/queue/queue.ts

@@ -0,0 +1,65 @@
+/**
+ * @license MIT
+ * @copyright 2024 Thinh Trinh Duc <[email protected]>
+ *
+ * @class
+ */
+export class Queue<T> {
+  #array: T[] = [];
+
+  /**
+   * Create a new queue
+   */
+  constructor(...elements: T[]) {
+    this.#array = [...elements];
+  }
+
+  /**
+   * Creates a queue from the existing array
+   * @public
+   * @static
+   * @param {Array} [elements]
+   * @return {Stack}
+   */
+  static fromArray<T>(arr: T[]) {
+    return new Queue<T>(...arr);
+  }
+
+  /**
+   * Queue's size
+   * @readonly
+   */
+  get size() {
+    return this.#array.length;
+  }
+
+  /**
+   * Check if the queue is empty.
+   */
+  isEmpty() {
+    return this.#array.length === 0;
+  }
+
+  /**
+   * Enqueue new elements, and returns the new size of the queue.
+   */
+  enqueue(...value: T[]) {
+    return this.#array.push(...value);
+  }
+
+  /**
+   *
+   * Removes the frist element from a queue and returns it.
+   * If the queue is empty, undefined is returned and the queue is not modified.
+   */
+  dequeue() {
+    return this.#array.shift();
+  }
+
+  /**
+   * Clear queue
+   */
+  clear() {
+    this.#array = [];
+  }
+}