Menu
I know about the System.Collections.Stack. I'm looking for a class that supports PushFront() & PushBack().
806
Stack represents a last-in, first out collection of object. It is used when you need a last-in, first-out access to items. When you add an item in the list, it is called pushing the item and when you remove it, it is called popping the item.
The capacity of a Stack is the number of elements the Stack can hold. As elements are added to a Stack, the capacity is automatically increased as required through reallocation. We don't recommend that you use the Stack class for new development. Instead, we recommend that you use the generic System.
A Stack represents a last-in, first-out collection of objects. It is used when you need last-in, first-out access to items. It is both a generic and non-generic type of collection. The generic stack is defined in System.
Queue and Stack are collection objects in the System. Collection namespace. The Queue class tracks objects on First-in & First-Out basis, while the Stack class tracks objects on First-in & Last-out basis. By using public methods of both Queue & Stacks classes, we can move objects to different locations.
It sounds like you want something normally called a deque. The closest I'm aware of in .NET is LinkedList<T>. I don't believe there's one built from a circular buffer (expanding as required), which is the way you'd probably want to build it from scratch.
Of course, you could implement it yourself - but I'd probably use LinkedList<T> unless I had a really good reason not to. Eric Lippert also has an immutable implementation you could look at (see his blog post covering it), but obviously you'd want to write a bunch of tests etc... and you may not want an immutable one.
96
Why not just use/wrap LinkedList<T>? It has AddFirst and AddLast methods. You can wrap it to hide the AddBefore etc. methods.
The common term for this is deque (it means double ended queue). If for some reason wrapping a LinkedList<T> doesn't suffice (it should!), you could look at Eric Lippert's implementation of an immutable deque.
31
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
