Struct Recursive
#[must_use = "strategies do nothing unless used"]
pub struct Recursive<T, F> { /* private fields */ }Return type from Strategy::prop_recursive().
Trait Implementations
impl<T, F> Clone for Recursive<T, F>
fn clone(&self) -> Self
impl<T: Debug + 'static, R: Strategy<Value = T> + 'static, F: Fn(BoxedStrategy<T>) -> R> Strategy for Recursive<T, F>
type Tree = Box<dyn ValueTree<Value = T>>;type Value = T;fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self>
impl<T: Debug, F> Debug for Recursive<T, F>
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Auto Trait Implementations
impl<T, F> !RefUnwindSafe for Recursive<T, F>
impl<T, F> !Send for Recursive<T, F>
impl<T, F> !Sync for Recursive<T, F>
impl<T, F> !UnwindSafe for Recursive<T, F>
impl<T, F> Freeze for Recursive<T, F>
where
BoxedStrategy<T>: Freeze,
Arc<F>: Freeze,
impl<T, F> Unpin for Recursive<T, F>
where
BoxedStrategy<T>: Unpin,
Arc<F>: Unpin,
impl<T, F> UnsafeUnpin for Recursive<T, F>
where
BoxedStrategy<T>: UnsafeUnpin,
Arc<F>: UnsafeUnpin,
Blanket Implementations
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for Recursive<T, F>
where
ST: ?Sized,
DT: ?Sized,
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for Recursive<T, F>
where
ST: ?Sized,
DT: ?Sized,
impl<T> Any for Recursive<T, F>
where
T: 'static + ?Sized,
fn type_id(&self) -> TypeId
impl<T> Borrow<T> for Recursive<T, F>
where
T: ?Sized,
fn borrow(&self) -> &T
impl<T> BorrowMut<T> for Recursive<T, F>
where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
impl<T> CloneToUninit for Recursive<T, F>
where
T: Clone,
unsafe fn clone_to_uninit(&self, dest: *mut u8)
impl<T> From<T> for Recursive<T, F>
fn from(t: T) -> TReturns the argument unchanged.
impl<T> Read<Exclusive, BecauseExclusive> for Recursive<T, F>
where
T: ?Sized,
impl<T> ToOwned for Recursive<T, F>
where
T: Clone,
type Owned = T;fn to_owned(&self) -> Tfn clone_into(&self, target: &mut T)
impl<T, U> Into<U> for Recursive<T, F>
where
U: From<T>,
fn into(self) -> UCalls
U::from(self).That is, this conversion is whatever the implementation of
[From]<T> for Uchooses to do.
impl<T, U> TryFrom<U> for Recursive<T, F>
where
U: Into<T>,
type Error = never;fn try_from(value: U) -> Result<T, never>
impl<T, U> TryInto<U> for Recursive<T, F>
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 Recursive<T, F>
where
V: MultiLane<T>,
fn vzip(self) -> V