diff options
| author | Mica White <botahamec@outlook.com> | 2026-02-07 10:45:11 -0500 |
|---|---|---|
| committer | Mica White <botahamec@outlook.com> | 2026-02-07 10:45:11 -0500 |
| commit | 2096d0c6819ce0e8f6c6e77e36ebc495924dad63 (patch) | |
| tree | fcee36a7aa3e3d77a8d57d1585d6ee095b4ff676 /src/collection.rs | |
| parent | 9d928375ffc365d9ae4f4bc9be4a3c08fae47387 (diff) | |
Rename data to child
Diffstat (limited to 'src/collection.rs')
| -rwxr-xr-x | src/collection.rs | 9 |
1 files changed, 4 insertions, 5 deletions
diff --git a/src/collection.rs b/src/collection.rs index 9c04fbb..c97bbd2 100755 --- a/src/collection.rs +++ b/src/collection.rs @@ -29,8 +29,7 @@ pub(crate) mod utils; // collection exist #[derive(Debug)] pub struct OwnedLockCollection<L> { - // TODO: rename to child - data: L, + child: L, } /// Locks a reference to a collection of locks, by sorting them by memory @@ -59,7 +58,7 @@ pub struct OwnedLockCollection<L> { // This type caches the sorting order of the locks and the fact that it doesn't // contain any duplicates. pub struct RefLockCollection<'a, L> { - data: &'a L, + child: &'a L, locks: Vec<&'a dyn RawLock>, } @@ -85,7 +84,7 @@ pub struct RefLockCollection<'a, L> { // This type caches the sorting order of the locks and the fact that it doesn't // contain any duplicates. pub struct BoxedLockCollection<L> { - data: *const UnsafeCell<L>, + child: *const UnsafeCell<L>, locks: Vec<&'static dyn RawLock>, } @@ -112,7 +111,7 @@ pub struct BoxedLockCollection<L> { // This type caches the fact that there are no duplicates #[derive(Debug)] pub struct RetryingLockCollection<L> { - data: L, + child: L, } /// A RAII guard for a generic [`Lockable`] type. When this structure is |
