public void TestEmptyListOperations()
{
VList <int> a = new VList <int>();
VList <int> b = new VList <int>();
a.AddRange(b);
a.InsertRange(0, b);
a.RemoveRange(0, 0);
Assert.That(!a.Remove(0));
Assert.That(a.IsEmpty);
a.Add(1);
b.AddRange(a);
ExpectList(b, 1);
b.RemoveAt(0);
Assert.That(b.IsEmpty);
b.InsertRange(0, a);
ExpectList(b, 1);
b.RemoveRange(0, 1);
Assert.That(b.IsEmpty);
b.Insert(0, a[0]);
ExpectList(b, 1);
b.Remove(a.Last);
Assert.That(b.IsEmpty);
AssertThrows <InvalidOperationException>(delegate() { a.NextIn(b); });
}
public void TestToArray()
{
VList <int> list = new VList <int>();
int[] array = list.ToArray();
Assert.AreEqual(array.Length, 0);
array = list.Add(1).ToArray();
ExpectList(array, 1);
array = list.Add(2).ToArray();
ExpectList(array, 1, 2);
array = list.Add(3).ToArray();
ExpectList(array, 1, 2, 3);
array = list.AddRange(new int[] { 4, 5, 6, 7, 8 }).ToArray();
ExpectList(array, 1, 2, 3, 4, 5, 6, 7, 8);
}
public void SimpleTests()
{
// In this simple test, I only add and remove items from the back
// of a VList, but forking is also tested.
VList <int> list = new VList <int>();
Assert.That(list.IsEmpty);
// Adding to VListBlockOfTwo
list = new VList <int>(10, 20);
ExpectList(list, 10, 20);
list = new VList <int>();
list.Add(1);
Assert.That(!list.IsEmpty);
list.Add(2);
ExpectList(list, 1, 2);
// A fork in VListBlockOfTwo. Note that list2 will use two VListBlocks
// here but list will only use one.
VList <int> list2 = list.WithoutLast(1);
list2.Add(3);
ExpectList(list, 1, 2);
ExpectList(list2, 1, 3);
// Try doubling list2
list2.AddRange(list2);
ExpectList(list2, 1, 3, 1, 3);
// list now uses two arrays
list.Add(4);
ExpectList(list, 1, 2, 4);
// Try doubling list using a different overload of AddRange()
list.AddRange((IList <int>)list);
ExpectList(list, 1, 2, 4, 1, 2, 4);
list = list.WithoutLast(3);
ExpectList(list, 1, 2, 4);
// Remove(), Pop()
Assert.AreEqual(3, list2.Pop());
ExpectList(list2, 1, 3, 1);
Assert.That(!list2.Remove(0));
Assert.AreEqual(1, list2.Pop());
Assert.That(list2.Remove(3));
ExpectList(list2, 1);
Assert.That(list2.Remove(1));
ExpectList(list2);
AssertThrows <Exception>(delegate() { list2.Pop(); });
// Add many, SubList(). This will fill 3 arrays (sizes 8, 4, 2) and use
// 1 element of a size-16 array. Oh, and test the enumerator.
for (int i = 5; i <= 16; i++)
{
list.Add(i);
}
ExpectList(list, 1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16);
list2 = list.WithoutLast(6);
ExpectListByEnumerator(list2, 1, 2, 4, 5, 6, 7, 8, 9, 10);
AssertThrows <IndexOutOfRangeException>(delegate() { int i = list[-1]; });
AssertThrows <IndexOutOfRangeException>(delegate() { int i = list[15]; });
// IndexOf, contains
Assert.That(list.Contains(11));
Assert.That(!list2.Contains(11));
Assert.That(list[list.IndexOf(2)] == 2);
Assert.That(list[list.IndexOf(1)] == 1);
Assert.That(list[list.IndexOf(15)] == 15);
Assert.That(list.IndexOf(3) == -1);
// PreviousIn(), Back
VList <int> list3 = list2;
Assert.AreEqual(11, (list3 = list3.NextIn(list)).Last);
Assert.AreEqual(12, (list3 = list3.NextIn(list)).Last);
Assert.AreEqual(13, (list3 = list3.NextIn(list)).Last);
Assert.AreEqual(14, (list3 = list3.NextIn(list)).Last);
Assert.AreEqual(15, (list3 = list3.NextIn(list)).Last);
Assert.AreEqual(16, (list3 = list3.NextIn(list)).Last);
AssertThrows <Exception>(delegate() { list3.NextIn(list); });
// Next
Assert.AreEqual(10, (list3 = list3.WithoutLast(6)).Last);
Assert.AreEqual(9, (list3 = list3.Tail).Last);
Assert.AreEqual(8, (list3 = list3.Tail).Last);
Assert.AreEqual(7, (list3 = list3.Tail).Last);
Assert.AreEqual(6, (list3 = list3.Tail).Last);
Assert.AreEqual(5, (list3 = list3.Tail).Last);
Assert.AreEqual(4, (list3 = list3.Tail).Last);
Assert.AreEqual(2, (list3 = list3.Tail).Last);
Assert.AreEqual(1, (list3 = list3.Tail).Last);
Assert.That((list3 = list3.Tail).IsEmpty);
// list2 is still the same
ExpectList(list2, 1, 2, 4, 5, 6, 7, 8, 9, 10);
// ==, !=, Equals(), AddRange(a, b)
Assert.That(!list2.Equals("hello"));
list3 = list2;
Assert.That(list3.Equals(list2));
Assert.That(list3 == list2);
// This AddRange forks the list. List2 ends up with block sizes 8 (3
// used), 8 (3 used), 4, 2.
list2.AddRange(list2, list2.WithoutLast(3));
ExpectList(list2, 1, 2, 4, 5, 6, 7, 8, 9, 10, 8, 9, 10);
Assert.That(list3 != list2);
// List3 is a sublist of list, but list2 no longer is
Assert.That(list3.NextIn(list).Last == 11);
AssertThrows <InvalidOperationException>(delegate() { list2.NextIn(list); });
list2 = list2.WithoutLast(3);
Assert.That(list3 == list2);
}
public void SelectManyTests()
{
// Plan: make a series of lists of different lengths and transform them
// semi-randomly, but do the same transformation on a regular list. Then
// ensure that the VList came out the same as the plain List.
//
// Note: this test isn't included in FVListTests because the FVList.Smart
// methods act in "reverse order" compared to the LINQ methods Select/Where/etc.
// so the results wouldn't be the same between List<int> and FVList<int>.
int initialLength = 0, trial = -1;
string subtest = "";
int same = 0, pattern = 0;
try {
for (initialLength = 0; initialLength < 100; initialLength++)
{
trial = -1;
VList <int> vlist = VList <int> .Empty;
List <int> list = new List <int>();
for (int i = 0; i < initialLength; i++)
{
vlist.Add(i);
list.Add(i);
}
// First, ensure that if the list is not changed, the same list comes out
subtest = "unchanged";
Assert.AreEqual(vlist, vlist.SmartSelect(i => i));
Assert.IsTrue(vlist == vlist.SmartSelect(i => i));
Assert.AreEqual(vlist, vlist.SmartWhere(i => true));
Assert.IsTrue(vlist == vlist.SmartWhere(i => true));
Assert.AreEqual(vlist, vlist.SmartSelectMany(i => new[] { i }));
Assert.IsTrue(vlist == vlist.SmartSelectMany(i => new[] { i }));
for (trial = 0; trial < (initialLength.IsInRange(1, 10) ? 4 : 1); trial++)
{
// Number of items to keep the same at the beginning of the transform
same = initialLength == 0 ? 0 : _r.Next(8) % initialLength;
pattern = _r.Next();
int index = 0;
Func <int, int> select = n => ++ index <= same ? n : n + 1000;
Func <int, bool> where = n => ++ index <= same * 2 || ((pattern >> (index & 31)) & 1) == 0;
Func <int, IList <int> > selectMany = n =>
{
var @out = new List <int>();
if (index < same)
{
@out.Add(n);
}
else
{
for (int i = 0; i < ((pattern >> (index & 15)) & 3); i++)
{
@out.Add(index * 1000 + i);
}
}
index++;
return(@out);
};
Func <int, IEnumerable <int> > selectManyE = n => selectMany(n);
subtest = "SmartSelect";
var expectS = list.Select(select); index = 0;
var resultS = vlist.SmartSelect(select); index = 0;
ExpectList(resultS, expectS);
subtest = "SmartWhere";
var expectW = list.Where(where); index = 0;
var resultW = vlist.SmartWhere(where); index = 0;
ExpectList(resultW, expectW);
subtest = "SmartSelectMany";
var expectM = list.SelectMany(selectManyE); index = 0;
var resultM = vlist.SmartSelectMany(selectMany); index = 0;
ExpectList(resultM, expectM);
}
}
} catch (Exception e) {
e.Data["subtest"] = subtest;
e.Data["initialLength"] = initialLength;
e.Data["trial"] = trial;
e.Data["same"] = same;
e.Data["pattern"] = pattern;
throw;
}
}