Struct fj_kernel::algorithms::intersection::CurveFaceIntersectionList

source · [−]

pub struct CurveFaceIntersectionList { /* private fields */ }

Expand description

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

Implementations

source

impl CurveFaceIntersectionList

source

pub fn from_intervals(
intervals: impl IntoIterator<Item = [impl Into<Scalar>; 2]>
) -> Self

Create a new instance from the intersection intervals

This method is useful for test code.

source

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

Compute the intersections between a Curve and a Face

source

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.

source

pub fn is_empty(&self) -> bool

Indicate whether the intersection list is empty

Trait Implementations

source

impl Clone for CurveFaceIntersectionList

source

fn clone(&self) -> CurveFaceIntersectionList

Returns a copy of the value. Read more

1.0.0 · source

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

Performs copy-assignment from source. Read more

source

impl Debug for CurveFaceIntersectionList

source

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

Formats the value using the given formatter. Read more

source

impl Hash for CurveFaceIntersectionList

source

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

Feeds this value into the given Hasher. Read more

1.3.0 · source

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

Feeds a slice of this type into the given Hasher. Read more

source

impl IntoIterator for CurveFaceIntersectionList

type Item = [Scalar ; 2]

The type of the elements being iterated over.

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

Which kind of iterator are we turning this into?

source

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more

source

impl Ord for CurveFaceIntersectionList

source

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

This method returns an Ordering between self and other. Read more

1.21.0 · source

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

Compares and returns the maximum of two values. Read more

1.21.0 · source

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

Compares and returns the minimum of two values. Read more

1.50.0 · source

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval. Read more

source

impl PartialEq<CurveFaceIntersectionList> for CurveFaceIntersectionList

source

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

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

source

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

This method tests for !=.

source

impl PartialOrd<CurveFaceIntersectionList> for CurveFaceIntersectionList

source

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

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

1.0.0 · source

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

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

1.0.0 · source

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

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

1.0.0 · source

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

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

1.0.0 · source

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

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

source

impl Eq for CurveFaceIntersectionList

source

impl StructuralEq for CurveFaceIntersectionList

source

impl StructuralPartialEq for CurveFaceIntersectionList

Auto Trait Implementations

impl RefUnwindSafe for CurveFaceIntersectionList

impl Send for CurveFaceIntersectionList

impl Sync for CurveFaceIntersectionList

impl Unpin for CurveFaceIntersectionList

impl UnwindSafe for CurveFaceIntersectionList

Blanket Implementations

source

impl<T> Any for T where
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

impl<T> Downcast for T where
T: Any,

fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>

Convert Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can then be further downcast into Box<ConcreteType> where ConcreteType implements Trait. Read more

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>

Convert Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait. Read more

fn as_any(&self) -> &(dyn Any + 'static)

Convert &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s. Read more

fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

Convert &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s. Read more

impl<T> DowncastSync for T where
T: Any + Send + Sync,

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Send + Sync + 'static>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T> Same<T> for T

type Output = T

Should always be Self

impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.

source

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

source

Struct fj_kernel::algorithms::intersection::CurveFaceIntersectionList

Implementations

impl CurveFaceIntersectionList

pub fn from_intervals( intervals: impl IntoIterator<Item = [impl Into<Scalar>; 2]>) -> Self

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

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

pub fn is_empty(&self) -> bool

Trait Implementations

impl Clone for CurveFaceIntersectionList

fn clone(&self) -> CurveFaceIntersectionList

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

impl Debug for CurveFaceIntersectionList

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

impl Hash for CurveFaceIntersectionList

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

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

impl IntoIterator for CurveFaceIntersectionList

type Item = [Scalar; 2]

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

fn into_iter(self) -> Self::IntoIter

impl Ord for CurveFaceIntersectionList

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

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

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

fn clamp(self, min: Self, max: Self) -> Self

impl PartialEq<CurveFaceIntersectionList> for CurveFaceIntersectionList

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

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

impl PartialOrd<CurveFaceIntersectionList> for CurveFaceIntersectionList

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

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

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

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

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

impl Eq for CurveFaceIntersectionList

impl StructuralEq for CurveFaceIntersectionList

impl StructuralPartialEq for CurveFaceIntersectionList

Auto Trait Implementations

impl RefUnwindSafe for CurveFaceIntersectionList

impl Send for CurveFaceIntersectionList

impl Sync for CurveFaceIntersectionList

impl Unpin for CurveFaceIntersectionList

impl UnwindSafe for CurveFaceIntersectionList

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> Downcast for T where T: Any,

fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>

fn as_any(&self) -> &(dyn Any + 'static)

fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

impl<T> DowncastSync for T where T: Any + Send + Sync,

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Send + Sync + 'static>

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

fn into(self) -> U

impl<T> Same<T> for T

type Output = T

impl<SS, SP> SupersetOf<SS> for SP where SS: SubsetOf<SP>,

fn to_subset(&self) -> Option<SS>

fn is_in_subset(&self) -> bool

fn to_subset_unchecked(&self) -> SS

fn from_subset(element: &SS) -> SP

impl<T> ToOwned for T where T: Clone,

type Owned = T

fn to_owned(&self) -> T

fn clone_into(&self, target: &mut T)

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<T> Scalar for T where T: 'static + Clone + PartialEq<T> + Debug,

pub fn from_intervals(
intervals: impl IntoIterator<Item = [impl Into<Scalar>; 2]>
) -> Self

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

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

type Item = [Scalar ; 2]

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<T> Downcast for T where
T: Any,

impl<T> DowncastSync for T where
T: Any + Send + Sync,

impl<T, U> Into<U> for T where
U: From<T>,

impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,

impl<T> ToOwned for T where
T: Clone,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

impl<T> Scalar for T where
T: 'static + Clone + PartialEq<T> + Debug,