### Importing TinyQueue

Source: https://github.com/mourner/tinyqueue/blob/main/README.md

Shows how to import the library via NPM or a CDN.

```javascript
import TinyQueue from 'tinyqueue';
```

```html
<script type="module">
	import TinyQueue from 'https://cdn.jsdelivr.net/npm/tinyqueue/+esm';
```

--------------------------------

### Basic Priority Queue Operations

Source: https://github.com/mourner/tinyqueue/blob/main/README.md

Demonstrates queue initialization, item insertion, removal, peeking, and custom comparator usage.

```javascript
// create an empty priority queue
let queue = new TinyQueue();

// add some items
queue.push(7);
queue.push(5);
queue.push(10);

// remove the top item
let top = queue.pop(); // returns 5

// return the top item (without removal)
top = queue.peek(); // returns 7

// get queue length
queue.length; // returns 2

// create a priority queue from an existing array (modifies the array)
queue = new TinyQueue([7, 5, 10]);

// pass a custom item comparator as a second argument
queue = new TinyQueue([{value: 5}, {value: 7}], function (a, b) {
	return a.value - b.value;
});

// turn a queue into a sorted array
const array = [];
while (queue.length) array.push(queue.pop());
```

--------------------------------

### Add items with push()

Source: https://context7.com/mourner/tinyqueue/llms.txt

Insert items into the queue while maintaining heap order with O(log n) complexity.

```javascript
import TinyQueue from 'tinyqueue';

const queue = new TinyQueue();

// Push numeric values
queue.push(7);
queue.push(5);
queue.push(10);
queue.push(3);

console.log(queue.length); // 4
console.log(queue.peek()); // 3 (smallest value)

// Push objects with custom comparator
const eventQueue = new TinyQueue([], (a, b) => a.timestamp - b.timestamp);
eventQueue.push({ event: 'click', timestamp: 1000 });
eventQueue.push({ event: 'load', timestamp: 500 });
eventQueue.push({ event: 'scroll', timestamp: 1500 });

console.log(eventQueue.peek()); // { event: 'load', timestamp: 500 }
```

--------------------------------

### Initialize a TinyQueue instance

Source: https://context7.com/mourner/tinyqueue/llms.txt

Create a new priority queue with optional initial data and custom comparator functions for min-heap or max-heap behavior.

```javascript
import TinyQueue from 'tinyqueue';

// Create an empty priority queue (min-heap by default)
const queue = new TinyQueue();

// Create a queue from an existing array (modifies the array in-place)
const numbers = [5, 3, 8, 1, 9, 2];
const queueFromArray = new TinyQueue(numbers);
// queueFromArray.peek() returns 1 (smallest element)

// Create a max-heap with custom comparator
const maxHeap = new TinyQueue([], (a, b) => b - a);
maxHeap.push(5);
maxHeap.push(10);
maxHeap.push(3);
// maxHeap.peek() returns 10 (largest element)

// Create a queue with objects using custom comparator
const tasks = [
    { name: 'Low priority', priority: 10 },
    { name: 'High priority', priority: 1 },
    { name: 'Medium priority', priority: 5 }
];
const taskQueue = new TinyQueue(tasks, (a, b) => a.priority - b.priority);
// taskQueue.peek() returns { name: 'High priority', priority: 1 }
```

--------------------------------

### Constructor

Source: https://context7.com/mourner/tinyqueue/llms.txt

Creates a new priority queue instance, optionally initialized with an array of items and a custom comparator function. The default comparator creates a min-heap where smaller values have higher priority.

```APIDOC
## Constructor

Creates a new priority queue instance, optionally initialized with an array of items and a custom comparator function. The default comparator creates a min-heap where smaller values have higher priority.

### Parameters

#### Path Parameters
None

#### Query Parameters
None

#### Request Body
None

### Request Example
```javascript
import TinyQueue from 'tinyqueue';

// Create an empty priority queue (min-heap by default)
const queue = new TinyQueue();

// Create a queue from an existing array (modifies the array in-place)
const numbers = [5, 3, 8, 1, 9, 2];
const queueFromArray = new TinyQueue(numbers);
// queueFromArray.peek() returns 1 (smallest element)

// Create a max-heap with custom comparator
const maxHeap = new TinyQueue([], (a, b) => b - a);
maxHeap.push(5);
maxHeap.push(10);
maxHeap.push(3);
// maxHeap.peek() returns 10 (largest element)

