public void Clear_FirstReturnsNull() { int[] numbers = new int[] { 1, 2, 3 }; foreach (int number in numbers) { _list.AddFirst(number); } _list.Clear(); Assert.That(_list.First, Is.Null); }
public void Clear_Length_Equal_0() { var list = new SingleLinkedList <string>("The", "Quick", "Brown"); list.Clear(); Assert.Equal(0, list.Length); }
public void Clear_First_Is_Null() { var list = new SingleLinkedList <string>("The", "Quick", "Brown"); list.Clear(); Assert.Null(list.First); }
public void SLL_ClearTest() { SingleLinkedList <int> list = new SingleLinkedList <int>(); list.Add(4); list.Add(3); Assert.AreEqual(2, list.Count); list.Clear(); Assert.AreEqual(0, list.Count); Assert.AreEqual(null, list.Head); list.Add(2); list.Add(1); list.Add(16); Assert.AreEqual(3, list.Count); list.Clear(); Assert.AreEqual(0, list.Count); Assert.AreEqual(null, list.Head); }
public void Clear_Test() { ILinkedList <char> linkedList = new SingleLinkedList <char>(); var a = linkedList.AddFirst('A'); var b = linkedList.AddFirst('B'); var c = linkedList.AddFirst('C'); var d = linkedList.AddFirst('D'); linkedList.Clear(); linkedList.First.Should().BeNull(); linkedList.Count.Should().Be(0); linkedList.IsEmpty.Should().BeTrue(); }
public void ClearTest() { SingleLinkedList <int> testList = new SingleLinkedList <int>(); testList.Add(0); testList.Add(1); testList.Add(2); testList.Clear(); Assert.AreEqual(0, testList.Count); Assert.IsFalse(testList.Contains(0)); }
public void SLL_Methods() { SingleLinkedList <int> list = new SingleLinkedList <int>(); list.Add(1); list.Insert(1, 0); var count = list.Count; var value = list.Get(0); var removed = list.Remove(); var last = list.RemoveLast(); var listString = list.ToString(); list.Clear(); var index = list.Search(1); }
public void SLL_TENCLEAR() { SingleLinkedList <int> list = new SingleLinkedList <int>(); list.Add(1); list.Add(2); list.Add(3); list.Add(4); list.Add(5); list.Add(6); list.Add(7); list.Add(8); list.Add(9); list.Add(10); list.Clear(); Assert.AreEqual("", list.ToString()); }
public void TestSingleLinkedList_Clear() { var list = new SingleLinkedList <int>(); var data = new[] { 1, 2, 3, 4, 5, 6, 7 }; foreach (var item in data) { list.Add(item); } var index = 0; foreach (var item in list) { Assert.IsTrue(item == data[index++]); } list.Clear(); Assert.IsTrue(list.Count == 0); }
public static void ReconstructNetwork() { Rooms = _rooms.ToArray(); _rooms.Clear(); for (int r = 0; r < Rooms.Length; r++) { Rooms[r].Init(); AI.RoomBreath(ref Rooms[r]); } RoomIndex = new int[TheGrid.size.x, TheGrid.size.y]; for (int y = 0; y < TheGrid.size.y; y++) { for (int x = 0; x < TheGrid.size.x; x++) { RoomIndex[x, y] = -1; int closest = int.MaxValue; for (int r = 0; r < Rooms.Length; r++) { if (Rooms[r].steps[x, y] < closest) { RoomIndex[x, y] = r; closest = Rooms[r].steps[x, y]; } } if (closest == int.MaxValue) { Debug.LogError("Room: ConstructNetwork: closest == int.maxvalue at gridpos (" + x + "," + y + ")"); } } } }
public void Clear() { datas.Clear(); }
public void Clear() { _items.Clear(); }
public void Clear() { _list.Clear(); }