public void IsNodeEmpty_Bug()
{
var tree = new QuadTree(14, 14);
var range = new Range(1, 1, 1, 1);
tree.Insert(range);
Assert.AreEqual(range, tree.QueryFirst(range));
}
public List<Range> GetRangesFirst(QuadTree tree)
{
List<Range> results = new List<Range>();
for (var col = 0; col < tree.Bounds.ColumnsCount; col++)
for (var row = 0; row < tree.Bounds.RowsCount; row++)
{
Range? range = null;
IPerformanceCounter counter = null;
using (counter = new PerformanceCounter())
{
range = tree.QueryFirst(new Position(row, col));
}
TotalQueries ++;
TotalTimeSpent += counter.GetMilisec();
if (range != null)
results.Add(range.Value);
}
AverageTimeSpent = TotalTimeSpent / TotalQueries;
return results;
}
