public void TINHeapTests_CheckConsistency2()
{
TINHeap heap = new TINHeap(1234);
GridToTINTriangle tri1 = new GridToTINTriangle(new TriVertex(1, 2, 0), new TriVertex(2, 2, 0), new TriVertex(2, 1, 0));
GridToTINTriangle tri2 = new GridToTINTriangle(new TriVertex(2, 1, 0), new TriVertex(1, 2, 0), new TriVertex(2, 2, 0));
GridToTINTriangle tri3 = new GridToTINTriangle(new TriVertex(0, 0, 0), new TriVertex(1, 2, 0), new TriVertex(3, 3, 0));
heap.Insert(tri1, 12.34);
heap.Insert(tri2, 34.56);
// This will succeed
foreach (var node in heap)
{
heap.CheckConsistency2(node.Tri);
}
// Mangle the triangel references
// foreach (var node in heap)
// node.Tri = tri3;
// This will fail
Action act = () => heap.CheckConsistency2(tri3);
act.Should().Throw <TRexException>().WithMessage("Triangle is not in the heap");
Assert.True(true);
}
public void TINHeapTests_CheckListConsistency()
{
TINHeap heap = new TINHeap(1234);
GridToTINTriangle tri1 = new GridToTINTriangle(new TriVertex(10, 20, 0), new TriVertex(20, 20, 0), new TriVertex(20, 10, 0));
GridToTINTriangle tri2 = new GridToTINTriangle(new TriVertex(20, 10, 0), new TriVertex(10, 20, 0), new TriVertex(20, 20, 0));
heap.Insert(tri1, 12.34);
heap.Insert(tri2, 34.56);
// This will fail
Action act = () => heap.CheckListConsistency();
act.Should().Throw <TRexException>().WithMessage("Tri does not contain heap location");
// Move the insertion point outside of a triangle in the heap node
foreach (var node in heap)
{
var centroid = node.Tri.Centroid();
node.sx = (int)Math.Truncate(centroid.X);
node.sy = (int)Math.Truncate(centroid.Y);
}
// This will succeed
heap.CheckListConsistency();
Assert.True(true);
}
public void TINHeapTests_CheckConsistency()
{
TINHeap heap = new TINHeap(1234);
GridToTINTriangle tri1 = new GridToTINTriangle(new TriVertex(1, 2, 0), new TriVertex(2, 2, 0), new TriVertex(2, 1, 0));
GridToTINTriangle tri2 = new GridToTINTriangle(new TriVertex(2, 1, 0), new TriVertex(1, 2, 0), new TriVertex(2, 2, 0));
GridToTINTriangle tri3 = new GridToTINTriangle(new TriVertex(0, 0, 0), new TriVertex(1, 2, 0), new TriVertex(3, 3, 0));
heap.Insert(tri1, 12.34);
heap.Insert(tri2, 34.56);
// This will succeed
heap.CheckConsistency();
// Mangle the HeapIndexes
foreach (var node in heap)
{
node.Tri.HeapIndex = 1000;
}
// This will fail
Action act = () => heap.CheckConsistency();
act.Should().Throw <TRexException>().WithMessage("Inconsistent heap indexing");
Assert.True(true);
}
public void TINHeapTests_CreationWithCapacity()
{
TINHeap heap = new TINHeap(1234);
Assert.True(heap != null);
Assert.True(heap.Capacity == 1234);
}
public void TINHeapTests_Top()
{
TINHeap heap = new TINHeap(1234);
GridToTINTriangle tri1 = new GridToTINTriangle(new TriVertex(1, 2, 0), new TriVertex(2, 2, 0), new TriVertex(2, 1, 0));
GridToTINTriangle tri2 = new GridToTINTriangle(new TriVertex(2, 1, 0), new TriVertex(1, 2, 0), new TriVertex(2, 2, 0));
heap.Insert(tri1, 12.34);
heap.Insert(tri2, 34.56);
Assert.True(heap.Top == heap[0]);
Assert.True(heap.Top.Tri == tri2);
}
public void TINHeapTests_Extract()
{
TINHeap heap = new TINHeap(1234);
GridToTINTriangle tri1 = new GridToTINTriangle(new TriVertex(1, 2, 0), new TriVertex(2, 2, 0), new TriVertex(2, 1, 0));
GridToTINTriangle tri2 = new GridToTINTriangle(new TriVertex(2, 1, 0), new TriVertex(1, 2, 0), new TriVertex(2, 2, 0));
heap.Insert(tri1, 12.34);
heap.Insert(tri2, 34.56);
Assert.True(heap.Extract().Import == 34.56);
Assert.True(heap.Count == 1, "Count not one after extracting element from heap");
}
public void TINHeapTests_Kill_FirstNode()
{
TINHeap heap = new TINHeap(1234);
GridToTINTriangle tri1 = new GridToTINTriangle(new TriVertex(1, 2, 0), new TriVertex(2, 2, 0), new TriVertex(2, 1, 0));
GridToTINTriangle tri2 = new GridToTINTriangle(new TriVertex(2, 1, 0), new TriVertex(1, 2, 0), new TriVertex(2, 2, 0));
heap.Insert(tri1, 12.34);
heap.Insert(tri2, 34.56);
heap.Kill(0);
Assert.True(heap.Count == 1);
Assert.True(heap[0].Tri == tri1);
}
public void TINHeapTests_Update()
{
TINHeap heap = new TINHeap(1234);
GridToTINTriangle tri1 = new GridToTINTriangle(new TriVertex(1, 2, 0), new TriVertex(2, 2, 0), new TriVertex(2, 1, 0));
GridToTINTriangle tri2 = new GridToTINTriangle(new TriVertex(2, 1, 0), new TriVertex(1, 2, 0), new TriVertex(2, 2, 0));
heap.Insert(tri1, 12.34);
heap.Insert(tri2, 34.56);
Assert.True(heap.Count == 2);
Assert.True(heap[1].Tri == tri1);
Assert.True(heap[0].Tri == tri2);
heap.Update(tri1, 56.78);
Assert.True(heap[0].Tri == tri1);
Assert.True(heap[1].Tri == tri2);
}
public void TINHeapTests_Insert_FailWithNullVertices()
{
TINHeap heap = new TINHeap(1234);
var tri = new GridToTINTriangle(new TriVertex(1, 2, 0), new TriVertex(2, 2, 0), null);
Action act = () => heap.Insert(tri, 12.34);
act.Should().Throw <TRexException>().WithMessage("One or more vertices in triangle is null");
tri = new GridToTINTriangle(new TriVertex(1, 2, 0), null, new TriVertex(2, 2, 0));
act = () => heap.Insert(tri, 12.34);
act.Should().Throw <TRexException>().WithMessage("One or more vertices in triangle is null");
tri = new GridToTINTriangle(null, new TriVertex(1, 2, 0), new TriVertex(2, 2, 0));
act = () => heap.Insert(tri, 12.34);
act.Should().Throw <TRexException>().WithMessage("One or more vertices in triangle is null");
}
public void TINHeapTests_Update_FailureModes()
{
TINHeap heap = new TINHeap(1234);
GridToTINTriangle tri1 = new GridToTINTriangle(new TriVertex(1, 2, 0), new TriVertex(2, 2, 0), new TriVertex(2, 1, 0));
GridToTINTriangle tri2 = new GridToTINTriangle(new TriVertex(1, 2, 0), new TriVertex(2, 2, 0), new TriVertex(2, 1, 0));
heap.Insert(tri1, 12.34);
tri2.HeapIndex = tri1.HeapIndex;
Action act = () => heap.Update(tri2, 56.78);
act.Should().Throw <TRexException>().WithMessage("*Inconsistent triangle references*");
tri1.HeapIndex = 100;
act = () => heap.Update(tri1, 56.78);
act.Should().Throw <TRexException>().WithMessage("*Attempting to update past end of heap*");
tri1.HeapIndex = GridToTINHeapNode.NOT_IN_HEAP;
act = () => heap.Update(tri1, 56.78);
act.Should().Throw <TRexException>().WithMessage("*Attempting to update object not in heap*");
}
