#![allow(dead_code)]
use proptest::prelude::*;
pub(crate) use super::bench_gen::max_value_for_num_bits;
pub(crate) fn num_bits_strategy() -> impl Strategy<Value = u8> {
1u8..=32
}
pub(crate) fn values_strategy(num_bits: u8, len: usize) -> impl Strategy<Value = Vec<u32>> {
proptest::collection::vec(0..=max_value_for_num_bits(num_bits), len)
}
pub(crate) fn num_bits_and_values(
len_strategy: impl Strategy<Value = usize>,
) -> impl Strategy<Value = (u8, Vec<u32>)> {
(num_bits_strategy(), len_strategy).prop_flat_map(|(num_bits, len)| {
values_strategy(num_bits, len).prop_map(move |values| (num_bits, values))
})
}
pub(crate) fn num_bits_and_block_values(block_len: usize) -> impl Strategy<Value = (u8, Vec<u32>)> {
num_bits_and_values(Just(block_len))
}
pub(crate) fn arbitrary_len_strategy() -> impl Strategy<Value = usize> {
0usize..=300
}
fn safe_len_for_step_bound(max_step_plus_margin: u64) -> usize {
let cap = u64::from(u32::MAX) / max_step_plus_margin.max(1);
cap.clamp(1, 300) as usize
}
pub(crate) fn sorted_num_bits_and_values() -> impl Strategy<Value = (u8, Vec<u32>)> {
num_bits_strategy().prop_flat_map(|num_bits| {
let max_step = max_value_for_num_bits(num_bits);
let len = safe_len_for_step_bound(u64::from(max_step) + 1);
(
0..=max_step,
proptest::collection::vec(0..=max_step, 0..=len.saturating_sub(1)),
)
.prop_map(move |(first, steps)| {
let mut acc = first;
let mut values = vec![first];
for step in steps {
acc = acc
.checked_add(step)
.expect("safe_len_for_step_bound must prevent u32 overflow");
values.push(acc);
}
(num_bits, values)
})
})
}
pub(crate) fn strictly_sorted_num_bits_and_values() -> impl Strategy<Value = (u8, Vec<u32>)> {
num_bits_strategy().prop_flat_map(|num_bits| {
let max_step = max_value_for_num_bits(num_bits);
let len = safe_len_for_step_bound(u64::from(max_step) + 2);
(
0..=max_step,
proptest::collection::vec(0..=max_step, 0..=len.saturating_sub(1)),
)
.prop_map(move |(first, steps)| {
let mut acc = first;
let mut values = vec![first];
for step in steps {
acc = acc
.checked_add(step)
.and_then(|s| s.checked_add(1))
.expect("safe_len_for_step_bound must prevent u32 overflow");
values.push(acc);
}
(num_bits, values)
})
})
}
pub(crate) fn proptest_config(cases: u32) -> ProptestConfig {
#[cfg(not(miri))]
{
ProptestConfig::with_cases(cases)
}
#[cfg(miri)]
{
ProptestConfig {
cases: cases.min(16),
failure_persistence: None,
..ProptestConfig::default()
}
}
}