Struct discrete_range_map::interval::InclusiveInterval

pub struct InclusiveInterval<I> {
    pub start: I,
    pub end: I,
}

Fields

start: I

end: I

Trait Implementations

impl<I: Clone> Clone for InclusiveInterval<I>

fn clone(&self) -> InclusiveInterval<I>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<I: Debug> Debug for InclusiveInterval<I>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de, I> Deserialize<'de> for InclusiveInterval<I>

where I: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<I: Hash> Hash for InclusiveInterval<I>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<I> InclusiveRange<I> for InclusiveInterval<I>

where I: PointType,

fn start(&self) -> I

fn end(&self) -> I

fn contains(&self, point: I) -> bool

where I: PointType,

fn is_valid(&self) -> bool

where I: PointType,

fn touches_ordered(&self, other: &Self) -> bool

where I: PointType,

requires that self comes before other and they don’t overlap

fn overlaps_ordered(&self, other: &Self) -> bool

where I: PointType,

requires that self comes before other

fn intersect(&self, other: &Self) -> Option<Self>

where I: PointType, Self: From<InclusiveInterval<I>>,

Intersect the range with the other one, and return Some if the intersection is not empty.

fn merge_ordered(&self, other: &Self) -> Self

where Self: From<InclusiveInterval<I>>,

requires that self comes before other

impl<I: PartialEq> PartialEq for InclusiveInterval<I>

fn eq(&self, other: &InclusiveInterval<I>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<I> RangeBounds<I> for InclusiveInterval<I>

where I: PointType,

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

Start index bound.

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

End index bound.

fn contains<U>(&self, item: &U) -> bool

where T: PartialOrd<U>, U: PartialOrd<T> + ?Sized,

Returns true if item is contained in the range.

impl<I> Serialize for InclusiveInterval<I>

where I: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<I: Copy> Copy for InclusiveInterval<I>

impl<I: Eq> Eq for InclusiveInterval<I>

impl<I> StructuralEq for InclusiveInterval<I>

impl<I> StructuralPartialEq for InclusiveInterval<I>