UniformInt

scirs2_core::random::uniform

Struct UniformInt 

Source 
pub struct UniformInt<X> { /* private fields */ }
Expand description

The back-end implementing UniformSampler for integer types.

Unless you are implementing UniformSampler for your own type, this type should not be used directly, use Uniform instead.

§Implementation notes

For simplicity, we use the same generic struct UniformInt<X> for all integer types X. This gives us only one field type, X; to store unsigned values of this size, we take use the fact that these conversions are no-ops.

For a closed range, the number of possible numbers we should generate is range = (high - low + 1). To avoid bias, we must ensure that the size of our sample space, zone, is a multiple of range; other values must be rejected (by replacing with a new random sample).

As a special case, we use range = 0 to represent the full range of the result type (i.e. for new_inclusive($ty::MIN, $ty::MAX)).

The optimum zone is the largest product of range which fits in our (unsigned) target type. We calculate this by calculating how many numbers we must reject: reject = (MAX + 1) % range = (MAX - range + 1) % range. Any (large) product of range will suffice, thus in sample_single we multiply by a power of 2 via bit-shifting (faster but may cause more rejections).

The smallest integer PRNGs generate is u32. For 8- and 16-bit outputs we use u32 for our zone and samples (because it’s not slower and because it reduces the chance of having to reject a sample). In this case we cannot store zone in the target type since it is too large, however we know ints_to_reject < range <= $uty::MAX.

An alternative to using a modulus is widening multiply: After a widening multiply by range, the result is in the high word. Then comparing the low word against zone makes sure our distribution is uniform.

§Bias

Unless the unbiased feature flag is used, outputs may have a small bias. In the worst case, bias affects 1 in 2^n samples where n is 56 (i8 and u8), 48 (i16 and u16), 96 (i32 and u32), 64 (i64 and u64), 128 (i128 and u128).

Trait Implementations§

Source§

impl<X> Clone for UniformInt<X>
where X: Clone,

Source§

fn clone(&self) -> UniformInt<X>

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl<X> Debug for UniformInt<X>
where X: Debug,

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<X> PartialEq for UniformInt<X>
where X: PartialEq,

Source§

fn eq(&self, other: &UniformInt<X>) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl UniformSampler for UniformInt<i128>

Source§

fn sample<R>(&self, rng: &mut R) -> <UniformInt<i128> as UniformSampler>::X
where R: Rng + ?Sized,

Sample from distribution, Lemire’s method, unbiased

Source§

fn sample_single_inclusive<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<i128> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<i128> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i128> as UniformSampler>::X>,

Sample single value, Canon’s method, biased

In the worst case, bias affects 1 in 2^n samples where n is 56 (i8), 48 (i16), 96 (i32), 64 (i64), 128 (i128).

Source§

type X = i128

The type sampled by this implementation.
Source§

fn new<B1, B2>(low_b: B1, high_b: B2) -> Result<UniformInt<i128>, Error>
where B1: SampleBorrow<<UniformInt<i128> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i128> as UniformSampler>::X>,

Construct self, with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

fn new_inclusive<B1, B2>( low_b: B1, high_b: B2, ) -> Result<UniformInt<i128>, Error>
where B1: SampleBorrow<<UniformInt<i128> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i128> as UniformSampler>::X>,

Construct self, with inclusive bounds [low, high]. Read more
Source§

fn sample_single<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<i128> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<i128> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i128> as UniformSampler>::X>,

Sample a single value uniformly from a range with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

impl UniformSampler for UniformInt<i16>

Source§

fn sample<R>(&self, rng: &mut R) -> <UniformInt<i16> as UniformSampler>::X
where R: Rng + ?Sized,

Sample from distribution, Lemire’s method, unbiased

Source§

fn sample_single_inclusive<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<i16> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<i16> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i16> as UniformSampler>::X>,

Sample single value, Canon’s method, biased

In the worst case, bias affects 1 in 2^n samples where n is 56 (i8), 48 (i16), 96 (i32), 64 (i64), 128 (i128).

Source§

type X = i16

The type sampled by this implementation.
Source§

fn new<B1, B2>(low_b: B1, high_b: B2) -> Result<UniformInt<i16>, Error>
where B1: SampleBorrow<<UniformInt<i16> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i16> as UniformSampler>::X>,

Construct self, with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

fn new_inclusive<B1, B2>( low_b: B1, high_b: B2, ) -> Result<UniformInt<i16>, Error>
where B1: SampleBorrow<<UniformInt<i16> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i16> as UniformSampler>::X>,

Construct self, with inclusive bounds [low, high]. Read more
Source§

fn sample_single<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<i16> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<i16> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i16> as UniformSampler>::X>,

Sample a single value uniformly from a range with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

impl UniformSampler for UniformInt<i32>

