pub fn from_counts(
        n_untouched: usize,
        n_removed: usize,
        n_inserted: usize,
        item_len: usize,
        hasher: H,
        n_bits_elem: usize,
        limb_width: usize,
        group: RsaQuotientGroup,
    ) -> Self {
        use rayon::prelude::*;
        let untouched_items: Vec<Vec<String>> = (0..n_untouched)
            .into_par_iter()
            .map(|i| {
                (0..item_len)
                    .map(|j| format!("1{:06}{:03}", i, j))
                    .collect()
            })
            .collect();
        let removed_items: Vec<Vec<String>> = (0..n_removed)
            .into_par_iter()
            .map(|i| {
                (0..item_len)
                    .map(|j| format!("2{:06}{:03}", i, j))
                    .collect()
            })
            .collect();
        let inserted_items: Vec<Vec<String>> = (0..n_inserted)
            .into_par_iter()
            .map(|i| {
                (0..item_len)
                    .map(|j| format!("3{:06}{:03}", i, j))
                    .collect()
            })
            .collect();

        Self::new(
            untouched_items,
            removed_items,
            inserted_items,
            hasher,
            n_bits_elem,
            limb_width,
            group,
        )
    }
/// Creates an input to the set benchmark in which fixed numbers of items are present but
/// unmodified, a fixed number of items are removed, and a fixed number are added.
Creates an input to the set benchmark in which fixed numbers of items are present but
unmodified, a fixed number of items are removed, and a fixed number are added.
Creates an input to the set benchmark in which fixed numbers of items are present but unmodified a fixed number of items are removed and a fixed number are added .
pub fn from_counts(
        n_untouched: usize,
        n_removed: usize,
        n_inserted: usize,
        item_len: usize,
        hasher: H,
        n_bits_elem: usize,
        limb_width: usize,
        group: RsaQuotientGroup,
    ) -> Self {
        use rayon::prelude::*;
        let untouched_items: Vec<Vec<String>> = (0..n_untouched)
            .into_par_iter()
            .map(|i| {
                (0..item_len)
                    .map(|j| format!("1{:06}{:03}", i, j))
                    .collect()
            })
            .collect();
        let removed_items: Vec<Vec<String>> = (0..n_removed)
            .into_par_iter()
            .map(|i| {
                (0..item_len)
                    .map(|j| format!("2{:06}{:03}", i, j))
                    .collect()
            })
            .collect();
        let inserted_items: Vec<Vec<String>> = (0..n_inserted)
            .into_par_iter()
            .map(|i| {
                (0..item_len)
                    .map(|j| format!("3{:06}{:03}", i, j))
                    .collect()
            })
            .collect();
        Self::new(
            untouched_items,
            removed_items,
            inserted_items,
            hasher,
            n_bits_elem,
            limb_width,
            group,
        )
    }
pub fn from_counts ( n_untouched : usize , n_removed : usize , n_inserted : usize , item_len : usize , hasher : H , n_bits_elem : usize , limb_width : usize , group : RsaQuotientGroup , ) -> Self { use rayon :: prelude :: * ; let untouched_items : Vec < Vec < String > > = ( 0 .. n_untouched ) . into_par_iter ( ) . map ( | i | { ( 0 .. item_len ) . map ( | j | format ! ( " " i j ) ) . collect ( ) } ) . collect ( ) ; let removed_items : Vec < Vec < String > > = ( 0 .. n_removed ) . into_par_iter ( ) . map ( | i | { ( 0 .. item_len ) . map ( | j | format ! ( " " i j ) ) . collect ( ) } ) . collect ( ) ; let inserted_items : Vec < Vec < String > > = ( 0 .. n_inserted ) . into_par_iter ( ) . map ( | i | { ( 0 .. item_len ) . map ( | j | format ! ( " " i j ) ) . collect ( ) } ) . collect ( ) ; Self :: new ( untouched_items , removed_items , inserted_items , hasher , n_bits_elem , limb_width , group , ) }
Creates an input to the set benchmark in which fixed numbers of items are present but
unmodified, a fixed number of items are removed, and a fixed number are added.
Creates an input to the set benchmark in which fixed numbers of items are present but unmodified a fixed number of items are removed and a fixed number are added .
n_untouched
usize
n_removed
usize
n_inserted
usize
item_len
usize
hasher
H
n_bits_elem
usize
limb_width
usize
group
RsaQuotientGroup
n_untouched
usize
n_removed
usize
n_inserted
usize
item_len
usize
hasher
H
n_bits_elem
usize
limb_width
usize
group
RsaQuotientGroup