/// <summary>
/// Remove component from the components list
/// </summary>
/// <param name="comp"></param>
public void RemoveComponent(Component comp)
{
List <Link> toRemove = new List <Link>();
Component losesInput = null;
if (listLinks.Count != 0)
{
foreach (Link x in listLinks)
{
if (x.startComponent == comp)
{
//int counter = 0;
foreach (Component y in listComponents)
{
if (y == x.endComponent)
{
if (y is Input)
{
Input i = y as Input;
i.Clear();
//listComponents[counter] = i;
}
else if (y is OR)
{
OR i = y as OR;
i.Clear(x);
//listComponents[counter] = i;
}
else if (y is XOR)
{
XOR i = y as XOR;
i.Clear(x);
//listComponents[counter] = i;
}
else if (y is NOT)
{
NOT i = y as NOT;
i.Clear(x);
//listComponents[counter] = i;
}
else if (y is And)
{
And i = y as And;
i.Clear(x);
//listComponents[counter] = i;
}
}
//counter++;
}
toRemove.Add(x);
}
if (x.endComponent == comp)
{
//int counter = 0;
foreach (Component y in listComponents)
{
if (y == x.startComponent)
{
if (y is Output)
{
Output s = y as Output;
s.Clear();
//listComponents[counter] = s;
}
else if (y is OR)
{
OR s = y as OR;
s.Clear(x);
//listComponents[counter] = s;
}
else if (y is XOR)
{
XOR s = y as XOR;
s.Clear(x);
//listComponents[counter] = s;
}
else if (y is NOT)
{
NOT i = y as NOT;
i.Clear(x);
//listComponents[counter] = i;
}
else if (y is And)
{
And s = y as And;
s.Clear(x);
//listComponents[counter] = s;
}
}
}
toRemove.Add(x);
}
}
}
foreach (Link checkIfOutput in toRemove)
{
if (checkIfOutput.startComponent == comp)
{
losesInput = checkIfOutput.endComponent;
}
}
foreach (Link l1 in toRemove)
{
listLinks.Remove(l1);
}
// this.RemoveLink();
this.listComponents.Remove(comp);
if (losesInput != null)
{
losesInput.CalculateValue();
}
}
/// <summary>
/// Remove link from the links list
/// </summary>
/// <param name="comp"></param>
public void RemoveLink(Component comp)
{
// this.listLinks.Remove(l);
List <Link> toRemove = new List <Link>();
List <Component> compToClear = new List <Component>();
foreach (Link x in listLinks)
{
if (x.startComponent == comp)
{
int counter = 0;
foreach (Component y in listComponents)
{
if (y == x.endComponent)
{
if (y is Input)
{
Input s = y as Input;
s.Clear();
// listComponents[counter] = s;
}
else if (y is OR)
{
OR s = y as OR;
s.Clear(x);
// listComponents[counter] = s;
}
else if (y is XOR)
{
XOR s = y as XOR;
s.Clear(x);
// listComponents[counter] = s;
}
else if (y is NOT)
{
NOT i = y as NOT;
i.Clear(x);
listComponents[counter] = i;
}
else if (y is And)
{
And s = y as And;
s.Clear(x);
// listComponents[counter] = s;
}
}
counter++;
}
toRemove.Add(x);
compToClear.Add(x.startComponent);
compToClear.Add(x.endComponent);
}
if (x.endComponent == comp)
{
int counter = 0;
foreach (Component y in listComponents)
{
if (y == x.startComponent)
{
if (y is Output)
{
Output s = y as Output;
s.Clear();
// listComponents[counter] = s;
}
else if (y is OR)
{
OR s = y as OR;
s.Clear(x);
// listComponents[counter] = s;
}
else if (y is XOR)
{
XOR s = y as XOR;
s.Clear(x);
//listComponents[counter] = s;
}
else if (y is NOT)
{
NOT i = y as NOT;
i.Clear(x);
listComponents[counter] = i;
}
else if (y is And)
{
And s = y as And;
s.Clear(x);
//listComponents[counter] = s;
}
}
}
toRemove.Add(x);
compToClear.Add(x.startComponent);
compToClear.Add(x.endComponent);
}
}
foreach (var c in compToClear)
{
ClearSettings(c);
}
foreach (Link c1 in toRemove)
{
listLinks.Remove(c1);
}
}
/// <summary>
/// Add link to the links list
/// </summary>
/// <param name="link"></param>
public void AddLink(ref Link link)
{
if (link.startComponent is Input)
{
for (int i = 0; i < listComponents.Count; i++)
{
if (listComponents.ElementAt(i) == link.startComponent)
{
Input input = listComponents.ElementAt(i) as Input;
input.CalculateValue();
input.setOutput(ref link);
if (link != null)
{
listComponents[i] = input;
link.startComponent = input;
}
break;
}
}
}
else if (link.startComponent is OR)
{
for (int i = 0; i < listComponents.Count; i++)
{
if (listComponents.ElementAt(i) == link.startComponent)
{
OR or = listComponents.ElementAt(i) as OR;
or.CalculateValue();
or.setOutput(ref link);
if (link != null)
{
listComponents[i] = or;
link.startComponent = or;
}
break;
}
}
}
else if (link.startComponent is XOR)
{
for (int i = 0; i < listComponents.Count; i++)
{
if (listComponents.ElementAt(i) == link.startComponent)
{
XOR xor = listComponents.ElementAt(i) as XOR;
xor.CalculateValue();
xor.setOutput(ref link);
if (link != null)
{
listComponents[i] = xor;
link.startComponent = xor;
// this.listLinks.Add(con);
}
break;
}
}
}
else if (link.startComponent is NOT)
{
for (int i = 0; i < listComponents.Count; i++)
{
if (listComponents.ElementAt(i) == link.startComponent)
{
NOT not = listComponents.ElementAt(i) as NOT;
not.CalculateValue();
not.setOutput(ref link);
if (link != null)
{
listComponents[i] = not;
link.startComponent = not;
// this.listLinks.Add(con);
}
break;
}
}
}
else if (link.startComponent is And)
{
for (int i = 0; i < listComponents.Count; i++)
{
if (listComponents.ElementAt(i) == link.startComponent)
{
And and = listComponents.ElementAt(i) as And;
and.CalculateValue();
and.setOutput(ref link);
if (link != null)
{
listComponents[i] = and;
link.startComponent = and;
// this.listLinks.Add(con);
}
break;
}
}
}
if (link != null)
{
if (link.endComponent is And)
{
for (int i = 0; i < listComponents.Count; i++)
{
if (listComponents.ElementAt(i) == link.endComponent)
{
And and = listComponents.ElementAt(i) as And;
and.CalculateValue();
Rectangle r1 = new Rectangle(link.curvePoints[link.curvePoints.Count() - 1], new Size(2, 2));
if (r1.IntersectsWith(and.lowerLeft))
{
and.setLowInput(ref link);
if (link != null)
{
listComponents[i] = and;
link.endComponent = and;
if (and.Output != null)
{
foreach (Link x in listLinks)
{
if (x == and.Output)
{
x.value = and.outValue;
}
}
}
Link newLink = link;
this.listLinks.Add(newLink);
}
break;
}
else if (r1.IntersectsWith(and.upperLeft))
{
and.setUpInput(ref link);
if (link != null)
{
listComponents[i] = and;
link.endComponent = and;
if (and.Output != null)
{
foreach (Link x in listLinks)
{
if (x == and.Output)
{
x.value = and.outValue;
}
}
}
Link newLink = link;
this.listLinks.Add(newLink);
}
break;
}
}
}
}
else if (link.endComponent is Output)
{
for (int i = 0; i < listComponents.Count; i++)
{
if (listComponents.ElementAt(i) == link.endComponent)
{
Output o = listComponents.ElementAt(i) as Output;
o.CalculateValue();
o.setInput(ref link);
if (link != null)
{
listComponents[i] = o;
link.endComponent = o;
}
Link newLink = link;
this.listLinks.Add(newLink);
break;
}
}
}
else if (link.endComponent is OR)
{
for (int i = 0; i < listComponents.Count; i++)
{
if (listComponents.ElementAt(i) == link.endComponent)
{
OR or = listComponents.ElementAt(i) as OR;
or.CalculateValue();
Rectangle r1 = new Rectangle(link.curvePoints[link.curvePoints.Count() - 1], new Size(2, 2));
if (r1.IntersectsWith(or.lowerLeft))
{
or.setLowInput(ref link);
if (link != null)
{
listComponents[i] = or;
link.endComponent = or;
if (or.Output != null)
{
foreach (Link x in listLinks)
{
if (x == or.Output)
{
x.value = or.outValue;
}
}
}
Link newLink = link;
this.listLinks.Add(newLink);
}
break;
}
else if (r1.IntersectsWith(or.upperLeft))
{
or.setUpInput(ref link);
if (link != null)
{
listComponents[i] = or;
link.endComponent = or;
if (or.Output != null)
{
foreach (Link x in listLinks)
{
if (x == or.Output)
{
x.value = or.outValue;
}
}
}
Link newLink = link;
this.listLinks.Add(newLink);
}
break;
}
}
}
}
else if (link.endComponent is NOT)
{
for (int i = 0; i < listComponents.Count; i++)
{
if (listComponents.ElementAt(i) == link.endComponent)
{
NOT not = listComponents.ElementAt(i) as NOT;
not.CalculateValue();
Rectangle r1 = new Rectangle(link.curvePoints[link.curvePoints.Count() - 1], new Size(2, 2));
if (r1.IntersectsWith(not.inLeft))
{
not.setUpInput(ref link);
if (link != null)
{
listComponents[i] = not;
link.endComponent = not;
if (not.Output != null)
{
foreach (Link x in listLinks)
{
if (x == not.Output)
{
x.value = not.outValue;
}
}
}
Link newLink = link;
this.listLinks.Add(newLink);
}
break;
}
}
}
}
else if (link.endComponent is XOR)
{
for (int i = 0; i < listComponents.Count; i++)
{
if (listComponents.ElementAt(i) == link.endComponent)
{
XOR xor = listComponents.ElementAt(i) as XOR;
xor.CalculateValue();
Rectangle r1 = new Rectangle(link.curvePoints[link.curvePoints.Count() - 1], new Size(2, 2));
if (r1.IntersectsWith(xor.lowerLeft))
{
xor.setLowInput(ref link);
if (link != null)
{
listComponents[i] = xor;
link.endComponent = xor;
if (xor.Output != null)
{
foreach (Link x in listLinks)
{
if (x == xor.Output)
{
x.value = xor.outValue;
}
}
}
Link newLink = link;
this.listLinks.Add(newLink);
}
break;
}
else if (r1.IntersectsWith(xor.upperLeft))
{
xor.setUpInput(ref link);
if (link != null)
{
listComponents[i] = xor;
link.endComponent = xor;
if (xor.Output != null)
{
foreach (Link x in listLinks)
{
if (x == xor.Output)
{
x.value = xor.outValue;
}
}
}
Link newLink = link;
this.listLinks.Add(newLink);
}
break;
}
}
}
}
}
}