Struct fj_kernel::algorithms::intersect::CurveFaceIntersection

pub struct CurveFaceIntersection {
    pub intervals: Vec<CurveFaceIntersectionInterval>,
}

The intersections between a Curve and a Face, in curve coordinates

Fields

intervals: Vec<CurveFaceIntersectionInterval>

The intervals where the curve and face intersect, in curve coordinates

Implementations

impl CurveFaceIntersection

pub fn from_intervals(
    intervals: impl IntoIterator<Item = impl Into<CurveFaceIntersectionInterval>>
) -> Self

Create a new instance from the intersection intervals

This method is useful for test code.

pub fn compute(curve: &Curve, face: &Face) -> Self

Compute the intersections between a Curve and a Face

pub fn merge(&self, other: &Self) -> Self

Merge this intersection list with another

The merged list will contain all overlaps of the intervals from the two other lists.

pub fn is_empty(&self) -> bool

Indicate whether the intersection list is empty

Trait Implementations

impl Clone for CurveFaceIntersection

fn clone(&self) -> CurveFaceIntersection

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for CurveFaceIntersection

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

Formats the value using the given formatter.

impl Hash for CurveFaceIntersection

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 IntoIterator for CurveFaceIntersection

type Item = CurveFaceIntersectionInterval

The type of the elements being iterated over.

type IntoIter = IntoIter<<CurveFaceIntersection as IntoIterator>::Item, Global>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl Ord for CurveFaceIntersection

fn cmp(&self, other: &CurveFaceIntersection) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere
    Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere
    Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere
    Self: Sized + PartialOrd<Self>,

Restrict a value to a certain interval.

impl PartialEq<CurveFaceIntersection> for CurveFaceIntersection

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

fn partial_cmp(&self, other: &CurveFaceIntersection) -> Option<Ordering>

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

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

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

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

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

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

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

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 Eq for CurveFaceIntersection

impl StructuralEq for CurveFaceIntersection

impl StructuralPartialEq for CurveFaceIntersection