ILossyQueue
Defined in: packages/data/src/queue/ilossy-queue.ts:14
The lossy sibling of IQueue: never throws or waits when a bounded
queue is full, evicting or skipping instead (overflowPolicy).
"evict" drops the front (oldest) item to make room — the same victim
Python’s deque(maxlen=N) and Boost’s circular_buffer pick, and the only
meaningful choice for a FIFO structure.
Extends
Section titled “Extends”Type Parameters
Section titled “Type Parameters”T extends DefinedValue = DefinedValue
Properties
Section titled “Properties”capacity
Section titled “capacity”
readonlycapacity:number
Defined in: packages/data/src/collection/ibounded.ts:17
The maximum number of elements the collection can hold.
Note: Infinity is not a legal value here — an unbounded type omits this
mixin.
Inherited from
Section titled “Inherited from”overflowPolicy
Section titled “overflowPolicy”
readonlyoverflowPolicy:OverflowPolicy
Defined in: packages/data/src/collection/ilossy.ts:20
Policy applied when the collection reaches its capacity.
Inherited from
Section titled “Inherited from”Methods
Section titled “Methods”[iterator]()
Section titled “[iterator]()”[iterator]():
Iterator<T,any,any>
Defined in: node_modules/.store/typescript-npm-6.0.3-585eecd158/package/lib/lib.es2015.iterable.d.ts:47
Returns
Section titled “Returns”Iterator<T, any, any>
Inherited from
Section titled “Inherited from”clear()
Section titled “clear()”clear():
void
Defined in: packages/data/src/collection/icollection.ts:23
Removes all elements from the collection.
Returns
Section titled “Returns”void
Inherited from
Section titled “Inherited from”count()
Section titled “count()”count():
number
Defined in: packages/data/src/collection/icollection.ts:20
The number of elements in the collection.
A method, not a getter: its async counterpart needs a round trip to the backing store, and a member must have the same shape in both.
Returns
Section titled “Returns”number
Inherited from
Section titled “Inherited from”dequeue()
Section titled “dequeue()”dequeue():
T|undefined
Defined in: packages/data/src/queue/iqueue.ts:38
Removes and returns the item at the front of the queue.
Returns
Section titled “Returns”T | undefined
The item at the front of the queue, or undefined if the queue is
empty.
Inherited from
Section titled “Inherited from”enqueue()
Section titled “enqueue()”enqueue(
item): readonlyT[]
Defined in: packages/data/src/queue/ilossy-queue.ts:22
Same as IQueue.enqueue, but never throws — returns the items dropped to
make room (empty if nothing was dropped).
Parameters
Section titled “Parameters”T
Returns
Section titled “Returns”readonly T[]
IQueue.enqueue
Overrides
Section titled “Overrides”enqueueAll()
Section titled “enqueueAll()”enqueueAll(
items): readonlyT[]
Defined in: packages/data/src/queue/ilossy-queue.ts:30
Same as IQueue.enqueueAll, but never throws — returns the items dropped
to make room (empty if nothing was dropped).
Parameters
Section titled “Parameters”readonly T[]
Returns
Section titled “Returns”readonly T[]
IQueue.enqueueAll
Overrides
Section titled “Overrides”front()
Section titled “front()”front():
T|undefined
Defined in: packages/data/src/queue/iqueue.ts:46
Returns the item at the front of the queue without removing it.
Returns
Section titled “Returns”T | undefined
The item at the front of the queue, or undefined if the queue is
empty.