rssn::prelude::jit::entity::__core::ops

Struct Range

1.6.0 · Source

pub struct Range<Idx> {
    pub start: Idx,
    pub end: Idx,
}

Expand description

A (half-open) range bounded inclusively below and exclusively above (start..end).

The range start..end contains all values with start <= x < end. It is empty if start >= end.

§Examples

The start..end syntax is a Range:

assert_eq!((3..5), std::ops::Range { start: 3, end: 5 });
assert_eq!(3 + 4 + 5, (3..6).sum());

let arr = [0, 1, 2, 3, 4];
assert_eq!(arr[ ..  ], [0, 1, 2, 3, 4]);
assert_eq!(arr[ .. 3], [0, 1, 2      ]);
assert_eq!(arr[ ..=3], [0, 1, 2, 3   ]);
assert_eq!(arr[1..  ], [   1, 2, 3, 4]);
assert_eq!(arr[1.. 3], [   1, 2      ]); // This is a `Range`
assert_eq!(arr[1..=3], [   1, 2, 3   ]);

Fields§

§start: Idx

The lower bound of the range (inclusive).

§end: Idx

The upper bound of the range (exclusive).

Implementations§

Source §

impl<Idx> Range<Idx>
where Idx: PartialOrd,

1.35.0 (const: unstable) · Source

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

Returns true if item is contained in the range.

§Examples

assert!(!(3..5).contains(&2));
assert!( (3..5).contains(&3));
assert!( (3..5).contains(&4));
assert!(!(3..5).contains(&5));

assert!(!(3..3).contains(&3));
assert!(!(3..2).contains(&3));

assert!( (0.0..1.0).contains(&0.5));
assert!(!(0.0..1.0).contains(&f32::NAN));
assert!(!(0.0..f32::NAN).contains(&0.5));
assert!(!(f32::NAN..1.0).contains(&0.5));

1.47.0 (const: unstable) · Source

pub fn is_empty(&self) -> bool
where Idx: PartialOrd,

Returns true if the range contains no items.

§Examples

assert!(!(3..5).is_empty());
assert!( (3..3).is_empty());
assert!( (3..2).is_empty());

The range is empty if either side is incomparable:

assert!(!(3.0..5.0).is_empty());
assert!( (3.0..f32::NAN).is_empty());
assert!( (f32::NAN..5.0).is_empty());

Trait Implementations§

Source §

impl<'a, A> Arbitrary<'a> for Range<A>
where A: Arbitrary<'a> + Clone + PartialOrd,

Source §

