Compare commits
4 Commits
4.2
...
EmbarkStud
Author | SHA1 | Date | |
---|---|---|---|
da43539b70 | |||
eca09f1baf | |||
e1b78070c6 | |||
cdc48a49a7 |
@ -23,7 +23,7 @@ std = []
|
||||
|
||||
[dependencies]
|
||||
cgmath = { version = ">=0.17, <0.19", optional = true }
|
||||
glam = { version = ">=0.10, <0.23", optional = true }
|
||||
glam = { version = ">=0.10, <0.25", optional = true }
|
||||
nalgebra = { version = ">=0.21, <0.33", optional = true }
|
||||
serde = { version = "1", features = ["derive"], optional = true }
|
||||
|
||||
|
@ -56,6 +56,13 @@ impl<T, V> Spline<T, V> {
|
||||
spline
|
||||
}
|
||||
|
||||
/// Clear the spline by removing all keys. Keeps the underlying allocated storage, so adding
|
||||
/// new keys should be faster than creating a new [`Spline`]
|
||||
#[inline]
|
||||
pub fn clear(&mut self) {
|
||||
self.0.clear()
|
||||
}
|
||||
|
||||
/// Create a new spline by consuming an `Iterater<Item = Key<T>>`. They keys don’t have to be
|
||||
/// sorted.
|
||||
///
|
||||
|
Reference in New Issue
Block a user