1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73
// Copyright 2023 宋昊文
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
use std::ops::Range;
pub trait RangeOperations<Rhs: ?Sized = Self>
where
Self: Sized,
{
fn intersects(&self, rhs: &Rhs) -> bool;
fn covering(&self, rhs: &Rhs) -> bool;
fn covered_by(&self, rhs: &Rhs) -> bool;
fn union(&self, rhs: &Rhs) -> Option<Self>;
}
impl<Idx> RangeOperations for Range<Idx>
where
Idx: PartialOrd + Copy,
{
fn intersects(&self, rhs: &Range<Idx>) -> bool {
(self.start < rhs.start && self.end > rhs.start)
|| (rhs.start < self.start && rhs.end > self.start)
}
fn covering(&self, rhs: &Range<Idx>) -> bool {
self.start <= rhs.start && self.end >= rhs.end
}
fn covered_by(&self, rhs: &Range<Idx>) -> bool {
self.start >= rhs.start && self.end <= rhs.end
}
fn union(&self, rhs: &Range<Idx>) -> Option<Range<Idx>> {
if self.start <= rhs.start && self.end >= rhs.start {
if self.end > rhs.end {
Some(Range {
start: self.start,
end: self.end,
})
} else {
Some(Range {
start: self.start,
end: rhs.end,
})
}
} else if rhs.start <= self.start && rhs.end >= self.start {
if rhs.end > self.end {
Some(Range {
start: rhs.start,
end: rhs.end,
})
} else {
Some(Range {
start: rhs.start,
end: self.end,
})
}
} else {
None
}
}
}