// Create a queue with objects using custom comparator
const tasks = [
    { name: 'Low priority', priority: 10 },
    { name: 'High priority', priority: 1 },
    { name: 'Medium priority', priority: 5 }
];
const taskQueue = new TinyQueue(tasks, (a, b) => a.priority - b.priority);
// taskQueue.peek() returns { name: 'High priority', priority: 1 }
```

### Response
#### Success Response (200)
Returns a new TinyQueue instance.

#### Response Example
```json
{
  "instance": "TinyQueue"
}
```
```

--------------------------------

### push(item)

Source: https://context7.com/mourner/tinyqueue/llms.txt

Adds a new item to the priority queue while maintaining the heap property. The operation has O(log n) time complexity.

```APIDOC
## push(item)

Adds a new item to the priority queue while maintaining the heap property. The operation has O(log n) time complexity.

### Parameters

#### Path Parameters
None

#### Query Parameters
None

#### Request Body
- **item** (any) - Required - The item to add to the queue.

### Request Example
```javascript
import TinyQueue from 'tinyqueue';

const queue = new TinyQueue();

// Push numeric values
queue.push(7);
queue.push(5);
queue.push(10);
queue.push(3);

console.log(queue.length); // 4
console.log(queue.peek()); // 3 (smallest value)

// Push objects with custom comparator
const eventQueue = new TinyQueue([], (a, b) => a.timestamp - b.timestamp);
eventQueue.push({ event: 'click', timestamp: 1000 });
eventQueue.push({ event: 'load', timestamp: 500 });
eventQueue.push({ event: 'scroll', timestamp: 1500 });

console.log(eventQueue.peek()); // { event: 'load', timestamp: 500 }
```

### Response
#### Success Response (200)
None (operation modifies the queue in-place).

#### Response Example
None
```

--------------------------------

### peek()

Source: https://context7.com/mourner/tinyqueue/llms.txt

Returns the highest priority item (smallest value in min-heap) without removing it from the queue. Returns undefined if the queue is empty. The operation has O(1) time complexity.

```APIDOC
## peek()

Returns the highest priority item (smallest value in min-heap) without removing it from the queue. Returns undefined if the queue is empty. The operation has O(1) time complexity.

### Parameters

#### Path Parameters
None

#### Query Parameters
None

#### Request Body
None

### Request Example
```javascript
import TinyQueue from 'tinyqueue';

const queue = new TinyQueue([7, 5, 10]);

console.log(queue.peek()); // 5 (smallest value, not removed)
console.log(queue.peek()); // 5 (still there)
console.log(queue.length); // 3 (unchanged)

// Check if queue has items before processing
const taskQueue = new TinyQueue();
if (queue.peek() === undefined) {
    console.log('Queue is empty');
}
taskQueue.push({ task: 'process', priority: 1 });
console.log(taskQueue.peek()); // { task: 'process', priority: 1 }
```

### Response
#### Success Response (200)
- **item** (any) - The highest priority item in the queue, or undefined if the queue is empty.

#### Response Example
```json
{
  "item": 5
}
```
```

--------------------------------

### Inspect items with peek()

Source: https://context7.com/mourner/tinyqueue/llms.txt

Retrieve the highest priority item without removing it from the queue. O(1) complexity.

```javascript
import TinyQueue from 'tinyqueue';

const queue = new TinyQueue([7, 5, 10]);

console.log(queue.peek()); // 5 (smallest value, not removed)
console.log(queue.peek()); // 5 (still there)
console.log(queue.length); // 3 (unchanged)

// Check if queue has items before processing
const taskQueue = new TinyQueue();
if (queue.peek() === undefined) {
    console.log('Queue is empty');
}
taskQueue.push({ task: 'process', priority: 1 });
console.log(taskQueue.peek()); // { task: 'process', priority: 1 }
```

--------------------------------

### Accessing TinyQueue Data Property

Source: https://context7.com/mourner/tinyqueue/llms.txt

Demonstrates how to access the internal heap array and its minimum element. Remember that direct modification of this array can corrupt the heap structure.

```javascript
import TinyQueue from 'tinyqueue';

const queue = new TinyQueue([5, 3, 8, 1, 9]);

// Access the internal heap array
console.log(queue.data); // [1, 3, 8, 5, 9] (heap order, not sorted)
console.log(queue.data[0]); // 1 (always the minimum)

// Note: Modifying data directly will break heap invariant
// Always use push/pop methods for modifications
```

--------------------------------

### pop()

Source: https://context7.com/mourner/tinyqueue/llms.txt

Removes and returns the highest priority item (smallest value in min-heap) from the queue. Returns undefined if the queue is empty. The operation has O(log n) time complexity.

