private bool ReachedEnd() { if (_cursor == null) { return(true); } if (_range.End() == null) { return(false); } return(_range.End().Equals(_cursor)); }
private bool ReachedEnd(BTreePointer cursor) { if (cursor == null) { return(true); } if (_range.End() == null) { return(false); } return(_range.End().Equals(cursor)); }
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); }
private static BTreeRangeSingle Merge(BTreeRangeSingle range1, BTreeRangeSingle range2 ) { return range1.NewBTreeRangeSingle(BTreePointer.Min(range1.First(), range2.First() ), BTreePointer.Max(range1.End(), range2.End())); }