Return to Answer

It's a bounded queue (a first-in-first-out queue with a fixed capacity).

This particular queue always allows addition of elements and silently remove head element for newly added element (when full).

In Java there is the CircularFifoQueue that works exactly that way (see also Size-limited queue that holds last N elements in Java).

For .NET you'd take a look at:

• Limit size of Queue in .NET?
• Fixed size queue which automatically dequeues old values upon new enques

It's a bounded queue (a first-in-first-out queue with a fixed capacity).

This particular queue always allows addition of elements and silently remove head element for newly added element (when full).

In Java there is the CircularFifoQueue that works exactly that way (see also Size-limited queue that holds last N elements in Java).

For .NET you'd take a look at:

• Limit size of Queue in .NET?
• Fixed size queue which automatically dequeues old values upon new enques

It's a bounded queue (a first-in-first-out queue with a fixed capacity).

This particular queue always allows addition of elements and silently remove head element for newly added element (when full).

In Java there is the CircularFifoQueue that works exactly this way (see also Size-limited queue that holds last N elements in Java).

For .NET you'd take a look at:

• Limit size of Queue in .NET?
• Fixed size queue which automatically dequeues old values upon new enques

It's a bounded queue (a first-in-first-out queue with a fixed capacity).

This particular queue always allows addition of elements and silently remove head element for newly added element (when full).

In Java there is the CircularFifoQueue that works exactly that way (see also Size-limited queue that holds last N elements in Java).

For .NET you'd take a look at:

• Limit size of Queue in .NET?
• Fixed size queue which automatically dequeues old values upon new enques

It's a bounded queue (a first-in-first-out queue with a fixed capacity).

This particular queue always allows addition of elements and silently remove head element for newly added element (when full).

In Java there is the CircularFifoQueue that works exactly this way (see also Size-limited queue that holds last N elements in Java).

It's a bounded queue (a first-in-first-out queue with a fixed capacity).

This particular queue always allows addition of elements and silently remove head element for newly added element (when full).

In Java there is the CircularFifoQueue that works exactly this way (see also Size-limited queue that holds last N elements in Java).

For .NET you'd take a look at:

• Limit size of Queue in .NET?
• Fixed size queue which automatically dequeues old values upon new enques