advanced-algorithms/tests/Advanced.Algorithms.Tests/DataStructures/Tree/QuadTree_Tests.cs at develop · justcoding121/advanced-algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
using System;
using System.Linq;
using Advanced.Algorithms.DataStructures;
using Advanced.Algorithms.Geometry;
using Microsoft.VisualStudio.TestTools.UnitTesting;

namespace Advanced.Algorithms.Tests.DataStructures
{
    public class QuadTree_Tests
    {
        [TestClass]
        public class QuadTreeTests
        {
            [TestMethod]
            public void QuadTree_Smoke_Test()
            {
                var tree = new QuadTree<object>();

                tree.Insert(new Point(0, 1));
                tree.Insert(new Point(1, 1));
                tree.Insert(new Point(2, 5));
                tree.Insert(new Point(3, 6));
                tree.Insert(new Point(4, 5));
                tree.Insert(new Point(4, 7));
                tree.Insert(new Point(5, 8));
                tree.Insert(new Point(6, 9));
                tree.Insert(new Point(7, 10));

                var rangeResult = tree.RangeSearch(new Rectangle(new Point(1, 7), new Point(3, 1)));
                Assert.IsTrue(rangeResult.Count == 3);

                //IEnumerable test using linq
                Assert.AreEqual(tree.Count, tree.Count());

                tree.Delete(new Point(2, 5));
                rangeResult = tree.RangeSearch(new Rectangle(new Point(1, 7), new Point(3, 1)));
                Assert.IsTrue(rangeResult.Count == 2);
                Assert.AreEqual(tree.Count, tree.Count());

                tree.Delete(new Point(3, 6));
                rangeResult = tree.RangeSearch(new Rectangle(new Point(1, 7), new Point(3, 1)));
                Assert.IsTrue(rangeResult.Count == 1);
                Assert.AreEqual(tree.Count, tree.Count());

                tree.Delete(new Point(0, 1));
                tree.Delete(new Point(1, 1));
                tree.Delete(new Point(4, 5));
                tree.Delete(new Point(4, 7));
                tree.Delete(new Point(5, 8));
                tree.Delete(new Point(6, 9));
                tree.Delete(new Point(7, 10));

                Assert.AreEqual(0, tree.Count);
                Assert.AreEqual(0, tree.Count());
            }

            [TestMethod]
            public void QuadTree_Delete_All_Clears_Tree()
            {
                var tree = new QuadTree<object>();

                tree.Insert(new Point(0, 0));
                tree.Insert(new Point(1, 2));
                tree.Insert(new Point(3, 1));

                tree.Delete(new Point(0, 0));
                tree.Delete(new Point(1, 2));
                tree.Delete(new Point(3, 1));

                Assert.AreEqual(0, tree.Count);
                Assert.AreEqual(0, tree.Count());
                Assert.AreEqual(0, tree.RangeSearch(new Rectangle(new Point(-10, 10), new Point(10, -10))).Count);

                Assert.ThrowsException<Exception>(() => tree.Delete(new Point(0, 0)));
            }

            [TestMethod]
            public void QuadTree_Delete_Triggers_Reconstruction()
            {
                var tree = new QuadTree<object>();

                // Even count so deleting half forces reconstruction (deleted >= live).
                tree.Insert(new Point(2, 2));
                tree.Insert(new Point(1, 1));
                tree.Insert(new Point(1, 3));
                tree.Insert(new Point(3, 3));

                tree.Delete(new Point(1, 1));
                tree.Delete(new Point(1, 3));

                Assert.AreEqual(2, tree.Count);
                Assert.AreEqual(2, tree.Count());

                var rangeResult = tree.RangeSearch(new Rectangle(new Point(0, 4), new Point(4, 0)));
                Assert.AreEqual(2, rangeResult.Count);
                Assert.IsTrue(rangeResult.Any(x => x.Item1.X == 2 && x.Item1.Y == 2));
                Assert.IsTrue(rangeResult.Any(x => x.Item1.X == 3 && x.Item1.Y == 3));

                // Already-deleted / missing points should throw.
                Assert.ThrowsException<Exception>(() => tree.Delete(new Point(1, 1)));
                Assert.ThrowsException<Exception>(() => tree.Delete(new Point(9, 9)));
            }

            [TestMethod]
            public void QuadTree_Delete_Uses_Tolerant_Float_Equality()
            {
                var tree = new QuadTree<object>();

                tree.Insert(new Point(0.1 + 0.2, 1.0));
                Assert.AreEqual(1, tree.Count);

                // 0.1 + 0.2 is not exactly 0.3; tolerant Find should still match.
                tree.Delete(new Point(0.3, 1.0));
                Assert.AreEqual(0, tree.Count);
                Assert.AreEqual(0, tree.Count());
            }

            [TestMethod]
            public void QuadTree_Delete_With_Fresh_Point_Instance()
            {
                var tree = new QuadTree<object>();

                tree.Insert(new Point(1.5, 2.5));
                tree.Delete(new Point(1.5, 2.5));

                Assert.AreEqual(0, tree.Count);
            }

            [TestMethod]
            public void QuadTree_Insert_Duplicate_Within_Tolerance_Throws()
            {
                var tree = new QuadTree<object>();

                tree.Insert(new Point(0.1 + 0.2, 1.0));

                Assert.ThrowsException<Exception>(() => tree.Insert(new Point(0.3, 1.0)));
                Assert.AreEqual(1, tree.Count);
            }
        }
    }
}