Range

protest::strategy

Struct Range 

Source 
pub struct Range<T> { /* private fields */ }
Expand description

A strategy for generating values in a numeric range

Trait Implementations§

Source§

impl<T: Clone> Clone for Range<T>

Source§

fn clone(&self) -> Range<T>

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<T: Debug> Debug for Range<T>

Source§

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

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

impl Generator<f32> for Range<f32>

Source§

fn generate(&self, rng: &mut dyn RngCore, _config: &GeneratorConfig) -> f32

Generate a random value of type T using the provided RNG and configuration
Source§

fn shrink(&self, value: &f32) -> Box<dyn Iterator<Item = f32>>

Create an iterator of shrunk values from the given value
Source§

impl Generator<f64> for Range<f64>

Source§

fn generate(&self, rng: &mut dyn RngCore, _config: &GeneratorConfig) -> f64

Generate a random value of type T using the provided RNG and configuration
Source§

fn shrink(&self, value: &f64) -> Box<dyn Iterator<Item = f64>>

Create an iterator of shrunk values from the given value
Source§

impl Generator<i128> for Range<i128>

Source§

fn generate(&self, rng: &mut dyn RngCore, _config: &GeneratorConfig) -> i128

Generate a random value of type T using the provided RNG and configuration
Source§

fn shrink(&self, value: &i128) -> Box<dyn Iterator<Item = i128>>

Create an iterator of shrunk values from the given value
Source§

impl Generator<i16> for Range<i16>

Source§

fn generate(&self, rng: &mut dyn RngCore, _config: &GeneratorConfig) -> i16

Generate a random value of type T using the provided RNG and configuration
Source§

fn shrink(&self, value: &i16) -> Box<dyn Iterator<Item = i16>>

Create an iterator of shrunk values from the given value
Source§

impl Generator<i32> for Range<i32>

Source§

fn generate(&self, rng: &mut dyn RngCore, _config: &GeneratorConfig) -> i32

Generate a random value of type T using the provided RNG and configuration
Source§

fn shrink(&self, value: &i32) -> Box<dyn Iterator<Item = i32>>

Create an iterator of shrunk values from the given value
Source§

impl Generator<i64> for Range<i64>

Source§

fn generate(&self, rng: &mut dyn RngCore, _config: &GeneratorConfig) -> i64

Generate a random value of type T using the provided RNG and configuration
Source§

fn shrink(&self, value: &i64) -> Box<dyn Iterator<Item = i64>>

Create an iterator of shrunk values from the given value
Source§

impl Generator<i8> for Range<i8>

Source§

fn generate(&self, rng: &mut dyn RngCore, _config: &GeneratorConfig) -> i8

Generate a random value of type T using the provided RNG and configuration
Source§

fn shrink(&self, value: &i8) -> Box<dyn Iterator<Item = i8>>

Create an iterator of shrunk values from the given value
Source§

impl Generator<isize> for Range<isize>

Source§

fn generate(&self, rng: &mut dyn RngCore, _config: &GeneratorConfig) -> isize

Generate a random value of type T using the provided RNG and configuration
Source§

fn shrink(&self, value: &isize) -> Box<dyn Iterator<Item = isize>>

Create an iterator of shrunk values from the given value
Source§

impl Generator<u128> for Range<u128>

Source§

fn generate(&self, rng: &mut dyn RngCore, _config: &GeneratorConfig) -> u128

Generate a random value of type T using the provided RNG and configuration
Source§

fn shrink(&self, value: &u128) -> Box<dyn Iterator<Item = u128>>

Create an iterator of shrunk values from the given value
Source§

impl Generator<u16> for Range<u16>

Source§

fn generate(&self, rng: &mut dyn RngCore, _config: &GeneratorConfig) -> u16

Generate a random value of type T using the provided RNG and configuration
Source§

fn shrink(&self, value: &u16) -> Box<dyn Iterator<Item = u16>>

Create an iterator of shrunk values from the given value
Source§

impl Generator<u32> for Range<u32>

Source§

fn generate(&self, rng: &mut dyn RngCore, _config: &GeneratorConfig) -> u32

Generate a random value of type T using the provided RNG and configuration
Source§

fn shrink(&self, value: &u32) -> Box<dyn Iterator<Item = u32>>

Create an iterator of shrunk values from the given value
Source§

impl Generator<u64> for Range<u64>

Source§

fn generate(&self, rng: &mut dyn RngCore, _config: &GeneratorConfig) -> u64

Generate a random value of type T using the provided RNG and configuration
Source§

