public ActivityContainer(string propertyName = nameof(ActivityContainer))
{
_propertyName = propertyName;
var sessionContainer = HttpContext.Current.Session[propertyName];
if (sessionContainer == null)
{
FixedActivities = new OrderedLinkedList <FixedActivity>(ComparableSequence.Asc, ComparableProperties.Name);
UnfixedActivities = new OrderedLinkedList <UnfixedActivity>(ComparableSequence.Asc, ComparableProperties.Name);
UndefinedActivities = new OrderedLinkedList <UndefinedActivity>(ComparableSequence.Asc, ComparableProperties.Name);
DeadlineActivities = new OrderedLinkedList <DeadlineActivity>(ComparableSequence.Asc, ComparableProperties.Name);
ActivitySelectedByUserForOptional = new OrderedLinkedList <Activity>(ComparableSequence.Asc, ComparableProperties.Name);
ActivitySelectedByUserForSure = new OrderedLinkedList <Activity>(ComparableSequence.Asc, ComparableProperties.Name);
FixedActivitiesSLI = new List <SelectListItem>();
UnfixedActivitiesSLI = new List <SelectListItem>();
UndefinedActivitiesSLI = new List <SelectListItem>();
DeadlineActivitiesSLI = new List <SelectListItem>();
CalendarEditorViewModel = new CalendarEditorViewModel();
Reset = true;
SelectedDate = null;
IsAsc = true;
Filter = new Filter();
}
else
{
Initialize(sessionContainer);
}
}
public void OrderedListRandomisedTest()
{
Random rnd = new Random();
int numOfElements = rnd.Next(100, 1000);
var list = new OrderedLinkedList();
//add in the numbers to the list
for (int i = 0; i < numOfElements; i++)
{
list.Add(rnd.Next(1, 10000));
}
//now, check them for orderedness
int iterations = 1;
var currentNode = list.Head();
var nextNode = list.GetNext();
while (currentNode.Next != null)
{
nextNode = list.GetNext();
if ((int)currentNode.Data > (int)nextNode.Data)
{
Assert.Fail();
}
iterations++;
currentNode = list.GetCurrentNode();
}
Assert.AreEqual(numOfElements, iterations + 1);
}
public void OrderedTestAddOneOutOfOrder()
{
var list = new OrderedLinkedList();
list.Add(5);
list.Add(7);
list.Add(9);
list.Add(8);
var headNode = list.Head();
Assert.IsNotNull(headNode);
Assert.AreEqual(5, headNode.Data);
Assert.IsNotNull(headNode.Next);
var currentNode = list.GetNext();
Assert.IsNotNull(currentNode);
Assert.AreEqual(7, currentNode.Data);
Assert.IsNotNull(currentNode.Next);
currentNode = list.GetNext();
Assert.IsNotNull(currentNode);
Assert.AreEqual(8, currentNode.Data);
Assert.IsNotNull(currentNode.Next);
currentNode = list.GetNext();
Assert.IsNotNull(currentNode);
Assert.AreEqual(9, currentNode.Data);
list.Add(1);
headNode = list.Head();
Assert.IsNotNull(headNode);
Assert.AreEqual(1, headNode.Data);
Assert.IsNotNull(headNode.Next);
currentNode = list.GetNext();
Assert.IsNotNull(currentNode);
Assert.AreEqual(5, currentNode.Data);
Assert.IsNotNull(currentNode.Next);
currentNode = list.GetNext();
Assert.IsNotNull(currentNode);
Assert.AreEqual(7, currentNode.Data);
Assert.IsNotNull(currentNode.Next);
currentNode = list.GetNext();
Assert.IsNotNull(currentNode);
Assert.AreEqual(8, currentNode.Data);
Assert.IsNotNull(currentNode.Next);
currentNode = list.GetNext();
Assert.IsNotNull(currentNode);
Assert.AreEqual(9, currentNode.Data);
}
public void TestMethod9()
{
OrderedLinkedList orderedLinkedList = new OrderedLinkedList();
orderedLinkedList.AddElement(56);
orderedLinkedList.AddElement(30);
orderedLinkedList.AddElement(40);
orderedLinkedList.AddElement(70);
Assert.AreEqual(30, orderedLinkedList.head.data);
}
public void OrderedTestAddInOrder()
{
var list = new OrderedLinkedList();
list.Add(5);
var headNode = list.Head();
Assert.IsNotNull(headNode);
Assert.AreEqual(5, headNode.Data);
var currentNode = list.GetNext();
Assert.AreEqual(currentNode, headNode);
list.Add(7);
headNode = list.Head();
Assert.IsNotNull(headNode);
Assert.AreEqual(5, headNode.Data);
currentNode = list.GetNext();
Assert.IsNotNull(currentNode);
Assert.AreEqual(7, currentNode.Data);
list.Add(9);
headNode = list.Head();
Assert.IsNotNull(headNode);
Assert.AreEqual(5, headNode.Data);
currentNode = list.GetNext();
Assert.IsNotNull(currentNode);
Assert.AreEqual(7, currentNode.Data);
currentNode = list.GetNext();
Assert.IsNotNull(currentNode);
Assert.AreEqual(9, currentNode.Data);
//remove Node test
currentNode = list.Head();
Assert.IsNotNull(currentNode);
Assert.AreEqual(5, currentNode.Data);
currentNode = list.GetNext();
Assert.IsNotNull(currentNode);
Assert.AreEqual(7, currentNode.Data);
list.RemoveCurrentNode();
currentNode = list.GetCurrentNode();
Assert.IsNotNull(currentNode);
Assert.AreEqual(9, currentNode.Data);
currentNode = list.Head();
Assert.AreEqual(5, currentNode.Data);
currentNode = list.GetNext();
Assert.AreEqual(9, currentNode.Data);
}
static void Main(string[] args)
{
UnorderedArrayList <int> u = new UnorderedArrayList <int>();
//insert function
int i = 5;
u.insert(ref i);
u.insert(ref i);
i = 6;
u.insert(ref i);
i = 7;
u.insert(ref i);
i = 5;
u.insert(ref i);
i = 5;
u.insert(ref i);
u.insert(ref i);
i = 13;
u.insert(ref i);
i = 9;
u.insert(ref i);
//show current array
Console.WriteLine("Current Array:");
u.print();
// removes all instances of 5
Console.WriteLine("Removing all 5s");
int var = 5;
u.removeall(ref var);
u.print();
//shows smallest and largest
Console.WriteLine("\nLargest: " + u.max());
Console.WriteLine("Smallesst: " + u.min());
//sorting
Console.WriteLine("\nSorted list:");
u.sort();
u.print();
//removing using the moving last element into the removed element...
Console.WriteLine("remove 7; becomes unsorted: ");
i = 7;
u.remove(ref i);
u.print();
Console.WriteLine("OrderedLinkedList Testing...");
OrderedLinkedList a = new OrderedLinkedList("cat");
a.insert(new OrderedLinkedList("dog"));
a.insert(new OrderedLinkedList("fish"));
a.insert(new OrderedLinkedList("bird"));
a.insert(new OrderedLinkedList("elephant"));
a.insert(new OrderedLinkedList("cactus"));
Console.WriteLine("OrderedLinkedList printing...");
a.print();
Console.WriteLine("OrderedLinkedList removing cat...");
a.remove(new OrderedLinkedList("cat"));
a.print();
Console.WriteLine("OrderedLinkedList adding int's and double's");
a.insert(new OrderedLinkedList(37));
a.insert(new OrderedLinkedList(3.55));
a.insert(new OrderedLinkedList(37.005));
a.print();
}
