1.26.0[−][src]Struct un_algebra::tests::float::RangeInclusive
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
.
This iterator is fused, but the specific values of start
and end
after
iteration has finished are unspecified other than that .is_empty()
will return true
once no more values will be produced.
Examples
assert_eq!((3..=5), std::ops::RangeInclusive::new(3, 5)); assert_eq!(3 + 4 + 5, (3..=5).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 ]); assert_eq!(arr[1..=3], [ 1,2,3 ]); // RangeInclusive
Methods
impl<Idx> RangeInclusive<Idx>
[src]
ⓘImportant traits for RangeInclusive<A>pub const fn new(start: Idx, end: Idx) -> RangeInclusive<Idx>
1.27.0[src]
Creates a new inclusive range. Equivalent to writing start..=end
.
Examples
use std::ops::RangeInclusive; assert_eq!(3..=5, RangeInclusive::new(3, 5));
pub const fn start(&self) -> &Idx
1.27.0[src]
Returns the lower bound of the range (inclusive).
When using an inclusive range for iteration, the values of start()
and
end()
are unspecified after the iteration ended. To determine
whether the inclusive range is empty, use the is_empty()
method
instead of comparing start() > end()
.
Note: the value returned by this method is unspecified after the range has been iterated to exhaustion.
Examples
assert_eq!((3..=5).start(), &3);
pub const fn end(&self) -> &Idx
1.27.0[src]
Returns the upper bound of the range (inclusive).
When using an inclusive range for iteration, the values of start()
and end()
are unspecified after the iteration ended. To determine
whether the inclusive range is empty, use the is_empty()
method
instead of comparing start() > end()
.
Note: the value returned by this method is unspecified after the range has been iterated to exhaustion.
Examples
assert_eq!((3..=5).end(), &5);
pub fn into_inner(self) -> (Idx, Idx)
1.27.0[src]
Destructures the RangeInclusive
into (lower bound, upper (inclusive) bound).
Note: the value returned by this method is unspecified after the range has been iterated to exhaustion.
Examples
assert_eq!((3..=5).into_inner(), (3, 5));
impl<Idx> RangeInclusive<Idx> where
Idx: PartialOrd<Idx>,
[src]
Idx: PartialOrd<Idx>,
pub fn contains<U>(&self, item: &U) -> bool where
Idx: PartialOrd<U>,
U: PartialOrd<Idx> + ?Sized,
1.35.0[src]
Idx: PartialOrd<U>,
U: PartialOrd<Idx> + ?Sized,
Returns true
if item
is contained in the range.
Examples
use std::f32; assert!(!(3..=5).contains(&2)); assert!( (3..=5).contains(&3)); assert!( (3..=5).contains(&4)); assert!( (3..=5).contains(&5)); assert!(!(3..=5).contains(&6)); assert!( (3..=3).contains(&3)); assert!(!(3..=2).contains(&3)); assert!( (0.0..=1.0).contains(&1.0)); assert!(!(0.0..=1.0).contains(&f32::NAN)); assert!(!(0.0..=f32::NAN).contains(&0.0)); assert!(!(f32::NAN..=1.0).contains(&1.0));
pub fn is_empty(&self) -> bool
[src]
🔬 This is a nightly-only experimental API. (range_is_empty
)
recently added
Returns true
if the range contains no items.
Examples
#![feature(range_is_empty)] assert!(!(3..=5).is_empty()); assert!(!(3..=3).is_empty()); assert!( (3..=2).is_empty());
The range is empty if either side is incomparable:
#![feature(range_is_empty)] use std::f32::NAN; assert!(!(3.0..=5.0).is_empty()); assert!( (3.0..=NAN).is_empty()); assert!( (NAN..=5.0).is_empty());
This method returns true
after iteration has finished:
#![feature(range_is_empty)] let mut r = 3..=5; for _ in r.by_ref() {} // Precise field values are unspecified here assert!(r.is_empty());
Trait Implementations
impl<'_, T> RangeBounds<T> for RangeInclusive<&'_ T>
1.28.0[src]
fn start_bound(&self) -> Bound<&T>
[src]
fn end_bound(&self) -> Bound<&T>
[src]
fn contains<U>(&self, item: &U) -> bool where
T: PartialOrd<U>,
U: PartialOrd<T> + ?Sized,
1.35.0[src]
T: PartialOrd<U>,
U: PartialOrd<T> + ?Sized,
Returns true
if item
is contained in the range. Read more
impl<T> RangeBounds<T> for RangeInclusive<T>
1.28.0[src]
fn start_bound(&self) -> Bound<&T>
[src]
fn end_bound(&self) -> Bound<&T>
[src]
fn contains<U>(&self, item: &U) -> bool where
T: PartialOrd<U>,
U: PartialOrd<T> + ?Sized,
1.35.0[src]
T: PartialOrd<U>,
U: PartialOrd<T> + ?Sized,
Returns true
if item
is contained in the range. Read more
impl<Idx> Hash for RangeInclusive<Idx> where
Idx: Hash,
[src]
Idx: Hash,
fn hash<H>(&self, state: &mut H) where
H: Hasher,
[src]
H: Hasher,
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
Feeds a slice of this type into the given [Hasher
]. Read more
impl<Idx> Eq for RangeInclusive<Idx> where
Idx: Eq,
[src]
Idx: Eq,
impl<Idx> Clone for RangeInclusive<Idx> where
Idx: Clone,
[src]
Idx: Clone,
ⓘImportant traits for RangeInclusive<A>fn clone(&self) -> RangeInclusive<Idx>
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl TrustedLen for RangeInclusive<usize>
[src]
impl TrustedLen for RangeInclusive<isize>
[src]
impl TrustedLen for RangeInclusive<i128>
[src]
impl TrustedLen for RangeInclusive<u64>
[src]
impl TrustedLen for RangeInclusive<u32>
[src]
impl TrustedLen for RangeInclusive<u128>
[src]
impl TrustedLen for RangeInclusive<u8>
[src]
impl TrustedLen for RangeInclusive<i8>
[src]
impl TrustedLen for RangeInclusive<u16>
[src]
impl TrustedLen for RangeInclusive<i32>
[src]
impl TrustedLen for RangeInclusive<i16>
[src]
impl TrustedLen for RangeInclusive<i64>
[src]
impl<Idx> Debug for RangeInclusive<Idx> where
Idx: Debug,
[src]
Idx: Debug,
impl<A> DoubleEndedIterator for RangeInclusive<A> where
A: Step,
[src]
A: Step,
fn next_back(&mut self) -> Option<A>
[src]
fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, <RangeInclusive<A> as Iterator>::Item) -> R,
R: Try<Ok = B>,
RangeInclusive<A>: Sized,
[src]
F: FnMut(B, <RangeInclusive<A> as Iterator>::Item) -> R,
R: Try<Ok = B>,
RangeInclusive<A>: Sized,
fn nth_back(&mut self, n: usize) -> Option<Self::Item>
[src]
iter_nth_back
)Returns the n
th element from the end of the iterator. Read more
fn rfold<B, F>(self, accum: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B,
1.27.0[src]
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
fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item> where
P: FnMut(&Self::Item) -> bool,
1.27.0[src]
P: FnMut(&Self::Item) -> bool,
Searches for an element of an iterator from the back that satisfies a predicate. Read more
impl<T> SliceIndex<[T]> for RangeInclusive<usize>
[src]
type Output = [T]
The output type returned by methods.
fn get(self, slice: &[T]) -> Option<&[T]>
[src]
fn get_mut(self, slice: &mut [T]) -> Option<&mut [T]>
[src]
unsafe fn get_unchecked(self, slice: &[T]) -> &[T]
[src]
unsafe fn get_unchecked_mut(self, slice: &mut [T]) -> &mut [T]
[src]
fn index(self, slice: &[T]) -> &[T]
[src]
fn index_mut(self, slice: &mut [T]) -> &mut [T]
[src]
impl SliceIndex<str> for RangeInclusive<usize>
[src]
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
]. Equivalent to &self [begin .. end + 1]
or &mut self[begin .. end + 1]
, except if end
has the maximum value for
usize
.
This operation is O(1)
.
Panics
Panics if begin
does not point to the starting byte offset of
a character (as defined by is_char_boundary
), if end
does not point
to the ending byte offset of a character (end + 1
is either a starting
byte offset or equal to len
), if begin > end
, or if end >= len
.
type Output = str
The output type returned by methods.
fn get(
self,
slice: &str
) -> Option<&<RangeInclusive<usize> as SliceIndex<str>>::Output>
[src]
self,
slice: &str
) -> Option<&<RangeInclusive<usize> as SliceIndex<str>>::Output>
fn get_mut(
self,
slice: &mut str
) -> Option<&mut <RangeInclusive<usize> as SliceIndex<str>>::Output>
[src]
self,
slice: &mut str
) -> Option<&mut <RangeInclusive<usize> as SliceIndex<str>>::Output>
ⓘImportant traits for RangeInclusive<A>unsafe fn get_unchecked(
self,
slice: &str
) -> &<RangeInclusive<usize> as SliceIndex<str>>::Output
[src]
self,
slice: &str
) -> &<RangeInclusive<usize> as SliceIndex<str>>::Output
ⓘImportant traits for RangeInclusive<A>unsafe fn get_unchecked_mut(
self,
slice: &mut str
) -> &mut <RangeInclusive<usize> as SliceIndex<str>>::Output
[src]
self,
slice: &mut str
) -> &mut <RangeInclusive<usize> as SliceIndex<str>>::Output
ⓘImportant traits for RangeInclusive<A>fn index(
self,
slice: &str
) -> &<RangeInclusive<usize> as SliceIndex<str>>::Output
[src]
self,
slice: &str
) -> &<RangeInclusive<usize> as SliceIndex<str>>::Output
ⓘImportant traits for RangeInclusive<A>fn index_mut(
self,
slice: &mut str
) -> &mut <RangeInclusive<usize> as SliceIndex<str>>::Output
[src]
self,
slice: &mut str
) -> &mut <RangeInclusive<usize> as SliceIndex<str>>::Output
impl<Idx> PartialEq<RangeInclusive<Idx>> for RangeInclusive<Idx> where
Idx: PartialEq<Idx>,
[src]
Idx: PartialEq<Idx>,
fn eq(&self, other: &RangeInclusive<Idx>) -> bool
[src]
#[must_use]
fn ne(&self, other: &Rhs) -> bool
1.0.0[src]
This method tests for !=
.
impl<A> Iterator for RangeInclusive<A> where
A: Step,
[src]
A: Step,
type Item = A
The type of the elements being iterated over.
fn next(&mut self) -> Option<A>
[src]
fn size_hint(&self) -> (usize, Option<usize>)
[src]
fn nth(&mut self, n: usize) -> Option<A>
[src]
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, <RangeInclusive<A> as Iterator>::Item) -> R,
R: Try<Ok = B>,
RangeInclusive<A>: Sized,
[src]
F: FnMut(B, <RangeInclusive<A> as Iterator>::Item) -> R,
R: Try<Ok = B>,
RangeInclusive<A>: Sized,
fn last(self) -> Option<A>
[src]
fn min(self) -> Option<A>
[src]
fn max(self) -> Option<A>
[src]
fn count(self) -> usize
1.0.0[src]
Consumes the iterator, counting the number of iterations and returning it. Read more
fn step_by(self, step: usize) -> StepBy<Self>
1.28.0[src]
Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Read more
fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator<Item = Self::Item>,
1.0.0[src]
U: IntoIterator<Item = Self::Item>,
Takes two iterators and creates a new iterator over both in sequence. Read more
fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator,
1.0.0[src]
U: IntoIterator,
'Zips up' two iterators into a single iterator of pairs. Read more
fn map<B, F>(self, f: F) -> Map<Self, F> where
F: FnMut(Self::Item) -> B,
1.0.0[src]
F: FnMut(Self::Item) -> B,
Takes a closure and creates an iterator which calls that closure on each element. Read more
fn for_each<F>(self, f: F) where
F: FnMut(Self::Item),
1.21.0[src]
F: FnMut(Self::Item),
Calls a closure on each element of an iterator. Read more
fn filter<P>(self, predicate: P) -> Filter<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
Creates an iterator which uses a closure to determine if an element should be yielded. Read more
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
F: FnMut(Self::Item) -> Option<B>,
1.0.0[src]
F: FnMut(Self::Item) -> Option<B>,
Creates an iterator that both filters and maps. Read more
fn enumerate(self) -> Enumerate<Self>
1.0.0[src]
Creates an iterator which gives the current iteration count as well as the next value. Read more
fn peekable(self) -> Peekable<Self>
1.0.0[src]
Creates an iterator which can use peek
to look at the next element of the iterator without consuming it. Read more
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
Creates an iterator that [skip
]s elements based on a predicate. Read more
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
Creates an iterator that yields elements based on a predicate. Read more
fn skip(self, n: usize) -> Skip<Self>
1.0.0[src]
Creates an iterator that skips the first n
elements. Read more
fn take(self, n: usize) -> Take<Self>
1.0.0[src]
Creates an iterator that yields its first n
elements. Read more
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
F: FnMut(&mut St, Self::Item) -> Option<B>,
1.0.0[src]
F: FnMut(&mut St, Self::Item) -> Option<B>,
An iterator adaptor similar to [fold
] that holds internal state and produces a new iterator. Read more
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
F: FnMut(Self::Item) -> U,
U: IntoIterator,
1.0.0[src]
F: FnMut(Self::Item) -> U,
U: IntoIterator,
Creates an iterator that works like map, but flattens nested structure. Read more
fn flatten(self) -> Flatten<Self> where
Self::Item: IntoIterator,
1.29.0[src]
Self::Item: IntoIterator,
Creates an iterator that flattens nested structure. Read more
fn fuse(self) -> Fuse<Self>
1.0.0[src]
Creates an iterator which ends after the first [None
]. Read more
fn inspect<F>(self, f: F) -> Inspect<Self, F> where
F: FnMut(&Self::Item),
1.0.0[src]
F: FnMut(&Self::Item),
Do something with each element of an iterator, passing the value on. Read more
fn by_ref(&mut self) -> &mut Self
1.0.0[src]
Borrows an iterator, rather than consuming it. Read more
#[must_use = "if you really need to exhaust the iterator, consider `.for_each(drop)` instead"]
fn collect<B>(self) -> B where
B: FromIterator<Self::Item>,
1.0.0[src]
B: FromIterator<Self::Item>,
Transforms an iterator into a collection. Read more
fn partition<B, F>(self, f: F) -> (B, B) where
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
1.0.0[src]
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
Consumes an iterator, creating two collections from it. Read more
fn try_for_each<F, R>(&mut self, f: F) -> R where
F: FnMut(Self::Item) -> R,
R: Try<Ok = ()>,
1.27.0[src]
F: FnMut(Self::Item) -> R,
R: Try<Ok = ()>,
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
fn fold<B, F>(self, init: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B,
1.0.0[src]
F: FnMut(B, Self::Item) -> B,
An iterator method that applies a function, producing a single, final value. Read more
fn all<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0[src]
F: FnMut(Self::Item) -> bool,
Tests if every element of the iterator matches a predicate. Read more
fn any<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0[src]
F: FnMut(Self::Item) -> bool,
Tests if any element of the iterator matches a predicate. Read more
fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
Searches for an element of an iterator that satisfies a predicate. Read more
fn find_map<B, F>(&mut self, f: F) -> Option<B> where
F: FnMut(Self::Item) -> Option<B>,
1.30.0[src]
F: FnMut(Self::Item) -> Option<B>,
Applies function to the elements of iterator and returns the first non-none result. Read more
fn position<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
1.0.0[src]
P: FnMut(Self::Item) -> bool,
Searches for an element in an iterator, returning its index. Read more
fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
1.0.0[src]
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
Searches for an element in an iterator from the right, returning its index. Read more
fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B,
1.6.0[src]
B: Ord,
F: FnMut(&Self::Item) -> B,
Returns the element that gives the maximum value from the specified function. Read more
fn max_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
1.15.0[src]
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Returns the element that gives the maximum value with respect to the specified comparison function. Read more
fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B,
1.6.0[src]
B: Ord,
F: FnMut(&Self::Item) -> B,
Returns the element that gives the minimum value from the specified function. Read more
fn min_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
1.15.0[src]
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
Returns the element that gives the minimum value with respect to the specified comparison function. Read more
fn rev(self) -> Rev<Self> where
Self: DoubleEndedIterator,
1.0.0[src]
Self: DoubleEndedIterator,
Reverses an iterator's direction. Read more
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
1.0.0[src]
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
Converts an iterator of pairs into a pair of containers. Read more
fn copied<'a, T>(self) -> Copied<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Copy,
1.36.0[src]
Self: Iterator<Item = &'a T>,
T: 'a + Copy,
Creates an iterator which copies all of its elements. Read more
fn cloned<'a, T>(self) -> Cloned<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
1.0.0[src]
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
Creates an iterator which [clone
]s all of its elements. Read more
fn cycle(self) -> Cycle<Self> where
Self: Clone,
1.0.0[src]
Self: Clone,
Repeats an iterator endlessly. Read more
fn sum<S>(self) -> S where
S: Sum<Self::Item>,
1.11.0[src]
S: Sum<Self::Item>,
Sums the elements of an iterator. Read more
fn product<P>(self) -> P where
P: Product<Self::Item>,
1.11.0[src]
P: Product<Self::Item>,
Iterates over the entire iterator, multiplying all the elements Read more
fn cmp<I>(self, other: I) -> Ordering where
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
1.5.0[src]
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
Lexicographically compares the elements of this Iterator
with those of another. Read more
fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Lexicographically compares the elements of this Iterator
with those of another. Read more
fn eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are equal to those of another. Read more
fn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are unequal to those of another. Read more
fn lt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically less than those of another. Read more
fn le<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically less or equal to those of another. Read more
fn gt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically greater than those of another. Read more
fn ge<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
Determines if the elements of this Iterator
are lexicographically greater than or equal to those of another. Read more
fn is_sorted(self) -> bool where
Self::Item: PartialOrd<Self::Item>,
[src]
Self::Item: PartialOrd<Self::Item>,
🔬 This is a nightly-only experimental API. (is_sorted
)
new API
Checks if the elements of this iterator are sorted. Read more
fn is_sorted_by<F>(self, compare: F) -> bool where
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,
[src]
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,
🔬 This is a nightly-only experimental API. (is_sorted
)
new API
Checks if the elements of this iterator are sorted using the given comparator function. Read more
fn is_sorted_by_key<F, K>(self, f: F) -> bool where
F: FnMut(&Self::Item) -> K,
K: PartialOrd<K>,
[src]
F: FnMut(&Self::Item) -> K,
K: PartialOrd<K>,
🔬 This is a nightly-only experimental API. (is_sorted
)
new API
Checks if the elements of this iterator are sorted using the given key extraction function. Read more
impl ExactSizeIterator for RangeInclusive<u8>
[src]
fn len(&self) -> usize
1.0.0[src]
Returns the exact number of times the iterator will iterate. Read more
fn is_empty(&self) -> bool
[src]
exact_size_is_empty
)Returns true
if the iterator is empty. Read more
impl ExactSizeIterator for RangeInclusive<u16>
[src]
fn len(&self) -> usize
1.0.0[src]
Returns the exact number of times the iterator will iterate. Read more
fn is_empty(&self) -> bool
[src]
exact_size_is_empty
)Returns true
if the iterator is empty. Read more
impl ExactSizeIterator for RangeInclusive<i16>
[src]
fn len(&self) -> usize
1.0.0[src]
Returns the exact number of times the iterator will iterate. Read more
fn is_empty(&self) -> bool
[src]
exact_size_is_empty
)Returns true
if the iterator is empty. Read more
impl ExactSizeIterator for RangeInclusive<i8>
[src]
fn len(&self) -> usize
1.0.0[src]
Returns the exact number of times the iterator will iterate. Read more
fn is_empty(&self) -> bool
[src]
exact_size_is_empty
)Returns true
if the iterator is empty. Read more
impl<A> FusedIterator for RangeInclusive<A> where
A: Step,
[src]
A: Step,
impl IndexMut<RangeInclusive<usize>> for String
[src]
fn index_mut(&mut self, index: RangeInclusive<usize>) -> &mut str
[src]
impl Index<RangeInclusive<usize>> for String
[src]
type Output = str
The returned type after indexing.
fn index(&self, index: RangeInclusive<usize>) -> &str
[src]
impl Strategy for RangeInclusive<f32>
[src]
type Tree = BinarySearch
The value tree generated by this Strategy
.
type Value = f32
The type of value used by functions under test generated by this Strategy. Read more
fn new_tree(
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<f32> as Strategy>::Tree, Reason>
[src]
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<f32> as Strategy>::Tree, Reason>
fn prop_map<O, F>(self, fun: F) -> Map<Self, F> where
F: Fn(Self::Value) -> O,
O: Debug,
[src]
F: Fn(Self::Value) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
. Read more
fn prop_map_into<O>(self) -> MapInto<Self, O> where
O: Debug,
Self::Value: Into<O>,
[src]
O: Debug,
Self::Value: Into<O>,
Returns a strategy which produces values of type O
by transforming Self
with Into<O>
. Read more
fn prop_perturb<O, F>(self, fun: F) -> Perturb<Self, F> where
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
[src]
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
, which is additionally given a random number generator. Read more
fn prop_flat_map<S, F>(self, fun: F) -> Flatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies. Read more
fn prop_ind_flat_map<S, F>(self, fun: F) -> IndFlatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies while considering the new strategies to be independent. Read more
fn prop_ind_flat_map2<S, F>(self, fun: F) -> IndFlattenMap<Self, F> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Similar to prop_ind_flat_map()
, but produces 2-tuples with the input generated from self
in slot 0 and the derived strategy in slot 1. Read more
fn prop_filter<R, F>(self, whence: R, fun: F) -> Filter<Self, F> where
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
[src]
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
Returns a strategy which only produces values accepted by fun
. Read more
fn prop_filter_map<F, O, impl Into>(
self,
whence: impl Into,
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into: Into<Reason>,
[src]
self,
whence: impl Into
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into
Returns a strategy which only produces transformed values where fun
returns Some(value)
and rejects those where fun
returns None
. Read more
fn prop_union(self, other: Self) -> Union<Self>
[src]
Returns a strategy which picks uniformly from self
and other
. Read more
fn prop_recursive<R, F>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
[src]
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
Generate a recursive structure with self
items as leaves. Read more
fn prop_shuffle(self) -> Shuffle<Self> where
Self::Value: Shuffleable,
[src]
Self::Value: Shuffleable,
Shuffle the contents of the values produced by this strategy. Read more
fn boxed(self) -> BoxedStrategy<Self::Value> where
Self: 'static,
[src]
Self: 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn sboxed(self) -> SBoxedStrategy<Self::Value> where
Self: Send + Sync + 'static,
[src]
Self: Send + Sync + 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn no_shrink(self) -> NoShrink<Self>
[src]
Wraps this strategy to prevent values from being subject to shrinking. Read more
impl Strategy for RangeInclusive<i64>
[src]
type Tree = BinarySearch
The value tree generated by this Strategy
.
type Value = i64
The type of value used by functions under test generated by this Strategy. Read more
fn new_tree(
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<i64> as Strategy>::Tree, Reason>
[src]
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<i64> as Strategy>::Tree, Reason>
fn prop_map<O, F>(self, fun: F) -> Map<Self, F> where
F: Fn(Self::Value) -> O,
O: Debug,
[src]
F: Fn(Self::Value) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
. Read more
fn prop_map_into<O>(self) -> MapInto<Self, O> where
O: Debug,
Self::Value: Into<O>,
[src]
O: Debug,
Self::Value: Into<O>,
Returns a strategy which produces values of type O
by transforming Self
with Into<O>
. Read more
fn prop_perturb<O, F>(self, fun: F) -> Perturb<Self, F> where
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
[src]
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
, which is additionally given a random number generator. Read more
fn prop_flat_map<S, F>(self, fun: F) -> Flatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies. Read more
fn prop_ind_flat_map<S, F>(self, fun: F) -> IndFlatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies while considering the new strategies to be independent. Read more
fn prop_ind_flat_map2<S, F>(self, fun: F) -> IndFlattenMap<Self, F> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Similar to prop_ind_flat_map()
, but produces 2-tuples with the input generated from self
in slot 0 and the derived strategy in slot 1. Read more
fn prop_filter<R, F>(self, whence: R, fun: F) -> Filter<Self, F> where
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
[src]
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
Returns a strategy which only produces values accepted by fun
. Read more
fn prop_filter_map<F, O, impl Into>(
self,
whence: impl Into,
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into: Into<Reason>,
[src]
self,
whence: impl Into
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into
Returns a strategy which only produces transformed values where fun
returns Some(value)
and rejects those where fun
returns None
. Read more
fn prop_union(self, other: Self) -> Union<Self>
[src]
Returns a strategy which picks uniformly from self
and other
. Read more
fn prop_recursive<R, F>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
[src]
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
Generate a recursive structure with self
items as leaves. Read more
fn prop_shuffle(self) -> Shuffle<Self> where
Self::Value: Shuffleable,
[src]
Self::Value: Shuffleable,
Shuffle the contents of the values produced by this strategy. Read more
fn boxed(self) -> BoxedStrategy<Self::Value> where
Self: 'static,
[src]
Self: 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn sboxed(self) -> SBoxedStrategy<Self::Value> where
Self: Send + Sync + 'static,
[src]
Self: Send + Sync + 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn no_shrink(self) -> NoShrink<Self>
[src]
Wraps this strategy to prevent values from being subject to shrinking. Read more
impl Strategy for RangeInclusive<u128>
[src]
type Tree = BinarySearch
The value tree generated by this Strategy
.
type Value = u128
The type of value used by functions under test generated by this Strategy. Read more
fn new_tree(
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<u128> as Strategy>::Tree, Reason>
[src]
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<u128> as Strategy>::Tree, Reason>
fn prop_map<O, F>(self, fun: F) -> Map<Self, F> where
F: Fn(Self::Value) -> O,
O: Debug,
[src]
F: Fn(Self::Value) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
. Read more
fn prop_map_into<O>(self) -> MapInto<Self, O> where
O: Debug,
Self::Value: Into<O>,
[src]
O: Debug,
Self::Value: Into<O>,
Returns a strategy which produces values of type O
by transforming Self
with Into<O>
. Read more
fn prop_perturb<O, F>(self, fun: F) -> Perturb<Self, F> where
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
[src]
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
, which is additionally given a random number generator. Read more
fn prop_flat_map<S, F>(self, fun: F) -> Flatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies. Read more
fn prop_ind_flat_map<S, F>(self, fun: F) -> IndFlatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies while considering the new strategies to be independent. Read more
fn prop_ind_flat_map2<S, F>(self, fun: F) -> IndFlattenMap<Self, F> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Similar to prop_ind_flat_map()
, but produces 2-tuples with the input generated from self
in slot 0 and the derived strategy in slot 1. Read more
fn prop_filter<R, F>(self, whence: R, fun: F) -> Filter<Self, F> where
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
[src]
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
Returns a strategy which only produces values accepted by fun
. Read more
fn prop_filter_map<F, O, impl Into>(
self,
whence: impl Into,
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into: Into<Reason>,
[src]
self,
whence: impl Into
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into
Returns a strategy which only produces transformed values where fun
returns Some(value)
and rejects those where fun
returns None
. Read more
fn prop_union(self, other: Self) -> Union<Self>
[src]
Returns a strategy which picks uniformly from self
and other
. Read more
fn prop_recursive<R, F>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
[src]
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
Generate a recursive structure with self
items as leaves. Read more
fn prop_shuffle(self) -> Shuffle<Self> where
Self::Value: Shuffleable,
[src]
Self::Value: Shuffleable,
Shuffle the contents of the values produced by this strategy. Read more
fn boxed(self) -> BoxedStrategy<Self::Value> where
Self: 'static,
[src]
Self: 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn sboxed(self) -> SBoxedStrategy<Self::Value> where
Self: Send + Sync + 'static,
[src]
Self: Send + Sync + 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn no_shrink(self) -> NoShrink<Self>
[src]
Wraps this strategy to prevent values from being subject to shrinking. Read more
impl Strategy for RangeInclusive<usize>
[src]
type Tree = BinarySearch
The value tree generated by this Strategy
.
type Value = usize
The type of value used by functions under test generated by this Strategy. Read more
fn new_tree(
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<usize> as Strategy>::Tree, Reason>
[src]
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<usize> as Strategy>::Tree, Reason>
fn prop_map<O, F>(self, fun: F) -> Map<Self, F> where
F: Fn(Self::Value) -> O,
O: Debug,
[src]
F: Fn(Self::Value) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
. Read more
fn prop_map_into<O>(self) -> MapInto<Self, O> where
O: Debug,
Self::Value: Into<O>,
[src]
O: Debug,
Self::Value: Into<O>,
Returns a strategy which produces values of type O
by transforming Self
with Into<O>
. Read more
fn prop_perturb<O, F>(self, fun: F) -> Perturb<Self, F> where
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
[src]
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
, which is additionally given a random number generator. Read more
fn prop_flat_map<S, F>(self, fun: F) -> Flatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies. Read more
fn prop_ind_flat_map<S, F>(self, fun: F) -> IndFlatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies while considering the new strategies to be independent. Read more
fn prop_ind_flat_map2<S, F>(self, fun: F) -> IndFlattenMap<Self, F> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Similar to prop_ind_flat_map()
, but produces 2-tuples with the input generated from self
in slot 0 and the derived strategy in slot 1. Read more
fn prop_filter<R, F>(self, whence: R, fun: F) -> Filter<Self, F> where
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
[src]
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
Returns a strategy which only produces values accepted by fun
. Read more
fn prop_filter_map<F, O, impl Into>(
self,
whence: impl Into,
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into: Into<Reason>,
[src]
self,
whence: impl Into
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into
Returns a strategy which only produces transformed values where fun
returns Some(value)
and rejects those where fun
returns None
. Read more
fn prop_union(self, other: Self) -> Union<Self>
[src]
Returns a strategy which picks uniformly from self
and other
. Read more
fn prop_recursive<R, F>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
[src]
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
Generate a recursive structure with self
items as leaves. Read more
fn prop_shuffle(self) -> Shuffle<Self> where
Self::Value: Shuffleable,
[src]
Self::Value: Shuffleable,
Shuffle the contents of the values produced by this strategy. Read more
fn boxed(self) -> BoxedStrategy<Self::Value> where
Self: 'static,
[src]
Self: 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn sboxed(self) -> SBoxedStrategy<Self::Value> where
Self: Send + Sync + 'static,
[src]
Self: Send + Sync + 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn no_shrink(self) -> NoShrink<Self>
[src]
Wraps this strategy to prevent values from being subject to shrinking. Read more
impl Strategy for RangeInclusive<u64>
[src]
type Tree = BinarySearch
The value tree generated by this Strategy
.
type Value = u64
The type of value used by functions under test generated by this Strategy. Read more
fn new_tree(
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<u64> as Strategy>::Tree, Reason>
[src]
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<u64> as Strategy>::Tree, Reason>
fn prop_map<O, F>(self, fun: F) -> Map<Self, F> where
F: Fn(Self::Value) -> O,
O: Debug,
[src]
F: Fn(Self::Value) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
. Read more
fn prop_map_into<O>(self) -> MapInto<Self, O> where
O: Debug,
Self::Value: Into<O>,
[src]
O: Debug,
Self::Value: Into<O>,
Returns a strategy which produces values of type O
by transforming Self
with Into<O>
. Read more
fn prop_perturb<O, F>(self, fun: F) -> Perturb<Self, F> where
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
[src]
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
, which is additionally given a random number generator. Read more
fn prop_flat_map<S, F>(self, fun: F) -> Flatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies. Read more
fn prop_ind_flat_map<S, F>(self, fun: F) -> IndFlatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies while considering the new strategies to be independent. Read more
fn prop_ind_flat_map2<S, F>(self, fun: F) -> IndFlattenMap<Self, F> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Similar to prop_ind_flat_map()
, but produces 2-tuples with the input generated from self
in slot 0 and the derived strategy in slot 1. Read more
fn prop_filter<R, F>(self, whence: R, fun: F) -> Filter<Self, F> where
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
[src]
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
Returns a strategy which only produces values accepted by fun
. Read more
fn prop_filter_map<F, O, impl Into>(
self,
whence: impl Into,
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into: Into<Reason>,
[src]
self,
whence: impl Into
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into
Returns a strategy which only produces transformed values where fun
returns Some(value)
and rejects those where fun
returns None
. Read more
fn prop_union(self, other: Self) -> Union<Self>
[src]
Returns a strategy which picks uniformly from self
and other
. Read more
fn prop_recursive<R, F>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
[src]
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
Generate a recursive structure with self
items as leaves. Read more
fn prop_shuffle(self) -> Shuffle<Self> where
Self::Value: Shuffleable,
[src]
Self::Value: Shuffleable,
Shuffle the contents of the values produced by this strategy. Read more
fn boxed(self) -> BoxedStrategy<Self::Value> where
Self: 'static,
[src]
Self: 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn sboxed(self) -> SBoxedStrategy<Self::Value> where
Self: Send + Sync + 'static,
[src]
Self: Send + Sync + 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn no_shrink(self) -> NoShrink<Self>
[src]
Wraps this strategy to prevent values from being subject to shrinking. Read more
impl Strategy for RangeInclusive<isize>
[src]
type Tree = BinarySearch
The value tree generated by this Strategy
.
type Value = isize
The type of value used by functions under test generated by this Strategy. Read more
fn new_tree(
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<isize> as Strategy>::Tree, Reason>
[src]
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<isize> as Strategy>::Tree, Reason>
fn prop_map<O, F>(self, fun: F) -> Map<Self, F> where
F: Fn(Self::Value) -> O,
O: Debug,
[src]
F: Fn(Self::Value) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
. Read more
fn prop_map_into<O>(self) -> MapInto<Self, O> where
O: Debug,
Self::Value: Into<O>,
[src]
O: Debug,
Self::Value: Into<O>,
Returns a strategy which produces values of type O
by transforming Self
with Into<O>
. Read more
fn prop_perturb<O, F>(self, fun: F) -> Perturb<Self, F> where
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
[src]
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
, which is additionally given a random number generator. Read more
fn prop_flat_map<S, F>(self, fun: F) -> Flatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies. Read more
fn prop_ind_flat_map<S, F>(self, fun: F) -> IndFlatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies while considering the new strategies to be independent. Read more
fn prop_ind_flat_map2<S, F>(self, fun: F) -> IndFlattenMap<Self, F> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Similar to prop_ind_flat_map()
, but produces 2-tuples with the input generated from self
in slot 0 and the derived strategy in slot 1. Read more
fn prop_filter<R, F>(self, whence: R, fun: F) -> Filter<Self, F> where
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
[src]
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
Returns a strategy which only produces values accepted by fun
. Read more
fn prop_filter_map<F, O, impl Into>(
self,
whence: impl Into,
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into: Into<Reason>,
[src]
self,
whence: impl Into
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into
Returns a strategy which only produces transformed values where fun
returns Some(value)
and rejects those where fun
returns None
. Read more
fn prop_union(self, other: Self) -> Union<Self>
[src]
Returns a strategy which picks uniformly from self
and other
. Read more
fn prop_recursive<R, F>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
[src]
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
Generate a recursive structure with self
items as leaves. Read more
fn prop_shuffle(self) -> Shuffle<Self> where
Self::Value: Shuffleable,
[src]
Self::Value: Shuffleable,
Shuffle the contents of the values produced by this strategy. Read more
fn boxed(self) -> BoxedStrategy<Self::Value> where
Self: 'static,
[src]
Self: 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn sboxed(self) -> SBoxedStrategy<Self::Value> where
Self: Send + Sync + 'static,
[src]
Self: Send + Sync + 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn no_shrink(self) -> NoShrink<Self>
[src]
Wraps this strategy to prevent values from being subject to shrinking. Read more
impl Strategy for RangeInclusive<u32>
[src]
type Tree = BinarySearch
The value tree generated by this Strategy
.
type Value = u32
The type of value used by functions under test generated by this Strategy. Read more
fn new_tree(
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<u32> as Strategy>::Tree, Reason>
[src]
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<u32> as Strategy>::Tree, Reason>
fn prop_map<O, F>(self, fun: F) -> Map<Self, F> where
F: Fn(Self::Value) -> O,
O: Debug,
[src]
F: Fn(Self::Value) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
. Read more
fn prop_map_into<O>(self) -> MapInto<Self, O> where
O: Debug,
Self::Value: Into<O>,
[src]
O: Debug,
Self::Value: Into<O>,
Returns a strategy which produces values of type O
by transforming Self
with Into<O>
. Read more
fn prop_perturb<O, F>(self, fun: F) -> Perturb<Self, F> where
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
[src]
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
, which is additionally given a random number generator. Read more
fn prop_flat_map<S, F>(self, fun: F) -> Flatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies. Read more
fn prop_ind_flat_map<S, F>(self, fun: F) -> IndFlatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies while considering the new strategies to be independent. Read more
fn prop_ind_flat_map2<S, F>(self, fun: F) -> IndFlattenMap<Self, F> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Similar to prop_ind_flat_map()
, but produces 2-tuples with the input generated from self
in slot 0 and the derived strategy in slot 1. Read more
fn prop_filter<R, F>(self, whence: R, fun: F) -> Filter<Self, F> where
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
[src]
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
Returns a strategy which only produces values accepted by fun
. Read more
fn prop_filter_map<F, O, impl Into>(
self,
whence: impl Into,
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into: Into<Reason>,
[src]
self,
whence: impl Into
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into
Returns a strategy which only produces transformed values where fun
returns Some(value)
and rejects those where fun
returns None
. Read more
fn prop_union(self, other: Self) -> Union<Self>
[src]
Returns a strategy which picks uniformly from self
and other
. Read more
fn prop_recursive<R, F>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
[src]
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
Generate a recursive structure with self
items as leaves. Read more
fn prop_shuffle(self) -> Shuffle<Self> where
Self::Value: Shuffleable,
[src]
Self::Value: Shuffleable,
Shuffle the contents of the values produced by this strategy. Read more
fn boxed(self) -> BoxedStrategy<Self::Value> where
Self: 'static,
[src]
Self: 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn sboxed(self) -> SBoxedStrategy<Self::Value> where
Self: Send + Sync + 'static,
[src]
Self: Send + Sync + 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn no_shrink(self) -> NoShrink<Self>
[src]
Wraps this strategy to prevent values from being subject to shrinking. Read more
impl Strategy for RangeInclusive<i128>
[src]
type Tree = BinarySearch
The value tree generated by this Strategy
.
type Value = i128
The type of value used by functions under test generated by this Strategy. Read more
fn new_tree(
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<i128> as Strategy>::Tree, Reason>
[src]
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<i128> as Strategy>::Tree, Reason>
fn prop_map<O, F>(self, fun: F) -> Map<Self, F> where
F: Fn(Self::Value) -> O,
O: Debug,
[src]
F: Fn(Self::Value) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
. Read more
fn prop_map_into<O>(self) -> MapInto<Self, O> where
O: Debug,
Self::Value: Into<O>,
[src]
O: Debug,
Self::Value: Into<O>,
Returns a strategy which produces values of type O
by transforming Self
with Into<O>
. Read more
fn prop_perturb<O, F>(self, fun: F) -> Perturb<Self, F> where
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
[src]
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
, which is additionally given a random number generator. Read more
fn prop_flat_map<S, F>(self, fun: F) -> Flatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies. Read more
fn prop_ind_flat_map<S, F>(self, fun: F) -> IndFlatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies while considering the new strategies to be independent. Read more
fn prop_ind_flat_map2<S, F>(self, fun: F) -> IndFlattenMap<Self, F> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Similar to prop_ind_flat_map()
, but produces 2-tuples with the input generated from self
in slot 0 and the derived strategy in slot 1. Read more
fn prop_filter<R, F>(self, whence: R, fun: F) -> Filter<Self, F> where
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
[src]
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
Returns a strategy which only produces values accepted by fun
. Read more
fn prop_filter_map<F, O, impl Into>(
self,
whence: impl Into,
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into: Into<Reason>,
[src]
self,
whence: impl Into
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into
Returns a strategy which only produces transformed values where fun
returns Some(value)
and rejects those where fun
returns None
. Read more
fn prop_union(self, other: Self) -> Union<Self>
[src]
Returns a strategy which picks uniformly from self
and other
. Read more
fn prop_recursive<R, F>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
[src]
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
Generate a recursive structure with self
items as leaves. Read more
fn prop_shuffle(self) -> Shuffle<Self> where
Self::Value: Shuffleable,
[src]
Self::Value: Shuffleable,
Shuffle the contents of the values produced by this strategy. Read more
fn boxed(self) -> BoxedStrategy<Self::Value> where
Self: 'static,
[src]
Self: 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn sboxed(self) -> SBoxedStrategy<Self::Value> where
Self: Send + Sync + 'static,
[src]
Self: Send + Sync + 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn no_shrink(self) -> NoShrink<Self>
[src]
Wraps this strategy to prevent values from being subject to shrinking. Read more
impl Strategy for RangeInclusive<u16>
[src]
type Tree = BinarySearch
The value tree generated by this Strategy
.
type Value = u16
The type of value used by functions under test generated by this Strategy. Read more
fn new_tree(
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<u16> as Strategy>::Tree, Reason>
[src]
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<u16> as Strategy>::Tree, Reason>
fn prop_map<O, F>(self, fun: F) -> Map<Self, F> where
F: Fn(Self::Value) -> O,
O: Debug,
[src]
F: Fn(Self::Value) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
. Read more
fn prop_map_into<O>(self) -> MapInto<Self, O> where
O: Debug,
Self::Value: Into<O>,
[src]
O: Debug,
Self::Value: Into<O>,
Returns a strategy which produces values of type O
by transforming Self
with Into<O>
. Read more
fn prop_perturb<O, F>(self, fun: F) -> Perturb<Self, F> where
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
[src]
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
, which is additionally given a random number generator. Read more
fn prop_flat_map<S, F>(self, fun: F) -> Flatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies. Read more
fn prop_ind_flat_map<S, F>(self, fun: F) -> IndFlatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies while considering the new strategies to be independent. Read more
fn prop_ind_flat_map2<S, F>(self, fun: F) -> IndFlattenMap<Self, F> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Similar to prop_ind_flat_map()
, but produces 2-tuples with the input generated from self
in slot 0 and the derived strategy in slot 1. Read more
fn prop_filter<R, F>(self, whence: R, fun: F) -> Filter<Self, F> where
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
[src]
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
Returns a strategy which only produces values accepted by fun
. Read more
fn prop_filter_map<F, O, impl Into>(
self,
whence: impl Into,
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into: Into<Reason>,
[src]
self,
whence: impl Into
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into
Returns a strategy which only produces transformed values where fun
returns Some(value)
and rejects those where fun
returns None
. Read more
fn prop_union(self, other: Self) -> Union<Self>
[src]
Returns a strategy which picks uniformly from self
and other
. Read more
fn prop_recursive<R, F>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
[src]
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
Generate a recursive structure with self
items as leaves. Read more
fn prop_shuffle(self) -> Shuffle<Self> where
Self::Value: Shuffleable,
[src]
Self::Value: Shuffleable,
Shuffle the contents of the values produced by this strategy. Read more
fn boxed(self) -> BoxedStrategy<Self::Value> where
Self: 'static,
[src]
Self: 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn sboxed(self) -> SBoxedStrategy<Self::Value> where
Self: Send + Sync + 'static,
[src]
Self: Send + Sync + 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn no_shrink(self) -> NoShrink<Self>
[src]
Wraps this strategy to prevent values from being subject to shrinking. Read more
impl Strategy for RangeInclusive<i16>
[src]
type Tree = BinarySearch
The value tree generated by this Strategy
.
type Value = i16
The type of value used by functions under test generated by this Strategy. Read more
fn new_tree(
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<i16> as Strategy>::Tree, Reason>
[src]
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<i16> as Strategy>::Tree, Reason>
fn prop_map<O, F>(self, fun: F) -> Map<Self, F> where
F: Fn(Self::Value) -> O,
O: Debug,
[src]
F: Fn(Self::Value) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
. Read more
fn prop_map_into<O>(self) -> MapInto<Self, O> where
O: Debug,
Self::Value: Into<O>,
[src]
O: Debug,
Self::Value: Into<O>,
Returns a strategy which produces values of type O
by transforming Self
with Into<O>
. Read more
fn prop_perturb<O, F>(self, fun: F) -> Perturb<Self, F> where
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
[src]
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
, which is additionally given a random number generator. Read more
fn prop_flat_map<S, F>(self, fun: F) -> Flatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies. Read more
fn prop_ind_flat_map<S, F>(self, fun: F) -> IndFlatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies while considering the new strategies to be independent. Read more
fn prop_ind_flat_map2<S, F>(self, fun: F) -> IndFlattenMap<Self, F> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Similar to prop_ind_flat_map()
, but produces 2-tuples with the input generated from self
in slot 0 and the derived strategy in slot 1. Read more
fn prop_filter<R, F>(self, whence: R, fun: F) -> Filter<Self, F> where
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
[src]
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
Returns a strategy which only produces values accepted by fun
. Read more
fn prop_filter_map<F, O, impl Into>(
self,
whence: impl Into,
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into: Into<Reason>,
[src]
self,
whence: impl Into
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into
Returns a strategy which only produces transformed values where fun
returns Some(value)
and rejects those where fun
returns None
. Read more
fn prop_union(self, other: Self) -> Union<Self>
[src]
Returns a strategy which picks uniformly from self
and other
. Read more
fn prop_recursive<R, F>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
[src]
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
Generate a recursive structure with self
items as leaves. Read more
fn prop_shuffle(self) -> Shuffle<Self> where
Self::Value: Shuffleable,
[src]
Self::Value: Shuffleable,
Shuffle the contents of the values produced by this strategy. Read more
fn boxed(self) -> BoxedStrategy<Self::Value> where
Self: 'static,
[src]
Self: 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn sboxed(self) -> SBoxedStrategy<Self::Value> where
Self: Send + Sync + 'static,
[src]
Self: Send + Sync + 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn no_shrink(self) -> NoShrink<Self>
[src]
Wraps this strategy to prevent values from being subject to shrinking. Read more
impl Strategy for RangeInclusive<i8>
[src]
type Tree = BinarySearch
The value tree generated by this Strategy
.
type Value = i8
The type of value used by functions under test generated by this Strategy. Read more
fn new_tree(
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<i8> as Strategy>::Tree, Reason>
[src]
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<i8> as Strategy>::Tree, Reason>
fn prop_map<O, F>(self, fun: F) -> Map<Self, F> where
F: Fn(Self::Value) -> O,
O: Debug,
[src]
F: Fn(Self::Value) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
. Read more
fn prop_map_into<O>(self) -> MapInto<Self, O> where
O: Debug,
Self::Value: Into<O>,
[src]
O: Debug,
Self::Value: Into<O>,
Returns a strategy which produces values of type O
by transforming Self
with Into<O>
. Read more
fn prop_perturb<O, F>(self, fun: F) -> Perturb<Self, F> where
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
[src]
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
, which is additionally given a random number generator. Read more
fn prop_flat_map<S, F>(self, fun: F) -> Flatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies. Read more
fn prop_ind_flat_map<S, F>(self, fun: F) -> IndFlatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies while considering the new strategies to be independent. Read more
fn prop_ind_flat_map2<S, F>(self, fun: F) -> IndFlattenMap<Self, F> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Similar to prop_ind_flat_map()
, but produces 2-tuples with the input generated from self
in slot 0 and the derived strategy in slot 1. Read more
fn prop_filter<R, F>(self, whence: R, fun: F) -> Filter<Self, F> where
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
[src]
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
Returns a strategy which only produces values accepted by fun
. Read more
fn prop_filter_map<F, O, impl Into>(
self,
whence: impl Into,
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into: Into<Reason>,
[src]
self,
whence: impl Into
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into
Returns a strategy which only produces transformed values where fun
returns Some(value)
and rejects those where fun
returns None
. Read more
fn prop_union(self, other: Self) -> Union<Self>
[src]
Returns a strategy which picks uniformly from self
and other
. Read more
fn prop_recursive<R, F>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
[src]
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
Generate a recursive structure with self
items as leaves. Read more
fn prop_shuffle(self) -> Shuffle<Self> where
Self::Value: Shuffleable,
[src]
Self::Value: Shuffleable,
Shuffle the contents of the values produced by this strategy. Read more
fn boxed(self) -> BoxedStrategy<Self::Value> where
Self: 'static,
[src]
Self: 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn sboxed(self) -> SBoxedStrategy<Self::Value> where
Self: Send + Sync + 'static,
[src]
Self: Send + Sync + 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn no_shrink(self) -> NoShrink<Self>
[src]
Wraps this strategy to prevent values from being subject to shrinking. Read more
impl Strategy for RangeInclusive<u8>
[src]
type Tree = BinarySearch
The value tree generated by this Strategy
.
type Value = u8
The type of value used by functions under test generated by this Strategy. Read more
fn new_tree(
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<u8> as Strategy>::Tree, Reason>
[src]
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<u8> as Strategy>::Tree, Reason>
fn prop_map<O, F>(self, fun: F) -> Map<Self, F> where
F: Fn(Self::Value) -> O,
O: Debug,
[src]
F: Fn(Self::Value) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
. Read more
fn prop_map_into<O>(self) -> MapInto<Self, O> where
O: Debug,
Self::Value: Into<O>,
[src]
O: Debug,
Self::Value: Into<O>,
Returns a strategy which produces values of type O
by transforming Self
with Into<O>
. Read more
fn prop_perturb<O, F>(self, fun: F) -> Perturb<Self, F> where
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
[src]
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
, which is additionally given a random number generator. Read more
fn prop_flat_map<S, F>(self, fun: F) -> Flatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies. Read more
fn prop_ind_flat_map<S, F>(self, fun: F) -> IndFlatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies while considering the new strategies to be independent. Read more
fn prop_ind_flat_map2<S, F>(self, fun: F) -> IndFlattenMap<Self, F> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Similar to prop_ind_flat_map()
, but produces 2-tuples with the input generated from self
in slot 0 and the derived strategy in slot 1. Read more
fn prop_filter<R, F>(self, whence: R, fun: F) -> Filter<Self, F> where
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
[src]
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
Returns a strategy which only produces values accepted by fun
. Read more
fn prop_filter_map<F, O, impl Into>(
self,
whence: impl Into,
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into: Into<Reason>,
[src]
self,
whence: impl Into
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into
Returns a strategy which only produces transformed values where fun
returns Some(value)
and rejects those where fun
returns None
. Read more
fn prop_union(self, other: Self) -> Union<Self>
[src]
Returns a strategy which picks uniformly from self
and other
. Read more
fn prop_recursive<R, F>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
[src]
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
Generate a recursive structure with self
items as leaves. Read more
fn prop_shuffle(self) -> Shuffle<Self> where
Self::Value: Shuffleable,
[src]
Self::Value: Shuffleable,
Shuffle the contents of the values produced by this strategy. Read more
fn boxed(self) -> BoxedStrategy<Self::Value> where
Self: 'static,
[src]
Self: 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn sboxed(self) -> SBoxedStrategy<Self::Value> where
Self: Send + Sync + 'static,
[src]
Self: Send + Sync + 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn no_shrink(self) -> NoShrink<Self>
[src]
Wraps this strategy to prevent values from being subject to shrinking. Read more
impl Strategy for RangeInclusive<i32>
[src]
type Tree = BinarySearch
The value tree generated by this Strategy
.
type Value = i32
The type of value used by functions under test generated by this Strategy. Read more
fn new_tree(
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<i32> as Strategy>::Tree, Reason>
[src]
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<i32> as Strategy>::Tree, Reason>
fn prop_map<O, F>(self, fun: F) -> Map<Self, F> where
F: Fn(Self::Value) -> O,
O: Debug,
[src]
F: Fn(Self::Value) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
. Read more
fn prop_map_into<O>(self) -> MapInto<Self, O> where
O: Debug,
Self::Value: Into<O>,
[src]
O: Debug,
Self::Value: Into<O>,
Returns a strategy which produces values of type O
by transforming Self
with Into<O>
. Read more
fn prop_perturb<O, F>(self, fun: F) -> Perturb<Self, F> where
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
[src]
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
, which is additionally given a random number generator. Read more
fn prop_flat_map<S, F>(self, fun: F) -> Flatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies. Read more
fn prop_ind_flat_map<S, F>(self, fun: F) -> IndFlatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies while considering the new strategies to be independent. Read more
fn prop_ind_flat_map2<S, F>(self, fun: F) -> IndFlattenMap<Self, F> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Similar to prop_ind_flat_map()
, but produces 2-tuples with the input generated from self
in slot 0 and the derived strategy in slot 1. Read more
fn prop_filter<R, F>(self, whence: R, fun: F) -> Filter<Self, F> where
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
[src]
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
Returns a strategy which only produces values accepted by fun
. Read more
fn prop_filter_map<F, O, impl Into>(
self,
whence: impl Into,
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into: Into<Reason>,
[src]
self,
whence: impl Into
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into
Returns a strategy which only produces transformed values where fun
returns Some(value)
and rejects those where fun
returns None
. Read more
fn prop_union(self, other: Self) -> Union<Self>
[src]
Returns a strategy which picks uniformly from self
and other
. Read more
fn prop_recursive<R, F>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
[src]
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
Generate a recursive structure with self
items as leaves. Read more
fn prop_shuffle(self) -> Shuffle<Self> where
Self::Value: Shuffleable,
[src]
Self::Value: Shuffleable,
Shuffle the contents of the values produced by this strategy. Read more
fn boxed(self) -> BoxedStrategy<Self::Value> where
Self: 'static,
[src]
Self: 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn sboxed(self) -> SBoxedStrategy<Self::Value> where
Self: Send + Sync + 'static,
[src]
Self: Send + Sync + 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn no_shrink(self) -> NoShrink<Self>
[src]
Wraps this strategy to prevent values from being subject to shrinking. Read more
impl Strategy for RangeInclusive<f64>
[src]
type Tree = BinarySearch
The value tree generated by this Strategy
.
type Value = f64
The type of value used by functions under test generated by this Strategy. Read more
fn new_tree(
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<f64> as Strategy>::Tree, Reason>
[src]
&self,
runner: &mut TestRunner
) -> Result<<RangeInclusive<f64> as Strategy>::Tree, Reason>
fn prop_map<O, F>(self, fun: F) -> Map<Self, F> where
F: Fn(Self::Value) -> O,
O: Debug,
[src]
F: Fn(Self::Value) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
. Read more
fn prop_map_into<O>(self) -> MapInto<Self, O> where
O: Debug,
Self::Value: Into<O>,
[src]
O: Debug,
Self::Value: Into<O>,
Returns a strategy which produces values of type O
by transforming Self
with Into<O>
. Read more
fn prop_perturb<O, F>(self, fun: F) -> Perturb<Self, F> where
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
[src]
F: Fn(Self::Value, TestRng) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
, which is additionally given a random number generator. Read more
fn prop_flat_map<S, F>(self, fun: F) -> Flatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies. Read more
fn prop_ind_flat_map<S, F>(self, fun: F) -> IndFlatten<Map<Self, F>> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies while considering the new strategies to be independent. Read more
fn prop_ind_flat_map2<S, F>(self, fun: F) -> IndFlattenMap<Self, F> where
F: Fn(Self::Value) -> S,
S: Strategy,
[src]
F: Fn(Self::Value) -> S,
S: Strategy,
Similar to prop_ind_flat_map()
, but produces 2-tuples with the input generated from self
in slot 0 and the derived strategy in slot 1. Read more
fn prop_filter<R, F>(self, whence: R, fun: F) -> Filter<Self, F> where
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
[src]
F: Fn(&Self::Value) -> bool,
R: Into<Reason>,
Returns a strategy which only produces values accepted by fun
. Read more
fn prop_filter_map<F, O, impl Into>(
self,
whence: impl Into,
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into: Into<Reason>,
[src]
self,
whence: impl Into
fun: F
) -> FilterMap<Self, F> where
F: Fn(Self::Value) -> Option<O>,
O: Debug,
impl Into
Returns a strategy which only produces transformed values where fun
returns Some(value)
and rejects those where fun
returns None
. Read more
fn prop_union(self, other: Self) -> Union<Self>
[src]
Returns a strategy which picks uniformly from self
and other
. Read more
fn prop_recursive<R, F>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
[src]
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Self::Value, F> where
F: Fn(BoxedStrategy<Self::Value>) -> R,
R: 'static + Strategy<Value = Self::Value>,
Self: 'static,
Generate a recursive structure with self
items as leaves. Read more
fn prop_shuffle(self) -> Shuffle<Self> where
Self::Value: Shuffleable,
[src]
Self::Value: Shuffleable,
Shuffle the contents of the values produced by this strategy. Read more
fn boxed(self) -> BoxedStrategy<Self::Value> where
Self: 'static,
[src]
Self: 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn sboxed(self) -> SBoxedStrategy<Self::Value> where
Self: Send + Sync + 'static,
[src]
Self: Send + Sync + 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn no_shrink(self) -> NoShrink<Self>
[src]
Wraps this strategy to prevent values from being subject to shrinking. Read more
impl From<RangeInclusive<usize>> for SizeRange
[src]
Given low ..= high
, then a size range [low, high]
is the result.
fn from(r: RangeInclusive<usize>) -> SizeRange
[src]
impl<A> Arbitrary for RangeInclusive<A> where
A: Arbitrary + PartialOrd<A>,
[src]
A: Arbitrary + PartialOrd<A>,
type Parameters = (<A as Arbitrary>::Parameters, <A as Arbitrary>::Parameters)
The type of parameters that [arbitrary_with
] accepts for configuration of the generated [Strategy
]. Parameters must implement [Default
]. Read more
type Strategy = Map<<(A, A) as Arbitrary>::Strategy, fn((A, A)) -> RangeInclusive<A>>
The type of [Strategy
] used to generate values of type Self
. Read more
ⓘImportant traits for RangeInclusive<A>fn arbitrary_with(
args: <RangeInclusive<A> as Arbitrary>::Parameters
) -> <RangeInclusive<A> as Arbitrary>::Strategy
[src]
args: <RangeInclusive<A> as Arbitrary>::Parameters
) -> <RangeInclusive<A> as Arbitrary>::Strategy
fn arbitrary() -> Self::Strategy
[src]
Generates a [Strategy
] for producing arbitrary values of type the implementing type (Self
). Read more
impl<A> ArbitraryF1<A> for RangeInclusive<A> where
A: PartialOrd<A> + Debug,
[src]
A: PartialOrd<A> + Debug,
type Parameters = ()
The type of parameters that [lift1_with
] accepts for configuration of the lifted and generated [Strategy
]. Parameters must implement [Default
]. Read more
fn lift1_with<S>(
base: S,
_args: <RangeInclusive<A> as ArbitraryF1<A>>::Parameters
) -> BoxedStrategy<RangeInclusive<A>> where
S: Strategy<Value = A> + 'static,
[src]
base: S,
_args: <RangeInclusive<A> as ArbitraryF1<A>>::Parameters
) -> BoxedStrategy<RangeInclusive<A>> where
S: Strategy<Value = A> + 'static,
fn lift1<AS>(base: AS) -> BoxedStrategy<Self> where
AS: Strategy<Value = A> + 'static,
[src]
AS: Strategy<Value = A> + 'static,
Lifts a given [Strategy
] to a new [Strategy
] for the (presumably) bigger type. This is useful for lifting a Strategy
for SomeType
to a container such as Vec<SomeType>
. Read more
Auto Trait Implementations
impl<Idx> Send for RangeInclusive<Idx> where
Idx: Send,
Idx: Send,
impl<Idx> Sync for RangeInclusive<Idx> where
Idx: Sync,
Idx: Sync,
Blanket Implementations
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<I> IntoIterator for I where
I: Iterator,
[src]
I: Iterator,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
fn into_iter(self) -> I
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<I> IteratorRandom for I where
I: Iterator,
[src]
I: Iterator,
fn choose<R>(self, rng: &mut R) -> Option<Self::Item> where
R: Rng + ?Sized,
[src]
R: Rng + ?Sized,
Choose one element at random from the iterator. If you have a slice, it's significantly faster to call the [choose
] or [choose_mut
] functions using the slice instead. Read more
fn choose_multiple_fill<R>(self, rng: &mut R, buf: &mut [Self::Item]) -> usize where
R: Rng + ?Sized,
[src]
R: Rng + ?Sized,
Collects amount
values at random from the iterator into a supplied buffer. Read more
fn choose_multiple<R>(self, rng: &mut R, amount: usize) -> Vec<Self::Item> where
R: Rng + ?Sized,
[src]
R: Rng + ?Sized,
Collects amount
values at random from the iterator into a vector. Read more