Struct DeltaDebugShrinker 

pub struct DeltaDebugShrinker<T> { /* private fields */ }

Delta debugging shrinker for finding minimal failing subsets

Uses binary search to efficiently find the smallest subset of a collection that still fails a test. This is particularly useful for reducing sequences of operations or large inputs to their minimal failing case.

Examples

use protest_extras::shrinking::DeltaDebugShrinker;

let items = vec!["a", "b", "c", "d", "e"];
let shrinker = DeltaDebugShrinker::new(items);

// Find minimal subset that contains "b" and "d"
let minimal = shrinker.find_minimal(|subset| {
    subset.contains(&"b") && subset.contains(&"d")
});

assert_eq!(minimal, vec!["b", "d"]);

Implementations

impl<T: Clone + Debug + PartialEq> DeltaDebugShrinker<T>

pub fn new(items: Vec<T>) -> Self

Create a new delta debugging shrinker

pub fn find_minimal<F>(self, predicate: F) -> Vec<T>

where F: Fn(&[T]) -> bool,

Find the minimal subset that satisfies the predicate

The predicate should return true for failing test cases.

pub fn shrink_steps<F>(self, predicate: F) -> DeltaDebugIterator<T, F>

where F: Fn(&[T]) -> bool,

Shrink to minimal subset, yielding intermediate results

This is useful if you want to see the shrinking process or stop early.

Trait Implementations

impl<T: Clone> Clone for DeltaDebugShrinker<T>

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug> Debug for DeltaDebugShrinker<T>

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

Formats the value using the given formatter.