pub struct Sampling {
pub us: Vec<f64>,
pub vs: Vec<f64>,
pub between: (bool, bool),
pub closed_v: bool,
pub most: usize,
}Expand description
Where fit_surface_sampled starts sampling and how far it may refine.
Fields§
§us: Vec<f64>The first grid’s column parameters (u), strictly increasing.
vs: Vec<f64>The first grid’s row parameters (v), strictly increasing.
between: (bool, bool)Whether the geometry is known between the columns (.0) and
between the rows (.1). Only a direction known between its samples
is checked there and refined; the other is fitted through its
samples, which are all there is of it.
closed_v: boolWhether the fit closes smoothly across v: the last row is the
first again, and the loop crosses its seam C1 as in
fit_surface_grid_closed_v.
most: usizeThe most spans a direction is refined to.
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Sampling
impl RefUnwindSafe for Sampling
impl Send for Sampling
impl Sync for Sampling
impl Unpin for Sampling
impl UnsafeUnpin for Sampling
impl UnwindSafe for Sampling
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§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.