Source§

fn sample<R>(&self, rng: &mut R) -> <UniformInt<i32> as UniformSampler>::X
where R: Rng + ?Sized,

Sample from distribution, Lemire’s method, unbiased

Source§

fn sample_single_inclusive<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<i32> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<i32> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i32> as UniformSampler>::X>,

Sample single value, Canon’s method, biased

In the worst case, bias affects 1 in 2^n samples where n is 56 (i8), 48 (i16), 96 (i32), 64 (i64), 128 (i128).

Source§

type X = i32

The type sampled by this implementation.
Source§

fn new<B1, B2>(low_b: B1, high_b: B2) -> Result<UniformInt<i32>, Error>
where B1: SampleBorrow<<UniformInt<i32> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i32> as UniformSampler>::X>,

Construct self, with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

fn new_inclusive<B1, B2>( low_b: B1, high_b: B2, ) -> Result<UniformInt<i32>, Error>
where B1: SampleBorrow<<UniformInt<i32> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i32> as UniformSampler>::X>,

Construct self, with inclusive bounds [low, high]. Read more
Source§

fn sample_single<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<i32> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<i32> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i32> as UniformSampler>::X>,

Sample a single value uniformly from a range with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

impl UniformSampler for UniformInt<i64>

Source§

fn sample<R>(&self, rng: &mut R) -> <UniformInt<i64> as UniformSampler>::X
where R: Rng + ?Sized,

Sample from distribution, Lemire’s method, unbiased

Source§

fn sample_single_inclusive<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<i64> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<i64> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i64> as UniformSampler>::X>,

Sample single value, Canon’s method, biased

In the worst case, bias affects 1 in 2^n samples where n is 56 (i8), 48 (i16), 96 (i32), 64 (i64), 128 (i128).

Source§

type X = i64

The type sampled by this implementation.
Source§

fn new<B1, B2>(low_b: B1, high_b: B2) -> Result<UniformInt<i64>, Error>
where B1: SampleBorrow<<UniformInt<i64> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i64> as UniformSampler>::X>,

Construct self, with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

fn new_inclusive<B1, B2>( low_b: B1, high_b: B2, ) -> Result<UniformInt<i64>, Error>
where B1: SampleBorrow<<UniformInt<i64> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i64> as UniformSampler>::X>,

Construct self, with inclusive bounds [low, high]. Read more
Source§

fn sample_single<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<i64> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<i64> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i64> as UniformSampler>::X>,

Sample a single value uniformly from a range with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

impl UniformSampler for UniformInt<i8>

Source§

fn sample<R>(&self, rng: &mut R) -> <UniformInt<i8> as UniformSampler>::X
where R: Rng + ?Sized,

Sample from distribution, Lemire’s method, unbiased

Source§

fn sample_single_inclusive<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<i8> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<i8> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i8> as UniformSampler>::X>,

Sample single value, Canon’s method, biased

In the worst case, bias affects 1 in 2^n samples where n is 56 (i8), 48 (i16), 96 (i32), 64 (i64), 128 (i128).

Source§

type X = i8

The type sampled by this implementation.
Source§

fn new<B1, B2>(low_b: B1, high_b: B2) -> Result<UniformInt<i8>, Error>
where B1: SampleBorrow<<UniformInt<i8> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i8> as UniformSampler>::X>,

Construct self, with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

fn new_inclusive<B1, B2>(low_b: B1, high_b: B2) -> Result<UniformInt<i8>, Error>
where B1: SampleBorrow<<UniformInt<i8> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i8> as UniformSampler>::X>,

Construct self, with inclusive bounds [low, high]. Read more
Source§

fn sample_single<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<i8> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<i8> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<i8> as UniformSampler>::X>,

Sample a single value uniformly from a range with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

impl UniformSampler for UniformInt<u128>

Source§

fn sample<R>(&self, rng: &mut R) -> <UniformInt<u128> as UniformSampler>::X
where R: Rng + ?Sized,

Sample from distribution, Lemire’s method, unbiased

Source§

fn sample_single_inclusive<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<u128> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<u128> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u128> as UniformSampler>::X>,

Sample single value, Canon’s method, biased

In the worst case, bias affects 1 in 2^n samples where n is 56 (i8), 48 (i16), 96 (i32), 64 (i64), 128 (i128).

Source§

type X = u128

The type sampled by this implementation.
Source§

fn new<B1, B2>(low_b: B1, high_b: B2) -> Result<UniformInt<u128>, Error>
where B1: SampleBorrow<<UniformInt<u128> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u128> as UniformSampler>::X>,

Construct self, with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

fn new_inclusive<B1, B2>( low_b: B1, high_b: B2, ) -> Result<UniformInt<u128>, Error>
where B1: SampleBorrow<<UniformInt<u128> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u128> as UniformSampler>::X>,

