pub struct ReentrantLock<T>where
T: ?Sized,{ /* private fields */ }
reentrant_lock
)std
only.Expand description
A re-entrant mutual exclusion lock
This lock will block other threads waiting for the lock to become available. The thread which has already locked the mutex can lock it multiple times without blocking, preventing a common source of deadlocks.
ยงExamples
Allow recursively calling a function needing synchronization from within
a callback (this is how StdoutLock
is currently
implemented):
#![feature(reentrant_lock)]
use std::cell::RefCell;
use std::sync::ReentrantLock;
pub struct Log {
data: RefCell<String>,
}
impl Log {
pub fn append(&self, msg: &str) {
self.data.borrow_mut().push_str(msg);
}
}
static LOG: ReentrantLock<Log> = ReentrantLock::new(Log { data: RefCell::new(String::new()) });
pub fn with_log<R>(f: impl FnOnce(&Log) -> R) -> R {
let log = LOG.lock();
f(&*log)
}
with_log(|log| {
log.append("Hello");
with_log(|log| log.append(" there!"));
});
Implementationsยง
Sourceยงimpl<T> ReentrantLock<T>
impl<T> ReentrantLock<T>
Sourcepub const fn new(t: T) -> ReentrantLock<T>
๐ฌThis is a nightly-only experimental API. (reentrant_lock
)
pub const fn new(t: T) -> ReentrantLock<T>
reentrant_lock
)Creates a new re-entrant lock in an unlocked state ready for use.
ยงExamples
#![feature(reentrant_lock)]
use std::sync::ReentrantLock;
let lock = ReentrantLock::new(0);
Sourcepub fn into_inner(self) -> T
๐ฌThis is a nightly-only experimental API. (reentrant_lock
)
pub fn into_inner(self) -> T
reentrant_lock
)Consumes this lock, returning the underlying data.
ยงExamples
#![feature(reentrant_lock)]
use std::sync::ReentrantLock;
let lock = ReentrantLock::new(0);
assert_eq!(lock.into_inner(), 0);
Sourceยงimpl<T> ReentrantLock<T>where
T: ?Sized,
impl<T> ReentrantLock<T>where
T: ?Sized,
Sourcepub fn lock(&self) -> ReentrantLockGuard<'_, T>
๐ฌThis is a nightly-only experimental API. (reentrant_lock
)
pub fn lock(&self) -> ReentrantLockGuard<'_, T>
reentrant_lock
)Acquires the lock, blocking the current thread until it is able to do so.
This function will block the caller until it is available to acquire the lock. Upon returning, the thread is the only thread with the lock held. When the thread calling this method already holds the lock, the call succeeds without blocking.
ยงExamples
#![feature(reentrant_lock)]
use std::cell::Cell;
use std::sync::{Arc, ReentrantLock};
use std::thread;
let lock = Arc::new(ReentrantLock::new(Cell::new(0)));
let c_lock = Arc::clone(&lock);
thread::spawn(move || {
c_lock.lock().set(10);
}).join().expect("thread::spawn failed");
assert_eq!(lock.lock().get(), 10);
Sourcepub fn get_mut(&mut self) -> &mut T
๐ฌThis is a nightly-only experimental API. (reentrant_lock
)
pub fn get_mut(&mut self) -> &mut T
reentrant_lock
)Returns a mutable reference to the underlying data.
Since this call borrows the ReentrantLock
mutably, no actual locking
needs to take place โ the mutable borrow statically guarantees no locks
exist.
ยงExamples
#![feature(reentrant_lock)]
use std::sync::ReentrantLock;
let mut lock = ReentrantLock::new(0);
*lock.get_mut() = 10;
assert_eq!(*lock.lock(), 10);
Trait Implementationsยง
Sourceยงimpl<T> Debug for ReentrantLock<T>
impl<T> Debug for ReentrantLock<T>
Sourceยงimpl<T> Default for ReentrantLock<T>where
T: Default,
impl<T> Default for ReentrantLock<T>where
T: Default,
Sourceยงfn default() -> ReentrantLock<T>
fn default() -> ReentrantLock<T>
Sourceยงimpl<T> From<T> for ReentrantLock<T>
impl<T> From<T> for ReentrantLock<T>
Sourceยงfn from(t: T) -> ReentrantLock<T>
fn from(t: T) -> ReentrantLock<T>
impl<T> RefUnwindSafe for ReentrantLock<T>where
T: RefUnwindSafe + ?Sized,
impl<T> Send for ReentrantLock<T>
impl<T> Sync for ReentrantLock<T>
impl<T> UnwindSafe for ReentrantLock<T>where
T: UnwindSafe + ?Sized,
Auto Trait Implementationsยง
impl<T> !Freeze for ReentrantLock<T>
impl<T> Unpin for ReentrantLock<T>
Blanket Implementationsยง
ยงimpl<T> ArchivePointee for T
impl<T> ArchivePointee for T
ยงtype ArchivedMetadata = ()
type ArchivedMetadata = ()
ยงfn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
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> ByteSized for T
impl<T> ByteSized for T
Sourceยงconst BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
Sourceยงfn byte_align(&self) -> usize โ
fn byte_align(&self) -> usize โ
Sourceยงfn ptr_size_ratio(&self) -> [usize; 2]
fn ptr_size_ratio(&self) -> [usize; 2]
Sourceยงimpl<T, R> Chain<R> for Twhere
T: ?Sized,
impl<T, R> Chain<R> for Twhere
T: ?Sized,
Sourceยงimpl<T> ExtAny for T
impl<T> ExtAny for T
Sourceยงfn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
Sourceยงimpl<T> ExtMem for Twhere
T: ?Sized,
impl<T> ExtMem for Twhere
T: ?Sized,
Sourceยงconst NEEDS_DROP: bool = _
const NEEDS_DROP: bool = _
Sourceยงfn mem_align_of<T>() -> usize โ
fn mem_align_of<T>() -> usize โ
Sourceยงfn mem_align_of_val(&self) -> usize โ
fn mem_align_of_val(&self) -> usize โ
Sourceยงfn mem_size_of_val(&self) -> usize โ
fn mem_size_of_val(&self) -> usize โ
Sourceยงfn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
true
if dropping values of this type matters. Read moreSourceยงfn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
self
without running its destructor. Read moreSourceยงfn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
Sourceยงunsafe fn mem_zeroed<T>() -> T
unsafe fn mem_zeroed<T>() -> T
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSourceยงunsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSourceยงfn mem_as_bytes(&self) -> &[u8] โ
fn mem_as_bytes(&self) -> &[u8] โ
unsafe_slice
only.ยงimpl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
Sourceยงimpl<T> Hook for T
impl<T> Hook for T
ยงimpl<T> Instrument for T
impl<T> Instrument for T
ยงfn instrument(self, span: Span) -> Instrumented<Self> โ
fn instrument(self, span: Span) -> Instrumented<Self> โ
ยงfn in_current_span(self) -> Instrumented<Self> โ
fn in_current_span(self) -> Instrumented<Self> โ
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 moreยงimpl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
ยงimpl<T> LayoutRaw for T
impl<T> LayoutRaw for T
ยงfn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> โ
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> โ
ยงimpl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
ยงunsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
ยงfn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out
indicating that a T
is niched.