Esempio n. 1
0
 public static IBTreeRange Intersect(BTreeRangeSingle single1, BTreeRangeSingle single2
     )
 {
     var first = BTreePointer.Max(single1.First(), single2.First());
     var end = BTreePointer.Min(single1.End(), single2.End());
     return single1.NewBTreeRangeSingle(first, end);
 }
Esempio n. 2
0
        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));
        }
Esempio n. 3
0
 private static BTreeRangeSingle Merge(BTreeRangeSingle range1, BTreeRangeSingle range2
                                       )
 {
     return(range1.NewBTreeRangeSingle(BTreePointer.Min(range1.First(), range2.First()
                                                        ), BTreePointer.Max(range1.End(), range2.End())));
 }
Esempio n. 4
0
 private static BTreeRangeSingle Merge(BTreeRangeSingle range1, BTreeRangeSingle range2
     )
 {
     return range1.NewBTreeRangeSingle(BTreePointer.Min(range1.First(), range2.First()
         ), BTreePointer.Max(range1.End(), range2.End()));
 }