public void Insert_RangeOfZeroElements_HasNoEffect() { var deque = new Deque <int>(new[] { 1, 2, 3 }); deque.InsertRange(1, new int[] { }); Assert.AreEqual(new[] { 1, 2, 3 }, deque); }
public void InsertMultiple_MakesRoomForNewElements() { var deque = new Deque <int>(new[] { 1, 2, 3 }); deque.InsertRange(1, new[] { 7, 13 }); Assert.AreEqual(new[] { 1, 7, 13, 2, 3 }, deque); Assert.AreEqual(5, deque.Capacity); }
private void InsertTest(IReadOnlyCollection <int> initial, IReadOnlyCollection <int> items) { var totalCapacity = initial.Count + items.Count; for (int rotated = 0; rotated <= totalCapacity; ++rotated) { for (int index = 0; index <= initial.Count; ++index) { // Calculate the expected result using the slower List<int>. var result = new List <int>(initial); for (int i = 0; i != rotated; ++i) { var item = result[0]; result.RemoveAt(0); result.Add(item); } result.InsertRange(index, items); // First, start off the deque with the initial items. var deque = new Deque <int>(initial); // Ensure there's enough room for the inserted items. deque.Capacity += items.Count; // Rotate the existing items. for (int i = 0; i != rotated; ++i) { var item = deque[0]; deque.RemoveFromFront(); deque.AddToBack(item); } // Do the insert. deque.InsertRange(index, items); // Ensure the results are as expected. Assert.AreEqual(result, deque); } } }