data-structure-typed 1.40.0-rc → 1.41.0

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

@@ -1,165 +0,0 @@
-/**
- * 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<E = any> extends DoublyLinkedList<E> {
-}
-export declare class ObjectDeque<E = number> {
-    constructor(capacity?: number);
-    private _nodes;
-    get nodes(): {
-        [p: number]: E;
-    };
-    private _capacity;
-    get capacity(): number;
-    set capacity(value: number);
-    private _first;
-    get first(): number;
-    set first(value: number);
-    private _last;
-    get last(): number;
-    set last(value: number);
-    private _size;
-    get size(): number;
-    /**
-     * The "addFirst" function adds a value to the beginning of an array-like data structure.
-     * @param {E} value - The `value` parameter represents the value that you want to add to the beginning of the data
-     * structure.
-     */
-    addFirst(value: E): void;
-    /**
-     * The addLast function adds a value to the end of an array-like data structure.
-     * @param {E} value - The `value` parameter represents the value that you want to add to the end of the data structure.
-     */
-    addLast(value: E): void;
-    /**
-     * The function `pollFirst()` removes and returns the first element in a data structure.
-     * @returns The value of the first element in the data structure.
-     */
-    pollFirst(): E | undefined;
-    /**
-     * The `peekFirst` function returns the first element in an array-like data structure if it exists.
-     * @returns The element at the first position of the `_nodes` array.
-     */
-    peekFirst(): E | undefined;
-    /**
-     * The `pollLast()` function removes and returns the last element in a data structure.
-     * @returns The value that was removed from the data structure.
-     */
-    pollLast(): E | undefined;
-    /**
-     * The `peekLast()` function returns the last element in an array-like data structure.
-     * @returns The last element in the array "_nodes" is being returned.
-     */
-    peekLast(): E | undefined;
-    /**
-     * The get function returns the element at the specified index in an array-like data structure.
-     * @param {number} index - The index parameter is a number that represents the position of the element you want to
-     * retrieve from the array.
-     * @returns The element at the specified index in the `_nodes` array is being returned. If there is no element at that
-     * index, `null` is returned.
-     */
-    get(index: number): NonNullable<E> | null;
-    /**
-     * The function checks if the size of a data structure is less than or equal to zero.
-     * @returns The method is returning a boolean value indicating whether the size of the object is less than or equal to 0.
-     */
-    isEmpty(): boolean;
-    protected _seNodes(value: {
-        [p: number]: E;
-    }): void;
-    protected _setSize(value: number): void;
-}
-export declare class ArrayDeque<E> {
-    protected _nodes: E[];
-    get size(): number;
-    /**
-     * O(n) time complexity of adding at the beginning and the end
-     */
-    /**
-     * The function "addLast" adds a value to the end of an array.
-     * @param {E} 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.
-     */
-    addLast(value: E): 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.
-     */
-    pollLast(): E | null;
-    /**
-     * The `pollFirst` function removes and returns the first element from an array, or returns null if the array is empty.
-     * @returns The `pollFirst()` function returns the first element of the `_nodes` array, or `null` if the array is
-     * empty.
-     */
-    pollFirst(): E | null;
-    /**
-     * O(n) time complexity of adding at the beginning and the end
-     */
-    /**
-     * The function "addFirst" adds a value to the beginning of an array.
-     * @param {E} value - The value parameter represents the value that you want to add to the beginning of the array.
-     * @returns The return value of the `addFirst` function is the new length of the array `_nodes` after adding the
-     * `value` at the beginning.
-     */
-    addFirst(value: E): 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 (`E`) of the `_nodes` array. If the array is
-     * empty, it will return `null`.
-     */
-    peekFirst(): E | null;
-    /**
-     * The `peekLast` function returns the last element of an array or null if the array is empty.
-     * @returns The method `peekLast()` returns the last element of the `_nodes` array, or `null` if the array is empty.
-     */
-    peekLast(): E | null;
-    /**
-     * O(1) time complexity of obtaining the value
-     */
-    /**
-     * The get function returns the element at the specified index in an array, or null if the index is out of bounds.
-     * @param {number} index - The index parameter is a number that represents the position of the element you want to
-     * retrieve from the array.
-     * @returns The method is returning the element at the specified index in the `_nodes` array. If the element exists, it
-     * will be returned. If the element does not exist (i.e., the index is out of bounds), `null` will be returned.
-     */
-    get(index: number): E | null;
-    /**
-     * The set function assigns a value to a specific index in an array.
-     * @param {number} index - The index parameter is a number that represents the position of the element in the array
-     * that you want to set a new value for.
-     * @param {E} value - The value parameter represents the new value that you want to set at the specified index in the
-     * _nodes array.
-     * @returns The value that is being set at the specified index in the `_nodes` array.
-     */
-    set(index: number, value: E): E;
-    /**
-     * The insert function adds a value at a specified index in an array.
-     * @param {number} index - The index parameter specifies the position at which the value should be inserted in the
-     * array. It is a number that represents the index of the array where the value should be inserted. The index starts
-     * from 0, so the first element of the array has an index of 0, the second element has
-     * @param {E} value - The value parameter represents the value that you want to insert into the array at the specified
-     * index.
-     * @returns The splice method returns an array containing the removed elements, if any. In this case, since no elements
-     * are being removed, an empty array will be returned.
-     */
-    insert(index: number, value: E): E[];
-    /**
-     * The remove function removes an element from an array at a specified index.
-     * @param {number} index - The index parameter specifies the position of the element to be removed from the array. It
-     * is a number that represents the index of the element to be removed.
-     * @returns The method is returning an array containing the removed element.
-     */
-    remove(index: number): E[];
-    /**
-     * The function checks if an array called "_nodes" is empty.
-     * @returns The method `isEmpty()` is returning a boolean value. It returns `true` if the length of the `_nodes` array
-     * is 0, indicating that the array is empty. Otherwise, it returns `false`.
-     */
-    isEmpty(): boolean;
-}

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

