Merge pull request #102 from phaazon/release/4.3.1

Prepare v4.3.1.

CHANGELOG.md

@@ -1,6 +1,8 @@
 # Changelog
 
-* [4.1.2](#412)
+* [4.3.1](#431)
+* [4.3](#43)
+* [4.2](#42)
 * [4.1.1](#411)
 * [4.1](#41)
 * [4.0.3](#403)
@@ -41,7 +43,20 @@
 * [0.1.1](#011)
 * [0.1](#01)
 
-# 4.2.0
+# 4.3.1
+
+> Nov 22, 2023
+
+- Add `Default` implementation for `Spline`. [c6ba847](https://github.com/phaazon/splines/commit/c6ba847)
+
+# 4.3
+
+> Sep 23, 2023
+
+- Add support for `glam-0.23` and `glam-0.24`. [cdc48a4](https://github.com/phaazon/splines/commit/cdc48a4)
+- Add `Spline::clear` to clear a spline keys without deallocating its internal storage. [eca09f1](https://github.com/phaazon/splines/commit/eca09f1)
+
+# 4.2
 
 > Feb 1, 2023
 

Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "splines"
-version = "4.2.0"
+version = "4.3.1"
 license = "BSD-3-Clause"
 authors = ["Dimitri Sabadie <dimitri.sabadie@gmail.com>"]
 description = "Spline interpolation made easy"
@@ -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 }
 

rustfmt.toml

@@ -1,6 +1,6 @@
 edition = "2018"
 
-fn_args_layout = "Tall"
+fn_params_layout = "Tall"
 force_explicit_abi = true
 hard_tabs = false
 max_width = 100

src/spline.rs

@@ -27,7 +27,7 @@ use std::cmp::Ordering;
 ///     for the required interpolation mode, you get `None`.
 ///   - [`Spline::clamped_sample`]: behaves like [`Spline::sample`] but will return either the first
 ///     or last key if out of bound; it will return `None` if not enough key.
-#[derive(Debug, Clone)]
+#[derive(Debug, Clone, Default)]
 #[cfg_attr(
   any(feature = "serialization", feature = "serde"),
   derive(Deserialize, Serialize)
@@ -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.
   ///