From 85dd2106bdc3476c0eb73c97f2f4b338a3486749 Mon Sep 17 00:00:00 2001 From: Botahamec Date: Fri, 20 Dec 2024 18:28:08 -0500 Subject: Fix clippy issues --- src/collection.rs | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) (limited to 'src/collection.rs') diff --git a/src/collection.rs b/src/collection.rs index 9e88062..a8ae0b7 100644 --- a/src/collection.rs +++ b/src/collection.rs @@ -52,11 +52,11 @@ pub struct OwnedLockCollection { /// /// [`Lockable`]: `crate::lockable::Lockable` /// [`OwnedLockable`]: `crate::lockable::OwnedLockable` - +// // This type was born when I eventually realized that I needed a self // referential structure. That used boxing, so I elected to make a more // efficient implementation (polonius please save us) - +// // This type caches the sorting order of the locks and the fact that it doesn't // contain any duplicates. pub struct RefLockCollection<'a, L> { @@ -82,7 +82,7 @@ pub struct RefLockCollection<'a, L> { /// /// [`Lockable`]: `crate::lockable::Lockable` /// [`OwnedLockable`]: `crate::lockable::OwnedLockable` - +// // This type caches the sorting order of the locks and the fact that it doesn't // contain any duplicates. pub struct BoxedLockCollection { @@ -112,7 +112,7 @@ pub struct BoxedLockCollection { /// [`Lockable`]: `crate::lockable::Lockable` /// [`OwnedLockable`]: `crate::lockable::OwnedLockable` /// [livelocking]: https://en.wikipedia.org/wiki/Deadlock#Livelock - +// // This type caches the fact that there are no duplicates #[derive(Debug)] pub struct RetryingLockCollection { -- cgit v1.2.3