deque-typed 2.5.0 → 2.5.1

package/dist/umd/deque-typed.js

@@ -583,6 +583,27 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
        * @example
     * // Deque peek at both ends
     *  const deque = new Deque<number>([10, 20, 30, 40, 50]);
@@ -617,6 +638,27 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
        * @example
     * // Peek at the back element
     *  const dq = new Deque<string>(['a', 'b', 'c']);
@@ -656,6 +698,27 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
        * @example
     * // basic Deque creation and push/pop operations
     *  // Create a simple Deque with initial values
@@ -708,6 +771,27 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
        * @example
     * // Remove from the back
     *  const dq = new Deque<number>([1, 2, 3]);
@@ -747,6 +831,27 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
        * @example
     * // Remove from the front
     *  const dq = new Deque<number>([1, 2, 3]);
@@ -787,6 +892,27 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
        * @example
     * // Deque shift and unshift operations
     *  const deque = new Deque<number>([20, 30, 40]);
@@ -868,6 +994,27 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
        * @example
     * // Check if empty
     *  const dq = new Deque();
@@ -889,6 +1036,27 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
        * @example
     * // Remove all elements
     *  const dq = new Deque<number>([1, 2, 3]);
@@ -914,6 +1082,27 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
        * @example
     * // Access by index
     *  const dq = new Deque<string>(['a', 'b', 'c']);
@@ -1090,6 +1279,27 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
        * @example
     * // Remove element
     *  const dq = new Deque<number>([1, 2, 3]);
@@ -1153,6 +1363,27 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
        * @example
     * // Deque for...of iteration and reverse
     *  const deque = new Deque<string>(['A', 'B', 'C', 'D']);
@@ -1241,6 +1472,27 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
        * @example
     * // Reclaim memory
     *  const dq = new Deque<number>([1, 2, 3, 4, 5]);
@@ -1288,6 +1540,27 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
        * @example
     * // Create independent copy
     *  const dq = new Deque<number>([1, 2, 3]);
@@ -1318,6 +1591,27 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
        * @example
     * // Filter elements
     *  const dq = new Deque<number>([1, 2, 3, 4]);
@@ -1368,6 +1662,27 @@ var dequeTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
        * @example
     * // Transform elements
     *  const dq = new Deque<number>([1, 2, 3]);