Struct iron_shapes_booleanop::sweep_line::naive_scanline::NaiveScanLine

pub struct NaiveScanLine<K, C>where
    C: Fn(&K, &K) -> Ordering,{
    comparator: C,
    content: Vec<K>,
}

Naive and inefficient implementation of the data structure used for the scan line.

Fields

comparator: C

content: Vec<K>

Implementations

impl<T, C> NaiveScanLine<T, C>where C: Fn(&T, &T) -> Ordering,

pub fn new(comparator: C) -> NaiveScanLine<T, C>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn clear(&mut self)

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

pub fn find(&self, t: &T) -> Option<&T>

pub fn next(&self, t: &T) -> Option<&T>

pub fn prev(&self, t: &T) -> Option<&T>

fn find_index(&self, t: &T) -> Option<(usize, &T)>

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>