fn shrink(&self, value: &u64) -> Box<dyn Iterator<Item = u64>>

Create an iterator of shrunk values from the given value
Source§

impl Generator<u8> for Range<u8>

Source§

fn generate(&self, rng: &mut dyn RngCore, _config: &GeneratorConfig) -> u8

Generate a random value of type T using the provided RNG and configuration
Source§

fn shrink(&self, value: &u8) -> Box<dyn Iterator<Item = u8>>

Create an iterator of shrunk values from the given value
Source§

impl Generator<usize> for Range<usize>

Source§

fn generate(&self, rng: &mut dyn RngCore, _config: &GeneratorConfig) -> usize

Generate a random value of type T using the provided RNG and configuration
Source§

fn shrink(&self, value: &usize) -> Box<dyn Iterator<Item = usize>>

Create an iterator of shrunk values from the given value
Source§

impl Strategy for Range<f32>

Source§

type Value = f32

The type of values this strategy generates
Source§

fn generate<R: Rng>( &self, rng: &mut R, _config: &GeneratorConfig, ) -> Self::Value

Generate a value using this strategy
Source§

fn shrink(&self, value: &Self::Value) -> Box<dyn Iterator<Item = Self::Value>>

Create an iterator of shrunk values from the given value
Source§

fn map<F, U>(self, f: F) -> Map<Self, F>
where Self: Sized, F: Fn(Self::Value) -> U, U: 'static,

Map this strategy to produce values of a different type
Source§

fn filter<F>(self, predicate: F) -> Filter<Self, F>
where Self: Sized, F: Fn(&Self::Value) -> bool,

Filter values produced by this strategy
Source§

fn zip<S>(self, other: S) -> Zip<Self, S>
where Self: Sized, S: Strategy,

Combine this strategy with another to produce tuples
Source§

fn flat_map<F, S>(self, f: F) -> FlatMap<Self, F>
where Self: Sized, F: Fn(Self::Value) -> S, S: Strategy,

Flat map (bind) this strategy with a function that produces another strategy This is the most powerful combinator but also the trickiest for shrinking
Source§

impl Strategy for Range<f64>

Source§

type Value = f64

The type of values this strategy generates
Source§

fn generate<R: Rng>( &self, rng: &mut R, _config: &GeneratorConfig, ) -> Self::Value

Generate a value using this strategy
Source§

fn shrink(&self, value: &Self::Value) -> Box<dyn Iterator<Item = Self::Value>>

Create an iterator of shrunk values from the given value
Source§

fn map<F, U>(self, f: F) -> Map<Self, F>
where Self: Sized, F: Fn(Self::Value) -> U, U: 'static,

Map this strategy to produce values of a different type
Source§

fn filter<F>(self, predicate: F) -> Filter<Self, F>
where Self: Sized, F: Fn(&Self::Value) -> bool,

Filter values produced by this strategy
Source§

fn zip<S>(self, other: S) -> Zip<Self, S>
where Self: Sized, S: Strategy,

Combine this strategy with another to produce tuples
Source§

fn flat_map<F, S>(self, f: F) -> FlatMap<Self, F>
where Self: Sized, F: Fn(Self::Value) -> S, S: Strategy,

Flat map (bind) this strategy with a function that produces another strategy This is the most powerful combinator but also the trickiest for shrinking
Source§

impl Strategy for Range<i128>

Source§

type Value = i128

The type of values this strategy generates
Source§

fn generate<R: Rng>( &self, rng: &mut R, _config: &GeneratorConfig, ) -> Self::Value

Generate a value using this strategy
Source§

fn shrink(&self, value: &Self::Value) -> Box<dyn Iterator<Item = Self::Value>>

Create an iterator of shrunk values from the given value
Source§

fn map<F, U>(self, f: F) -> Map<Self, F>
where Self: Sized, F: Fn(Self::Value) -> U, U: 'static,

Map this strategy to produce values of a different type
Source§

fn filter<F>(self, predicate: F) -> Filter<Self, F>
where Self: Sized, F: Fn(&Self::Value) -> bool,

Filter values produced by this strategy
Source§

fn zip<S>(self, other: S) -> Zip<Self, S>
where Self: Sized, S: Strategy,

Combine this strategy with another to produce tuples
Source§

fn flat_map<F, S>(self, f: F) -> FlatMap<Self, F>
where Self: Sized, F: Fn(Self::Value) -> S, S: Strategy,

Flat map (bind) this strategy with a function that produces another strategy This is the most powerful combinator but also the trickiest for shrinking
Source§

impl Strategy for Range<i16>

