public static IBTreeRange Intersect(BTreeRangeSingle single1, BTreeRangeSingle single2
)
{
BTreePointer first = BTreePointer.Max(single1.First(), single2.First());
BTreePointer end = BTreePointer.Min(single1.End(), single2.End());
return single1.NewBTreeRangeSingle(first, end);
}
public int Compare(object x, object y)
{
Db4objects.Db4o.Internal.Btree.BTreeRangeSingle xRange = (Db4objects.Db4o.Internal.Btree.BTreeRangeSingle
)x;
Db4objects.Db4o.Internal.Btree.BTreeRangeSingle yRange = (Db4objects.Db4o.Internal.Btree.BTreeRangeSingle
)y;
return(xRange.First().CompareTo(yRange.First()));
}
public AbstractBTreeRangeIterator(BTreeRangeSingle range)
{
_range = range;
BTreePointer first = range.First();
if (first != null)
{
// we clone here, because we are calling unsafeNext() on BTreePointer
// _cursor is our private copy, we modify it and never pass it out.
_cursor = first.ShallowClone();
}
}
public AbstractBTreeRangeIterator(BTreeRangeSingle range)
{
_range = range;
BTreePointer first = range.First();
if (first != null)
{
// we clone here, because we are calling unsafeNext() on BTreePointer
// _cursor is our private copy, we modify it and never pass it out.
_cursor = first.ShallowClone();
}
}
public virtual void Reset()
{
_cursor = _range.First();
}
public AbstractBTreeRangeIterator(BTreeRangeSingle range)
{
_range = range;
_cursor = range.First();
}
public AbstractBTreeRangeIterator(BTreeRangeSingle range)
{
_range = range;
_cursor = range.First();
}
private static BTreeRangeSingle Merge(BTreeRangeSingle range1, BTreeRangeSingle range2
)
{
return range1.NewBTreeRangeSingle(BTreePointer.Min(range1.First(), range2.First()
), BTreePointer.Max(range1.End(), range2.End()));
}
