diff options
| author | Botahamec <botahamec@outlook.com> | 2024-12-20 18:28:08 -0500 |
|---|---|---|
| committer | Botahamec <botahamec@outlook.com> | 2024-12-20 18:28:08 -0500 |
| commit | 85dd2106bdc3476c0eb73c97f2f4b338a3486749 (patch) | |
| tree | 096e5fd71a67949bbf45a0e79f2357d64acb96d6 /src/collection.rs | |
| parent | 6514ffc5b33962c98fe9ce8f123edca6c57668d8 (diff) | |
Fix clippy issues
Diffstat (limited to 'src/collection.rs')
| -rw-r--r-- | src/collection.rs | 8 |
1 files changed, 4 insertions, 4 deletions
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<L> { /// /// [`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<L> { @@ -112,7 +112,7 @@ pub struct BoxedLockCollection<L> { /// [`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<L> { |