Struct btree_range_map::RangeFromExcludedToIncluded

pub struct RangeFromExcludedToIncluded<T> {
    pub start: T,
    pub end: T,
}

Range with an excluded start bound and included end bound.

Fields

start: T

end: T

Implementations

impl<T> RangeFromExcludedToIncluded<T>

pub const fn new(start: T, end: T) -> RangeFromExcludedToIncluded<T>

Trait Implementations

impl<T: Measure + PartialEnum> AsRange for RangeFromExcludedToIncluded<T>

type Item = T

Type of the elements of the range.

fn start(&self) -> Bound<&Self::Item>

Start bound of the range.

fn end(&self) -> Bound<&Self::Item>

End bound of the range.

fn is_empty(&self) -> bool

fn intersects<R: AsRange>(&self, other: &R) -> boolwhere Self::Item: PartialOrd<R::Item> + Measure<R::Item>,

fn connected_to<R: AsRange>(&self, other: &R) -> boolwhere Self::Item: PartialOrd<R::Item> + Measure<R::Item>,

impl<T: Measure + PartialEnum> IntoRange for RangeFromExcludedToIncluded<T>

fn into_range(self) -> AnyRange<Self::Item>

impl<T> RangeBounds<T> for RangeFromExcludedToIncluded<T>

fn start_bound(&self) -> Bound<&T>

Start index bound.

fn end_bound(&self) -> Bound<&T>

End index bound.

fn contains<U>(&self, item: &U) -> boolwhere T: PartialOrd<U>, U: PartialOrd<T> + ?Sized,

Returns true if item is contained in the range.