public void RandomInsertDeleteRange() { const int ITER = 2000, LOOP = 15; Random rand = new Random(13); for (int loop = 0; loop < LOOP; ++loop) { Deque <int> deque = new Deque <int>(); List <int> list = new List <int>(); for (int iter = 0; iter < ITER; ++iter) { //Console.Write("Loop {0}, Iteration {1}: ", loop, iter); if (rand.Next(100) < 45) { // remove a range. if (list.Count > 0) { int index = rand.Next(list.Count); int count = rand.Next(list.Count - index); //Console.WriteLine("RemoveAt({0}, {1})", index, count); list.RemoveRange(index, count); deque.RemoveRange(index, count); } } else { // Add an range. int index = rand.Next(list.Count + 1); int count = rand.Next(10); int[] items = new int[count]; for (int i = 0; i < count; ++i) { items[i] = rand.Next(1000); } /*Console.Write("Insert({0}, {{", index); * for (int i = 0; i < count; ++i) { * if (i > 0) * Console.Write(", "); * Console.Write(items[i]); * } * Console.WriteLine("})"); */ IEnumerable <int> e = (rand.Next(2) == 0) ? AlgorithmsTests.EnumerableFromArray(items) : items; list.InsertRange(index, e); deque.InsertRange(index, e); } //deque.Print(); CheckListAndDeque(list, deque); } InterfaceTests.TestReadWriteList(deque, list.ToArray()); } }
public void IListInterface() { Deque <string> d = new Deque <string>(); d.AddToFront("foo"); d.AddToBack("world"); d.AddToFront("hello"); d.AddToBack("elvis"); d.AddToFront("elvis"); d.AddToBack(null); d.AddToFront("cool"); InterfaceTests.TestReadWriteList((IList)d, new string[] { "cool", "elvis", "hello", "foo", "world", "elvis", null }); }
public void RandomInsertDelete() { const int ITER = 2000, LOOP = 15; Random rand = new Random(13); for (int loop = 0; loop < LOOP; ++loop) { Deque <int> deque = new Deque <int>(); List <int> list = new List <int>(); for (int iter = 0; iter < ITER; ++iter) { //Console.Write("Loop {0}, Iteration {1}: ", loop, iter); if (rand.Next(100) < 45) { // remove an item. if (list.Count > 0) { int index = rand.Next(list.Count); //Console.WriteLine("RemoveAt({0})", index); list.RemoveAt(index); deque.RemoveAt(index); } } else { // Add an item. int item = rand.Next(1, 1000); int index = rand.Next(list.Count + 1); //Console.WriteLine("Insert({0}, {1})", index, item); list.Insert(index, item); deque.Insert(index, item); } //deque.Print(); CheckListAndDeque(list, deque); } InterfaceTests.TestReadWriteList(deque, list.ToArray()); } }
public void RandomAddRemoveFrontBack() { const int ITER = 2000, LOOP = 15; Random rand = new Random(13); for (int loop = 0; loop < LOOP; ++loop) { Deque <int> deque = new Deque <int>(); List <int> list = new List <int>(); for (int iter = 0; iter < ITER; ++iter) { //Console.Write("Loop {0}, Iteration {1}: ", loop, iter); if (rand.Next(100) < 45 && list.Count > 0) { int r = rand.Next(10); if (r < 4) { //Console.WriteLine("RemoveFront()"); int removedList = list[0]; list.RemoveAt(0); int removedDeque = deque.RemoveFromFront(); Assert.AreEqual(removedList, removedDeque); } else if (r < 8) { //Console.WriteLine("RemoveBack()"); int removedList = list[list.Count - 1]; list.RemoveAt(list.Count - 1); int removedDeque = deque.RemoveFromBack(); Assert.AreEqual(removedList, removedDeque); } else { int index = rand.Next(list.Count); //Console.WriteLine("RemoveAt({0})", index); list.RemoveAt(index); deque.RemoveAt(index); } } else { int r = rand.Next(10); int item = rand.Next(1, 1000); if (r < 4) { //Console.WriteLine("AddFront({0})", item); list.Insert(0, item); deque.AddToFront(item); } else if (r < 8) { //Console.WriteLine("AddBack({0})", item); list.Add(item); deque.AddToBack(item); } else { // Add an item. int index = rand.Next(list.Count + 1); //Console.WriteLine("Insert({0}, {1})", index, item); list.Insert(index, item); deque.Insert(index, item); } } //deque.Print(); CheckListAndDeque(list, deque); } InterfaceTests.TestReadWriteList(deque, list.ToArray()); } }