public void RemoveRange(ulong offset, ulong range)
{
ValidateParams(offset, range);
if (mTree.Count == 0)
{
throw new Exception("Empty tree.");
}
var removeRange = new SpaceRange(offset, range);
var near = mTree.FindNearestValues(removeRange);
if (near.Item1.IsValid && near.Item1.Contains(removeRange))
{
SplitNode(near.Item1, removeRange);
return;
}
else if (near.Item2.IsValid && near.Item2.Contains(removeRange))
{
SplitNode(near.Item2, removeRange);
return;
}
throw new Exception("Could not find range to remove.");
}
public bool ContainsRange(ulong offset, ulong range)
{
if (mTree.Count == 0)
{
return(false);
}
var search = new SpaceRange(offset, range);
var near = mTree.FindNearestValues(search);
return((near.Item1.IsValid && near.Item1.Contains(search)) || (near.Item2.IsValid && near.Item2.Contains(search)));
}
public void AddRange(ulong offset, ulong range)
{
ValidateParams(offset, range);
if (mTree.Count == 0)
{
mTree.Add(new SpaceRange(offset, range));
return;
}
var newRange = new SpaceRange(offset, range);
var near = mTree.FindNearestValues(newRange);
//try to merge with the left
if (near.Item1.IsValid)
{
if (near.Item1.Intersects(newRange))
{
throw new Exception("Range already added");
}
if (near.Item1.Offset + near.Item1.Range == newRange.Offset)
{
if (!mTree.Remove(near.Item1))
{
throw new Exception("Failed to remove node, this should not happen.");
}
newRange = new SpaceRange(near.Item1.Offset, near.Item1.Range + newRange.Range);
}
}
//try to merge with the right
if (near.Item2.IsValid)
{
if (near.Item2.Intersects(newRange))
{
throw new Exception("Range already added.");
}
if (newRange.Offset + newRange.Range == near.Item2.Offset)
{
if (!mTree.Remove(near.Item2))
{
throw new Exception("Failed to remove node, this should not happen.");
}
newRange = new SpaceRange(newRange.Offset, newRange.Range + near.Item2.Range);
}
}
mTree.Add(newRange);
}
static RangeMap()
{
var space = new SpaceRange(100, 100);
Debug.Assert(space.Intersects(new SpaceRange(150, 25)));
Debug.Assert(space.Intersects(new SpaceRange(100, 25)));
Debug.Assert(space.Intersects(new SpaceRange(50, 200)));
Debug.Assert(space.Intersects(new SpaceRange(190, 10)));
Debug.Assert(space.Intersects(new SpaceRange(90, 20)));
Debug.Assert(space.Intersects(new SpaceRange(190, 20)));
Debug.Assert(!space.Intersects(new SpaceRange(50, 25)));
Debug.Assert(!space.Intersects(new SpaceRange(90, 10)));
Debug.Assert(!space.Intersects(new SpaceRange(200, 10)));
}
private void SplitNode(SpaceRange existingRange, SpaceRange removeRange)
{
var newLowerRange = new SpaceRange(existingRange.Offset, removeRange.Offset - existingRange.Offset);
var newUpperRange = new SpaceRange(removeRange.Offset + removeRange.Range, existingRange.Range - newLowerRange.Range - removeRange.Range);
if (!mTree.Remove(existingRange))
{
throw new Exception("Failed to remove range.");
}
if (newLowerRange.Range != 0)
{
mTree.Add(newLowerRange);
}
if (newUpperRange.Range != 0)
{
mTree.Add(newUpperRange);
}
}