private static void LoadTree(IRange2Map <int> tree, int count, STuple <int, int, int>[] inserts)
{
for (int i = 0; i < count; i++)
{
STuple <int, int, int> insert = inserts[i];
int start = insert.Item1;
tree.NearestLessOrEqual(start, Side.X, out start);
tree.Insert(start, Side.X, insert.Item2, insert.Item3, insert.Item1);
}
}
public override void Add()
{
int i = reference.Count > 0 ? random.Next((int)reference.Count + 1) : 0;
int xStart = i < reference.Count ? ((INonInvasiveRange2MapInspection)reference).GetRanges()[i].x.start : reference.GetExtent(Side.X);
int xLength = random.Next(100) + 1;
int yLength = random.Next(100) + 1;
float value = (float)random.NextDouble();
actual.Insert(xStart, Side.X, xLength, yLength, value); // throws when capacity locked & exhausted
reference.Insert(xStart, Side.X, xLength, yLength, value);
}