Struct Curve 

pub struct Curve {
    pub points: Vec<Vec2>,
}

Fields

points: Vec<Vec2>

Implementations

impl Curve

pub fn new() -> Self

pub fn arc(center: Vec2, radius: f32, start_angle: f32, end_angle: f32) -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn add_point(&mut self, point: Vec2)

pub fn remove_point(&mut self, index: usize)

pub fn clear(&mut self)

pub fn rounded_mesh(self, thickness: f32, color: Color) -> Mesh

Trait Implementations

impl Clone for Curve

fn clone(&self) -> Curve

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Curve

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

Formats the value using the given formatter.

impl Default for Curve

fn default() -> Curve

Returns the “default value” for a type.

impl<'a> IntoIterator for &'a Curve

type Item = &'a Vec2

The type of the elements being iterated over.

type IntoIter = Iter<'a, Vec2>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a> IntoIterator for &'a mut Curve

type Item = &'a mut Vec2

The type of the elements being iterated over.

type IntoIter = IterMut<'a, Vec2>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl IntoIterator for Curve

type Item = Vec2

The type of the elements being iterated over.

type IntoIter = IntoIter<Vec2>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for Curve

fn eq(&self, other: &Curve) -> 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 Curve