Skip to content

BoundedQueue

Defined in: packages/core/src/queue.ts:20

A bounded, priority-aware FIFO. It never grows past capacity: when full, it evicts the oldest item from the lowest non-empty lane at or below the new item’s priority, or refuses the new item if only higher-priority items remain. Every eviction and refusal is counted in BoundedQueue.dropped, per lane.

T

new BoundedQueue<T>(capacity): BoundedQueue<T>

Defined in: packages/core/src/queue.ts:27

number

BoundedQueue<T>

readonly capacity: number

Defined in: packages/core/src/queue.ts:25


readonly dropped: number[]

Defined in: packages/core/src/queue.ts:24

Per priority.

get size(): number

Defined in: packages/core/src/queue.ts:32

number

laneSize(priority): number

Defined in: packages/core/src/queue.ts:36

Priority

number


push(item, priority): void

Defined in: packages/core/src/queue.ts:46

T

Priority

void


removeWhere(match): number

Defined in: packages/core/src/queue.ts:102

Removes every queued item match accepts (a user’s events, when they ask for erasure). Returns how many.

(item) => boolean

number


requeue(items): void

Defined in: packages/core/src/queue.ts:78

Puts a failed batch back at the front of its lanes. If the queue filled up meanwhile, the eviction rule applies: lower lanes give way, and within a lane the batch’s oldest items are dropped first. One splice per lane, so a large queue doesn’t pay for every item on every retry.

readonly QueuedItem<T>[]

void


take(n): QueuedItem<T>[]

Defined in: packages/core/src/queue.ts:62

Highest priority first, oldest first within a lane.

number

QueuedItem<T>[]