Struct rusttype::Point

pub struct Point<N> {
    pub x: N,
    pub y: N,
}

[−] Expand description

A point in 2-dimensional space, with each dimension of type N.

Legal operations on points are addition and subtraction by vectors, and subtraction between points, to give a vector representing the offset between the two points. Combined with the legal operations on vectors, meaningful manipulations of vectors and points can be performed.

For example, to interpolate between two points by a factor t:

let interpolated_point = p0 + (p1 - p0) * t;

Fields

x: N

y: N

Trait Implementations

impl<N: Add<Output = N>> Add<Point<N>> for Vector<N>[+]

[+] Show hidden undocumented items

type Output = Point<N>

The resulting type after applying the + operator.

fn add(self, rhs: Point<N>) -> Point<N>[−]

Performs the + operation.

impl<N: Add<Output = N>> Add<Vector<N>> for Point<N>[+]

[+] Show hidden undocumented items

type Output = Point<N>

The resulting type after applying the + operator.

fn add(self, rhs: Vector<N>) -> Point<N>[−]

Performs the + operation.

impl<N: Clone> Clone for Point<N>[+]

[+] Show hidden undocumented items

fn clone(&self) -> Point<N>[−]

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)[−]

Performs copy-assignment from source.

impl<N: Copy> Copy for Point<N>

impl<N: Debug> Debug for Point<N>[+]

[+] Show hidden undocumented items

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

Formats the value using the given formatter.

impl<N: Default> Default for Point<N>[+]

[+] Show hidden undocumented items

fn default() -> Point<N>[−]

Returns the “default value” for a type.

impl<N: Eq> Eq for Point<N>

impl<N: Hash> Hash for Point<N>[+]

[+] Show hidden undocumented items

fn hash<__H: Hasher>(&self, state: &mut __H)[−]

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<N: Ord> Ord for Point<N>[+]

[+] Show hidden undocumented items

fn cmp(&self, other: &Point<N>) -> Ordering[−]

This method returns an Ordering between self and other.

#[must_use]

pub fn max(self, other: Self) -> Self[−]

Compares and returns the maximum of two values.

#[must_use]

pub fn min(self, other: Self) -> Self[−]

Compares and returns the minimum of two values.

#[must_use]

pub fn clamp(self, min: Self, max: Self) -> Self[−]

Restrict a value to a certain interval.

impl<N: PartialEq> PartialEq<Point<N>> for Point<N>[+]

[+] Show hidden undocumented items

fn eq(&self, other: &Point<N>) -> bool[−]

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

fn ne(&self, other: &Point<N>) -> bool[−]

This method tests for !=.

impl<N: PartialOrd> PartialOrd<Point<N>> for Point<N>[+]

[+] Show hidden undocumented items

fn partial_cmp(&self, other: &Point<N>) -> Option<Ordering>[−]

This method returns an ordering between self and other values if one exists.

#[must_use]

pub fn lt(&self, other: &Rhs) -> bool[−]

This method tests less than (for self and other) and is used by the < operator.

#[must_use]

pub fn le(&self, other: &Rhs) -> bool[−]

This method tests less than or equal to (for self and other) and is used by the <= operator.

#[must_use]

pub fn gt(&self, other: &Rhs) -> bool[−]

This method tests greater than (for self and other) and is used by the > operator.

#[must_use]

pub fn ge(&self, other: &Rhs) -> bool[−]

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<N> StructuralEq for Point<N>

impl<N> StructuralPartialEq for Point<N>

impl<N: Sub<Output = N>> Sub<Point<N>> for Point<N>[+]

[+] Show hidden undocumented items

type Output = Vector<N>

The resulting type after applying the - operator.

fn sub(self, rhs: Point<N>) -> Vector<N>[−]

Performs the - operation.

impl<N: Sub<Output = N>> Sub<Vector<N>> for Point<N>[+]

[+] Show hidden undocumented items

type Output = Point<N>

The resulting type after applying the - operator.

fn sub(self, rhs: Vector<N>) -> Point<N>[−]

Performs the - operation.