Source§

type Value = i16

The type of values this strategy generates
Source§

fn generate<R: Rng>( &self, rng: &mut R, _config: &GeneratorConfig, ) -> Self::Value

Generate a value using this strategy
Source§

fn shrink(&self, value: &Self::Value) -> Box<dyn Iterator<Item = Self::Value>>

Create an iterator of shrunk values from the given value
Source§

fn map<F, U>(self, f: F) -> Map<Self, F>
where Self: Sized, F: Fn(Self::Value) -> U, U: 'static,

Map this strategy to produce values of a different type
Source§

fn filter<F>(self, predicate: F) -> Filter<Self, F>
where Self: Sized, F: Fn(&Self::Value) -> bool,

Filter values produced by this strategy
Source§

fn zip<S>(self, other: S) -> Zip<Self, S>
where Self: Sized, S: Strategy,

Combine this strategy with another to produce tuples
Source§

fn flat_map<F, S>(self, f: F) -> FlatMap<Self, F>
where Self: Sized, F: Fn(Self::Value) -> S, S: Strategy,

Flat map (bind) this strategy with a function that produces another strategy This is the most powerful combinator but also the trickiest for shrinking
Source§

impl Strategy for Range<i32>

Source§

type Value = i32

The type of values this strategy generates
Source§

fn generate<R: Rng>( &self, rng: &mut R, _config: &GeneratorConfig, ) -> Self::Value

Generate a value using this strategy
Source§

fn shrink(&self, value: &Self::Value) -> Box<dyn Iterator<Item = Self::Value>>

Create an iterator of shrunk values from the given value
Source§

fn map<F, U>(self, f: F) -> Map<Self, F>
where Self: Sized, F: Fn(Self::Value) -> U, U: 'static,

Map this strategy to produce values of a different type
Source§

fn filter<F>(self, predicate: F) -> Filter<Self, F>
where Self: Sized, F: Fn(&Self::Value) -> bool,

Filter values produced by this strategy
Source§

fn zip<S>(self, other: S) -> Zip<Self, S>
where Self: Sized, S: Strategy,

Combine this strategy with another to produce tuples
Source§

fn flat_map<F, S>(self, f: F) -> FlatMap<Self, F>
where Self: Sized, F: Fn(Self::Value) -> S, S: Strategy,

Flat map (bind) this strategy with a function that produces another strategy This is the most powerful combinator but also the trickiest for shrinking
Source§

impl Strategy for Range<i64>

Source§

type Value = i64

The type of values this strategy generates
Source§

fn generate<R: Rng>( &self, rng: &mut R, _config: &GeneratorConfig, ) -> Self::Value

Generate a value using this strategy
Source§

fn shrink(&self, value: &Self::Value) -> Box<dyn Iterator<Item = Self::Value>>

Create an iterator of shrunk values from the given value
Source§

fn map<F, U>(self, f: F) -> Map<Self, F>
where Self: Sized, F: Fn(Self::Value) -> U, U: 'static,

Map this strategy to produce values of a different type
Source§

fn filter<F>(self, predicate: F) -> Filter<Self, F>
where Self: Sized, F: Fn(&Self::Value) -> bool,

Filter values produced by this strategy
Source§

fn zip<S>(self, other: S) -> Zip<Self, S>
where Self: Sized, S: Strategy,

Combine this strategy with another to produce tuples
Source§

fn flat_map<F, S>(self, f: F) -> FlatMap<Self, F>
where Self: Sized, F: Fn(Self::Value) -> S, S: Strategy,

Flat map (bind) this strategy with a function that produces another strategy This is the most powerful combinator but also the trickiest for shrinking
Source§

impl Strategy for Range<i8>

Source§

type Value = i8

The type of values this strategy generates
Source§

fn generate<R: Rng>( &self, rng: &mut R, _config: &GeneratorConfig, ) -> Self::Value

Generate a value using this strategy
Source§

fn shrink(&self, value: &Self::Value) -> Box<dyn Iterator<Item = Self::Value>>

Create an iterator of shrunk values from the given value
Source§

fn map<F, U>(self, f: F) -> Map<Self, F>
where Self: Sized, F: Fn(Self::Value) -> U, U: 'static,

Map this strategy to produce values of a different type
Source§

fn filter<F>(self, predicate: F) -> Filter<Self, F>
where Self: Sized, F: Fn(&Self::Value) -> bool,

Filter values produced by this strategy
Source§

fn zip<S>(self, other: S) -> Zip<Self, S>
where Self: Sized, S: Strategy,

