pub struct Knots { /* private fields */ }
Implementations§
source§impl Knots
impl Knots
pub fn new(degree: usize, knots: VecD) -> Self
pub fn vector(&self) -> &VecD
pub fn vector_mut(&mut self) -> &mut VecD
sourcepub fn vector_derivative(&self, derivative: usize) -> &VecD
pub fn vector_derivative(&self, derivative: usize) -> &VecD
§Arguments
k
- Thek
-th derivative knot vector.
pub fn vector_derivative_mut(&mut self, derivative: usize) -> &mut VecD
pub fn degree(&self) -> usize
pub fn segments(&self) -> usize
pub fn segments_derivative(&self, k: usize) -> usize
pub fn len(&self, k: usize) -> usize
pub fn internal_count(&self) -> usize
pub fn internal(&self) -> VecDView<'_>
pub fn internal_knot(&self, i: usize) -> f64
pub fn domain_count(&self) -> usize
pub fn domain(&self) -> VecDView<'_>
pub fn domain_derivative(&self, k: usize) -> VecDView<'_>
pub fn domain_knot(&self, i: usize) -> f64
pub fn multiplicity(&self, u: f64) -> usize
pub fn normalize(&mut self) -> &mut Self
pub fn rescale(&mut self, old_lim: (f64, f64), new_lim: (f64, f64))
pub fn max_derivative(&self) -> usize
pub fn derive(&mut self)
Trait Implementations§
Auto Trait Implementations§
impl RefUnwindSafe for Knots
impl Send for Knots
impl Sync for Knots
impl Unpin for Knots
impl UnwindSafe for Knots
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
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
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
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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.