Struct RingIntersection 

pub struct RingIntersection {
    pub from: usize,
    pub to: usize,
    pub point: Rc<RefCell<Point>>,
    pub t: f64,
    pub t_vec: Point,
    pub t_angle: f64,
}

Local Intersection to a [poly_index][ring_index]

Fields

from: usize

The index of the ring’s start

to: usize

The index of the ring’s end

point: Rc<RefCell<Point>>

The intersection point

t: f64

The t value (where the intersection occurs on the line segment from 0->1)

t_vec: Point

The vector from the start to the intersection

t_angle: f64

The angle of the vector from the start to the intersection

Implementations

impl RingIntersection

pub fn new<P: FullXY>( from: usize, to: usize, point: Rc<RefCell<Point>>, t: f64, t_vec: &P, t_angle: f64, ) -> Self

Create a new Intersection

Trait Implementations

impl Clone for RingIntersection

fn clone(&self) -> RingIntersection

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RingIntersection

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

Formats the value using the given formatter.

impl PartialEq for RingIntersection

fn eq(&self, other: &RingIntersection) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for RingIntersection