DequeT Class

Class implementing a Double Ended Queue. Items can be added and removed in O(1) at the beginning and at the end, and accessed at an arbitrary index in O(1). Implemented by a ring buffer that is doubled in size (and the old content copied) when necessary (so insert is only amortized O(1)).

public class Deque<T> : IDeque, ICollection, 
	IEnumerable, ICloneable, ICollection<T>, IEnumerable<T>