Struct iron_shapes_booleanop::sweep_line::btree_scanline::BTreeScanLine

pub struct BTreeScanLine<K> {
    pub(crate) content: BTreeSet<K>,
}

Data structure for the scan-line based on a BTreeSet.

Fields

content: BTreeSet<K>

Implementations

impl<T> BTreeScanLine<T>where T: Ord,

pub fn new() -> BTreeScanLine<T>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn clear(&mut self)

pub fn contains<Q>(&self, value: &Q) -> boolwhere T: Borrow<Q> + Ord, Q: Ord + ?Sized,

pub fn next<Q>(&self, t: &Q) -> Option<&T>where T: Borrow<Q> + Ord, Q: Ord + ?Sized,

pub fn prev<Q>(&self, t: &Q) -> Option<&T>where T: Borrow<Q> + Ord, Q: Ord + ?Sized,

pub fn insert(&mut self, t: T) -> bool

pub fn remove(&mut self, t: &T) -> bool

pub fn min(&self) -> Option<&T>

pub fn max(&self) -> Option<&T>