pub struct LazyValueTree<S: Strategy> { /* private fields */ }
Expand description
Represents a value tree that is initialized on the first call to any methods.
This is used to defer potentially expensive generation to shrinking time. It is public only to allow APIs to expose it as an intermediate value.
Trait Implementations§
Source§impl<S: Strategy> Clone for LazyValueTree<S>
impl<S: Strategy> Clone for LazyValueTree<S>
Auto Trait Implementations§
impl<S> Freeze for LazyValueTree<S>
impl<S> !RefUnwindSafe for LazyValueTree<S>
impl<S> Send for LazyValueTree<S>
impl<S> Sync for LazyValueTree<S>
impl<S> Unpin for LazyValueTree<S>
impl<S> !UnwindSafe for LazyValueTree<S>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)Layout§
Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.