/// <summary>
/// Performs a point query with a single value.
/// All items with overlapping ranges are returned.
/// </summary>
public IEnumerable <RangeValuePair <TKey, TValue> > QueryRangeValueList(TKey value)
{
var results = new List <RangeValuePair <TKey, TValue> >();
// If the node has items, check for leaves containing the value.
if (items != null)
{
foreach (var o in items)
{
if (comparer.Compare(o.From, value) > 0)
{
break;
}
else if (comparer.Compare(value, o.From) >= 0 && comparer.Compare(value, o.To) <= 0)
{
results.Add(o);
}
}
}
// go to the left or go to the right of the tree, depending
// where the query value lies compared to the center
var centerComp = comparer.Compare(value, center);
if (leftNode != null && centerComp < 0)
{
results.AddRange(leftNode.QueryRangeValueList(value));
}
else if (rightNode != null && centerComp > 0)
{
results.AddRange(rightNode.QueryRangeValueList(value));
}
return(results);
}
public IEnumerable <RangeValuePair <TKey, TValue> > QueryRangeValueList(
TKey value)
{
if (!isInSync)
{
Rebuild();
}
return(root.QueryRangeValueList(value));
}
