Struct HashSetStrategy
#[must_use = "strategies do nothing unless used"]
pub struct HashSetStrategy<T>(/* private field */)
where
T: Strategy,
T::Value: Hash + Eq,;Strategy to create HashSets with a length in a certain range.
Created by the hash_set() function in the same module.
Trait Implementations
impl<T> Clone for HashSetStrategy<T>
where
T: Strategy + Clone,
T::Value: Hash + Eq,
fn clone(&self) -> HashSetStrategy<T>
impl<T> Debug for HashSetStrategy<T>
where
T: Strategy + Debug,
T::Value: Hash + Eq,
fn fmt(&self, f: &mut Formatter<'_>) -> Result
impl<T> Strategy for HashSetStrategy<T>
where
T: Strategy,
T::Value: Hash + Eq,
type Tree = HashSetValueTree<<T as Strategy>::Tree>;type Value = HashSet<<T as Strategy>::Value>;fn new_tree(&self, runner: &mut TestRunner) -> NewTree<Self>
Auto Trait Implementations
impl<T> Freeze for HashSetStrategy<T>
where
Filter<Map<VecStrategy<T>, VecToHashSet>, MinSize>: Freeze,
impl<T> RefUnwindSafe for HashSetStrategy<T>
where
Filter<Map<VecStrategy<T>, VecToHashSet>, MinSize>: RefUnwindSafe,
impl<T> Send for HashSetStrategy<T>
where
Filter<Map<VecStrategy<T>, VecToHashSet>, MinSize>: Send,
impl<T> Sync for HashSetStrategy<T>
where
Filter<Map<VecStrategy<T>, VecToHashSet>, MinSize>: Sync,
impl<T> Unpin for HashSetStrategy<T>
where
Filter<Map<VecStrategy<T>, VecToHashSet>, MinSize>: Unpin,
impl<T> UnsafeUnpin for HashSetStrategy<T>
where
Filter<Map<VecStrategy<T>, VecToHashSet>, MinSize>: UnsafeUnpin,
impl<T> UnwindSafe for HashSetStrategy<T>
where
Filter<Map<VecStrategy<T>, VecToHashSet>, MinSize>: UnwindSafe,
Blanket Implementations
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for HashSetStrategy<T>
where
ST: ?Sized,
DT: ?Sized,
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for HashSetStrategy<T>
where
ST: ?Sized,
DT: ?Sized,
impl<T> Any for HashSetStrategy<T>
where
T: 'static + ?Sized,
fn type_id(&self) -> TypeId
impl<T> Borrow<T> for HashSetStrategy<T>
where
T: ?Sized,
fn borrow(&self) -> &T
impl<T> BorrowMut<T> for HashSetStrategy<T>
where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
impl<T> CloneToUninit for HashSetStrategy<T>
where
T: Clone,
unsafe fn clone_to_uninit(&self, dest: *mut u8)
impl<T> From<T> for HashSetStrategy<T>
fn from(t: T) -> TReturns the argument unchanged.
impl<T> Read<Exclusive, BecauseExclusive> for HashSetStrategy<T>
where
T: ?Sized,
impl<T> ToOwned for HashSetStrategy<T>
where
T: Clone,
type Owned = T;fn to_owned(&self) -> Tfn clone_into(&self, target: &mut T)
impl<T, U> Into<U> for HashSetStrategy<T>
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 HashSetStrategy<T>
where
U: Into<T>,
type Error = never;fn try_from(value: U) -> Result<T, never>
impl<T, U> TryInto<U> for HashSetStrategy<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 HashSetStrategy<T>
where
V: MultiLane<T>,
fn vzip(self) -> V