Struct vrp_core::algorithms::geometry::Point

pub struct Point {
    pub x: f64,
    pub y: f64,
}

Represents a point in 2D space.

Fields

x: f64

X value.

y: f64

Y value.

Implementations

impl Point

pub fn new(x: f64, y: f64) -> Self

Creates a new instance of Point.

pub fn distance_to_point(&self, other: &Point) -> f64

Computes distance from given point to other

pub fn distance_to_line(&self, a: &Point, b: &Point) -> f64

Computes distance from line, drawn by points a and b, to the point.

pub fn distance_to_segment(&self, a: &Point, b: &Point) -> f64

Computes distance from segment to the point.

pub fn dot_product(a: &Point, b: &Point, c: &Point) -> f64

Computes the dot product AB . BC

pub fn cross_product(a: &Point, b: &Point, c: &Point) -> f64

Computes the cross product AB x AC

Trait Implementations

impl Clone for Point

fn clone(&self) -> Point

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Point

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

Formats the value using the given formatter.

impl Hash for Point

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq<Point> for Point

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

This method tests for self and other values to be equal, and is used by ==.

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

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

impl Eq for Point