public void ThrowsOutOfIndex()
{
// Arrange
var sut = new SpecialLinkedList <string>();
// Act
// Assert
var item = sut[0];
}
public void CanAddMember()
{
// Arrange
var sut = new SpecialLinkedList <string>();
// Act
sut.Add("Test");
// Assert
Assert.AreEqual(1, sut.Count);
}
public void CanPrintEmptyList()
{
// Arrange
var sut = new SpecialLinkedList <int>();
// Act
// Assert
Assert.AreEqual("", sut.ToString());
Assert.AreEqual("", sut.ToStringReverse());
}
public void RetrievesMembersByIndex()
{
var sut = new SpecialLinkedList <string>();
var item = "Test";
// Act
sut.Add(item);
// Assert
Assert.AreEqual(item, sut[0]);
}
public void SupportsNullValues()
{
// Arrange
var sut = new SpecialLinkedList <string>();
sut.Add(null);
// Act
// Assert
Assert.AreEqual("", sut.ToString());
Assert.AreEqual("", sut.ToStringReverse());
}
public void CanSetHeadElement()
{
// Arrange
var sut = new SpecialLinkedList <string>();
var item = "Test";
// Act
sut.Add(item);
// Assert
Assert.AreEqual(item, sut.Head);
}
public void CanRemoveMemberByIndex()
{
// Arrange
var sut = new SpecialLinkedList <string>();
var item = "Test";
// Act
sut.Add(item);
sut.RemoveAt(0);
// Assert
Assert.AreEqual(0, sut.Count);
}
public void CanPrintMembersReverse()
{
// Arrange
var sut = new SpecialLinkedList <int>();
// Act
sut.Add(1);
sut.Add(2);
sut.Add(3);
sut.Add(5);
sut.Add(7);
// Assert
Assert.AreEqual("7,5,3,2,1", sut.ToString());
}
public void CanPrintMembers()
{
// Arrange
var sut = new SpecialLinkedList <int>();
// Act
sut.Add(1);
sut.Add(2);
sut.Add(3);
sut.Add(5);
sut.Add(7);
// Assert
Assert.AreEqual("1,2,3,5,7", sut.ToString()); //fixed ToStringReverse() method to ToString()
}
public void CanLoopUsingForeach()
{
// Arrange
var sut = new SpecialLinkedList <int>();
// Act
sut.Add(1);
sut.Add(2);
sut.Add(3);
// Assert
foreach (var item in sut)
{
Assert.AreNotEqual(null, item);
}
}
static void Main(string[] args)
{
// Congratulations, you need to implement our empty datastructure but not change the contracts and you cannot use already existing LinkedList class in .NET
// make sure all tests are green (do not edit tests)
// find and fix any bugs you encounter
// create a list here
// add 100 random members to it
// print all 100 members to console
var list = new SpecialLinkedList <int>();
Random rnd = new Random();
for (int i = 0; i < 100; i++)
{
list.Add(rnd.Next());
}
Console.WriteLine(list.ToString());
}
