binary-tree-typed 2.5.0 → 2.5.2

package/src/data-structures/queue/queue.ts

@@ -168,6 +168,30 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Track queue length
  *  const q = new Queue<number>();
@@ -196,6 +220,30 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // View the front element
  *  const q = new Queue<string>(['first', 'second', 'third']);
@@ -244,6 +292,30 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Queue for...of iteration and isEmpty check
  *  const queue = new Queue<string>(['A', 'B', 'C', 'D']);
@@ -284,6 +356,30 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // basic Queue creation and push operation
  *  // Create a simple Queue with initial values
@@ -333,6 +429,30 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Queue shift and peek operations
  *  const queue = new Queue<number>([10, 20, 30, 40]);
@@ -370,6 +490,30 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Remove specific element
  *  const q = new Queue<number>([1, 2, 3, 2]);
@@ -400,6 +544,30 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Access element by index
  *  const q = new Queue<string>(['a', 'b', 'c']);
@@ -479,6 +647,30 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Remove all elements
  *  const q = new Queue<number>([1, 2, 3]);
@@ -503,6 +695,30 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Reclaim unused memory
  *  const q = new Queue<number>([1, 2, 3, 4, 5]);
@@ -556,6 +772,30 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Create independent copy
  *  const q = new Queue<number>([1, 2, 3]);
@@ -587,6 +827,30 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Filter elements
  *  const q = new Queue<number>([1, 2, 3, 4, 5]);
@@ -622,6 +886,30 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Transform elements
  *  const q = new Queue<number>([1, 2, 3]);

package/src/data-structures/stack/stack.ts

@@ -173,6 +173,30 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Get number of elements
  *  const stack = new Stack<number>([1, 2, 3]);
@@ -217,6 +241,30 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Check if stack has elements
  *  const stack = new Stack<number>();
@@ -244,6 +292,30 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // View the top element without removing it
  *  const stack = new Stack<string>(['a', 'b', 'c']);
@@ -271,6 +343,30 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // basic Stack creation and push operation
  *  // Create a simple Stack with initial values
@@ -307,6 +403,30 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Stack pop operation (LIFO - Last In First Out)
  *  const stack = new Stack<number>([10, 20, 30, 40, 50]);
@@ -360,6 +480,30 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Remove element
  *  const stack = new Stack<number>([1, 2, 3]);
@@ -415,6 +559,30 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Remove all elements
  *  const stack = new Stack<number>([1, 2, 3]);
@@ -439,6 +607,30 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Create independent copy
  *  const stack = new Stack<number>([1, 2, 3]);
@@ -469,6 +661,30 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Filter elements
  *  const stack = new Stack<number>([1, 2, 3, 4, 5]);
@@ -521,6 +737,30 @@ export class Stack<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Transform elements
  *  const stack = new Stack<number>([1, 2, 3]);