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