Construct self, with inclusive bounds [low, high]. Read more
Source§

fn sample_single<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<u128> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<u128> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u128> as UniformSampler>::X>,

Sample a single value uniformly from a range with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

impl UniformSampler for UniformInt<u16>

Source§

fn sample<R>(&self, rng: &mut R) -> <UniformInt<u16> as UniformSampler>::X
where R: Rng + ?Sized,

Sample from distribution, Lemire’s method, unbiased

Source§

fn sample_single_inclusive<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<u16> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<u16> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u16> as UniformSampler>::X>,

Sample single value, Canon’s method, biased

In the worst case, bias affects 1 in 2^n samples where n is 56 (i8), 48 (i16), 96 (i32), 64 (i64), 128 (i128).

Source§

type X = u16

The type sampled by this implementation.
Source§

fn new<B1, B2>(low_b: B1, high_b: B2) -> Result<UniformInt<u16>, Error>
where B1: SampleBorrow<<UniformInt<u16> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u16> as UniformSampler>::X>,

Construct self, with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

fn new_inclusive<B1, B2>( low_b: B1, high_b: B2, ) -> Result<UniformInt<u16>, Error>
where B1: SampleBorrow<<UniformInt<u16> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u16> as UniformSampler>::X>,

Construct self, with inclusive bounds [low, high]. Read more
Source§

fn sample_single<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<u16> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<u16> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u16> as UniformSampler>::X>,

Sample a single value uniformly from a range with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

impl UniformSampler for UniformInt<u32>

Source§

fn sample<R>(&self, rng: &mut R) -> <UniformInt<u32> as UniformSampler>::X
where R: Rng + ?Sized,

Sample from distribution, Lemire’s method, unbiased

Source§

fn sample_single_inclusive<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<u32> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<u32> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u32> as UniformSampler>::X>,

Sample single value, Canon’s method, biased

In the worst case, bias affects 1 in 2^n samples where n is 56 (i8), 48 (i16), 96 (i32), 64 (i64), 128 (i128).

Source§

type X = u32

The type sampled by this implementation.
Source§

fn new<B1, B2>(low_b: B1, high_b: B2) -> Result<UniformInt<u32>, Error>
where B1: SampleBorrow<<UniformInt<u32> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u32> as UniformSampler>::X>,

Construct self, with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

fn new_inclusive<B1, B2>( low_b: B1, high_b: B2, ) -> Result<UniformInt<u32>, Error>
where B1: SampleBorrow<<UniformInt<u32> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u32> as UniformSampler>::X>,

Construct self, with inclusive bounds [low, high]. Read more
Source§

fn sample_single<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<u32> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<u32> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u32> as UniformSampler>::X>,

Sample a single value uniformly from a range with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

impl UniformSampler for UniformInt<u64>

Source§

fn sample<R>(&self, rng: &mut R) -> <UniformInt<u64> as UniformSampler>::X
where R: Rng + ?Sized,

Sample from distribution, Lemire’s method, unbiased

Source§

fn sample_single_inclusive<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<u64> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<u64> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u64> as UniformSampler>::X>,

Sample single value, Canon’s method, biased

In the worst case, bias affects 1 in 2^n samples where n is 56 (i8), 48 (i16), 96 (i32), 64 (i64), 128 (i128).

Source§

type X = u64

The type sampled by this implementation.
Source§

fn new<B1, B2>(low_b: B1, high_b: B2) -> Result<UniformInt<u64>, Error>
where B1: SampleBorrow<<UniformInt<u64> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u64> as UniformSampler>::X>,

Construct self, with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

fn new_inclusive<B1, B2>( low_b: B1, high_b: B2, ) -> Result<UniformInt<u64>, Error>
where B1: SampleBorrow<<UniformInt<u64> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u64> as UniformSampler>::X>,

Construct self, with inclusive bounds [low, high]. Read more
Source§

fn sample_single<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<u64> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<u64> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u64> as UniformSampler>::X>,

Sample a single value uniformly from a range with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

impl UniformSampler for UniformInt<u8>

Source§

fn sample<R>(&self, rng: &mut R) -> <UniformInt<u8> as UniformSampler>::X
where R: Rng + ?Sized,

Sample from distribution, Lemire’s method, unbiased

Source§

fn sample_single_inclusive<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<u8> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<u8> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u8> as UniformSampler>::X>,

Sample single value, Canon’s method, biased

In the worst case, bias affects 1 in 2^n samples where n is 56 (i8), 48 (i16), 96 (i32), 64 (i64), 128 (i128).

Source§

type X = u8

The type sampled by this implementation.
Source§

