public static SortedPosList operator -(SortedPosList a, SortedPosList b)
{
int clonedIndex = 0;
int bIndex = 0;
SortedPosList clonedList = a.Clone();
while (clonedIndex < clonedList.Count() && bIndex < b.Count())
{
if (clonedList[clonedIndex].Equals(b[bIndex]))
{
clonedList.Remove(clonedList[clonedIndex]);
}
else
{
if (clonedList[clonedIndex].Length() >= b[bIndex].Length())
{
bIndex++;
}
else
{
clonedIndex++;
}
}
}
return(clonedList);
}
//Tests
private static void pathTest()
{
// Testing a list connected to a path.
// Save / Load / Parse method tested
SortedPosList listWithPath = new SortedPosList(@"c:\users\willi\Documents\test.txt");
Position posM = new Position(123, 37);
Position posN = new Position(14, 55);
Position posK = new Position(3, 69);
listWithPath.Add(posM);
listWithPath.Add(posN);
listWithPath.Add(posK);
Console.WriteLine("List with path: ");
for (int i = 0; i < listWithPath.Count(); i++)
{
Console.WriteLine(listWithPath[i].ToString());
}
listWithPath.Remove(posM);
Console.WriteLine("List with path after remove: ");
for (int i = 0; i < listWithPath.Count(); i++)
{
Console.WriteLine(listWithPath[i].ToString());
}
//List without path set
SortedPosList withoutPath = new SortedPosList();
Position poss = new Position(100, 100);
withoutPath.Add(new Position(110, 900));
withoutPath.Add(new Position(50, 10));
withoutPath.Add(poss);
withoutPath.Remove(poss);
Console.WriteLine("Without Path: ");
//Should return a list of 2. 3 added and 1 removed
for (int i = 0; i < withoutPath.Count(); i++)
{
Console.WriteLine(withoutPath[i].ToString());
}
}
private static void WillTest()
{
//Egna tester. Operatorer
Position pos1 = new Position(47, 14);
Position pos2 = new Position(10, 18);
Position pos3 = new Position(80, 64);
Position pos4 = new Position(12, 5);
Position pos5 = new Position(52, 14);
Position pos6 = new Position(90, 14);
Position pos7 = new Position(10, 18);
Position pos8 = new Position(80, 64);
Position pos9 = new Position(122, 5);
Position pos10 = new Position(13, 14);
SortedPosList list = new SortedPosList();
list.Add(pos1);
list.Add(pos2);
list.Add(pos3);
list.Add(pos4);
list.Add(pos5);
SortedPosList list2 = new SortedPosList();
list2.Add(pos6);
list2.Add(pos7);
list2.Add(pos8);
list2.Add(pos9);
list2.Add(pos10);
SortedPosList list3 = list - list2;
SortedPosList list4 = list2 + list;
list.Remove(new Position(80, 64));
list.Remove(new Position(10, 10));
list.Remove(new Position(10, 11));
// skriver ut list - list2
Console.WriteLine("list - list2 : ");
for (int i = 0; i < list3.Count(); i++)
{
Console.WriteLine(list3[i].ToString() + ". Length: " + list3[i].Length());
}
// skriver ut list2 + list
Console.WriteLine("list2 + list : ");
for (int i = 0; i < list4.Count(); i++)
{
Console.WriteLine(list4[i].ToString() + ". Length list 2 : " + list4[i].Length());
}
}
public SortedPosList CircleContent(Position centerPos, double radius)
{
SortedPosList clone = SortedPosListClone();
for (int i = 0; i < clone.Count(); i++)
{
if (centerPos % clone.positions[i] > radius)
{
clone.Remove(clone.positions[i]);
i--;
}
}
return(clone);
}
// Returns a new sorted list containing all positions that aren't shared
// between the two provided lists
// sp1 - the first sorted list of Positions
// sp2 - the second sorted list of Positions
public static SortedPosList operator -(SortedPosList list1, SortedPosList list2)
{
SortedPosList comboList = list1 + list2;
SortedPosList result = list1.Clone();
for (int i = 0; i + 1 < comboList.Count(); i++)
{
if (comboList[i].Equals(comboList[i + 1]))
{
//Console.WriteLine($"Found same values: {comboList[i]} and {comboList[i + 1]}");
result.Remove(comboList[i]);
}
else
{
// Console.WriteLine($"Not The same: {comboList[i]} and {comboList[i + 1]}");
}
}
return(result);
}
static void Main(string[] args)
{
/*
* //Creates two positions and uses + on them. Returns a new position with added values from both.
* Console.WriteLine(new Position(2, 4) + new Position(1, 2) + "\n");
*
* //Creates two positions and uses - on them. Returns a new position with subtracted values from both. Cannot be negative tho.
* Console.WriteLine(new Position(2, 4) - new Position(1, 2) + "\n");
*
* //Creates two positions and uses - on them. Returns a new position with subtracted values from both. Cannot be negative tho.
* Console.WriteLine(new Position(1, 2) - new Position(3, 6) + "\n");
*
* //Creates two positions and uses % on them. Returns the length between them.
* Console.WriteLine(new Position(3, 5) % new Position(1, 3) + "\n");
*
* SortedPosList list1 = new SortedPosList();
* SortedPosList list2 = new SortedPosList();
* list1.Add(new Position(3, 7));
* list1.Add(new Position(1, 4));
* list1.Add(new Position(2, 6));
* list1.Add(new Position(2, 3));
* Console.WriteLine(list1 + "\n");
* list1.Remove(new Position(2, 6));
* Console.WriteLine(list1 + "\n");
*
* list2.Add(new Position(3, 7));
* list2.Add(new Position(1, 2));
* list2.Add(new Position(3, 6));
* list2.Add(new Position(2, 3));
* Console.WriteLine((list2 + list1) + "\n");
*
* SortedPosList circleList = new SortedPosList();
* circleList.Add(new Position(1, 1));
* circleList.Add(new Position(2, 2));
* circleList.Add(new Position(3, 3));
* Console.WriteLine(circleList.CircleContent(new Position(5, 5), 4) + "\n");
*/
/*
* SortedPosList list1 = new SortedPosList();
* SortedPosList list2 = new SortedPosList();
* list1.Add(new Position(3, 7));
* list1.Add(new Position(1, 4));
* list1.Add(new Position(2, 6));
* list1.Add(new Position(2, 3));
*
* list2.Add(new Position(3, 7));
* list2.Add(new Position(1, 2));
* list2.Add(new Position(3, 6));
* list2.Add(new Position(2, 3));
*
* Console.WriteLine("List2" + list2);
*
* Console.WriteLine("List1 before circle: " + list1);
* SortedPosList s3 = list1.CircleContent(new Position(7, 5), 5);
* Console.WriteLine("List1 after circle: " + s3); */
Position p1 = new Position(2, 4);
Position p2 = new Position(4, 2);
Console.WriteLine($"P1: {p1}");
Console.WriteLine($"P2: {p2}");
Console.WriteLine(p1.Length());
Console.WriteLine(p1.Equals(p2));
Position p3 = p2.Clone();
Console.WriteLine($"P3: {p3}");
Console.WriteLine(p1);
Console.WriteLine(p1 > p2);
Console.WriteLine(p1 < p2);
Console.WriteLine(p1 + p2);
Console.WriteLine(p1 - p2);
Console.WriteLine(p1 % p2);
SortedPosList sp1 = new SortedPosList();
SortedPosList sp2 = new SortedPosList();
sp1.Add(new Position(2, 4));
sp1.Add(new Position(3, 5));
sp1.Add(new Position(1, 5));
sp1.Add(new Position(1, 1));
sp2.Add(new Position(2, 2));
sp2.Add(new Position(5, 5));
sp1.Add(p1);
Console.WriteLine(sp1.ToString());
Console.WriteLine(sp1.Count());
sp1.Remove(p1);
Console.WriteLine(sp1);
SortedPosList sp3 = sp1.Clone();
Console.WriteLine(sp3);
SortedPosList sp4 = sp1.CircleContent(new Position(5, 5), 4);
Console.WriteLine(sp4);
Console.WriteLine(sp1 + sp2);
Console.WriteLine(sp1[1]);
Console.WriteLine(sp1 * sp2);
}
