data-structure-typed 1.12.10 → 1.12.21

package/dist/data-structures/graph/undirected-graph.js

@@ -53,13 +53,21 @@ var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.UndirectedGraph = exports.UndirectedEdge = exports.UndirectedVertex = void 0;
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 var utils_1 = require("../../utils");
 var abstract_graph_1 = require("./abstract-graph");
 var UndirectedVertex = /** @class */ (function (_super) {
     __extends(UndirectedVertex, _super);
+    /**
+     * The constructor function initializes an object with a given id.
+     * @param {VertexId} id - The `id` parameter is the identifier for the vertex. It is used to uniquely identify the
+     * vertex within a graph or network.
+     */
     function UndirectedVertex(id) {
         return _super.call(this, id) || this;
     }
@@ -68,6 +76,14 @@ var UndirectedVertex = /** @class */ (function (_super) {
 exports.UndirectedVertex = UndirectedVertex;
 var UndirectedEdge = /** @class */ (function (_super) {
     __extends(UndirectedEdge, _super);
+    /**
+     * The constructor function initializes an instance of a class with two vertex IDs and an optional weight.
+     * @param {VertexId} v1 - The parameter `v1` is of type `VertexId` and represents the first vertex in the edge.
+     * @param {VertexId} v2 - The parameter `v2` is a `VertexId`, which represents the identifier of the second vertex in a
+     * graph.
+     * @param {number} [weight] - The `weight` parameter is an optional number that represents the weight of the edge
+     * between two vertices.
+     */
     function UndirectedEdge(v1, v2, weight) {
         var _this = _super.call(this, weight) || this;
         _this._vertices = [v1, v2];

package/dist/data-structures/hash/coordinate-map.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 export declare class CoordinateMap<V> extends Map<any, V> {
     private readonly _joint;

package/dist/data-structures/hash/coordinate-map.js

@@ -17,8 +17,11 @@ var __extends = (this && this.__extends) || (function () {
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.CoordinateMap = void 0;
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 var CoordinateMap = /** @class */ (function (_super) {
     __extends(CoordinateMap, _super);

package/dist/data-structures/hash/coordinate-set.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 export declare class CoordinateSet extends Set {
     private readonly _joint;

package/dist/data-structures/hash/coordinate-set.js

@@ -17,8 +17,11 @@ var __extends = (this && this.__extends) || (function () {
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.CoordinateSet = void 0;
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 var CoordinateSet = /** @class */ (function (_super) {
     __extends(CoordinateSet, _super);

package/dist/data-structures/heap/heap.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 import { PriorityQueue } from '../priority-queue';
 import type { HeapItem, HeapOptions } from '../types';
@@ -34,16 +37,16 @@ export declare abstract class Heap<T> {
      */
     peekLast(): HeapItem<T> | null;
     /**
-     * The `offer` function adds an element to a priority queue with an optional priority value.
+     * The `add` function adds an element to a priority queue with an optional priority value.
      * @param {T} element - The `element` parameter represents the value that you want to add to the heap. It can be of any
      * type.
      * @param {number} [priority] - The `priority` parameter is an optional number that represents the priority of the
-     * element being offered to the heap. If the `element` parameter is a number, then the `priority` parameter is set to
+     * element being added to the heap. If the `element` parameter is a number, then the `priority` parameter is set to
      * the value of `element`. If the `element` parameter is not a number, then the
-     * @returns The `offer` method returns the instance of the `Heap` class.
+     * @returns The `add` method returns the instance of the `Heap` class.
      * @throws {Error} if priority is not a valid number
      */
-    offer(element: T, priority?: number): Heap<T>;
+    add(element: T, priority?: number): Heap<T>;
     /**
      * The `poll` function returns the top item from a priority queue or null if the queue is empty.Removes and returns an element with the highest priority in the queue
      * @returns either a HeapItem<T> object or null.

package/dist/data-structures/heap/heap.js

@@ -52,33 +52,33 @@ var Heap = /** @class */ (function () {
         return this._pq.leaf();
     };
     /**
-     * The `offer` function adds an element to a priority queue with an optional priority value.
+     * The `add` function adds an element to a priority queue with an optional priority value.
      * @param {T} element - The `element` parameter represents the value that you want to add to the heap. It can be of any
      * type.
      * @param {number} [priority] - The `priority` parameter is an optional number that represents the priority of the
-     * element being offered to the heap. If the `element` parameter is a number, then the `priority` parameter is set to
+     * element being added to the heap. If the `element` parameter is a number, then the `priority` parameter is set to
      * the value of `element`. If the `element` parameter is not a number, then the
-     * @returns The `offer` method returns the instance of the `Heap` class.
+     * @returns The `add` method returns the instance of the `Heap` class.
      * @throws {Error} if priority is not a valid number
      */
-    Heap.prototype.offer = function (element, priority) {
+    Heap.prototype.add = function (element, priority) {
         if (typeof element === 'number') {
             priority = element;
         }
         else {
             if (priority === undefined) {
-                throw new Error('.offer expects a numeric priority');
+                throw new Error('.add expects a numeric priority');
             }
         }
         if (priority && Number.isNaN(+priority)) {
-            throw new Error('.offer expects a numeric priority');
+            throw new Error('.add expects a numeric priority');
         }
         if (Number.isNaN(+priority) && Number.isNaN(this._priorityCb(element))) {
-            throw new Error('.offer expects a numeric priority '
+            throw new Error('.add expects a numeric priority '
                 + 'or a constructor callback that returns a number');
         }
         var _priority = !Number.isNaN(+priority) ? priority : this._priorityCb(element);
-        this._pq.offer({ priority: _priority, element: element });
+        this._pq.add({ priority: _priority, element: element });
         return this;
     };
     /**

package/dist/data-structures/heap/max-heap.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 import { Heap } from './heap';
 import { PriorityQueue } from '../priority-queue';

package/dist/data-structures/heap/max-heap.js

@@ -1,7 +1,10 @@
 "use strict";
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 var __extends = (this && this.__extends) || (function () {
     var extendStatics = function (d, b) {

package/dist/data-structures/heap/min-heap.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 import { Heap } from './heap';
 import { PriorityQueue } from '../priority-queue';

package/dist/data-structures/heap/min-heap.js

@@ -1,7 +1,10 @@
 "use strict";
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 var __extends = (this && this.__extends) || (function () {
     var extendStatics = function (d, b) {

package/dist/data-structures/index.d.ts

@@ -8,3 +8,4 @@ export * from './heap';
 export * from './priority-queue';
 export * from './matrix';
 export * from './trie';
+export * from './types';

package/dist/data-structures/index.js

@@ -24,3 +24,4 @@ __exportStar(require("./heap"), exports);
 __exportStar(require("./priority-queue"), exports);
 __exportStar(require("./matrix"), exports);
 __exportStar(require("./trie"), exports);
+__exportStar(require("./types"), exports);

package/dist/data-structures/linked-list/doubly-linked-list.d.ts

@@ -16,14 +16,14 @@ export declare class DoublyLinkedList<T> {
      * the doubly linked list.
      * @returns A boolean value is being returned.
      */
-    offerFirst(val: T): boolean;
+    addFirst(val: T): boolean;
     /**
      * The function adds a new node with a given value to the end of a doubly linked list.
      * @param {T} val - The `val` parameter represents the value of the element that you want to add to the end of the
      * doubly linked list.
      * @returns a boolean value, which is always true.
      */
-    offerLast(val: T): boolean;
+    addLast(val: T): boolean;
     peekFirst(): T | null;
     peekFirst(by: 'val'): T | null;
     peekFirst(by: 'node'): DoublyLinkedListNode<T> | null;

package/dist/data-structures/linked-list/doubly-linked-list.js

@@ -33,7 +33,7 @@ var DoublyLinkedList = /** @class */ (function () {
      * the doubly linked list.
      * @returns A boolean value is being returned.
      */
-    DoublyLinkedList.prototype.offerFirst = function (val) {
+    DoublyLinkedList.prototype.addFirst = function (val) {
         var newNode = new DoublyLinkedListNode(val);
         if (this._size === 0) {
             this._first = newNode;
@@ -54,7 +54,7 @@ var DoublyLinkedList = /** @class */ (function () {
      * doubly linked list.
      * @returns a boolean value, which is always true.
      */
-    DoublyLinkedList.prototype.offerLast = function (val) {
+    DoublyLinkedList.prototype.addLast = function (val) {
         var newNode = new DoublyLinkedListNode(val);
         if (this._size === 0) {
             this._first = newNode;
@@ -247,9 +247,9 @@ var DoublyLinkedList = /** @class */ (function () {
         if (index < 0 || index > this._size)
             return false;
         if (index === 0)
-            return !!this.offerFirst(val);
+            return !!this.addFirst(val);
         if (index === this._size)
-            return !!this.offerLast(val);
+            return !!this.addLast(val);
         var newNode = new DoublyLinkedListNode(val);
         var prevNode = this.get(index - 1, 'node');
         var nextNode = prevNode === null || prevNode === void 0 ? void 0 : prevNode.next;

package/dist/data-structures/linked-list/singly-linked-list.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 /**
  * The class which represents one link or node in a linked list

package/dist/data-structures/linked-list/singly-linked-list.js

@@ -1,7 +1,10 @@
 "use strict";
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 var __generator = (this && this.__generator) || function (thisArg, body) {
     var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;

package/dist/data-structures/matrix/matrix.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 export declare class MatrixNTI2D<T = number> {
     private readonly _matrix;

package/dist/data-structures/matrix/matrix.js

@@ -2,8 +2,11 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.MatrixNTI2D = void 0;
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 // todo need to be improved
 var MatrixNTI2D = /** @class */ (function () {

package/dist/data-structures/matrix/matrix2d.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 import Vector2D from './vector2d';
 export declare class Matrix2D {

package/dist/data-structures/matrix/matrix2d.js

@@ -5,8 +5,11 @@ var __importDefault = (this && this.__importDefault) || function (mod) {
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Matrix2D = void 0;
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 var vector2d_1 = __importDefault(require("./vector2d"));
 var Matrix2D = /** @class */ (function () {

package/dist/data-structures/matrix/navigator.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 import type { Direction, NavigatorParams, Turning } from '../types';
 export declare class Character {

package/dist/data-structures/matrix/vector2d.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 export declare class Vector2D {
     x: number;

package/dist/data-structures/matrix/vector2d.js

@@ -2,8 +2,11 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Vector2D = void 0;
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 var Vector2D = /** @class */ (function () {
     function Vector2D(x, y, w // needed for matrix multiplication

package/dist/data-structures/priority-queue/max-priority-queue.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 import { PriorityQueue } from './priority-queue';
 import type { PriorityQueueOptions } from '../types';

package/dist/data-structures/priority-queue/max-priority-queue.js

@@ -17,8 +17,11 @@ var __extends = (this && this.__extends) || (function () {
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.MaxPriorityQueue = void 0;
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 var priority_queue_1 = require("./priority-queue");
 var MaxPriorityQueue = /** @class */ (function (_super) {

package/dist/data-structures/priority-queue/min-priority-queue.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 import { PriorityQueue } from './priority-queue';
 import type { PriorityQueueOptions } from '../types';

package/dist/data-structures/priority-queue/min-priority-queue.js

@@ -17,8 +17,11 @@ var __extends = (this && this.__extends) || (function () {
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.MinPriorityQueue = void 0;
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 var priority_queue_1 = require("./priority-queue");
 var MinPriorityQueue = /** @class */ (function (_super) {

package/dist/data-structures/priority-queue/priority-queue.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 import type { PriorityQueueComparator, PriorityQueueDFSOrderPattern, PriorityQueueOptions } from '../types';
 export declare class PriorityQueue<T = number> {
@@ -29,11 +32,11 @@ export declare class PriorityQueue<T = number> {
      */
     static isPriorityQueueified<T>(options: Omit<PriorityQueueOptions<T>, 'isFix'>): boolean;
     /**
-     * The "offer" function adds a node to the heap and ensures that the heap property is maintained.
+     * The "add" function adds a node to the heap and ensures that the heap property is maintained.
      * @param {T} node - The parameter "node" is of type T, which means it can be any data type. It represents the node
      * that needs to be added to the heap.
      */
-    offer(node: T): void;
+    add(node: T): void;
     /**
      * The `peek` function returns the first element of the `nodes` array if it exists, otherwise it returns `null`.
      * @returns The `peek()` function is returning the first element (`T`) of the `nodes` array if the `size` is not zero.

package/dist/data-structures/priority-queue/priority-queue.js

@@ -87,11 +87,11 @@ var PriorityQueue = /** @class */ (function () {
         return new PriorityQueue(__assign(__assign({}, options), { isFix: true })).isValid();
     };
     /**
-     * The "offer" function adds a node to the heap and ensures that the heap property is maintained.
+     * The "add" function adds a node to the heap and ensures that the heap property is maintained.
      * @param {T} node - The parameter "node" is of type T, which means it can be any data type. It represents the node
      * that needs to be added to the heap.
      */
-    PriorityQueue.prototype.offer = function (node) {
+    PriorityQueue.prototype.add = function (node) {
         this.nodes.push(node);
         this._heapifyUp(this.size - 1);
     };

package/dist/data-structures/queue/deque.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 import { DoublyLinkedList } from '../linked-list';
 export declare class Deque<T> extends DoublyLinkedList<T> {
@@ -15,8 +18,8 @@ export declare class ObjectDeque<T> {
     protected _size: number;
     constructor(capacity?: number);
     size(): number;
-    offerFirst(value: T): void;
-    offerLast(value: T): void;
+    addFirst(value: T): void;
+    addLast(value: T): void;
     pollFirst(): T | undefined;
     peekFirst(): T | undefined;
     pollLast(): T | undefined;
@@ -28,11 +31,11 @@ export declare class ArrayDeque<T> {
     protected _nodes: T[];
     get size(): number;
     /**
-     * The function "offerLast" adds a value to the end of an array.
+     * The function "addLast" adds a value to the end of an array.
      * @param {T} value - The value parameter represents the value that you want to add to the end of the array.
      * @returns The return value is the new length of the array after the value has been added.
      */
-    offerLast(value: T): number;
+    addLast(value: T): number;
     /**
      * The function "pollLast" returns and removes the last element from an array, or returns null if the array is empty.
      * @returns The method `pollLast()` returns the last element of the `_nodes` array, or `null` if the array is empty.
@@ -45,12 +48,12 @@ export declare class ArrayDeque<T> {
      */
     pollFirst(): T | null;
     /**
-     * The function "offerFirst" adds a value to the beginning of an array.
+     * The function "addFirst" adds a value to the beginning of an array.
      * @param {T} value - The value parameter represents the value that you want to add to the beginning of the array.
-     * @returns The return value of the `offerFirst` function is the new length of the array `_nodes` after adding the
+     * @returns The return value of the `addFirst` function is the new length of the array `_nodes` after adding the
      * `value` at the beginning.
      */
-    offerFirst(value: T): number;
+    addFirst(value: T): number;
     /**
      * The `peekFirst` function returns the first element of an array or null if the array is empty.
      * @returns The function `peekFirst()` is returning the first element (`T`) of the `_nodes` array. If the array is

package/dist/data-structures/queue/deque.js

@@ -17,8 +17,11 @@ var __extends = (this && this.__extends) || (function () {
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.ArrayDeque = exports.ObjectDeque = exports.Deque = void 0;
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 var linked_list_1 = require("../linked-list");
 // O(n) time complexity of obtaining the value
@@ -47,7 +50,7 @@ var ObjectDeque = /** @class */ (function () {
     ObjectDeque.prototype.size = function () {
         return this._size;
     };
-    ObjectDeque.prototype.offerFirst = function (value) {
+    ObjectDeque.prototype.addFirst = function (value) {
         if (this._size === 0) {
             var mid = Math.floor(this._capacity / 2);
             this._first = mid;
@@ -59,7 +62,7 @@ var ObjectDeque = /** @class */ (function () {
         this._nodes[this._first] = value;
         this._size++;
     };
-    ObjectDeque.prototype.offerLast = function (value) {
+    ObjectDeque.prototype.addLast = function (value) {
         if (this._size === 0) {
             var mid = Math.floor(this._capacity / 2);
             this._first = mid;
@@ -120,11 +123,11 @@ var ArrayDeque = /** @class */ (function () {
         configurable: true
     });
     /**
-     * The function "offerLast" adds a value to the end of an array.
+     * The function "addLast" adds a value to the end of an array.
      * @param {T} value - The value parameter represents the value that you want to add to the end of the array.
      * @returns The return value is the new length of the array after the value has been added.
      */
-    ArrayDeque.prototype.offerLast = function (value) {
+    ArrayDeque.prototype.addLast = function (value) {
         return this._nodes.push(value);
     };
     /**
@@ -145,12 +148,12 @@ var ArrayDeque = /** @class */ (function () {
         return (_a = this._nodes.shift()) !== null && _a !== void 0 ? _a : null;
     };
     /**
-     * The function "offerFirst" adds a value to the beginning of an array.
+     * The function "addFirst" adds a value to the beginning of an array.
      * @param {T} value - The value parameter represents the value that you want to add to the beginning of the array.
-     * @returns The return value of the `offerFirst` function is the new length of the array `_nodes` after adding the
+     * @returns The return value of the `addFirst` function is the new length of the array `_nodes` after adding the
      * `value` at the beginning.
      */
-    ArrayDeque.prototype.offerFirst = function (value) {
+    ArrayDeque.prototype.addFirst = function (value) {
         return this._nodes.unshift(value);
     };
     /**

package/dist/data-structures/queue/queue.d.ts

@@ -1,6 +1,6 @@
 /**
  * @license MIT
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
+ * @copyright Tyler Zeng <zrwusa@gmail.com>
  * @class
  */
 export declare class Queue<T> {
@@ -23,11 +23,11 @@ export declare class Queue<T> {
      */
     static fromArray<T>(elements: T[]): Queue<T>;
     /**
-     * The offer function adds an element to the end of the queue and returns the updated queue.Adds an element at the back of the queue.
+     * The add function adds an element to the end of the queue and returns the updated queue.Adds an element at the back of the queue.
      * @param {T} element - The `element` parameter represents the element that you want to add to the queue.
-     * @returns The `offer` method is returning a `Queue<T>` object.
+     * @returns The `add` method is returning a `Queue<T>` object.
      */
-    offer(element: T): Queue<T>;
+    add(element: T): Queue<T>;
     /**
      * The `poll` function removes and returns the first element in the queue, and adjusts the internal data structure if
      * necessary to optimize performance.