pub type ReadGuard<'a, T> = RwLockReadGuard<'a, RawRwLock, T>;
Expand description
RAII structure used to release the shared read access of a lock when dropped.
Aliased Type§
struct ReadGuard<'a, T> { /* private fields */ }
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...)
attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 8 bytes
Implementations
Source§impl<'a, R, T> RwLockReadGuard<'a, R, T>
impl<'a, R, T> RwLockReadGuard<'a, R, T>
Sourcepub fn rwlock(s: &RwLockReadGuard<'a, R, T>) -> &'a RwLock<R, T>
pub fn rwlock(s: &RwLockReadGuard<'a, R, T>) -> &'a RwLock<R, T>
Returns a reference to the original reader-writer lock object.
Sourcepub fn map<U, F>(
s: RwLockReadGuard<'a, R, T>,
f: F,
) -> MappedRwLockReadGuard<'a, R, U>
pub fn map<U, F>( s: RwLockReadGuard<'a, R, T>, f: F, ) -> MappedRwLockReadGuard<'a, R, U>
Make a new MappedRwLockReadGuard
for a component of the locked data.
This operation cannot fail as the RwLockReadGuard
passed
in already locked the data.
This is an associated function that needs to be
used as RwLockReadGuard::map(...)
. A method would interfere with methods of
the same name on the contents of the locked data.
Sourcepub fn try_map<U, F>(
s: RwLockReadGuard<'a, R, T>,
f: F,
) -> Result<MappedRwLockReadGuard<'a, R, U>, RwLockReadGuard<'a, R, T>>
pub fn try_map<U, F>( s: RwLockReadGuard<'a, R, T>, f: F, ) -> Result<MappedRwLockReadGuard<'a, R, U>, RwLockReadGuard<'a, R, T>>
Attempts to make a new MappedRwLockReadGuard
for a component of the
locked data. Returns the original guard if the closure returns None
.
This operation cannot fail as the RwLockReadGuard
passed
in already locked the data.
This is an associated function that needs to be
used as RwLockReadGuard::try_map(...)
. A method would interfere with methods of
the same name on the contents of the locked data.
Sourcepub fn unlocked<F, U>(s: &mut RwLockReadGuard<'a, R, T>, f: F) -> Uwhere
F: FnOnce() -> U,
pub fn unlocked<F, U>(s: &mut RwLockReadGuard<'a, R, T>, f: F) -> Uwhere
F: FnOnce() -> U,
Temporarily unlocks the RwLock
to execute the given function.
This is safe because &mut
guarantees that there exist no other
references to the data protected by the RwLock
.
Source§impl<'a, R, T> RwLockReadGuard<'a, R, T>where
R: RawRwLockFair + 'a,
T: 'a + ?Sized,
impl<'a, R, T> RwLockReadGuard<'a, R, T>where
R: RawRwLockFair + 'a,
T: 'a + ?Sized,
Sourcepub fn unlock_fair(s: RwLockReadGuard<'a, R, T>)
pub fn unlock_fair(s: RwLockReadGuard<'a, R, T>)
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 RwLockReadGuard
normally.
Sourcepub fn unlocked_fair<F, U>(s: &mut RwLockReadGuard<'a, R, T>, f: F) -> Uwhere
F: FnOnce() -> U,
pub fn unlocked_fair<F, U>(s: &mut RwLockReadGuard<'a, R, T>, f: F) -> Uwhere
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
.
Sourcepub fn bump(s: &mut RwLockReadGuard<'a, R, T>)
pub fn bump(s: &mut RwLockReadGuard<'a, R, T>)
Temporarily yields the RwLock
to a waiting thread if there is one.
This method is functionally equivalent to calling unlock_fair
followed
by read
, however it can be much more efficient in the case where there
are no waiting threads.