Struct bitflags::__core::ops::RangeToInclusive

pub struct RangeToInclusive<Idx> {
    pub end: Idx,
}

Unstable (inclusive_range)

: recently added, follows RFC

An inclusive range which is only bounded above: { x | x <= end }. Use ...end (three dots) for its shorthand.

See the contains() method for its characterization.

It cannot serve as an iterator because it doesn't have a starting point.

Examples

#![feature(inclusive_range,inclusive_range_syntax)]
fn main() {
    assert_eq!((...5), std::ops::RangeToInclusive{ end: 5 });

    let arr = [0, 1, 2, 3];
    assert_eq!(arr[ ...2], [0,1,2  ]);  // RangeToInclusive
    assert_eq!(arr[1...2], [  1,2  ]);
}

Fields

end	Unstable (inclusive_range) : recently added, follows RFC The upper bound of the range (inclusive)

Methods

impl<Idx> RangeToInclusive<Idx> where Idx: PartialOrd<Idx>

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

Unstable (range_contains)

: recently added as per RFC

Examples

#![feature(range_contains,inclusive_range_syntax)]
fn main() {
    assert!(   (...5).contains(-1_000_000_000));
    assert!(   (...5).contains(5));
    assert!( ! (...5).contains(6));
}

Trait Implementations

impl<Idx> Debug for RangeToInclusive<Idx> where Idx: Debug

fn fmt(&self, fmt: &mut Formatter) -> Result<(), Error>

Unstable (inclusive_range)

: recently added, follows RFC

Derived Implementations

impl<Idx> Eq for RangeToInclusive<Idx> where Idx: Eq

impl<Idx> PartialEq<RangeToInclusive<Idx>> for RangeToInclusive<Idx> where Idx: PartialEq<Idx>

fn eq(&self, __arg_0: &RangeToInclusive<Idx>) -> bool

Unstable (inclusive_range)

: recently added, follows RFC

fn ne(&self, __arg_0: &RangeToInclusive<Idx>) -> bool

Unstable (inclusive_range)

: recently added, follows RFC

impl<Idx> Clone for RangeToInclusive<Idx> where Idx: Clone

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

Unstable (inclusive_range)

: recently added, follows RFC

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

impl<Idx> Copy for RangeToInclusive<Idx> where Idx: Copy