Combine this strategy with another to produce tuples
Source§

fn flat_map<F, S>(self, f: F) -> FlatMap<Self, F>
where Self: Sized, F: Fn(Self::Value) -> S, S: Strategy,

Flat map (bind) this strategy with a function that produces another strategy This is the most powerful combinator but also the trickiest for shrinking
Source§

impl Strategy for Range<isize>

Source§

type Value = isize

The type of values this strategy generates
Source§

fn generate<R: Rng>( &self, rng: &mut R, _config: &GeneratorConfig, ) -> Self::Value

Generate a value using this strategy
Source§

fn shrink(&self, value: &Self::Value) -> Box<dyn Iterator<Item = Self::Value>>

Create an iterator of shrunk values from the given value
Source§

fn map<F, U>(self, f: F) -> Map<Self, F>
where Self: Sized, F: Fn(Self::Value) -> U, U: 'static,

Map this strategy to produce values of a different type
Source§

fn filter<F>(self, predicate: F) -> Filter<Self, F>
where Self: Sized, F: Fn(&Self::Value) -> bool,

Filter values produced by this strategy
Source§

fn zip<S>(self, other: S) -> Zip<Self, S>
where Self: Sized, S: Strategy,

Combine this strategy with another to produce tuples
Source§

fn flat_map<F, S>(self, f: F) -> FlatMap<Self, F>
where Self: Sized, F: Fn(Self::Value) -> S, S: Strategy,

Flat map (bind) this strategy with a function that produces another strategy This is the most powerful combinator but also the trickiest for shrinking
Source§

impl Strategy for Range<u128>

Source§

type Value = u128

The type of values this strategy generates
Source§

fn generate<R: Rng>( &self, rng: &mut R, _config: &GeneratorConfig, ) -> Self::Value

Generate a value using this strategy
Source§

fn shrink(&self, value: &Self::Value) -> Box<dyn Iterator<Item = Self::Value>>

Create an iterator of shrunk values from the given value
Source§

fn map<F, U>(self, f: F) -> Map<Self, F>
where Self: Sized, F: Fn(Self::Value) -> U, U: 'static,

Map this strategy to produce values of a different type
Source§

fn filter<F>(self, predicate: F) -> Filter<Self, F>
where Self: Sized, F: Fn(&Self::Value) -> bool,

Filter values produced by this strategy
Source§

fn zip<S>(self, other: S) -> Zip<Self, S>
where Self: Sized, S: Strategy,

Combine this strategy with another to produce tuples
Source§

fn flat_map<F, S>(self, f: F) -> FlatMap<Self, F>
where Self: Sized, F: Fn(Self::Value) -> S, S: Strategy,

Flat map (bind) this strategy with a function that produces another strategy This is the most powerful combinator but also the trickiest for shrinking
Source§

impl Strategy for Range<u16>

Source§

type Value = u16

The type of values this strategy generates
Source§

fn generate<R: Rng>( &self, rng: &mut R, _config: &GeneratorConfig, ) -> Self::Value

Generate a value using this strategy
Source§

fn shrink(&self, value: &Self::Value) -> Box<dyn Iterator<Item = Self::Value>>

Create an iterator of shrunk values from the given value
Source§

fn map<F, U>(self, f: F) -> Map<Self, F>
where Self: Sized, F: Fn(Self::Value) -> U, U: 'static,

Map this strategy to produce values of a different type
Source§

fn filter<F>(self, predicate: F) -> Filter<Self, F>
where Self: Sized, F: Fn(&Self::Value) -> bool,

Filter values produced by this strategy
Source§

fn zip<S>(self, other: S) -> Zip<Self, S>
where Self: Sized, S: Strategy,

Combine this strategy with another to produce tuples
Source§

fn flat_map<F, S>(self, f: F) -> FlatMap<Self, F>
where Self: Sized, F: Fn(Self::Value) -> S, S: Strategy,

Flat map (bind) this strategy with a function that produces another strategy This is the most powerful combinator but also the trickiest for shrinking
Source§

impl Strategy for Range<u32>

Source§

type Value = u32

The type of values this strategy generates
Source§

fn generate<R: Rng>( &self, rng: &mut R, _config: &GeneratorConfig, ) -> Self::Value

Generate a value using this strategy
Source§

fn shrink(&self, value: &Self::Value) -> Box<dyn Iterator<Item = Self::Value>>

Create an iterator of shrunk values from the given value
Source§

fn map<F, U>(self, f: F) -> Map<Self, F>
where Self: Sized, F: Fn(Self::Value) -> U, U: 'static,

