Struct BlockingQueue

pub struct BlockingQueue<T, C, DualStore>
where
    T: IBranchFilter,
    DualStore: UserDualStore,
    C: Compare<Branch<T, DualStore>> + Clone,
{ /* private fields */ }

Thread-safe queue that blocks de_q on empty

Implementations

impl<T: IBranchFilter, C: Compare<Branch<T, DualStore>> + Clone, DualStore: UserDualStore> BlockingQueue<T, C, DualStore>

pub fn new(compare_bound: C, compare_without_bound: C) -> Self

Create empty blocking queue

pub fn now_has_bound(&self)

pub fn add_job(&self, t: Branch<T, DualStore>)

push input on back of queue

• unrecoverable if lock fails so just unwrap

pub fn get_job(&self) -> Option<Branch<T, DualStore>>

pop element from front of queue

• unrecoverable if lock fails so just unwrap
• same for condition variable

pub fn job_done(&self)

pub fn flush_and_terminate(&self)

pub fn copy_of_queue(&self) -> Vec<Branch<T, DualStore>>

pub fn lowest_bound(&self) -> Option<f64>

pub fn len(&self) -> usize

return number of elements in queue