public override bool Equals(Object c)
{
if (!(c is ConcreteSupplementaryAngles))
{
return(false);
}
ConcreteSupplementaryAngles cca = (ConcreteSupplementaryAngles)c;
//If this checks that the set of angles is equal to the set in question, I think it should work for supplementary sets the same as congruent sets
return(ca1.Equals(cca.ca1) && ca2.Equals(cca.ca2) || ca1.Equals(cca.ca2) && ca2.Equals(cca.ca1));
}
//TODO: this currently describes something else
// Intersect(X, Segment(A, B), Segment(C, D)) -> Congruent(Angle(A, X, C), Angle(B, X, D)),
// Congruent(Angle(A, X, D), Angle(C, X, B))
//
public static List<KeyValuePair<List<GroundedClause>, GroundedClause>> Instantiate(GroundedClause c)
{
//Exit if c is neither a parallel set nor an intersection
if (!(c is Parallel) && !(c is Intersection)) return new List<KeyValuePair<List<GroundedClause>, GroundedClause>>();
List<Intersection> foundCand = new List<Intersection>(); //Variable holding intersections that will used for theorem
Parallel foundParallelSet = null;
ConcreteSegment foundTransversal;
// The list of new grounded clauses if they are deduced
List<KeyValuePair<List<GroundedClause>, GroundedClause>> newGrounded = new List<KeyValuePair<List<GroundedClause>, GroundedClause>>();
if (c is Parallel)
{
Parallel newParallel = (Parallel)c;
candParallel.Add((Parallel)c);
//Create a list of all segments in the intersection list by individual segment and list of intersecting segments
var query1 = candIntersection.GroupBy(m => m.lhs, m => m.rhs).Concat(candIntersection.GroupBy(m => m.rhs, m => m.lhs));
//Iterate through all segments intersected by each key segment
foreach (var group in query1)
{
if (group.Contains(newParallel.segment1) && group.Contains(newParallel.segment2))
{
//If a segment that intersected both parallel lines was found, find the intersection objects.
var query2 = candIntersection.Where(m => m.lhs.Equals(group.Key)).Concat(candIntersection.Where(m => m.rhs.Equals(group.Key)));
var query3 = candIntersection.Where(m => m.lhs.Equals(newParallel.segment1) || m.lhs.Equals(newParallel.segment2) || m.rhs.Equals(newParallel.segment1) || m.rhs.Equals(newParallel.segment2));
foundCand.AddRange(query3);
foundParallelSet = newParallel;
foundTransversal = group.Key;
antecedent = Utilities.MakeList<GroundedClause>(newParallel); //Add parallel set to antecedents
}
}
}
else if (c is Intersection)
{
candIntersection.Add((Intersection)c);
Intersection newintersect = (Intersection)c;
var query1 = candIntersection.GroupBy(m => m.lhs, m => m.rhs).Concat(candIntersection.GroupBy(m => m.rhs, m => m.lhs));
foreach (Parallel p in candParallel)
{
foreach (var group in query1)
{
if (group.Contains(p.segment1) && group.Contains(p.segment2))
{
var query2 = candIntersection.Where(m => m.lhs.Equals(group.Key)).Concat(candIntersection.Where(m => m.rhs.Equals(group.Key)));
var query3 = candIntersection.Where(m => m.lhs.Equals(p.segment1) || m.lhs.Equals(p.segment2) || m.rhs.Equals(p.segment1) || m.rhs.Equals(p.segment2));
foundCand.AddRange(query3);
foundParallelSet = p;
foundTransversal = group.Key;
antecedent = Utilities.MakeList<GroundedClause>(p);
}
}
}
}
if (foundCand.Count() > 1)
{
antecedent.AddRange((IEnumerable<GroundedClause>)(foundCand)); //Add the two intersections to antecedent
ConcreteSupplementaryAngles cca1;
ConcreteSupplementaryAngles cca2;
int seg1index;
int seg2index;
//Match first and second intersection points with first and second segments
if (foundCand[0].lhs == foundParallelSet.segment1 || foundCand[0].rhs == foundParallelSet.segment1)
{
seg1index = 0;
seg2index = 1;
}
else
{
seg1index = 1;
seg2index = 0;
}
ConcreteAngle ang1Seg1 = new ConcreteAngle(foundParallelSet.segment1.Point1, foundCand[seg1index].intersect, foundCand[seg2index].intersect);
ConcreteAngle ang2Seg1 = new ConcreteAngle(foundParallelSet.segment1.Point2, foundCand[seg1index].intersect, foundCand[seg2index].intersect);
ConcreteAngle ang1Seg2 = new ConcreteAngle(foundParallelSet.segment2.Point1, foundCand[seg2index].intersect, foundCand[seg1index].intersect);
ConcreteAngle ang2Seg2 = new ConcreteAngle(foundParallelSet.segment2.Point2, foundCand[seg2index].intersect, foundCand[seg1index].intersect);
/*
ConcreteAngle ang1Set1 = new ConcreteAngle(foundCand[0].lhs.Point1, foundCand[0].intersect, foundCand[0].rhs.Point1);
ConcreteAngle ang2Set1 = new ConcreteAngle(foundCand[0].lhs.Point2, foundCand[0].intersect, foundCand[0].rhs.Point1);
ConcreteAngle ang1Set2 = new ConcreteAngle(foundCand[1].lhs.Point1, foundCand[1].intersect, foundCand[1].rhs.Point1);
ConcreteAngle ang2Set2 = new ConcreteAngle(foundCand[1].lhs.Point2, foundCand[1].intersect, foundCand[1].rhs.Point1);
*/
//Supplementary angles will be the matching angles on different segments
//TODO: Make sure they're on the same side
if (ang1Seg1.measure == ang1Seg2.measure)
{
cca1 = new ConcreteSupplementaryAngles(ang1Seg1, ang2Seg2, NAME);
cca2 = new ConcreteSupplementaryAngles(ang1Seg2, ang2Seg1, NAME);
}
else
{
cca1 = new ConcreteSupplementaryAngles(ang1Seg1, ang1Seg2, NAME);
cca2 = new ConcreteSupplementaryAngles(ang2Seg1, ang2Seg2, NAME);
}
//Add the two new supplementary angle sets
newGrounded.Add(new KeyValuePair<List<GroundedClause>, GroundedClause>(antecedent, cca1));
newGrounded.Add(new KeyValuePair<List<GroundedClause>, GroundedClause>(antecedent, cca2));
}
return newGrounded;
}