@@ -1,277 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ArrayDeque = exports.ObjectDeque = exports.Deque = void 0;
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-const linked_list_1 = require("../linked-list");
-// O(n) time complexity of obtaining the value
-// O(1) time complexity of adding at the beginning and the end
-class Deque extends linked_list_1.DoublyLinkedList {
-}
-exports.Deque = Deque;
-// O(1) time complexity of obtaining the value
-// O(n) time complexity of adding at the beginning and the end
-// todo tested slowest one
-class ObjectDeque {
-    constructor(capacity) {
-        this._nodes = {};
-        this._capacity = Number.MAX_SAFE_INTEGER;
-        this._first = -1;
-        this._last = -1;
-        this._size = 0;
-        if (capacity !== undefined)
-            this._capacity = capacity;
-    }
-    get nodes() {
-        return this._nodes;
-    }
-    get capacity() {
-        return this._capacity;
-    }
-    set capacity(value) {
-        this._capacity = value;
-    }
-    get first() {
-        return this._first;
-    }
-    set first(value) {
-        this._first = value;
-    }
-    get last() {
-        return this._last;
-    }
-    set last(value) {
-        this._last = value;
-    }
-    get size() {
-        return this._size;
-    }
-    /**
-     * The "addFirst" function adds a value to the beginning of an array-like data structure.
-     * @param {E} value - The `value` parameter represents the value that you want to add to the beginning of the data
-     * structure.
-     */
-    addFirst(value) {
-        if (this._size === 0) {
-            const mid = Math.floor(this._capacity / 2);
-            this._first = mid;
-            this._last = mid;
-        }
-        else {
-            this._first--;
-        }
-        this._nodes[this._first] = value;
-        this._size++;
-    }
-    /**
-     * The addLast function adds a value to the end of an array-like data structure.
-     * @param {E} value - The `value` parameter represents the value that you want to add to the end of the data structure.
-     */
-    addLast(value) {
-        if (this._size === 0) {
-            const mid = Math.floor(this._capacity / 2);
-            this._first = mid;
-            this._last = mid;
-        }
-        else {
-            this._last++;
-        }
-        this._nodes[this._last] = value;
-        this._size++;
-    }
-    /**
-     * The function `pollFirst()` removes and returns the first element in a data structure.
-     * @returns The value of the first element in the data structure.
-     */
-    pollFirst() {
-        if (!this._size)
-            return;
-        const value = this.peekFirst();
-        delete this._nodes[this._first];
-        this._first++;
-        this._size--;
-        return value;
-    }
-    /**
-     * The `peekFirst` function returns the first element in an array-like data structure if it exists.
-     * @returns The element at the first position of the `_nodes` array.
-     */
-    peekFirst() {
-        if (this._size)
-            return this._nodes[this._first];
-    }
-    /**
-     * The `pollLast()` function removes and returns the last element in a data structure.
-     * @returns The value that was removed from the data structure.
-     */
-    pollLast() {
-        if (!this._size)
-            return;
-        const value = this.peekLast();
-        delete this._nodes[this._last];
-        this._last--;
-        this._size--;
-        return value;
-    }
-    /**
-     * The `peekLast()` function returns the last element in an array-like data structure.
-     * @returns The last element in the array "_nodes" is being returned.
-     */
-    peekLast() {
-        if (this._size)
-            return this._nodes[this._last];
-    }
-    /**
-     * The get function returns the element at the specified index in an array-like data structure.
-     * @param {number} index - The index parameter is a number that represents the position of the element you want to
-     * retrieve from the array.
-     * @returns The element at the specified index in the `_nodes` array is being returned. If there is no element at that
-     * index, `null` is returned.
-     */
-    get(index) {
-        return this._nodes[this._first + index] || null;
-    }
-    /**
-     * The function checks if the size of a data structure is less than or equal to zero.
-     * @returns The method is returning a boolean value indicating whether the size of the object is less than or equal to 0.
-     */
-    isEmpty() {
-        return this._size <= 0;
-    }
-    _seNodes(value) {
-        this._nodes = value;
-    }
-    _setSize(value) {
-        this._size = value;
-    }
-}
-exports.ObjectDeque = ObjectDeque;
-// O(1) time complexity of obtaining the value
-// O(n) time complexity of adding at the beginning and the end
-class ArrayDeque {
-    constructor() {
-        this._nodes = [];
-    }
-    get size() {
-        return this._nodes.length;
-    }
-    /**
-     * O(n) time complexity of adding at the beginning and the end
-     */
-    /**
-     * The function "addLast" adds a value to the end of an array.
-     * @param {E} 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.
-     */
-    addLast(value) {
-        return this._nodes.push(value);
-    }
-    /**
-     * 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.
-     */
-    pollLast() {
-        var _a;
-        return (_a = this._nodes.pop()) !== null && _a !== void 0 ? _a : null;
-    }
-    /**
-     * The `pollFirst` function removes and returns the first element from an array, or returns null if the array is empty.
-     * @returns The `pollFirst()` function returns the first element of the `_nodes` array, or `null` if the array is
-     * empty.
-     */
-    pollFirst() {
-        var _a;
-        return (_a = this._nodes.shift()) !== null && _a !== void 0 ? _a : null;
-    }
-    /**
-     * O(n) time complexity of adding at the beginning and the end
-     */
-    /**
-     * The function "addFirst" adds a value to the beginning of an array.
-     * @param {E} value - The value parameter represents the value that you want to add to the beginning of the array.
-     * @returns The return value of the `addFirst` function is the new length of the array `_nodes` after adding the
-     * `value` at the beginning.
-     */
-    addFirst(value) {
-        return this._nodes.unshift(value);
-    }
-    /**
-     * 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 (`E`) of the `_nodes` array. If the array is
-     * empty, it will return `null`.
-     */
-    peekFirst() {
-        var _a;
-        return (_a = this._nodes[0]) !== null && _a !== void 0 ? _a : null;
-    }
-    /**
-     * The `peekLast` function returns the last element of an array or null if the array is empty.
-     * @returns The method `peekLast()` returns the last element of the `_nodes` array, or `null` if the array is empty.
-     */
-    peekLast() {
-        var _a;
-        return (_a = this._nodes[this._nodes.length - 1]) !== null && _a !== void 0 ? _a : null;
-    }
-    /**
-     * O(1) time complexity of obtaining the value
-     */
-    /**
-     * The get function returns the element at the specified index in an array, or null if the index is out of bounds.
-     * @param {number} index - The index parameter is a number that represents the position of the element you want to
-     * retrieve from the array.
-     * @returns The method is returning the element at the specified index in the `_nodes` array. If the element exists, it
-     * will be returned. If the element does not exist (i.e., the index is out of bounds), `null` will be returned.
-     */
-    get(index) {
-        var _a;
-        return (_a = this._nodes[index]) !== null && _a !== void 0 ? _a : null;
-    }
-    /**
-     * The set function assigns a value to a specific index in an array.
-     * @param {number} index - The index parameter is a number that represents the position of the element in the array
-     * that you want to set a new value for.
-     * @param {E} value - The value parameter represents the new value that you want to set at the specified index in the
-     * _nodes array.
-     * @returns The value that is being set at the specified index in the `_nodes` array.
-     */
-    set(index, value) {
-        return (this._nodes[index] = value);
-    }
-    /**
-     * The insert function adds a value at a specified index in an array.
-     * @param {number} index - The index parameter specifies the position at which the value should be inserted in the
-     * array. It is a number that represents the index of the array where the value should be inserted. The index starts
-     * from 0, so the first element of the array has an index of 0, the second element has
-     * @param {E} value - The value parameter represents the value that you want to insert into the array at the specified
-     * index.
-     * @returns The splice method returns an array containing the removed elements, if any. In this case, since no elements
-     * are being removed, an empty array will be returned.
-     */
-    insert(index, value) {
-        return this._nodes.splice(index, 0, value);
-    }
-    /**
-     * The remove function removes an element from an array at a specified index.
-     * @param {number} index - The index parameter specifies the position of the element to be removed from the array. It
-     * is a number that represents the index of the element to be removed.
-     * @returns The method is returning an array containing the removed element.
-     */
-    remove(index) {
-        return this._nodes.splice(index, 1);
-    }
-    /**
-     * The function checks if an array called "_nodes" is empty.
-     * @returns The method `isEmpty()` is returning a boolean value. It returns `true` if the length of the `_nodes` array
-     * is 0, indicating that the array is empty. Otherwise, it returns `false`.
-     */
-    isEmpty() {
-        return this._nodes.length === 0;
-    }
-}
-exports.ArrayDeque = ArrayDeque;
-//# sourceMappingURL=deque.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"deque.js","sourceRoot":"","sources":["../../../src/data-structures/queue/deque.ts"],"names":[],"mappings":";;;AAAA;;;;;;GAMG;AACH,gDAAgD;AAEhD,8CAA8C;AAC9C,8DAA8D;AAC9D,MAAa,KAAe,SAAQ,8BAAmB;CAAG;AAA1D,sBAA0D;AAE1D,8CAA8C;AAC9C,8DAA8D;AAC9D,0BAA0B;AAC1B,MAAa,WAAW;IACtB,YAAY,QAAiB;QAIrB,WAAM,GAAuB,EAAE,CAAC;QAMhC,cAAS,GAAG,MAAM,CAAC,gBAAgB,CAAC;QAUpC,WAAM,GAAG,CAAC,CAAC,CAAC;QAUZ,UAAK,GAAG,CAAC,CAAC,CAAC;QAUX,UAAK,GAAG,CAAC,CAAC;QAvChB,IAAI,QAAQ,KAAK,SAAS;YAAE,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;IACxD,CAAC;IAID,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAID,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED,IAAI,QAAQ,CAAC,KAAa;QACxB,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;IACzB,CAAC;IAID,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,KAAK,CAAC,KAAa;QACrB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAID,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,IAAI,IAAI,CAAC,KAAa;QACpB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAID,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,KAAQ;QACf,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE;YACpB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;YAC3C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;YAClB,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC;SAClB;aAAM;YACL,IAAI,CAAC,MAAM,EAAE,CAAC;SACf;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;QACjC,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,OAAO,CAAC,KAAQ;QACd,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE;YACpB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;YAC3C,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;YAClB,IAAI,CAAC,KAAK,GAAG,GAAG,CAAC;SAClB;aAAM;YACL,IAAI,CAAC,KAAK,EAAE,CAAC;SACd;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;QAChC,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,SAAS;QACP,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChC,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,SAAS;QACP,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAClD,CAAC;IAED;;;OAGG;IACH,QAAQ;QACN,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/B,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,KAAK,EAAE,CAAC;QAEb,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,QAAQ;QACN,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC;IAED;;;;;;OAMG;IACH,GAAG,CAAC,KAAa;QACf,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,IAAI,IAAI,CAAC;IAClD,CAAC;IAED;;;OAGG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;IACzB,CAAC;IAES,QAAQ,CAAC,KAAuB;QACxC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAES,QAAQ,CAAC,KAAa;QAC9B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;CACF;AArJD,kCAqJC;AAED,8CAA8C;AAC9C,8DAA8D;AAC9D,MAAa,UAAU;IAAvB;QACY,WAAM,GAAQ,EAAE,CAAC;IA8H7B,CAAC;IA5HC,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED;;OAEG;IAEH;;;;OAIG;IACH,OAAO,CAAC,KAAQ;QACd,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAED;;;OAGG;IACH,QAAQ;;QACN,OAAO,MAAA,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,mCAAI,IAAI,CAAC;IACnC,CAAC;IAED;;;;OAIG;IACH,SAAS;;QACP,OAAO,MAAA,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,mCAAI,IAAI,CAAC;IACrC,CAAC;IAED;;OAEG;IAEH;;;;;OAKG;IACH,QAAQ,CAAC,KAAQ;QACf,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACH,SAAS;;QACP,OAAO,MAAA,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,mCAAI,IAAI,CAAC;IAChC,CAAC;IAED;;;OAGG;IACH,QAAQ;;QACN,OAAO,MAAA,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,mCAAI,IAAI,CAAC;IACrD,CAAC;IAED;;OAEG;IAEH;;;;;;OAMG;IACH,GAAG,CAAC,KAAa;;QACf,OAAO,MAAA,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,mCAAI,IAAI,CAAC;IACpC,CAAC;IAED;;;;;;;OAOG;IACH,GAAG,CAAC,KAAa,EAAE,KAAQ;QACzB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;IACtC,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,KAAa,EAAE,KAAQ;QAC5B,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IAC7C,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAC,KAAa;QAClB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACtC,CAAC;IAED;;;;OAIG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC;IAClC,CAAC;CACF;AA/HD,gCA+HC"}

