Struct SubsetSumProblem 

pub struct SubsetSumProblem {
    size: usize,
    dp: BitSet,
    pending_weights: Vec<Reverse<usize>>,
}

Fields

size: usize

dp: BitSet

pending_weights: Vec<Reverse<usize>>

Implementations

impl SubsetSumProblem

pub fn new(size: usize) -> Self

pub fn insert(&mut self, weight: usize)

Examples found in repository

crates/competitive/src/combinatorial_optimization/subset_sum_problem.rs (line 34)

    pub fn extend<I>(&mut self, iter: I)
    where
        I: IntoIterator<Item = usize>,
    {
        for weight in iter {
            self.insert(weight);
        }
    }

pub fn extend<I>(&mut self, iter: I)

where I: IntoIterator<Item = usize>,

pub fn contains(&mut self, sum: usize) -> bool

fn rebuild(&mut self)

Examples found in repository

crates/competitive/src/combinatorial_optimization/subset_sum_problem.rs (line 39)

    pub fn contains(&mut self, sum: usize) -> bool {
        self.rebuild();
        if sum < self.dp.len() {
            self.dp.get(sum)
        } else {
            false
        }
    }

Trait Implementations

impl Clone for SubsetSumProblem

fn clone(&self) -> SubsetSumProblem

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SubsetSumProblem

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

Formats the value using the given formatter.