Struct BinaryHeapStrategy

struct BinaryHeapStrategy<T>(_)
where
    T: Strategy,
    <T as >::Value: Ord

Strategy to create BinaryHeaps with a length in a certain range.

Created by the binary_heap() function in the same module.

Implementations

impl<T> Any for BinaryHeapStrategy<T>

fn type_id(self: &Self) -> TypeId

impl<T> Borrow for BinaryHeapStrategy<T>

fn borrow(self: &Self) -> &T

impl<T> BorrowMut for BinaryHeapStrategy<T>

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

impl<T> Clone for BinaryHeapStrategy<T>

fn clone(self: &Self) -> BinaryHeapStrategy<T>

impl<T> CloneToUninit for BinaryHeapStrategy<T>

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

impl<T> Debug for BinaryHeapStrategy<T>

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

impl<T> Freeze for BinaryHeapStrategy<T>

impl<T> From for BinaryHeapStrategy<T>

fn from(t: T) -> T

Returns the argument unchanged.

impl<T> RefUnwindSafe for BinaryHeapStrategy<T>

impl<T> Send for BinaryHeapStrategy<T>

impl<T> Strategy for BinaryHeapStrategy<T>

fn new_tree(self: &Self, runner: &mut TestRunner) -> NewTree<Self>

impl<T> Sync for BinaryHeapStrategy<T>

impl<T> ToOwned for BinaryHeapStrategy<T>

fn to_owned(self: &Self) -> T
fn clone_into(self: &Self, target: &mut T)

impl<T> Unpin for BinaryHeapStrategy<T>

impl<T> UnwindSafe for BinaryHeapStrategy<T>

impl<T, U> Into for BinaryHeapStrategy<T>

fn into(self: 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 for BinaryHeapStrategy<T>

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto for BinaryHeapStrategy<T>

fn try_into(self: Self) -> Result<U, <U as TryFrom<T>>::Error>

impl<V, T> VZip for BinaryHeapStrategy<T>

fn vzip(self: Self) -> V