queue-typed 2.4.4 → 2.5.0

package/README.md

@@ -94,54 +94,6 @@ for (let i = 0; i < magnitude; i++) {
 
 [//]: # (No deletion!!! Start of Example Replace Section)
 
-### basic Queue creation and push operation
-```typescript
- // Create a simple Queue with initial values
-    const queue = new Queue([1, 2, 3, 4, 5]);
-
-    // Verify the queue maintains insertion order
-    console.log([...queue]); // [1, 2, 3, 4, 5];
-
-    // Check length
-    console.log(queue.length); // 5;
-```
-
-### Queue shift and peek operations
-```typescript
- const queue = new Queue<number>([10, 20, 30, 40]);
-
-    // Peek at the front element without removing it
-    console.log(queue.first); // 10;
-
-    // Remove and get the first element (FIFO)
-    const first = queue.shift();
-    console.log(first); // 10;
-
-    // Verify remaining elements and length decreased
-    console.log([...queue]); // [20, 30, 40];
-    console.log(queue.length); // 3;
-```
-
-### Queue for...of iteration and isEmpty check
-```typescript
- const queue = new Queue<string>(['A', 'B', 'C', 'D']);
-
-    const elements: string[] = [];
-    for (const item of queue) {
-      elements.push(item);
-    }
-
-    // Verify all elements are iterated in order
-    console.log(elements); // ['A', 'B', 'C', 'D'];
-
-    // Process all elements
-    while (queue.length > 0) {
-      queue.shift();
-    }
-
-    console.log(queue.length); // 0;
-```
-
 ### Queue as message broker for event processing
 ```typescript
  interface Message {
@@ -205,6 +157,12 @@ for (let i = 0; i < magnitude; i++) {
     console.log(messageQueue.length); // 0;
 ```
 
+### Convert queue to array
+```typescript
+ const q = new Queue<number>([10, 20, 30]);
+    console.log(q.toArray()); // [10, 20, 30];
+```
+
 [//]: # (No deletion!!! End of Example Replace Section)