Struct TupleUnionValueTree

pub struct TupleUnionValueTree<T> { /* private fields */ }

ValueTree type produced by TupleUnion.

Trait Implementations

impl<A: Strategy, B: Strategy<Value = A::Value>> ValueTree for TupleUnionValueTree<(LazyValueTree<A>, Option<LazyValueTree<B>>)>

type Value = <A as Strategy>::Value;
fn current(&self) -> Self::Value
fn simplify(&mut self) -> bool
fn complicate(&mut self) -> bool

impl<A: Strategy, B: Strategy<Value = A::Value>, C: Strategy<Value = A::Value>> ValueTree for TupleUnionValueTree<(LazyValueTree<A>, Option<LazyValueTree<B>>, Option<LazyValueTree<C>>)>

type Value = <A as Strategy>::Value;
fn current(&self) -> Self::Value
fn simplify(&mut self) -> bool
fn complicate(&mut self) -> bool

impl<A: Strategy, B: Strategy<Value = A::Value>, C: Strategy<Value = A::Value>, D: Strategy<Value = A::Value>> ValueTree for TupleUnionValueTree<(LazyValueTree<A>, Option<LazyValueTree<B>>, Option<LazyValueTree<C>>, Option<LazyValueTree<D>>)>

type Value = <A as Strategy>::Value;
fn current(&self) -> Self::Value
fn simplify(&mut self) -> bool
fn complicate(&mut self) -> bool

impl<A: Strategy, B: Strategy<Value = A::Value>, C: Strategy<Value = A::Value>, D: Strategy<Value = A::Value>, E: Strategy<Value = A::Value>> ValueTree for TupleUnionValueTree<(LazyValueTree<A>, Option<LazyValueTree<B>>, Option<LazyValueTree<C>>, Option<LazyValueTree<D>>, Option<LazyValueTree<E>>)>

type Value = <A as Strategy>::Value;
fn current(&self) -> Self::Value
fn simplify(&mut self) -> bool
fn complicate(&mut self) -> bool

impl<A: Strategy, B: Strategy<Value = A::Value>, C: Strategy<Value = A::Value>, D: Strategy<Value = A::Value>, E: Strategy<Value = A::Value>, F: Strategy<Value = A::Value>> ValueTree for TupleUnionValueTree<(LazyValueTree<A>, Option<LazyValueTree<B>>, Option<LazyValueTree<C>>, Option<LazyValueTree<D>>, Option<LazyValueTree<E>>, Option<LazyValueTree<F>>)>

type Value = <A as Strategy>::Value;
fn current(&self) -> Self::Value
fn simplify(&mut self) -> bool
fn complicate(&mut self) -> bool

impl<A: Strategy, B: Strategy<Value = A::Value>, C: Strategy<Value = A::Value>, D: Strategy<Value = A::Value>, E: Strategy<Value = A::Value>, F: Strategy<Value = A::Value>, G: Strategy<Value = A::Value>> ValueTree for TupleUnionValueTree<(LazyValueTree<A>, Option<LazyValueTree<B>>, Option<LazyValueTree<C>>, Option<LazyValueTree<D>>, Option<LazyValueTree<E>>, Option<LazyValueTree<F>>, Option<LazyValueTree<G>>)>

type Value = <A as Strategy>::Value;
fn current(&self) -> Self::Value
fn simplify(&mut self) -> bool
fn complicate(&mut self) -> bool

impl<A: Strategy, B: Strategy<Value = A::Value>, C: Strategy<Value = A::Value>, D: Strategy<Value = A::Value>, E: Strategy<Value = A::Value>, F: Strategy<Value = A::Value>, G: Strategy<Value = A::Value>, H: Strategy<Value = A::Value>> ValueTree for TupleUnionValueTree<(LazyValueTree<A>, Option<LazyValueTree<B>>, Option<LazyValueTree<C>>, Option<LazyValueTree<D>>, Option<LazyValueTree<E>>, Option<LazyValueTree<F>>, Option<LazyValueTree<G>>, Option<LazyValueTree<H>>)>

type Value = <A as Strategy>::Value;
fn current(&self) -> Self::Value
fn simplify(&mut self) -> bool
fn complicate(&mut self) -> bool

impl<A: Strategy, B: Strategy<Value = A::Value>, C: Strategy<Value = A::Value>, D: Strategy<Value = A::Value>, E: Strategy<Value = A::Value>, F: Strategy<Value = A::Value>, G: Strategy<Value = A::Value>, H: Strategy<Value = A::Value>, I: Strategy<Value = A::Value>> ValueTree for TupleUnionValueTree<(LazyValueTree<A>, Option<LazyValueTree<B>>, Option<LazyValueTree<C>>, Option<LazyValueTree<D>>, Option<LazyValueTree<E>>, Option<LazyValueTree<F>>, Option<LazyValueTree<G>>, Option<LazyValueTree<H>>, Option<LazyValueTree<I>>)>

type Value = <A as Strategy>::Value;
fn current(&self) -> Self::Value
fn simplify(&mut self) -> bool
fn complicate(&mut self) -> bool

impl<A: Strategy, B: Strategy<Value = A::Value>, C: Strategy<Value = A::Value>, D: Strategy<Value = A::Value>, E: Strategy<Value = A::Value>, F: Strategy<Value = A::Value>, G: Strategy<Value = A::Value>, H: Strategy<Value = A::Value>, I: Strategy<Value = A::Value>, J: Strategy<Value = A::Value>> ValueTree for TupleUnionValueTree<(LazyValueTree<A>, Option<LazyValueTree<B>>, Option<LazyValueTree<C>>, Option<LazyValueTree<D>>, Option<LazyValueTree<E>>, Option<LazyValueTree<F>>, Option<LazyValueTree<G>>, Option<LazyValueTree<H>>, Option<LazyValueTree<I>>, Option<LazyValueTree<J>>)>

type Value = <A as Strategy>::Value;
fn current(&self) -> Self::Value
fn simplify(&mut self) -> bool
fn complicate(&mut self) -> bool

impl<T: Clone> Clone for TupleUnionValueTree<T>

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

impl<T: Copy> Copy for TupleUnionValueTree<T>

impl<T: Debug> Debug for TupleUnionValueTree<T>

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

Auto Trait Implementations

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

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

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

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

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

impl<T> UnsafeUnpin for TupleUnionValueTree<T> where T: UnsafeUnpin,

impl<T> UnwindSafe for TupleUnionValueTree<T> where T: UnwindSafe,

Blanket Implementations

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for TupleUnionValueTree<T> where ST: ?Sized, DT: ?Sized,

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for TupleUnionValueTree<T> where ST: ?Sized, DT: ?Sized,

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

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

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

impl<T> From<T> for TupleUnionValueTree<T>

fn from(t: T) -> T

Returns the argument unchanged.

impl<T> Read<Exclusive, BecauseExclusive> for TupleUnionValueTree<T> where T: ?Sized,

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

type Owned = T;
fn to_owned(&self) -> T
fn clone_into(&self, target: &mut T)

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

fn into(self) -> U

Calls U::from(self).

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

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

type Error = never;
fn try_from(value: U) -> Result<T, never>

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

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

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

fn vzip(self) -> V