Struct range_inclusive::RangeInclusive

pub struct RangeInclusive<Idx: Clone + PartialOrd> { /* private fields */ }

A range bounded inclusively below and above (start..=end).

The RangeInclusive start..=end contains all values with x >= start and x <= end. It is empty unless start <= end.

See the crate-level docs for more information.

Implementations

impl<Idx: Clone + PartialOrd> RangeInclusive<Idx>

pub const fn new(start: Idx, end: Idx) -> Self

Creates a new inclusive range.

pub const fn start(&self) -> &Idx

Returns the lower bound of the range (inclusive).

pub const fn end(&self) -> &Idx

Returns the upper bound of the range (inclusive).

pub fn into_inner(self) -> (Idx, Idx)

Destructures the RangeInclusive into (lower bound, upper (inclusive) bound).

pub fn is_empty(&self) -> bool

Returns true if the range contains no items.

pub fn iter(&self) -> RangeInclusiveIterator<Idx>

Returns an iterator with the same start and end values as the range.

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

Returns true if item is contained in the range.

Trait Implementations

impl<Idx: Clone + Clone + PartialOrd> Clone for RangeInclusive<Idx>

fn clone(&self) -> RangeInclusive<Idx>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Idx: Clone + PartialOrd + Debug> Debug for RangeInclusive<Idx>

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

Formats the value using the given formatter.

impl<Idx: Hash + Clone + PartialOrd> Hash for RangeInclusive<Idx>

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<'a, Idx: Clone + PartialOrd + Step> IntoIterator for &'a RangeInclusive<Idx>

type Item = Idx

The type of the elements being iterated over.

type IntoIter = RangeInclusiveIterator<Idx>

Which kind of iterator are we turning this into?

fn into_iter(self) -> RangeInclusiveIterator<Idx>

Creates an iterator from a value.

impl<Idx: PartialEq + Clone + PartialOrd> PartialEq<RangeInclusive<Idx>> for RangeInclusive<Idx>

fn eq(&self, other: &RangeInclusive<Idx>) -> 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<T: Clone + PartialOrd> RangeBounds<T> for RangeInclusive<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.

impl<Idx: Copy + Clone + PartialOrd> Copy for RangeInclusive<Idx>

impl<Idx: Eq + Clone + PartialOrd> Eq for RangeInclusive<Idx>

impl<Idx: Clone + PartialOrd> StructuralEq for RangeInclusive<Idx>

impl<Idx: Clone + PartialOrd> StructuralPartialEq for RangeInclusive<Idx>