Struct TupleValueTree

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

Common ValueTree implementation for all tuple strategies.

Implementations

impl<T> TupleValueTree<T>

fn new(inner: T) -> Self

Create a new TupleValueTree wrapping inner.

It only makes sense for inner to be a tuple of an arity for which the type implements ValueTree.

Trait Implementations

impl<A: ValueTree> ValueTree for TupleValueTree<(A,)>

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

impl<A: ValueTree, B: ValueTree> ValueTree for TupleValueTree<(A, B)>

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

impl<A: ValueTree, B: ValueTree, C: ValueTree> ValueTree for TupleValueTree<(A, B, C)>

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

impl<A: ValueTree, B: ValueTree, C: ValueTree, D: ValueTree> ValueTree for TupleValueTree<(A, B, C, D)>

type Value = (<A as ValueTree>::Value, <B as ValueTree>::Value, <C as ValueTree>::Value, <D as ValueTree>::Value);
fn current(&self) -> Self::Value
fn simplify(&mut self) -> bool
fn complicate(&mut self) -> bool

impl<A: ValueTree, B: ValueTree, C: ValueTree, D: ValueTree, E: ValueTree> ValueTree for TupleValueTree<(A, B, C, D, E)>

type Value = (<A as ValueTree>::Value, <B as ValueTree>::Value, <C as ValueTree>::Value, <D as ValueTree>::Value, <E as ValueTree>::Value);
fn current(&self) -> Self::Value
fn simplify(&mut self) -> bool
fn complicate(&mut self) -> bool

impl<A: ValueTree, B: ValueTree, C: ValueTree, D: ValueTree, E: ValueTree, F: ValueTree> ValueTree for TupleValueTree<(A, B, C, D, E, F)>

type Value = (<A as ValueTree>::Value, <B as ValueTree>::Value, <C as ValueTree>::Value, <D as ValueTree>::Value, <E as ValueTree>::Value, <F as ValueTree>::Value);
fn current(&self) -> Self::Value
fn simplify(&mut self) -> bool
fn complicate(&mut self) -> bool

impl<A: ValueTree, B: ValueTree, C: ValueTree, D: ValueTree, E: ValueTree, F: ValueTree, G: ValueTree> ValueTree for TupleValueTree<(A, B, C, D, E, F, G)>

type Value = (<A as ValueTree>::Value, <B as ValueTree>::Value, <C as ValueTree>::Value, <D as ValueTree>::Value, <E as ValueTree>::Value, <F as ValueTree>::Value, <G as ValueTree>::Value);
fn current(&self) -> Self::Value
fn simplify(&mut self) -> bool
fn complicate(&mut self) -> bool

impl<A: ValueTree, B: ValueTree, C: ValueTree, D: ValueTree, E: ValueTree, F: ValueTree, G: ValueTree, H: ValueTree> ValueTree for TupleValueTree<(A, B, C, D, E, F, G, H)>

type Value = (<A as ValueTree>::Value, <B as ValueTree>::Value, <C as ValueTree>::Value, <D as ValueTree>::Value, <E as ValueTree>::Value, <F as ValueTree>::Value, <G as ValueTree>::Value, <H as ValueTree>::Value);
fn current(&self) -> Self::Value
fn simplify(&mut self) -> bool
fn complicate(&mut self) -> bool

impl<A: ValueTree, B: ValueTree, C: ValueTree, D: ValueTree, E: ValueTree, F: ValueTree, G: ValueTree, H: ValueTree, I: ValueTree> ValueTree for TupleValueTree<(A, B, C, D, E, F, G, H, I)>

type Value = (<A as ValueTree>::Value, <B as ValueTree>::Value, <C as ValueTree>::Value, <D as ValueTree>::Value, <E as ValueTree>::Value, <F as ValueTree>::Value, <G as ValueTree>::Value, <H as ValueTree>::Value, <I as ValueTree>::Value);
fn current(&self) -> Self::Value
fn simplify(&mut self) -> bool
fn complicate(&mut self) -> bool

impl<A: ValueTree, B: ValueTree, C: ValueTree, D: ValueTree, E: ValueTree, F: ValueTree, G: ValueTree, H: ValueTree, I: ValueTree, J: ValueTree> ValueTree for TupleValueTree<(A, B, C, D, E, F, G, H, I, J)>

type Value = (<A as ValueTree>::Value, <B as ValueTree>::Value, <C as ValueTree>::Value, <D as ValueTree>::Value, <E as ValueTree>::Value, <F as ValueTree>::Value, <G as ValueTree>::Value, <H as ValueTree>::Value, <I as ValueTree>::Value, <J as ValueTree>::Value);
fn current(&self) -> Self::Value
fn simplify(&mut self) -> bool
fn complicate(&mut self) -> bool

impl<A: ValueTree, B: ValueTree, C: ValueTree, D: ValueTree, E: ValueTree, F: ValueTree, G: ValueTree, H: ValueTree, I: ValueTree, J: ValueTree, K: ValueTree> ValueTree for TupleValueTree<(A, B, C, D, E, F, G, H, I, J, K)>

type Value = (<A as ValueTree>::Value, <B as ValueTree>::Value, <C as ValueTree>::Value, <D as ValueTree>::Value, <E as ValueTree>::Value, <F as ValueTree>::Value, <G as ValueTree>::Value, <H as ValueTree>::Value, <I as ValueTree>::Value, <J as ValueTree>::Value, <K as ValueTree>::Value);
fn current(&self) -> Self::Value
fn simplify(&mut self) -> bool
fn complicate(&mut self) -> bool

impl<A: ValueTree, B: ValueTree, C: ValueTree, D: ValueTree, E: ValueTree, F: ValueTree, G: ValueTree, H: ValueTree, I: ValueTree, J: ValueTree, K: ValueTree, L: ValueTree> ValueTree for TupleValueTree<(A, B, C, D, E, F, G, H, I, J, K, L)>

type Value = (<A as ValueTree>::Value, <B as ValueTree>::Value, <C as ValueTree>::Value, <D as ValueTree>::Value, <E as ValueTree>::Value, <F as ValueTree>::Value, <G as ValueTree>::Value, <H as ValueTree>::Value, <I as ValueTree>::Value, <J as ValueTree>::Value, <K as ValueTree>::Value, <L as ValueTree>::Value);
fn current(&self) -> Self::Value
fn simplify(&mut self) -> bool
fn complicate(&mut self) -> bool

impl<T: Clone> Clone for TupleValueTree<T>

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

impl<T: Copy> Copy for TupleValueTree<T>

impl<T: Debug> Debug for TupleValueTree<T>

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

Auto Trait Implementations

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

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

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

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

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

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

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

Blanket Implementations

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

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

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

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

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

impl<T> From<T> for TupleValueTree<T>

fn from(t: T) -> T

Returns the argument unchanged.

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

impl<T> ToOwned for TupleValueTree<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 TupleValueTree<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 TupleValueTree<T> where U: Into<T>,

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

impl<T, U> TryInto<U> for TupleValueTree<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 TupleValueTree<T> where V: MultiLane<T>,

fn vzip(self) -> V