fn arbitrary(u: &mut Unstructured<'a>) -> Result<Range<A>, Error>

Generate an arbitrary value of Self from the given unstructured data. Read more

Source §

fn size_hint(depth: usize) -> (usize, Option<usize>)

fn end(&self, _: D) -> usize

The index immediately after the last index inside of the range.

Source §

fn size(&self, _: D) -> <Range<usize> as DimRange<D>>::Size ⓘ

The number of elements of the range, i.e., self.end - self.begin.

Source §

impl<D> DimRange<D> for Range<usize>
where D: Dim,

Source §

type Size = Dyn

Type of the range size. May be a type-level integer.

Source §

fn begin(&self, _: D) -> usize

The start index of the range.

Source §

fn end(&self, _: D) -> usize

The index immediately after the last index inside of the range.

Source §

fn size(&self, _: D) -> <Range<usize> as DimRange<D>>::Size ⓘ

The number of elements of the range, i.e., self.end - self.begin.

1.0.0 · Source§

impl<A> DoubleEndedIterator for Range<A>
where A: Step,

Source §

fn next_back(&mut self) -> Option<A>

Removes and returns an element from the end of the iterator. Read more

Source §

fn nth_back(&mut self, n: usize) -> Option<A>

Returns the nth element from the end of the iterator. Read more

Source §

fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>

🔬This is a nightly-only experimental API. (iter_advance_by)

Advances the iterator from the back by n elements. Read more

1.27.0 · Source§

fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R
where Self: Sized, F: FnMut(B, Self::Item) -> R, R: Try<Output = B>,

This is the reverse version of Iterator::try_fold(): it takes elements starting from the back of the iterator. Read more

1.27.0 · Source§

fn rfold<B, F>(self, init: B, f: F) -> B
where Self: Sized, F: FnMut(B, Self::Item) -> B,

An iterator method that reduces the iterator’s elements to a single, final value, starting from the back. Read more

1.27.0 · Source§

fn rfind(&mut self, predicate: P) -> Option<Self::Item>
where Self: Sized, P: FnMut(&Self::Item) -> bool,

Searches for an element of an iterator from the back that satisfies a predicate. Read more

Source §

impl<T> Encode for Range<T>
where T: Encode,

Source §

Source §

type ReprC = RRange<T>

The #[repr(C)] equivalent.

🔬This is a nightly-only experimental API. (iter_advance_by)

Advances the iterator by n elements. Read more

Source §

fn next_chunk<const N: usize>( &mut self, ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>
where Self: Sized,

🔬This is a nightly-only experimental API. (iter_next_chunk)

Advances the iterator and returns an array containing the next N values. Read more

1.28.0 · Source§

fn step_by(self, step: usize) -> StepBy<Self> ⓘ
where Self: Sized,

Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Read more

1.0.0 · Source§

fn chain(self, other: U) -> Chain<Self, ::IntoIter> ⓘ
where Self: Sized, U: IntoIterator<Item = Self::Item>,

Takes two iterators and creates a new iterator over both in sequence. Read more

1.0.0 · Source§

fn zip(self, other: U) -> Zip<Self, ::IntoIter> ⓘ
where Self: Sized, U: IntoIterator,

‘Zips up’ two iterators into a single iterator of pairs. Read more

Source §

fn intersperse(self, separator: Self::Item) -> Intersperse<Self> ⓘ
where Self: Sized, Self::Item: Clone,

🔬This is a nightly-only experimental API. (iter_intersperse)

Creates a new iterator which places a copy of separator between adjacent items of the original iterator. Read more

Source §

fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G> ⓘ
where Self: Sized, G: FnMut() -> Self::Item,

🔬This is a nightly-only experimental API. (iter_intersperse)

fn fuse(self) -> Fuse<Self> ⓘ
where Self: Sized,

Creates an iterator which ends after the first None. Read more

1.0.0 · Source§

fn inspect<F>(self, f: F) -> Inspect<Self, F> ⓘ
where Self: Sized, F: FnMut(&Self::Item),

Does something with each element of an iterator, passing the value on. Read more

1.0.0 · Source§

fn by_ref(&mut self) -> &mut Self
where Self: Sized,

Creates a “by reference” adapter for this instance of Iterator. Read more

1.0.0 · Source§

fn collect(self) -> B
where B: FromIterator<Self::Item>, Self: Sized,

Transforms an iterator into a collection. Read more

Source §

fn try_collect( &mut self, ) -> <<Self::Item as Try>::Residual as Residual>::TryType
where Self: Sized, Self::Item: Try, <Self::Item as Try>::Residual: Residual, B: FromIterator<<Self::Item as Try>::Output>,

🔬This is a nightly-only experimental API. (iterator_try_collect)

Fallibly transforms an iterator into a collection, short circuiting if a failure is encountered. Read more

Source §

fn collect_into<E>(self, collection: &mut E) -> &mut E
where E: Extend<Self::Item>, Self: Sized,

🔬This is a nightly-only experimental API. (iter_collect_into)

Collects all the items from an iterator into a collection. Read more

1.0.0 · Source§

fn partition<B, F>(self, f: F) -> (B, B)
where Self: Sized, B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> bool,

Consumes an iterator, creating two collections from it. Read more

Source §

fn partition_in_place<'a, T, P>(self, predicate: P) -> usize
where T: 'a, Self: Sized + DoubleEndedIterator<Item = &'a mut T>, P: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (iter_partition_in_place)

Reorders the elements of this iterator in-place according to the given predicate, such that all those that return true precede all those that return false. Returns the number of true elements found. Read more

Source §

fn is_partitioned(self, predicate: P) -> bool
where Self: Sized, P: FnMut(Self::Item) -> bool,

🔬This is a nightly-only experimental API. (iter_is_partitioned)

Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return true precede all those that return false. Read more

1.27.0 · Source§

fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R
where Self: Sized, F: FnMut(B, Self::Item) -> R, R: Try<Output = B>,

An iterator method that applies a function as long as it returns successfully, producing a single, final value. Read more

1.27.0 · Source§

fn try_for_each<F, R>(&mut self, f: F) -> R
where Self: Sized, F: FnMut(Self::Item) -> R, R: Try<Output = ()>,

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error. Read more

1.0.0 · Source§

fn fold<B, F>(self, init: B, f: F) -> B
where Self: Sized, F: FnMut(B, Self::Item) -> B,

Folds every element into an accumulator by applying an operation, returning the final result. Read more

1.51.0 · Source§

fn reduce<F>(self, f: F) -> Option<Self::Item>
where Self: Sized, F: FnMut(Self::Item, Self::Item) -> Self::Item,

Reduces the elements to a single one, by repeatedly applying a reducing operation. Read more

Source §

fn try_reduce<R>( &mut self, f: impl FnMut(Self::Item, Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType
where Self: Sized, R: Try<Output = Self::Item>, <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (iterator_try_reduce)

Reduces the elements to a single one by repeatedly applying a reducing operation. If the closure returns a failure, the failure is propagated back to the caller immediately. Read more

1.0.0 · Source§

fn all<F>(&mut self, f: F) -> bool
where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if every element of the iterator matches a predicate. Read more

1.0.0 · Source§

fn any<F>(&mut self, f: F) -> bool
where Self: Sized, F: FnMut(Self::Item) -> bool,

Tests if any element of the iterator matches a predicate. Read more

1.0.0 · Source§

fn find(&mut self, predicate: P) -> Option<Self::Item>
where Self: Sized, P: FnMut(&Self::Item) -> bool,

Searches for an element of an iterator that satisfies a predicate. Read more

1.30.0 · Source§

fn find_map<B, F>(&mut self, f: F) -> Option
where Self: Sized, F: FnMut(Self::Item) -> Option,

Applies function to the elements of iterator and returns the first non-none result. Read more

Source §

fn try_find<R>( &mut self, f: impl FnMut(&Self::Item) -> R, ) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType
where Self: Sized, R: Try<Output = bool>, <R as Try>::Residual: Residual<Option<Self::Item>>,

🔬This is a nightly-only experimental API. (try_find)

🔬This is a nightly-only experimental API. (iter_array_chunks)

Returns an iterator over N elements of the iterator at a time. Read more

1.11.0 · Source§

fn sum<S>(self) -> S
where Self: Sized, S: Sum<Self::Item>,

Sums the elements of an iterator. Read more

1.11.0 · Source§

Source §

type Output = Skip<Take>

The type returned for this type of index.

Source §

fn index(self, iter: I) -> <Range<usize> as IteratorIndex>::Output ⓘ

Returns an adapted iterator for the current index. Read more

Source §

Source §

fn is_empty(&self) -> bool
where T: PartialOrd,

🔬This is a nightly-only experimental API. (range_bounds_is_empty)

Returns true if the range contains no items. One-sided ranges (RangeFrom, etc) always return false. Read more

1.28.0 (const: unstable) · Source§

impl<T> RangeBounds<T> for Range<T>

Source §

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

Check whether the range is empty.

Source §

impl<T> SampleRange<T> for Range<T>
where T: SampleUniform + PartialOrd,

Source §

fn sample_single<R>(self, rng: &mut R) -> Result<T, Error>
where R: RngCore + ?Sized,

Generate a sample from the given range.

Source §

fn is_empty(&self) -> bool

Check whether the range is empty.

Source §

impl<Idx> Serialize for Range<Idx>
where Idx: Serialize,

Source §

fn serialize<S>( &self, serializer: S, ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
where S: Serializer,

Serialize this value into the given Serde serializer. Read more

1.15.0 (const: unstable) · Source§

impl<T> SliceIndex<[T]> for Range<usize>

The methods index and index_mut panic if:

the start of the range is greater than the end of the range or
the end of the range is out of bounds.

Source §

Source §

🔬This is a nightly-only experimental API. (slice_index_methods)

Returns a mutable reference to the output at this location, panicking if out of bounds.

1.20.0 (const: unstable) · Source§

impl SliceIndex<str> for Range<usize>

Implements substring slicing with syntax &self[begin .. end] or &mut self[begin .. end].

Returns a slice of the given string from the byte range [begin, end).

This operation is O(1).

Prior to 1.20.0, these indexing operations were still supported by direct implementation of Index and IndexMut.

§Panics

Panics if begin or end does not point to the starting byte offset of a character (as defined by is_char_boundary), if begin > end, or if end > len.

§Examples

let s = "Löwe 老虎 Léopard";
assert_eq!(&s[0 .. 1], "L");

assert_eq!(&s[1 .. 9], "öwe 老");

// these will panic:
// byte 2 lies within `ö`:
// &s[2 ..3];

// byte 8 lies within `老`
// &s[1 .. 8];

// byte 100 is outside the string
// &s[3 .. 100];

Source §

Source §

type Error = Error

The type returned in the event of a conversion error.

Source §

fn try_from(r: Range<X>) -> Result<Uniform<X>, Error>

Performs the conversion.

Source §

impl<T> CloneFromCell for Range<T>
where T: CloneFromCell,

1.0.0 · Source§

impl<Idx> Eq for Range<Idx>
where Idx: Eq,

1.26.0 · Source§

impl<A> FusedIterator for Range<A>
where A: Step,

1.0.0 · Source§

impl<Idx> StructuralPartialEq for Range<Idx>

Source §

impl<A> TrustedLen for Range<A>
where A: TrustedStep,

type Type = T

The same type as Self, used to emulate type equality bounds (T == U) with associated type equality constraints (T: Identity<Type = U>).

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more

Source §

impl IntoIterator for I
where I: Iterator,

Source §

type Item = ::Item

The type of the elements being iterated over.

Source §

type IntoIter = I

Which kind of iterator are we turning this into?

👎Deprecated since 0.13.0: Use .chunk_by() instead

👎Deprecated since 0.10.2: Use Iterator::reduce instead

Accumulator of the elements in the iterator. Read more

Source §

fn tree_reduce<F>(self, f: F) -> Option<Self::Item>
where F: FnMut(Self::Item, Self::Item) -> Self::Item, Self: Sized,

Accumulate the elements in the iterator in a tree-like manner. Read more

Source §

fn tree_fold1<F>(self, f: F) -> Option<Self::Item>
where F: FnMut(Self::Item, Self::Item) -> Self::Item, Self: Sized,

👎Deprecated since 0.13.0: Use .tree_reduce() instead

Returns the length of the iterator if one exists. Otherwise return self.size_hint(). Read more

Source §

Drops the object pointed to by the given pointer. Read more

Source §

impl<'a, T> RCowCompatibleRef<'a> for T
where T: Clone + 'a,

Source §

type RefC = &'a T

The (preferably) ffi-safe equivalent of &Self.

Source §

type ROwned = T

The owned version of Self::RefC.

Source §

fn as_c_ref(from: &'a T) -> <T as RCowCompatibleRef<'a>>::RefC

Converts a reference to an FFI-safe type

Source §

fn as_rust_ref(from: <T as RCowCompatibleRef<'a>>::RefC) -> &'a T

Converts an FFI-safe type to a reference

Source §

impl<S> ROExtAcc for S

Source §

fn f_get<F>(&self, offset: FieldOffset<S, F, Aligned>) -> &F

Performs the conversion.

Source §

impl<T, U> TryInto for T
where U: TryFrom<T>,

Source §

type Error = >::Error

The type returned in the event of a conversion error.

Source §

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Source §

Struct Range Copy item path

§Examples

Fields§

Implementations§

impl<Idx> Range<Idx>where Idx: PartialOrd,

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

§Examples

pub fn is_empty(&self) -> boolwhere Idx: PartialOrd,

§Examples

Trait Implementations§

impl<'a, A> Arbitrary<'a> for Range<A>where A: Arbitrary<'a> + Clone + PartialOrd,

fn arbitrary(u: &mut Unstructured<'a>) -> Result<Range<A>, Error>

fn size_hint(depth: usize) -> (usize, Option<usize>)

fn try_size_hint( depth: usize, ) -> Result<(usize, Option<usize>), MaxRecursionReached>

fn arbitrary_take_rest(u: Unstructured<'a>) -> Result<Self, Error>

impl<Z> AsRangedCoord for Range<Date<Z>>where Z: TimeZone,

type CoordDescType = RangedDate<Date<Z>>

type Value = Date<Z>

impl<Z> AsRangedCoord for Range<DateTime<Z>>where Z: TimeZone,

type CoordDescType = RangedDateTime<DateTime<Z>>

type Value = DateTime<Z>

impl AsRangedCoord for Range<NaiveDate>

type CoordDescType = RangedDate<NaiveDate>

type Value = NaiveDate

impl AsRangedCoord for Range<TimeDelta>

type CoordDescType = RangedDuration

type Value = TimeDelta

impl AsRangedCoord for Range<f32>

type CoordDescType = RangedCoordf32

type Value = f32

impl AsRangedCoord for Range<f64>

type CoordDescType = RangedCoordf64

type Value = f64

impl AsRangedCoord for Range<i128>

type CoordDescType = RangedCoordi128

type Value = i128

impl AsRangedCoord for Range<i32>

type CoordDescType = RangedCoordi32

type Value = i32

impl AsRangedCoord for Range<i64>

type CoordDescType = RangedCoordi64

type Value = i64

impl AsRangedCoord for Range<isize>

type CoordDescType = RangedCoordisize

type Value = isize

impl AsRangedCoord for Range<u128>

type CoordDescType = RangedCoordu128

type Value = u128

impl AsRangedCoord for Range<u32>

type CoordDescType = RangedCoordu32

type Value = u32

impl AsRangedCoord for Range<u64>

type CoordDescType = RangedCoordu64

type Value = u64

impl AsRangedCoord for Range<usize>

type CoordDescType = RangedCoordusize

type Value = usize

impl<'de, T, Context> BorrowDecode<'de, Context> for Range<T>where T: BorrowDecode<'de, Context>,

fn borrow_decode<D>(decoder: &mut D) -> Result<Range<T>, DecodeError>where D: BorrowDecoder<'de, Context = Context>,

impl<Idx> Clone for Range<Idx>where Idx: Clone,

fn clone(&self) -> Range<Idx> ⓘ

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

impl<Idx> Debug for Range<Idx>where Idx: Debug,

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

impl<Context, T> Decode<Context> for Range<T>where T: Decode<Context>,

fn decode<D>(decoder: &mut D) -> Result<Range<T>, DecodeError>where D: Decoder<Context = Context>,

impl<Idx> Default for Range<Idx>where Idx: Default,

fn default() -> Range<Idx> ⓘ

impl<'de, Idx> Deserialize<'de> for Range<Idx>where Idx: Deserialize<'de>,

fn deserialize<D>( deserializer: D, ) -> Result<Range<Idx>, <D as Deserializer<'de>>::Error>where D: Deserializer<'de>,

impl<D> DimRange<D> for Range<usize>where D: Dim,

type Size = Dyn

fn begin(&self, _: D) -> usize

fn end(&self, _: D) -> usize

fn size(&self, _: D) -> <Range<usize> as DimRange<D>>::Size ⓘ

impl<D> DimRange<D> for Range<usize>where D: Dim,

type Size = Dyn

fn begin(&self, _: D) -> usize

fn end(&self, _: D) -> usize

fn size(&self, _: D) -> <Range<usize> as DimRange<D>>::Size ⓘ

Struct Range

impl<Idx> Range<Idx>
where Idx: PartialOrd,

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

pub fn is_empty(&self) -> bool
where Idx: PartialOrd,

impl<'a, A> Arbitrary<'a> for Range<A>
where A: Arbitrary<'a> + Clone + PartialOrd,

impl<Z> AsRangedCoord for Range<Date<Z>>
where Z: TimeZone,

impl<Z> AsRangedCoord for Range<DateTime<Z>>
where Z: TimeZone,

impl<'de, T, Context> BorrowDecode<'de, Context> for Range<T>
where T: BorrowDecode<'de, Context>,

fn borrow_decode<D>(decoder: &mut D) -> Result<Range<T>, DecodeError>
where D: BorrowDecoder<'de, Context = Context>,

impl<Idx> Clone for Range<Idx>
where Idx: Clone,

impl<Idx> Debug for Range<Idx>
where Idx: Debug,

impl<Context, T> Decode<Context> for Range<T>
where T: Decode<Context>,

fn decode<D>(decoder: &mut D) -> Result<Range<T>, DecodeError>
where D: Decoder<Context = Context>,

impl<Idx> Default for Range<Idx>
where Idx: Default,

impl<'de, Idx> Deserialize<'de> for Range<Idx>
where Idx: Deserialize<'de>,

fn deserialize<D>( deserializer: D, ) -> Result<Range<Idx>, <D as Deserializer<'de>>::Error>
where D: Deserializer<'de>,

impl<D> DimRange<D> for Range<usize>
where D: Dim,

impl<D> DimRange<D> for Range<usize>
where D: Dim,

impl<A> DoubleEndedIterator for Range<A>
where A: Step,

fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R
where Self: Sized, F: FnMut(B, Self::Item) -> R, R: Try<Output = B>,

fn rfold<B, F>(self, init: B, f: F) -> B
where Self: Sized, F: FnMut(B, Self::Item) -> B,

fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item>
where Self: Sized, P: FnMut(&Self::Item) -> bool,

impl<T> Encode for Range<T>
where T: Encode,

fn encode<E>(&self, encoder: &mut E) -> Result<(), EncodeError>
where E: Encoder,

impl<D> From<Range<D>> for RangedDate<D>
where D: Datelike,

impl<Z> From<Range<DateTime<Z>>> for RangedDateTime<DateTime<Z>>
where Z: TimeZone,

impl<X> From<Range<X>> for Uniform<X>
where X: SampleUniform,