Struct proptest::collection::BinaryHeapStrategy
source · Expand description
Strategy to create BinaryHeap
s with a length in a certain range.
Created by the binary_heap()
function in the same module.
Trait Implementations§
source§impl<T: Clone> Clone for BinaryHeapStrategy<T>where
T: Strategy,
ValueFor<T>: Ord,
impl<T: Clone> Clone for BinaryHeapStrategy<T>where
T: Strategy,
ValueFor<T>: Ord,
source§fn clone(&self) -> BinaryHeapStrategy<T>
fn clone(&self) -> BinaryHeapStrategy<T>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<T> Strategy for BinaryHeapStrategy<T>where
T: Strategy,
ValueFor<T>: Ord,
impl<T> Strategy for BinaryHeapStrategy<T>where
T: Strategy,
ValueFor<T>: Ord,
§type Value = BinaryHeapValueTree<<T as Strategy>::Value>
type Value = BinaryHeapValueTree<<T as Strategy>::Value>
The value tree generated by this
Strategy
. Read moresource§fn new_value(&self, runner: &mut TestRunner) -> NewTree<Self>
fn new_value(&self, runner: &mut TestRunner) -> NewTree<Self>
Generate a new value tree from the given runner. Read more
source§fn prop_map<O: Debug, F: Fn(ValueFor<Self>) -> O>(self, fun: F) -> Map<Self, F>where
Self: Sized,
fn prop_map<O: Debug, F: Fn(ValueFor<Self>) -> O>(self, fun: F) -> Map<Self, F>where
Self: Sized,
Returns a strategy which produces values transformed by the function
fun
. Read moresource§fn prop_map_into<O: Debug>(self) -> MapInto<Self, O>where
Self: Sized,
ValueFor<Self>: Into<O>,
fn prop_map_into<O: Debug>(self) -> MapInto<Self, O>where
Self: Sized,
ValueFor<Self>: Into<O>,
source§fn prop_perturb<O: Debug, F: Fn(ValueFor<Self>, XorShiftRng) -> O>(
self,
fun: F
) -> Perturb<Self, F>where
Self: Sized,
fn prop_perturb<O: Debug, F: Fn(ValueFor<Self>, XorShiftRng) -> O>(
self,
fun: F
) -> Perturb<Self, F>where
Self: Sized,
Returns a strategy which produces values transformed by the function
fun
, which is additionally given a random number generator. Read moresource§fn prop_flat_map<S: Strategy, F: Fn(ValueFor<Self>) -> S>(
self,
fun: F
) -> Flatten<Map<Self, F>>where
Self: Sized,
fn prop_flat_map<S: Strategy, F: Fn(ValueFor<Self>) -> S>(
self,
fun: F
) -> Flatten<Map<Self, F>>where
Self: Sized,
Maps values produced by this strategy into new strategies and picks
values from those strategies. Read more
source§fn prop_ind_flat_map<S: Strategy, F: Fn(ValueFor<Self>) -> S>(
self,
fun: F
) -> IndFlatten<Map<Self, F>>where
Self: Sized,
fn prop_ind_flat_map<S: Strategy, F: Fn(ValueFor<Self>) -> S>(
self,
fun: F
) -> IndFlatten<Map<Self, F>>where
Self: Sized,
Maps values produced by this strategy into new strategies and picks
values from those strategies while considering the new strategies to be
independent. Read more
source§fn prop_ind_flat_map2<S: Strategy, F: Fn(ValueFor<Self>) -> S>(
self,
fun: F
) -> IndFlattenMap<Self, F>where
Self: Sized,
fn prop_ind_flat_map2<S: Strategy, F: Fn(ValueFor<Self>) -> S>(
self,
fun: F
) -> IndFlattenMap<Self, F>where
Self: Sized,
Similar to
prop_ind_flat_map()
, but produces 2-tuples with the input
generated from self
in slot 0 and the derived strategy in slot 1. Read moresource§fn prop_filter<R: Into<Reason>, F: Fn(&ValueFor<Self>) -> bool>(
self,
whence: R,
fun: F
) -> Filter<Self, F>where
Self: Sized,
fn prop_filter<R: Into<Reason>, F: Fn(&ValueFor<Self>) -> bool>(
self,
whence: R,
fun: F
) -> Filter<Self, F>where
Self: Sized,
Returns a strategy which only produces values accepted by
fun
. Read moresource§fn prop_union(self, other: Self) -> Union<Self>where
Self: Sized,
fn prop_union(self, other: Self) -> Union<Self>where
Self: Sized,
source§fn prop_recursive<R, F>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<ValueFor<Self>, F>where
Self: Sized + 'static,
F: Fn(BoxedStrategy<ValueFor<Self>>) -> R,
R: Strategy + 'static,
R::Value: ValueTree<Value = ValueFor<Self>>,
fn prop_recursive<R, F>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<ValueFor<Self>, F>where
Self: Sized + 'static,
F: Fn(BoxedStrategy<ValueFor<Self>>) -> R,
R: Strategy + 'static,
R::Value: ValueTree<Value = ValueFor<Self>>,
Generate a recursive structure with
self
items as leaves. Read more