From 11a92751fed3ed04f392730da327d6e0f06a18c3 Mon Sep 17 00:00:00 2001
From: DeflateAwning <11021263+DeflateAwning@users.noreply.github.com>
Date: Wed, 8 Apr 2026 15:47:10 -0600
Subject: [PATCH 1/3] fix: Clippy suggestion

---
 bounded-collections/src/bounded_btree_map.rs | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/bounded-collections/src/bounded_btree_map.rs b/bounded-collections/src/bounded_btree_map.rs
index 248d72e3..319e5836 100644
--- a/bounded-collections/src/bounded_btree_map.rs
+++ b/bounded-collections/src/bounded_btree_map.rs
@@ -243,7 +243,7 @@ where
 		Ok(BoundedBTreeMap::<K, T, S>::unchecked_from(
 			self.0
 				.into_iter()
-				.map(|(k, v)| (f((&k, v)).map(|t| (k, t))))
+				.map(|(k, v)| f((&k, v)).map(|t| (k, t)))
 				.collect::<Result<BTreeMap<_, _>, _>>()?,
 		))
 	}

From 19cad2a64a1348d64a85b68c5fe83a96392d36b5 Mon Sep 17 00:00:00 2001
From: DeflateAwning <11021263+DeflateAwning@users.noreply.github.com>
Date: Wed, 8 Apr 2026 15:47:26 -0600
Subject: [PATCH 2/3] fix: Clippy suggestion in uint

---
 uint/tests/uint_tests.rs | 1 -
 1 file changed, 1 deletion(-)

diff --git a/uint/tests/uint_tests.rs b/uint/tests/uint_tests.rs
index 5a89bcae..f9ffb013 100644
--- a/uint/tests/uint_tests.rs
+++ b/uint/tests/uint_tests.rs
@@ -7,7 +7,6 @@
 // except according to those terms.
 
 use core::{convert::TryInto, str::FromStr, u64::MAX};
-use crunchy::unroll;
 use uint::{construct_uint, overflowing, FromDecStrErr};
 
 construct_uint! {

From 5a12ded0cd96a79e87e106f316d0f6bb99119718 Mon Sep 17 00:00:00 2001
From: DeflateAwning <11021263+DeflateAwning@users.noreply.github.com>
Date: Wed, 8 Apr 2026 15:51:57 -0600
Subject: [PATCH 3/3] fix: Clippy suggestion in macro usage for div_ceil

---
 uint/src/uint.rs | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/uint/src/uint.rs b/uint/src/uint.rs
index 3482aa6d..96f0e7ca 100644
--- a/uint/src/uint.rs
+++ b/uint/src/uint.rs
@@ -938,10 +938,10 @@ macro_rules! construct_uint {
 				(q, remainder)
 			}
 
-			// Returns the least number of words needed to represent the nonzero number
+			/// Returns the least number of words needed to represent a number with width `bits`.
 			fn words(bits: usize) -> usize {
 				debug_assert!(bits > 0);
-				1 + (bits - 1) / Self::WORD_BITS
+				bits.div_ceil(Self::WORD_BITS)
 			}
 
 			/// Returns a pair `(self / other, self % other)`.