Click here to Skip to main content
15,896,201 members
Articles / Programming Languages / C#

The List Trifecta, Part 1

Rate me:
Please Sign up or sign in to vote.
4.97/5 (21 votes)
20 May 2016LGPL321 min read 37.1K   161   40  
The A-list is an all-purpose list, a data structure that can support most standard list operation in O(log n) time and does lots of other stuff, too
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using NUnit.Framework;
using Loyc.Essentials;
using Loyc.Collections;

namespace Loyc.Collections.Impl
{
	/// <summary>A test class for unsorted list classes that implement IList{int} 
	/// and are cloneable, such as AList and DList.</summary>
	[TestFixture]
	public class ListTests<ListT> : ListCollectionTests<ListT> where ListT : IList<int>, IListSource<int>, ICloneable<ListT>
	{
		protected new Func<int, ListT> _newList;
		protected bool _testExceptions;

		public ListTests(bool testExceptions, Func<int, ListT> newListWithSize) : this(testExceptions, newListWithSize, Environment.TickCount) { }
		public ListTests(bool testExceptions, Func<int, ListT> newListWithSize, int randomSeed) 
			: base(() => newListWithSize(0), randomSeed, false)
		{
			_testExceptions = testExceptions;
			_newList = newListWithSize;
		}

		// Resolves the "ambiguity" between IListSource[i] and IList[i].
		protected static T At<T>(IListSource<T> list, int i) { return list[i]; }

		[Test]
		public void TestInsert()
		{
			ListT list = _newList(0);
			List<int> list2 = new List<int>();
			for (int i = 0; i < 128; i++) {
				int j = _r.Next(i + 1);
				list.Insert(j, i);
				list2.Insert(j, i);
				if ((i & (i - 1)) == 0) // check every power of 2
					ExpectList(list, list2, false);
			}
			ExpectList(list, list2, false);
		}

		[Test]
		public void TestRemoveAt()
		{
			const int InitialCount = 128;
			Assert.AreEqual(InitialCount / 4 * 4, InitialCount); // Multiple of 4
			int i, j;
			
			IList<int> list = _newList(InitialCount);
			Assert.AreEqual(InitialCount, Count(list));
			for (i = 0; i < Count(list); i++)
				list[i] = i;

			for (i = 0; i < Count(list); i++)
			{
				Assert.AreEqual(i * 2, list[i]);
				list.RemoveAt(i);
				Assert.AreEqual(i * 2 + 1, list[i]);
			}
			for (i = 0; i < Count(list); i++)
				Assert.AreEqual(i * 2 + 1, list[i]);

			Assert.AreEqual(InitialCount / 2, Count(list));
			i = 1;
			j = Count(list) * 2 - 1;
			while (Count(list) > 0)
			{
				Assert.AreEqual(j, list[Count(list)-1]);
				list.RemoveAt(Count(list) - 1);
				j -= 2;
				
				Assert.AreEqual(i, list[0]);
				list.RemoveAt(0);
				i += 2;
			}
			ExpectList((IListSource<int>)list);
		}

		[Test]
		public void TestEnumerator()
		{
			IList<int> list = _newList(StressTestIterations);
			int i;
			for (i = 0; i < Count(list); i++)
				list[i] = i;
			IEnumerator<int> e = list.GetEnumerator();
			for (i = 0; e.MoveNext(); i++)
				Assert.AreEqual(i, e.Current);
			Assert.AreEqual(Count(list), i);
			Assert.AreEqual(Count(list), StressTestIterations);
		}

		[Test]
		public void BasicWorkout()
		{
			ListT list = _newList(0);
			Assert.AreEqual(0, Count(list));
			Assert.That(!list.IsReadOnly);

			// Add(), RemoveAt(), Clone()
			list.Add(1);
			list.Add(2);
			Assert.That(!list.IsReadOnly);
			ExpectList(list, 1, 2);
			var list2 = list.Clone();
			list2.RemoveAt(1);
			list2.Add(3);
			ExpectList(list, 1, 2);
			ExpectList(list2, 1, 3);
			list.Add(4);
			ExpectList(list, 1, 2, 4);

			// Indexer, Insert(), GetEnumerator()
			list2.Insert(Count(list2), At(list2, 0));
			list2.Insert(Count(list2), At(list2, 1));
			ExpectList(list2, 1, 3, 1, 3);
			for (int i = 0; i < Count(list); i++)
				list2.Insert(i, At(list, i));
			ExpectList(list2, false, 1, 2, 4, 1, 3, 1, 3);
			ExpectList(list2, true,  1, 2, 4, 1, 3, 1, 3);

			// Clear list with Remove()
			Assert.That(list.Remove(1));
			ExpectList(list, 2, 4);
			Assert.That(list.Remove(2));
			Assert.That(list.Remove(4));
			Assert.That(Count(list) == 0);
			Assert.That(!list.Remove(2));
			Assert.That(!list.Remove(4));
		}