package/dist/data-structures/queue/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/data-structures/queue/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,0CAAwB;AACxB,0CAAwB"}

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

@@ -1,107 +0,0 @@
-/**
- * @license MIT
- * @copyright Tyler Zeng <zrwusa@gmail.com>
- * @class
- */
-import { SinglyLinkedList } from '../linked-list';
-export declare class LinkedListQueue<E = any> extends SinglyLinkedList<E> {
-    /**
-     * The enqueue function adds a value to the end of an array.
-     * @param {E} value - The value parameter represents the value that you want to add to the queue.
-     */
-    enqueue(value: E): void;
-    /**
-     * The `dequeue` function removes and returns the first element from a queue, or returns null if the queue is empty.
-     * @returns The method is returning the element at the front of the queue, or null if the queue is empty.
-     */
-    dequeue(): E | undefined;
-    /**
-     * The `peek` function returns the value of the head node in a linked list, or `undefined` if the list is empty.
-     * @returns The `peek()` method is returning the value of the `head` node if it exists, otherwise it returns `undefined`.
-     */
-    peek(): E | undefined;
-}
-export declare class Queue<E = any> {
-    /**
-     * The constructor initializes an instance of a class with an optional array of elements and sets the offset to 0.
-     * @param {E[]} [elements] - The `elements` parameter is an optional array of elements of type `E`. If provided, it
-     * will be used to initialize the `_nodes` property of the class. If not provided, the `_nodes` property will be
-     * initialized as an empty array.
-     */
-    constructor(elements?: E[]);
-    private _nodes;
-    get nodes(): E[];
-    set nodes(value: E[]);
-    private _offset;
-    get offset(): number;
-    set offset(value: number);
-    /**
-     * The size function returns the number of elements in an array.
-     * @returns {number} The size of the array, which is the difference between the length of the array and the offset.
-     */
-    get size(): number;
-    /**
-     * The function "fromArray" creates a new Queue object from an array of elements.Creates a queue from an existing array.
-     * @public
-     * @static
-     * @param {E[]} elements - The "elements" parameter is an array of elements of type E.
-     * @returns The method is returning a new instance of the Queue class, initialized with the elements from the input
-     * array.
-     */
-    static fromArray<E>(elements: E[]): Queue<E>;
-    /**
-     * The push 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 {E} element - The `element` parameter represents the element that you want to add to the queue.
-     * @returns The `add` method is returning a `Queue<E>` object.
-     */
-    push(element: E): Queue<E>;
-    /**
-     * The `shift` function removes and returns the first element in the queue, and adjusts the internal data structure if
-     * necessary to optimize performance.
-     * @returns The function `shift()` returns either the first element in the queue or `null` if the queue is empty.
-     */
-    shift(): E | undefined;
-    /**
-     * The `peek` function returns the first element of the array `_nodes` if it exists, otherwise it returns `null`.
-     * @returns The `peek()` method returns the first element of the data structure, represented by the `_nodes` array at
-     * the `_offset` index. If the data structure is empty (size is 0), it returns `null`.
-     */
-    peek(): E | undefined;
-    /**
-     * The `peekLast` function returns the last element in an array-like data structure, or null if the structure is empty.
-     * @returns The method `peekLast()` returns the last element of the `_nodes` array if the array is not empty. If the
-     * array is empty, it returns `null`.
-     */
-    peekLast(): E | undefined;
-    /**
-     * The enqueue function adds a value to the end of a queue.
-     * @param {E} value - The value parameter represents the value that you want to add to the queue.
-     */
-    enqueue(value: E): void;
-    /**
-     * The `dequeue` function removes and returns the first element from a queue, or returns null if the queue is empty.
-     * @returns The method is returning a value of type E or null.
-     */
-    dequeue(): E | undefined;
-    getAt(index: number): E | undefined;
-    /**
-     * The function checks if a data structure is empty by comparing its size to zero.
-     * @returns {boolean} A boolean value indicating whether the size of the object is 0 or not.
-     */
-    isEmpty(): boolean;
-    /**
-     * The toArray() function returns an array of elements from the current offset to the end of the _nodes array.
-     * @returns An array of type E is being returned.
-     */
-    toArray(): E[];
-    /**
-     * The clear function resets the nodes array and offset to their initial values.
-     */
-    clear(): void;
-    /**
-     * The `clone()` function returns a new Queue object with the same elements as the original Queue.
-     * @returns The `clone()` method is returning a new instance of the `Queue` class.
-     */
-    clone(): Queue<E>;
-    [Symbol.iterator](): Generator<E, void, unknown>;
-}