Bufferless queue (source code)

= Bufferless queue

A <queue> which retains no unfinished work between slots. Given nonnegative input $A$ and capacity $c$, its <bufferless queue output> is $\min(A,c)$ and its lost work is $(A-c)^+$.