```APIDOC
## pop()

Removes and returns the highest priority item (smallest value in min-heap) from the queue. Returns undefined if the queue is empty. The operation has O(log n) time complexity.

### Parameters

#### Path Parameters
None

#### Query Parameters
None

#### Request Body
None

### Request Example
```javascript
import TinyQueue from 'tinyqueue';

const queue = new TinyQueue([7, 5, 10, 3, 8]);

console.log(queue.pop()); // 3
console.log(queue.pop()); // 5
console.log(queue.pop()); // 7
console.log(queue.pop()); // 8
console.log(queue.pop()); // 10
console.log(queue.pop()); // undefined (queue is empty)

// Convert priority queue to sorted array
const data = [42, 17, 83, 5, 29];
const sortQueue = new TinyQueue(data.slice());
const sorted = [];
while (sortQueue.length) {
    sorted.push(sortQueue.pop());
}
console.log(sorted); // [5, 17, 29, 42, 83]
```

### Response
#### Success Response (200)
- **item** (any) - The highest priority item removed from the queue, or undefined if the queue is empty.

#### Response Example
```json
{
  "item": 3
}
```
```

--------------------------------

### Accessing the data Property

Source: https://context7.com/mourner/tinyqueue/llms.txt

The data property provides direct access to the underlying array storing the heap data in binary heap order.

```APIDOC
## Property: data

### Description
Provides direct access to the underlying array storing the heap data. The array is structured as a binary heap, where the first element is always the minimum, but other elements are in heap order rather than sorted.

### Usage
Accessing this property allows inspection of the internal heap structure. Note that modifying this array directly will break the heap invariant; always use the library's push/pop methods for modifications.

### Example
```javascript
import TinyQueue from 'tinyqueue';

const queue = new TinyQueue([5, 3, 8, 1, 9]);

// Access the internal heap array
console.log(queue.data); // [1, 3, 8, 5, 9]
console.log(queue.data[0]); // 1 (always the minimum)
```
```

--------------------------------

### Check queue size with length

Source: https://context7.com/mourner/tinyqueue/llms.txt

Access the current number of items in the queue, which updates automatically during push and pop operations.

```javascript
import TinyQueue from 'tinyqueue';

const queue = new TinyQueue();

console.log(queue.length); // 0

queue.push(1);
queue.push(2);
queue.push(3);
console.log(queue.length); // 3

queue.pop();
console.log(queue.length); // 2

// Process all items in the queue
while (queue.length > 0) {
    const item = queue.pop();
    console.log(`Processing: ${item}`);
}
// Output:
// Processing: 2
// Processing: 3
```

--------------------------------

### length Property

Source: https://context7.com/mourner/tinyqueue/llms.txt

Returns the current number of items in the priority queue. This property is updated automatically when items are pushed or popped.

```APIDOC
## length Property

Returns the current number of items in the priority queue. This property is updated automatically when items are pushed or popped.

### Parameters

#### Path Parameters
None

#### Query Parameters
None

#### Request Body
None

### Request Example
```javascript
import TinyQueue from 'tinyqueue';

const queue = new TinyQueue();

console.log(queue.length); // 0

queue.push(1);
queue.push(2);
queue.push(3);
console.log(queue.length); // 3

queue.pop();
console.log(queue.length); // 2

// Process all items in the queue
while (queue.length > 0) {
    const item = queue.pop();
    console.log(`Processing: ${item}`);
}
// Output:
// Processing: 2
// Processing: 3
```

### Response
#### Success Response (200)
- **length** (number) - The number of items currently in the queue.

#### Response Example
```json
{
  "length": 3
}
```
```

--------------------------------

### Remove items with pop()

Source: https://context7.com/mourner/tinyqueue/llms.txt

Extract the highest priority item from the queue. Returns undefined if the queue is empty.

```javascript
import TinyQueue from 'tinyqueue';

const queue = new TinyQueue([7, 5, 10, 3, 8]);

console.log(queue.pop()); // 3
console.log(queue.pop()); // 5
console.log(queue.pop()); // 7
console.log(queue.pop()); // 8
console.log(queue.pop()); // 10
console.log(queue.pop()); // undefined (queue is empty)

// Convert priority queue to sorted array
const data = [42, 17, 83, 5, 29];
const sortQueue = new TinyQueue(data.slice());
const sorted = [];
while (sortQueue.length) {
    sorted.push(sortQueue.pop());
}
console.log(sorted); // [5, 17, 29, 42, 83]
```

=== COMPLETE CONTENT === This response contains all available snippets from this library. No additional content exists. Do not make further requests.