pub struct Key<T, V> {
pub t: T,
pub value: V,
pub interpolation: Interpolation<T, V>,
}
Expand description
A spline control point.
This type associates a value at a given interpolation parameter value. It also contains an
interpolation mode used to determine how to interpolate values on the segment defined by this
key and the next one – if existing. Have a look at Interpolation
for further details.
Fields§
§t: T
Interpolation parameter at which the Key
should be reached.
value: V
Carried value.
interpolation: Interpolation<T, V>
Interpolation mode.
Implementations§
Trait Implementations§
source§impl<'de, T, V> Deserialize<'de> for Key<T, V>where
T: Deserialize<'de>,
V: Deserialize<'de>,
impl<'de, T, V> Deserialize<'de> for Key<T, V>where
T: Deserialize<'de>,
V: Deserialize<'de>,
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl<T: PartialEq, V: PartialEq> PartialEq for Key<T, V>
impl<T: PartialEq, V: PartialEq> PartialEq for Key<T, V>
impl<T: Copy, V: Copy> Copy for Key<T, V>
impl<T: Eq, V: Eq> Eq for Key<T, V>
impl<T, V> StructuralEq for Key<T, V>
impl<T, V> StructuralPartialEq for Key<T, V>
Auto Trait Implementations§
impl<T, V> RefUnwindSafe for Key<T, V>where
T: RefUnwindSafe,
V: RefUnwindSafe,
impl<T, V> Send for Key<T, V>
impl<T, V> Sync for Key<T, V>
impl<T, V> Unpin for Key<T, V>
impl<T, V> UnwindSafe for Key<T, V>where
T: UnwindSafe,
V: UnwindSafe,
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.