Fixed size queue which automatically dequeues old values upon new enques

c# queue fifo
Xaqron picture Xaqron · May 2, 2011 · Viewed 82.3k times · Source

I'm using ConcurrentQueue for a shared data structure which purpose is holding the last N objects passed to it (kind of history).

Assume we have a browser and we want to have the last 100 browsed Urls. I want a queue which automatically drop (dequeue) the oldest (first) entry upon new entry insertion (enqueue) when the capacity gets full (100 addresses in history).

How can I accomplish that using System.Collections ?

Answer

Richard Schneider picture Richard Schneider · May 2, 2011

I would write a wrapper class that on Enqueue would check the Count and then Dequeue when the count exceeds the limit. 

 public class FixedSizedQueue<T>
 {
     ConcurrentQueue<T> q = new ConcurrentQueue<T>();
     private object lockObject = new object();

     public int Limit { get; set; }
     public void Enqueue(T obj)
     {
        q.Enqueue(obj);
        lock (lockObject)
        {
           T overflow;
           while (q.Count > Limit && q.TryDequeue(out overflow)) ;
        }
     }
 }

Related questions

Creating a blocking Queue<T> in .NET?

I have a scenario where I have multiple threads adding to a queue and multiple threads reading from the same queue. If the queue reaches a specific size all threads that are filling the queue will be blocked on add …

Read More
How can I check if a Queue is empty?

In C#, how can I check if a Queue is empty? I want to iterate through the Queue's elements, and I need to know when to stop. How can I accomplish this?

Read More
In C# would it be better to use Queue.Synchronized or lock() for thread safety?

I have a Queue object that I need to ensure is thread-safe. Would it be better to use a lock object like this: lock(myLockObject) { //do stuff with the queue } Or is it recommended to use Queue.Synchronized like this: …

Read More