bolero-generator 0.13.5

#[macro_use]
pub mod collections;

pub use collections::CollectionGenerator;

pub mod boxed;
pub mod string;
pub mod sync;

use crate::{Driver, TypeGenerator, ValueGenerator};
pub use alloc::{
    borrow::{Cow, ToOwned},
    collections::{BTreeMap, BTreeSet, BinaryHeap, LinkedList, VecDeque},
    vec::Vec,
};

pub(crate) const DEFAULT_LEN_RANGE: core::ops::RangeInclusive<usize> = 0..=64;

impl_values_collection_generator!(BinaryHeap, BinaryHeapGenerator, DEFAULT_LEN_RANGE, [Ord]);

impl<T: Ord> CollectionGenerator for BinaryHeap<T> {
    type Item = T;

    fn mutate_collection<D: Driver, G>(
        &mut self,
        driver: &mut D,
        new_len: usize,
        item_gen: &G,
    ) -> Option<()>
    where
        G: ValueGenerator<Output = Self::Item>,
    {
        let prev = core::mem::take(self);

        for mut item in prev.into_iter().take(new_len) {
            item_gen.mutate(driver, &mut item)?;
            self.push(item);
        }

        for _ in 0..(new_len - self.len()) {
            self.push(item_gen.generate(driver)?);
        }

        Some(())
    }
}

#[test]
fn binary_heap_test() {
    let _ = generator_no_clone_test!(produce::<BinaryHeap<u8>>());
}

impl_values_collection_generator!(BTreeSet, BTreeSetGenerator, DEFAULT_LEN_RANGE, [Ord]);

impl<T: Ord> CollectionGenerator for BTreeSet<T> {
    type Item = T;

    fn mutate_collection<D: Driver, G>(
        &mut self,
        driver: &mut D,
        new_len: usize,
        item_gen: &G,
    ) -> Option<()>
    where
        G: ValueGenerator<Output = Self::Item>,
    {
        let prev = core::mem::take(self);
        for mut item in prev.into_iter().take(new_len) {
            item_gen.mutate(driver, &mut item)?;
            self.insert(item);
        }

        for _ in 0..(new_len - self.len()) {
            self.insert(item_gen.generate(driver)?);
        }

        Some(())
    }
}

#[test]
fn btree_set_test() {
    let _ = generator_test!(produce::<BTreeSet<u8>>());
}

impl_values_collection_generator!(LinkedList, LinkedListGenerator, DEFAULT_LEN_RANGE);

impl<T> CollectionGenerator for LinkedList<T> {
    type Item = T;

    fn mutate_collection<D: Driver, G>(
        &mut self,
        driver: &mut D,
        new_len: usize,
        item_gen: &G,
    ) -> Option<()>
    where
        G: ValueGenerator<Output = Self::Item>,
    {
        for item in self.iter_mut().take(new_len) {
            item_gen.mutate(driver, item)?;
        }

        if let Some(to_add) = new_len.checked_sub(self.len()) {
            for _ in 0..to_add {
                self.push_back(item_gen.generate(driver)?);
            }
        } else {
            // remove extras
            for item in self.split_off(new_len) {
                item_gen.driver_cache(driver, item);
            }
        }

        #[cfg(test)]
        assert_eq!(self.len(), new_len);

        Some(())
    }
}

#[test]
fn linked_list_test() {
    let _ = generator_test!(produce::<LinkedList<u8>>());
}

impl_values_collection_generator!(VecDeque, VecDequeGenerator, DEFAULT_LEN_RANGE);

impl<T> CollectionGenerator for VecDeque<T> {
    type Item = T;

    fn mutate_collection<D: Driver, G>(
        &mut self,
        driver: &mut D,
        new_len: usize,
        item_gen: &G,
    ) -> Option<()>
    where
        G: ValueGenerator<Output = Self::Item>,
    {
        for item in self.iter_mut().take(new_len) {
            item_gen.mutate(driver, item)?;
        }

        if let Some(to_add) = new_len.checked_sub(self.len()) {
            self.reserve(to_add);
            for _ in 0..to_add {
                self.push_back(item_gen.generate(driver)?);
            }
        } else {
            // remove extras
            for item in self.drain(new_len..) {
                item_gen.driver_cache(driver, item);
            }
        }

        #[cfg(test)]
        assert_eq!(self.len(), new_len);

        Some(())
    }
}

#[test]
fn vecdeque_test() {
    let _ = generator_test!(produce::<VecDeque<u8>>());
}

impl_values_collection_generator!(Vec, VecGenerator, DEFAULT_LEN_RANGE);

impl<T> CollectionGenerator for Vec<T> {
    type Item = T;

    fn mutate_collection<D: Driver, G>(
        &mut self,
        driver: &mut D,
        new_len: usize,
        item_gen: &G,
    ) -> Option<()>
    where
        G: ValueGenerator<Output = Self::Item>,
    {
        for item in self.iter_mut().take(new_len) {
            item_gen.mutate(driver, item)?;
        }

        if let Some(to_add) = new_len.checked_sub(self.len()) {
            self.reserve(to_add);
            for _ in 0..to_add {
                self.push(item_gen.generate(driver)?);
            }
        } else {
            // remove extras
            for item in self.drain(new_len..) {
                item_gen.driver_cache(driver, item);
            }
        }

        #[cfg(test)]
        assert_eq!(self.len(), new_len);

        Some(())
    }
}

#[test]
fn vec_type_test() {
    let _ = generator_test!(produce::<Vec<u8>>());
}

#[test]
fn vec_with_len_test() {
    let results = generator_test!(produce::<Vec<u8>>().with().len(8usize));
    assert!(results.into_iter().all(|v| v.len() == 8));
}

#[test]
fn vec_with_values_test() {
    let _ = generator_test!(produce::<Vec<_>>().with().values(4u16..6));
}

#[test]
fn vec_gen_test() {
    let _ = generator_test!(vec![produce::<u8>()]);
}

impl_key_values_collection_generator!(BTreeMap, BTreeMapGenerator, DEFAULT_LEN_RANGE, [Ord]);

#[test]
fn btree_map_type_test() {
    let _ = generator_test!(produce::<BTreeMap<u8, u8>>());
}

pub type Bytes = Vec<u8>;
pub type BytesGenerator<L> = VecGenerator<crate::TypeValueGenerator<u8>, L>;

pub type Chars = Vec<char>;
pub type CharsGenerator<L> = VecGenerator<crate::TypeValueGenerator<char>, L>;

impl<T> TypeGenerator for Cow<'static, T>
where
    T: ToOwned + ?Sized,
    <T as ToOwned>::Owned: TypeGenerator,
{
    fn generate<D: Driver>(driver: &mut D) -> Option<Self> {
        Some(Cow::Owned(driver.produce()?))
    }
}