Struct intersect2d::algorithm::AlgorithmData

pub struct AlgorithmData<T> where
    T: Float + CoordNum + PartialOrd + AbsDiffEq + UlpsEq,
    T::Epsilon: Copy,  {
    pub ignore_end_point_intersections: bool,
    // some fields omitted
}

Contains the data the sweepline intersection algorithm needs to operate. Most of these containers are stored inside an Option. This makes it possible to take() them and make the borrow-checker happy.

Fields

ignore_end_point_intersections: bool

Implementations

impl<T> AlgorithmData<T> where
    T: Float + Display + ToPrimitive + CoordNum + PartialOrd + AbsDiffEq + UlpsEq,
    T::Epsilon: Copy, 

pub fn get_sweepline_pos(&self) -> &Coordinate<T>

pub fn get_lines(&self) -> &Vec<Line<T>>

pub fn get_results(&self) -> &Option<RBMap<SiteEventKey<T>, Vec<usize>>>

pub fn get_site_events(&self) -> &Option<RBMap<SiteEventKey<T>, SiteEvent<T>>>

pub fn get_active_lines(&self) -> &Option<FnvHashSet<usize>>

pub fn get_intersection_calls(&self) -> usize

pub fn with_stop_at_first_intersection(&mut self, value: bool)

pub fn with_ignore_end_point_intersections(&mut self, value: bool)

pub fn with_lines<'a, I>(&mut self, data: I) where
    T: 'a,
    I: Iterator<Item = &'a Line<T>>, 

Add data to the input lines. Sort the end point according to the order of SiteEventKey. Populate the event queue Todo add error when data contains NaN (for example)

pub fn compute(&mut self, interactive: bool) -> bool

handles input event, returns true when done If interactive is set, the method will handle only one event for each call

Trait Implementations

impl<T> Default for AlgorithmData<T> where
    T: Float + Display + ToPrimitive + CoordNum + PartialOrd + AbsDiffEq + UlpsEq,
    T::Epsilon: Copy, 

fn default() -> Self

Returns the "default value" for a type.