pub struct ReentrantMutexGuard<'a, R, G, T>{ /* private fields */ }Expand description
An RAII implementation of a “scoped lock” of a reentrant mutex. When this structure is dropped (falls out of scope), the lock will be unlocked.
The data protected by the mutex can be accessed through this guard via its
Deref implementation.
Implementations§
Source§impl<'a, R, G, T> ReentrantMutexGuard<'a, R, G, T>
impl<'a, R, G, T> ReentrantMutexGuard<'a, R, G, T>
Sourcepub fn remutex(
s: &ReentrantMutexGuard<'a, R, G, T>,
) -> &'a ReentrantMutex<R, G, T>
pub fn remutex( s: &ReentrantMutexGuard<'a, R, G, T>, ) -> &'a ReentrantMutex<R, G, T>
Returns a reference to the original ReentrantMutex object.
Sourcepub fn map<U, F>(
s: ReentrantMutexGuard<'a, R, G, T>,
f: F,
) -> MappedReentrantMutexGuard<'a, R, G, U>
pub fn map<U, F>( s: ReentrantMutexGuard<'a, R, G, T>, f: F, ) -> MappedReentrantMutexGuard<'a, R, G, U>
Makes a new MappedReentrantMutexGuard for a component of the locked data.
This operation cannot fail as the ReentrantMutexGuard passed
in already locked the mutex.
This is an associated function that needs to be
used as ReentrantMutexGuard::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: ReentrantMutexGuard<'a, R, G, T>,
f: F,
) -> Result<MappedReentrantMutexGuard<'a, R, G, U>, ReentrantMutexGuard<'a, R, G, T>>
pub fn try_map<U, F>( s: ReentrantMutexGuard<'a, R, G, T>, f: F, ) -> Result<MappedReentrantMutexGuard<'a, R, G, U>, ReentrantMutexGuard<'a, R, G, T>>
Attempts to make a new MappedReentrantMutexGuard for a component of the
locked data. The original guard is return if the closure returns None.
This operation cannot fail as the ReentrantMutexGuard passed
in already locked the mutex.
This is an associated function that needs to be
used as ReentrantMutexGuard::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 ReentrantMutexGuard<'a, R, G, T>, f: F) -> Uwhere
F: FnOnce() -> U,
pub fn unlocked<F, U>(s: &mut ReentrantMutexGuard<'a, R, G, T>, f: F) -> Uwhere
F: FnOnce() -> U,
Temporarily unlocks the mutex to execute the given function.
This is safe because &mut guarantees that there exist no other
references to the data protected by the mutex.
Source§impl<'a, R, G, T> ReentrantMutexGuard<'a, R, G, T>
impl<'a, R, G, T> ReentrantMutexGuard<'a, R, G, T>
Sourcepub fn unlock_fair(s: ReentrantMutexGuard<'a, R, G, T>)
pub fn unlock_fair(s: ReentrantMutexGuard<'a, R, G, T>)
Unlocks the mutex using a fair unlock protocol.
By default, mutexes are unfair and allow the current thread to re-lock the mutex before another has the chance to acquire the lock, even if that thread has been blocked on the mutex for a long time. This is the default because it allows much higher throughput as it avoids forcing a context switch on every mutex unlock. This can result in one thread acquiring a mutex 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 ReentrantMutexGuard normally.
Sourcepub fn unlocked_fair<F, U>(s: &mut ReentrantMutexGuard<'a, R, G, T>, f: F) -> Uwhere
F: FnOnce() -> U,
pub fn unlocked_fair<F, U>(s: &mut ReentrantMutexGuard<'a, R, G, T>, f: F) -> Uwhere
F: FnOnce() -> U,
Temporarily unlocks the mutex to execute the given function.
The mutex is unlocked a fair unlock protocol.
This is safe because &mut guarantees that there exist no other
references to the data protected by the mutex.
Sourcepub fn bump(s: &mut ReentrantMutexGuard<'a, R, G, T>)
pub fn bump(s: &mut ReentrantMutexGuard<'a, R, G, T>)
Temporarily yields the mutex to a waiting thread if there is one.
This method is functionally equivalent to calling unlock_fair followed
by lock, however it can be much more efficient in the case where there
are no waiting threads.
Trait Implementations§
Source§impl<'a, R, G, T> Debug for ReentrantMutexGuard<'a, R, G, T>
impl<'a, R, G, T> Debug for ReentrantMutexGuard<'a, R, G, T>
Source§impl<'a, R, G, T> Display for ReentrantMutexGuard<'a, R, G, T>
impl<'a, R, G, T> Display for ReentrantMutexGuard<'a, R, G, T>
Source§impl<'a, R, G, T> Drop for ReentrantMutexGuard<'a, R, G, T>
impl<'a, R, G, T> Drop for ReentrantMutexGuard<'a, R, G, T>
Source§impl<'a, R, G, T> Deref for ReentrantMutexGuard<'a, R, G, T>
impl<'a, R, G, T> Deref for ReentrantMutexGuard<'a, R, G, T>
impl<'a, R, G, T> Sync for ReentrantMutexGuard<'a, R, G, T>
Auto Trait Implementations§
impl<'a, R, G, T> Freeze for ReentrantMutexGuard<'a, R, G, T>where
T: ?Sized,
impl<'a, R, G, T> !RefUnwindSafe for ReentrantMutexGuard<'a, R, G, T>
impl<'a, R, G, T> !Send for ReentrantMutexGuard<'a, R, G, T>
impl<'a, R, G, T> Unpin for ReentrantMutexGuard<'a, R, G, T>where
T: ?Sized,
impl<'a, R, G, T> !UnwindSafe for ReentrantMutexGuard<'a, R, G, T>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Any. Could be used to downcast a trait object
to a particular type.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Any. Could be used to downcast a trait object
to a particular type.fn into_any(self: Box<T>) -> Box<dyn Any>
Source§impl<T> FieldValue for Twhere
T: 'static,
impl<T> FieldValue for Twhere
T: 'static,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.