Struct descartes::PrimitiveArea

pub struct PrimitiveArea {
    pub boundary: ClosedLinePath,
}

Represents a filled area bounded by a clockwise boundary. Everything "right of" the boundary is considered "inside"

Fields

boundary: ClosedLinePath

Methods

impl PrimitiveArea

pub fn new(boundary: ClosedLinePath) -> PrimitiveArea

pub fn fully_contains(&self, other: &PrimitiveArea) -> bool

pub fn winding_number(&self, point: P2) -> f32

Trait Implementations

impl Clone for PrimitiveArea

fn clone(&self) -> PrimitiveArea

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for PrimitiveArea

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

Formats the value using the given formatter.

impl Compact for PrimitiveArea

fn is_still_compact(&self) -> bool

Is the object's dynamic part stored compactly?

fn dynamic_size_bytes(&self) -> usize

Size of the dynamic part in bytes

unsafe fn compact(source: *mut Self, dest: *mut Self, new_dynamic_part: *mut u8)

Copy the static part of source to dest and compactly store the dynamic part of source as the new dynamic part of dest at new_dynamic_part. This semantically moves source into dest.

unsafe fn decompact(source: *const Self) -> Self

Creates a clone of self with the dynamic part guaranteed to be stored freely.

fn total_size_bytes(&self) -> usize

Total size of the object (static part + dynamic part)

unsafe fn behind(ptr: *mut Self) -> *mut u8

Get a pointer to behind the static part of self (commonly used place for the dynamic part)

unsafe fn compact_behind(source: *mut Self, dest: *mut Self)

Like compact with new_dynamic_part set to dest.behind()

impl PointContainer for PrimitiveArea

fn location_of(&self, point: P2) -> AreaLocation

fn contains(&self, point: P2) -> bool

impl<'a> RoughEq for &'a PrimitiveArea

fn rough_eq_by(&self, other: Self, tolerance: N) -> bool

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