fn new<B1, B2>(low_b: B1, high_b: B2) -> Result<UniformInt<u8>, Error>
where B1: SampleBorrow<<UniformInt<u8> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u8> as UniformSampler>::X>,

Construct self, with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

fn new_inclusive<B1, B2>(low_b: B1, high_b: B2) -> Result<UniformInt<u8>, Error>
where B1: SampleBorrow<<UniformInt<u8> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u8> as UniformSampler>::X>,

Construct self, with inclusive bounds [low, high]. Read more
Source§

fn sample_single<R, B1, B2>( low_b: B1, high_b: B2, rng: &mut R, ) -> Result<<UniformInt<u8> as UniformSampler>::X, Error>
where R: Rng + ?Sized, B1: SampleBorrow<<UniformInt<u8> as UniformSampler>::X>, B2: SampleBorrow<<UniformInt<u8> as UniformSampler>::X>,

Sample a single value uniformly from a range with inclusive lower bound and exclusive upper bound [low, high). Read more
Source§

impl<X> Copy for UniformInt<X>
where X: Copy,

Source§

impl<X> Eq for UniformInt<X>
where X: Eq,

Source§

impl<X> StructuralPartialEq for UniformInt<X>

Auto Trait Implementations§

§

impl<X> Freeze for UniformInt<X>
where X: Freeze,

§

impl<X> RefUnwindSafe for UniformInt<X>
where X: RefUnwindSafe,

§

impl<X> Send for UniformInt<X>
where X: Send,

§

impl<X> Sync for UniformInt<X>
where X: Sync,

§

impl<X> Unpin for UniformInt<X>
where X: Unpin,

§

impl<X> UnwindSafe for UniformInt<X>
where X: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Az for T

Source§

fn az<Dst>(self) -> Dst
where T: Cast<Dst>,

Casts the value.
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<Src, Dst> CastFrom<Src> for Dst
where Src: Cast<Dst>,

Source§

fn cast_from(src: Src) -> Dst

Casts the value.
Source§

impl<T> CheckedAs for T

Source§

fn checked_as<Dst>(self) -> Option<Dst>
where T: CheckedCast<Dst>,

Casts the value.
Source§

impl<Src, Dst> CheckedCastFrom<Src> for Dst
where Src: CheckedCast<Dst>,

Source§

fn checked_cast_from(src: Src) -> Option<Dst>

Casts the value.
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> Downcast<T> for T

Source§

fn downcast(&self) -> &T

Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

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<T> OverflowingAs for T

Source§

fn overflowing_as<Dst>(self) -> (Dst, bool)
where T: OverflowingCast<Dst>,

Casts the value.
Source§

impl<Src, Dst> OverflowingCastFrom<Src> for Dst
where Src: OverflowingCast<Dst>,

Source§

fn overflowing_cast_from(src: Src) -> (Dst, bool)

Casts the value.
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

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

impl<T> PolicyExt for T
where T: ?Sized,

Source§

fn and<P, B, E>(self, other: P) -> And<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow only if self and other return Action::Follow. Read more
Source§

fn or<P, B, E>(self, other: P) -> Or<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow if either self or other returns Action::Follow. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> SaturatingAs for T

Source§

fn saturating_as<Dst>(self) -> Dst
where T: SaturatingCast<Dst>,

Casts the value.
Source§

impl<Src, Dst> SaturatingCastFrom<Src> for Dst
where Src: SaturatingCast<Dst>,

Source§

fn saturating_cast_from(src: Src) -> Dst

Casts the value.
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

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

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

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

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.
Source§

impl<T> UnwrappedAs for T

Source§

fn unwrapped_as<Dst>(self) -> Dst
where T: UnwrappedCast<Dst>,

Casts the value.
Source§

impl<Src, Dst> UnwrappedCastFrom<Src> for Dst
where Src: UnwrappedCast<Dst>,

Source§

fn unwrapped_cast_from(src: Src) -> Dst

Casts the value.
Source§

impl<T> Upcast<T> for T

Source§

fn upcast(&self) -> Option<&T>

Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

impl<T> WrappingAs for T

Source§

fn wrapping_as<Dst>(self) -> Dst
where T: WrappingCast<Dst>,

Casts the value.
Source§

impl<Src, Dst> WrappingCastFrom<Src> for Dst
where Src: WrappingCast<Dst>,

Source§

fn wrapping_cast_from(src: Src) -> Dst

Casts the value.
Source§

impl<T> Scalar for T
where T: 'static + Clone + PartialEq + Debug,

Source§

impl<T> Ungil for T
where T: Send,

Source§

impl<T> WasmNotSend for T
where T: Send,

Source§

impl<T> WasmNotSendSync for T
where T: WasmNotSend + WasmNotSync,

Source§

impl<T> WasmNotSync for T
where T: Sync,