Map this strategy to produce values of a different type
Source§

fn filter<F>(self, predicate: F) -> Filter<Self, F>
where Self: Sized, F: Fn(&Self::Value) -> bool,

Filter values produced by this strategy
Source§

fn zip<S>(self, other: S) -> Zip<Self, S>
where Self: Sized, S: Strategy,

Combine this strategy with another to produce tuples
Source§

fn flat_map<F, S>(self, f: F) -> FlatMap<Self, F>
where Self: Sized, F: Fn(Self::Value) -> S, S: Strategy,

Flat map (bind) this strategy with a function that produces another strategy This is the most powerful combinator but also the trickiest for shrinking
Source§

impl Strategy for Range<u64>

Source§

type Value = u64

The type of values this strategy generates
Source§

fn generate<R: Rng>( &self, rng: &mut R, _config: &GeneratorConfig, ) -> Self::Value

Generate a value using this strategy
Source§

fn shrink(&self, value: &Self::Value) -> Box<dyn Iterator<Item = Self::Value>>

Create an iterator of shrunk values from the given value
Source§

fn map<F, U>(self, f: F) -> Map<Self, F>
where Self: Sized, F: Fn(Self::Value) -> U, U: 'static,

Map this strategy to produce values of a different type
Source§

fn filter<F>(self, predicate: F) -> Filter<Self, F>
where Self: Sized, F: Fn(&Self::Value) -> bool,

Filter values produced by this strategy
Source§

fn zip<S>(self, other: S) -> Zip<Self, S>
where Self: Sized, S: Strategy,

Combine this strategy with another to produce tuples
Source§

fn flat_map<F, S>(self, f: F) -> FlatMap<Self, F>
where Self: Sized, F: Fn(Self::Value) -> S, S: Strategy,

Flat map (bind) this strategy with a function that produces another strategy This is the most powerful combinator but also the trickiest for shrinking
Source§

impl Strategy for Range<u8>

Source§

type Value = u8

The type of values this strategy generates
Source§

fn generate<R: Rng>( &self, rng: &mut R, _config: &GeneratorConfig, ) -> Self::Value

Generate a value using this strategy
Source§

fn shrink(&self, value: &Self::Value) -> Box<dyn Iterator<Item = Self::Value>>

Create an iterator of shrunk values from the given value
Source§

fn map<F, U>(self, f: F) -> Map<Self, F>
where Self: Sized, F: Fn(Self::Value) -> U, U: 'static,

Map this strategy to produce values of a different type
Source§

fn filter<F>(self, predicate: F) -> Filter<Self, F>
where Self: Sized, F: Fn(&Self::Value) -> bool,

Filter values produced by this strategy
Source§

fn zip<S>(self, other: S) -> Zip<Self, S>
where Self: Sized, S: Strategy,

Combine this strategy with another to produce tuples
Source§

fn flat_map<F, S>(self, f: F) -> FlatMap<Self, F>
where Self: Sized, F: Fn(Self::Value) -> S, S: Strategy,

Flat map (bind) this strategy with a function that produces another strategy This is the most powerful combinator but also the trickiest for shrinking
Source§

impl Strategy for Range<usize>

Source§

type Value = usize

The type of values this strategy generates
Source§

fn generate<R: Rng>( &self, rng: &mut R, _config: &GeneratorConfig, ) -> Self::Value

Generate a value using this strategy
Source§

fn shrink(&self, value: &Self::Value) -> Box<dyn Iterator<Item = Self::Value>>

Create an iterator of shrunk values from the given value
Source§

fn map<F, U>(self, f: F) -> Map<Self, F>
where Self: Sized, F: Fn(Self::Value) -> U, U: 'static,

Map this strategy to produce values of a different type
Source§

fn filter<F>(self, predicate: F) -> Filter<Self, F>
where Self: Sized, F: Fn(&Self::Value) -> bool,

Filter values produced by this strategy
Source§

fn zip<S>(self, other: S) -> Zip<Self, S>
where Self: Sized, S: Strategy,

Combine this strategy with another to produce tuples
Source§

fn flat_map<F, S>(self, f: F) -> FlatMap<Self, F>
where Self: Sized, F: Fn(Self::Value) -> S, S: Strategy,

Flat map (bind) this strategy with a function that produces another strategy This is the most powerful combinator but also the trickiest for shrinking

Auto Trait Implementations§

§

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

§

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

§

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

§

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

§

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

§

impl<T> UnwindSafe for Range<T>
where T: 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> 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<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> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

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> 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> 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<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V