diff --git a/README.md b/README.md
index d3aa8f4..4b26904 100644
--- a/README.md
+++ b/README.md
@@ -225,3 +225,4 @@ topic area:
 [`continuous`]: https://en.wikipedia.org/wiki/List_of_continuity-related_mathematical_topics
 [`interval-mathematics`]: https://en.wikipedia.org/wiki/Interval_(mathematics)
 [`actual infinity`]: https://en.wikipedia.org/wiki/Actual_infinity
+[`finite`]: https://en.wiktionary.org/wiki/finite#Adjective
diff --git a/src/lib.rs b/src/lib.rs
index dae2baf..58b012a 100644
--- a/src/lib.rs
+++ b/src/lib.rs
@@ -233,6 +233,7 @@ along with range_bounds_map. If not, see <https://www.gnu.org/licenses/>.
 //! [`continuous`]: https://en.wikipedia.org/wiki/List_of_continuity-related_mathematical_topics
 //! [`interval-mathematics`]: https://en.wikipedia.org/wiki/Interval_(mathematics)
 //! [`actual infinity`]: https://en.wikipedia.org/wiki/Actual_infinity
+//! [`finite`]: https://en.wiktionary.org/wiki/finite#Adjective
 
 #![feature(let_chains)]
 #![feature(btree_cursors)]
diff --git a/src/range_bounds_map.rs b/src/range_bounds_map.rs
index 1891b37..9a7dae7 100644
--- a/src/range_bounds_map.rs
+++ b/src/range_bounds_map.rs
@@ -29,8 +29,8 @@ use serde::de::{MapAccess, Visitor};
 use serde::ser::SerializeMap;
 use serde::{Deserialize, Deserializer, Serialize, Serializer};
 
-use crate::discrete_finite_bounds::DiscreteFiniteBounds;
 use crate::discrete_finite::DiscreteFinite;
+use crate::discrete_finite_bounds::DiscreteFiniteBounds;
 use crate::utils::{cmp_point_with_range, cut_range, is_valid_range, overlaps};
 
 /// An ordered map of non-overlapping ranges based on [`BTreeMap`].
@@ -135,8 +135,8 @@ pub struct RangeBoundsMap<I, K, V> {
 	phantom: PhantomData<I>,
 }
 
-/// An error type to represent a [`RangeBounds`] overlapping another
-/// [`RangeBounds`] when it should not have.
+/// An error type to represent a range overlapping another range when
+/// it should not have.
 #[derive(PartialEq, Debug)]
 pub struct OverlapError;
 
@@ -585,7 +585,10 @@ where
 	/// );
 	/// assert_eq!(base, after_cut);
 	/// ```
-	pub fn cut<'a, Q>(&'a mut self, range: Q) -> impl Iterator<Item = (DiscreteFiniteBounds<I>, V)> + '_
+	pub fn cut<'a, Q>(
+		&'a mut self,
+		range: Q,
+	) -> impl Iterator<Item = (DiscreteFiniteBounds<I>, V)> + '_
 	where
 		Q: FiniteRange<I> + Copy + 'a,
 		K: From<DiscreteFiniteBounds<I>>,
@@ -738,7 +741,10 @@ where
 	/// 	]
 	/// );
 	/// ```
-	pub fn gaps<Q>(&self, outer_range: Q) -> impl DoubleEndedIterator<Item = DiscreteFiniteBounds<I>>
+	pub fn gaps<Q>(
+		&self,
+		outer_range: Q,
+	) -> impl DoubleEndedIterator<Item = DiscreteFiniteBounds<I>>
 	where
 		Q: FiniteRange<I> + Copy,
 	{
@@ -2179,7 +2185,8 @@ mod tests {
 
 	// Test Helper Functions
 	//======================
-	fn all_non_overlapping_test_bound_entries() -> Vec<(DiscreteFiniteBounds<i8>, DiscreteFiniteBounds<i8>)> {
+	fn all_non_overlapping_test_bound_entries(
+	) -> Vec<(DiscreteFiniteBounds<i8>, DiscreteFiniteBounds<i8>)> {
 		let mut output = Vec::new();
 		for test_bounds1 in all_valid_test_bounds() {
 			for test_bounds2 in all_valid_test_bounds() {