deque-typed 2.5.3 → 2.6.0

package/dist/types/data-structures/trie/trie.d.ts

@@ -253,6 +253,9 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -311,6 +314,9 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -364,6 +370,9 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -413,6 +422,9 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -461,6 +473,9 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -512,6 +527,9 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -588,6 +606,9 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -647,6 +668,9 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -700,6 +724,9 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -753,6 +780,9 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -803,6 +833,9 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -848,6 +881,9 @@ export declare class Trie<R = any> extends IterableElementBase<string, R> {
    
    
    
+   
+   
+   
    
    
    

package/dist/umd/deque-typed.js

@@ -238,6 +238,35 @@ var dequeTyped = (() => {
       for (const ele of this) if (ele === element) return true;
       return false;
     }
+    /**
+     * Check whether a value exists (Array-compatible alias for `has`).
+     * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1).
+     * @param element - Element to search for (uses `===`).
+     * @returns `true` if found.
+     */
+    includes(element) {
+      return this.has(element);
+    }
+    /**
+     * Return an iterator of `[index, value]` pairs (Array-compatible).
+     * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1) per step.
+     */
+    *entries() {
+      let index = 0;
+      for (const value of this) {
+        yield [index++, value];
+      }
+    }
+    /**
+     * Return an iterator of numeric indices (Array-compatible).
+     * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1) per step.
+     */
+    *keys() {
+      let index = 0;
+      for (const _ of this) {
+        yield index++;
+      }
+    }
     /**
      * Reduces all elements to a single accumulated value.
      *
@@ -497,6 +526,16 @@ var dequeTyped = (() => {
       }
       return this;
     }
+    /**
+     * Return a new instance of the same type with elements in reverse order (non-mutating).
+     * @remarks Provided for familiarity when migrating from Array (ES2023 `toReversed`). Time O(n), Space O(n).
+     * @returns A new reversed instance.
+     */
+    toReversed() {
+      const cloned = this.clone();
+      cloned.reverse();
+      return cloned;
+    }
   };
 
   // src/data-structures/queue/deque.ts
@@ -687,7 +726,10 @@ var dequeTyped = (() => {
     }
     /**
       * Deque peek at both ends
-      * @example
+     
+      
+      
+       * @example
     * // Deque peek at both ends
     *  const deque = new Deque<number>([10, 20, 30, 40, 50]);
     *
@@ -745,6 +787,9 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -812,6 +857,9 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -892,6 +940,9 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -959,6 +1010,9 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1027,6 +1081,9 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1136,6 +1193,9 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1185,6 +1245,9 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1238,6 +1301,9 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1442,6 +1508,9 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1536,6 +1605,64 @@ var dequeTyped = (() => {
       
       
       
+      
+       * @example
+    * // Deque for...of iteration and reverse
+    *  const deque = new Deque<string>(['A', 'B', 'C', 'D']);
+    *
+    *     // Iterate forward
+    *     const forward: string[] = [];
+    *     for (const item of deque) {
+    *       forward.push(item);
+    *     }
+    *     console.log(forward); // ['A', 'B', 'C', 'D'];
+    *
+    *     // Reverse the deque
+    *     deque.reverse();
+    *     const backward: string[] = [];
+    *     for (const item of deque) {
+    *       backward.push(item);
+    *     }
+    *     console.log(backward); // ['D', 'C', 'B', 'A'];
+      */
+    /**
+      * Find the last value matching a predicate (scans back-to-front).
+      * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1).
+      * @param predicate - Function called with (value, index, deque).
+      * @returns Matching value or undefined.
+       * @example
+    * // Find last matching value
+    *  const d = new Deque([1, 2, 3, 4, 5]);
+    *     console.log(d.findLast(v => v > 2)); // 5;
+    *     console.log(d.findLast(v => v % 2 === 0)); // 4;
+      */
+    findLast(predicate) {
+      for (let i = this.length - 1; i >= 0; i--) {
+        const val = this.at(i);
+        if (predicate(val, i, this)) return val;
+      }
+      return void 0;
+    }
+    /**
+      * Find the index of the last value matching a predicate (scans back-to-front).
+      * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1).
+      * @param predicate - Function called with (value, index, deque).
+      * @returns Matching index, or -1 if not found.
+       * @example
+    * // Find last matching index
+    *  const d = new Deque([10, 20, 30, 20, 10]);
+    *     console.log(d.findLastIndex(v => v === 20)); // 3;
+    *     console.log(d.findLastIndex(v => v === 10)); // 4;
+      */
+    findLastIndex(predicate) {
+      for (let i = this.length - 1; i >= 0; i--) {
+        if (predicate(this.at(i), i, this)) return i;
+      }
+      return -1;
+    }
+    /**
+      * Deque for...of iteration and reverse
+     
       
        * @example
     * // Deque for...of iteration and reverse
@@ -1649,6 +1776,9 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1724,6 +1854,9 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1782,6 +1915,9 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
       
       
       
@@ -1860,6 +1996,9 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+