Struct lock_api::RwLockWriteGuard
source · [−]Expand description
RAII structure used to release the exclusive write access of a lock when dropped.
Implementations
sourceimpl<'a, R: RawRwLock + 'a, T: ?Sized + 'a> RwLockWriteGuard<'a, R, T>
impl<'a, R: RawRwLock + 'a, T: ?Sized + 'a> RwLockWriteGuard<'a, R, T>
sourcepub fn rwlock(s: &Self) -> &'a RwLock<R, T>
pub fn rwlock(s: &Self) -> &'a RwLock<R, T>
Returns a reference to the original reader-writer lock object.
sourcepub fn map<U: ?Sized, F>(s: Self, f: F) -> MappedRwLockWriteGuard<'a, R, U> where
F: FnOnce(&mut T) -> &mut U,
pub fn map<U: ?Sized, F>(s: Self, f: F) -> MappedRwLockWriteGuard<'a, R, U> where
F: FnOnce(&mut T) -> &mut U,
Make a new MappedRwLockWriteGuard
for a component of the locked data.
This operation cannot fail as the RwLockWriteGuard
passed
in already locked the data.
This is an associated function that needs to be
used as RwLockWriteGuard::map(...)
. A method would interfere with methods of
the same name on the contents of the locked data.
sourcepub fn try_map<U: ?Sized, F>(
s: Self,
f: F
) -> Result<MappedRwLockWriteGuard<'a, R, U>, Self> where
F: FnOnce(&mut T) -> Option<&mut U>,
pub fn try_map<U: ?Sized, F>(
s: Self,
f: F
) -> Result<MappedRwLockWriteGuard<'a, R, U>, Self> where
F: FnOnce(&mut T) -> Option<&mut U>,
Attempts to make a new MappedRwLockWriteGuard
for a component of the
locked data. The original guard is return if the closure returns None
.
This operation cannot fail as the RwLockWriteGuard
passed
in already locked the data.
This is an associated function that needs to be
used as RwLockWriteGuard::map(...)
. A method would interfere with methods of
the same name on the contents of the locked data.
sourceimpl<'a, R: RawRwLockDowngrade + 'a, T: ?Sized + 'a> RwLockWriteGuard<'a, R, T>
impl<'a, R: RawRwLockDowngrade + 'a, T: ?Sized + 'a> RwLockWriteGuard<'a, R, T>
sourcepub fn downgrade(s: Self) -> RwLockReadGuard<'a, R, T>
pub fn downgrade(s: Self) -> RwLockReadGuard<'a, R, T>
Atomically downgrades a write lock into a read lock without allowing any writers to take exclusive access of the lock in the meantime.
Note that if there are any writers currently waiting to take the lock then other readers may not be able to acquire the lock even if it was downgraded.
sourceimpl<'a, R: RawRwLockUpgradeDowngrade + 'a, T: ?Sized + 'a> RwLockWriteGuard<'a, R, T>
impl<'a, R: RawRwLockUpgradeDowngrade + 'a, T: ?Sized + 'a> RwLockWriteGuard<'a, R, T>
sourcepub fn downgrade_to_upgradable(s: Self) -> RwLockUpgradableReadGuard<'a, R, T>
pub fn downgrade_to_upgradable(s: Self) -> RwLockUpgradableReadGuard<'a, R, T>
Atomically downgrades a write lock into an upgradable read lock without allowing any writers to take exclusive access of the lock in the meantime.
Note that if there are any writers currently waiting to take the lock then other readers may not be able to acquire the lock even if it was downgraded.
sourceimpl<'a, R: RawRwLockFair + 'a, T: ?Sized + 'a> RwLockWriteGuard<'a, R, T>
impl<'a, R: RawRwLockFair + 'a, T: ?Sized + 'a> RwLockWriteGuard<'a, R, T>
sourcepub fn unlock_fair(s: Self)
pub fn unlock_fair(s: Self)
Unlocks the RwLock
using a fair unlock protocol.
By default, RwLock
is unfair and allow the current thread to re-lock
the RwLock
before another has the chance to acquire the lock, even if
that thread has been blocked on the RwLock
for a long time. This is
the default because it allows much higher throughput as it avoids
forcing a context switch on every RwLock
unlock. This can result in one
thread acquiring a RwLock
many more times than other threads.
However in some cases it can be beneficial to ensure fairness by forcing
the lock to pass on to a waiting thread if there is one. This is done by
using this method instead of dropping the RwLockWriteGuard
normally.
sourcepub fn unlocked_fair<F, U>(s: &mut Self, f: F) -> U where
F: FnOnce() -> U,
pub fn unlocked_fair<F, U>(s: &mut Self, f: F) -> U where
F: FnOnce() -> U,
Temporarily unlocks the RwLock
to execute the given function.
The RwLock
is unlocked a fair unlock protocol.
This is safe because &mut
guarantees that there exist no other
references to the data protected by the RwLock
.
Trait Implementations
sourceimpl<'a, R: RawRwLock + 'a, T: ?Sized + 'a> Deref for RwLockWriteGuard<'a, R, T>
impl<'a, R: RawRwLock + 'a, T: ?Sized + 'a> Deref for RwLockWriteGuard<'a, R, T>
sourceimpl<'a, R: RawRwLock + 'a, T: ?Sized + 'a> DerefMut for RwLockWriteGuard<'a, R, T>
impl<'a, R: RawRwLock + 'a, T: ?Sized + 'a> DerefMut for RwLockWriteGuard<'a, R, T>
Auto Trait Implementations
impl<'a, R, T> !RefUnwindSafe for RwLockWriteGuard<'a, R, T>
impl<'a, R, T: ?Sized> Send for RwLockWriteGuard<'a, R, T> where
R: Sync,
T: Send + Sync,
<R as RawRwLock>::GuardMarker: Send,
impl<'a, R, T: ?Sized> Sync for RwLockWriteGuard<'a, R, T> where
R: Sync,
T: Send + Sync,
<R as RawRwLock>::GuardMarker: Sync,
impl<'a, R, T: ?Sized> Unpin for RwLockWriteGuard<'a, R, T> where
<R as RawRwLock>::GuardMarker: Unpin,
impl<'a, R, T> !UnwindSafe for RwLockWriteGuard<'a, R, T>
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more