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.
Type Parameters
Section titled “Type Parameters”T
Constructors
Section titled “Constructors”Constructor
Section titled “Constructor”new BoundedQueue<
T>(capacity):BoundedQueue<T>
Defined in: packages/core/src/queue.ts:27
Parameters
Section titled “Parameters”capacity
Section titled “capacity”number
Returns
Section titled “Returns”BoundedQueue<T>
Properties
Section titled “Properties”capacity
Section titled “capacity”
readonlycapacity:number
Defined in: packages/core/src/queue.ts:25
dropped
Section titled “dropped”
readonlydropped:number[]
Defined in: packages/core/src/queue.ts:24
Per priority.
Accessors
Section titled “Accessors”Get Signature
Section titled “Get Signature”get size():
number
Defined in: packages/core/src/queue.ts:32
Returns
Section titled “Returns”number
Methods
Section titled “Methods”laneSize()
Section titled “laneSize()”laneSize(
priority):number
Defined in: packages/core/src/queue.ts:36
Parameters
Section titled “Parameters”priority
Section titled “priority”Returns
Section titled “Returns”number
push()
Section titled “push()”push(
item,priority):void
Defined in: packages/core/src/queue.ts:46
Parameters
Section titled “Parameters”T
priority
Section titled “priority”Returns
Section titled “Returns”void
removeWhere()
Section titled “removeWhere()”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.
Parameters
Section titled “Parameters”(item) => boolean
Returns
Section titled “Returns”number
requeue()
Section titled “requeue()”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.
Parameters
Section titled “Parameters”readonly QueuedItem<T>[]
Returns
Section titled “Returns”void
take()
Section titled “take()”take(
n):QueuedItem<T>[]
Defined in: packages/core/src/queue.ts:62
Highest priority first, oldest first within a lane.
Parameters
Section titled “Parameters”number
Returns
Section titled “Returns”QueuedItem<T>[]