		[Test]
		public void BasicWorkout2()
		{
			var list = _newList(0);
			ExpectList(list, true);

			list = _newList(10);
			for (int i = 0; i < 10; i++)
				((IList<int>)list)[i] = (i+1)*2;
			ExpectList(list, true, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20);
			
			// CopyTo()
			var array = new int[Count(list)+2];
			list.CopyTo(array, 2);
			ExpectList(array.AsListSource(), true, 0, 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20);

			// IndexOf(), Contains()
			Assert.That(list.Contains(2));
			Assert.That(list.IndexOf(5) == -1);
			Assert.That(list.IndexOf(4) == 1);
			Assert.That(list.IndexOf(20) == 9);
			Assert.That(!list.Contains(3));
			Assert.That(At(list, list.IndexOf(2)) == 2);
			Assert.That(At(list, list.IndexOf(10)) == 10);
			Assert.That(At(list, list.IndexOf(20)) == 20);

			// Clear list with Remove()
			Assert.That(list.Remove(2));
			Assert.That(list.Remove(20));
			Assert.That(!list.Remove(20));
			Assert.That(!list.Remove(2));
			for (int i = 4; i <= 19; i++)
				Assert.AreEqual((i & 1) == 0, list.Remove(i));

			if (_testExceptions)
				AssertThrows<IndexOutOfRangeException>(delegate() { int x = At(list, 0); });

			// Equals(), GetHashCode(), Clear()
			Assert.That(!list.Equals("hello"));
			Assert.That(list.Equals(list));
			int hashCode = list.GetHashCode();
			list.Clear();
			foreach (int i in list)
				Assert.Fail("List not empty after Clear()");
			Assert.AreEqual(0, Count(list));

			if (_testExceptions)
				// Not really an exception test, but _testExceptions==false for
				// InternalList<int>, which cannot provide a consistent hashcode.
				Assert.AreEqual(hashCode, list.GetHashCode());
		}

		protected int StressTestIterations = 1000;

		[Test]
		public void StressTest()
		{
			ListT list = _newList(0), clone = default(ListT);
			List<int> list2 = new List<int>();
			int[] clone2 = null;

			// Do a series of Insert, Add, Remove and RemoveAt operations to both 
			// lists, and ensure that we get the same results.
			int i;
			for (i = 0; i < StressTestIterations; i++)
			{
				StressTestIteration(ref list, list2, i);

				if ((i & (i - 1)) == 0) // when i is a power of 2
				{
					ExpectList(list, false, list2.ToArray());
					ExpectList(list, true, list2.ToArray());
					
					if (_testExceptions)
						AssertThrows<IndexOutOfRangeException>(delegate() { list.RemoveAt(Count(list)); });
				}
				if (i == StressTestIterations/2)
				{
					clone = list.Clone();
					clone2 = list2.ToArray();
					ExpectList(list, clone2);
				}
			}

			i = 0;
			ExpectList(clone, false, clone2);
			ExpectList(clone, true, clone2);
		}

		// Note: list is passed by reference in case ListT is a value type (InternalList)
		protected virtual void StressTestIteration(ref ListT list, List<int> list2, int i)
		{
			int n = _r.Next(list2.Count + 1);
			list.Insert(n, i);
			list2.Insert(n, i);
			list.Add(i);
			list2.Add(i);

			Assert.AreEqual(list2.Count, Count(list));

			n = _r.Next(i * 2);
			Assert.AreEqual(list2.IndexOf(n), list.IndexOf(n));
			Assert.AreEqual(list2.Remove(n), list.Remove(n));

			if (n < list2.Count)
			{
				list.RemoveAt(n);
				list2.RemoveAt(n);
			}
		}
	}
}

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article, along with any associated source code and files, is licensed under The GNU Lesser General Public License (LGPLv3)


Written By
Software Developer None
Canada Canada
Since I started programming when I was 11, I wrote the SNES emulator "SNEqr", the FastNav mapping component, the Enhanced C# programming language (in progress), the parser generator LLLPG, and LES, a syntax to help you start building programming languages, DSLs or build systems.

My overall focus is on the Language of your choice (Loyc) initiative, which is about investigating ways to improve interoperability between programming languages and putting more power in the hands of developers. I'm also seeking employment.

Comments and Discussions