Reputation: 28059
Is there any way to limit the size of a generic collection?
I have a Stack of WriteableBitmap which I am using to store a clone of a WriteableBitmap on each change, meaning that I can undo easily by simply Popping the most recent WriteableBitmap off the stack.
The problem is the memory usage, I want to limit this stack to hold 10 objects, but I can't see a property allowing me to easily do this. Is there a way, or am I going to have to check the stack size on each change, and copy the last 10 objects into a new stack whenever I hit 10, and on each subsequent change? I know how to do this, but was hoping that there was an easier way, is there?
Upvotes: 13
Views: 25615
Reputation: 36403
To elaborate on Tilak's answer here is some example code:
public class LimitedSizeStack<T> : LinkedList<T>
{
private readonly int _maxSize;
public LimitedSizeStack(int maxSize)
{
_maxSize = maxSize;
}
public void Push(T item)
{
this.AddFirst(item);
if(this.Count > _maxSize)
this.RemoveLast();
}
public T Pop()
{
var item = this.First.Value;
this.RemoveFirst();
return item;
}
}
Upvotes: 25
Reputation: 223237
You have to implement your own wrapper to achieve that. There is no direct option available.
class FixedSizeStack : Stack
{
private int MaxNumber;
public FixedSizeStack(int Limit)
: base()
{
MaxNumber = Limit;
}
public override void Push(object obj)
{
if (this.Count < MaxNumber)
base.Push(obj);
}
}
Upvotes: 10
Reputation: 30698
You can use LinkedList which represents doubly link list to simulate Circular Stack.
You can you AddFirst()
corresponding to Push()
. If Count is 10, you can use RemoveLast()
.
For Pop()
you can use RemoveFirst()
Upvotes: 5
Reputation: 6021
You will have to check the size (You will get an exception I believe if you set a limit, and don't check if it's full).
Edit
You don't get an exception if the size has been set, but the size just increases so you do have to check the size (via http://msdn.microsoft.com/en-us/library/6335ax0f.aspx):-
If Count already equals the capacity, the capacity of the Stack is increased by automatically reallocating the internal array, and the existing elements are copied to the new array before the new element is added.
Upvotes: 1