type HttpCacheState = Mutex<HashMap<CacheKey, Arc<(Mutex<HttpCacheEntryState>, Condvar)>>>;
Aliased Type§
struct HttpCacheState { /* private fields */ }
Implementations
Source§impl<T> Mutex<T>
impl<T> Mutex<T>
1.0.0 (const: 1.63.0) · Sourcepub const fn new(t: T) -> Mutex<T>
pub const fn new(t: T) -> Mutex<T>
Creates a new mutex in an unlocked state ready for use.
§Examples
use std::sync::Mutex;
let mutex = Mutex::new(0);
Sourcepub fn get_cloned(&self) -> Result<T, PoisonError<()>>where
T: Clone,
🔬This is a nightly-only experimental API. (lock_value_accessors
)
pub fn get_cloned(&self) -> Result<T, PoisonError<()>>where
T: Clone,
lock_value_accessors
)Returns the contained value by cloning it.
§Errors
If another user of this mutex panicked while holding the mutex, then this call will return an error instead.
§Examples
#![feature(lock_value_accessors)]
use std::sync::Mutex;
let mut mutex = Mutex::new(7);
assert_eq!(mutex.get_cloned().unwrap(), 7);
Sourcepub fn set(&self, value: T) -> Result<(), PoisonError<T>>
🔬This is a nightly-only experimental API. (lock_value_accessors
)
pub fn set(&self, value: T) -> Result<(), PoisonError<T>>
lock_value_accessors
)Sets the contained value.
§Errors
If another user of this mutex panicked while holding the mutex, then
this call will return an error containing the provided value
instead.
§Examples
#![feature(lock_value_accessors)]
use std::sync::Mutex;
let mut mutex = Mutex::new(7);
assert_eq!(mutex.get_cloned().unwrap(), 7);
mutex.set(11).unwrap();
assert_eq!(mutex.get_cloned().unwrap(), 11);
Sourcepub fn replace(&self, value: T) -> Result<T, PoisonError<T>>
🔬This is a nightly-only experimental API. (lock_value_accessors
)
pub fn replace(&self, value: T) -> Result<T, PoisonError<T>>
lock_value_accessors
)Replaces the contained value with value
, and returns the old contained value.
§Errors
If another user of this mutex panicked while holding the mutex, then
this call will return an error containing the provided value
instead.
§Examples
#![feature(lock_value_accessors)]
use std::sync::Mutex;
let mut mutex = Mutex::new(7);
assert_eq!(mutex.replace(11).unwrap(), 7);
assert_eq!(mutex.get_cloned().unwrap(), 11);
Source§impl<T> Mutex<T>where
T: ?Sized,
impl<T> Mutex<T>where
T: ?Sized,
1.0.0 · Sourcepub fn lock(&self) -> Result<MutexGuard<'_, T>, PoisonError<MutexGuard<'_, T>>>
pub fn lock(&self) -> Result<MutexGuard<'_, T>, PoisonError<MutexGuard<'_, T>>>
Acquires a mutex, blocking the current thread until it is able to do so.
This function will block the local thread until it is available to acquire the mutex. Upon returning, the thread is the only thread with the lock held. An RAII guard is returned to allow scoped unlock of the lock. When the guard goes out of scope, the mutex will be unlocked.
The exact behavior on locking a mutex in the thread which already holds the lock is left unspecified. However, this function will not return on the second call (it might panic or deadlock, for example).
§Errors
If another user of this mutex panicked while holding the mutex, then this call will return an error once the mutex is acquired. The acquired mutex guard will be contained in the returned error.
§Panics
This function might panic when called if the lock is already held by the current thread.
§Examples
use std::sync::{Arc, Mutex};
use std::thread;
let mutex = Arc::new(Mutex::new(0));
let c_mutex = Arc::clone(&mutex);
thread::spawn(move || {
*c_mutex.lock().unwrap() = 10;
}).join().expect("thread::spawn failed");
assert_eq!(*mutex.lock().unwrap(), 10);
1.0.0 · Sourcepub fn try_lock(
&self,
) -> Result<MutexGuard<'_, T>, TryLockError<MutexGuard<'_, T>>>
pub fn try_lock( &self, ) -> Result<MutexGuard<'_, T>, TryLockError<MutexGuard<'_, T>>>
Attempts to acquire this lock.
If the lock could not be acquired at this time, then Err
is returned.
Otherwise, an RAII guard is returned. The lock will be unlocked when the
guard is dropped.
This function does not block.
§Errors
If another user of this mutex panicked while holding the mutex, then
this call will return the Poisoned
error if the mutex would
otherwise be acquired. An acquired lock guard will be contained
in the returned error.
If the mutex could not be acquired because it is already locked, then
this call will return the WouldBlock
error.
§Examples
use std::sync::{Arc, Mutex};
use std::thread;
let mutex = Arc::new(Mutex::new(0));
let c_mutex = Arc::clone(&mutex);
thread::spawn(move || {
let mut lock = c_mutex.try_lock();
if let Ok(ref mut mutex) = lock {
**mutex = 10;
} else {
println!("try_lock failed");
}
}).join().expect("thread::spawn failed");
assert_eq!(*mutex.lock().unwrap(), 10);
1.2.0 · Sourcepub fn is_poisoned(&self) -> bool
pub fn is_poisoned(&self) -> bool
Determines whether the mutex is poisoned.
If another thread is active, the mutex can still become poisoned at any
time. You should not trust a false
value for program correctness
without additional synchronization.
§Examples
use std::sync::{Arc, Mutex};
use std::thread;
let mutex = Arc::new(Mutex::new(0));
let c_mutex = Arc::clone(&mutex);
let _ = thread::spawn(move || {
let _lock = c_mutex.lock().unwrap();
panic!(); // the mutex gets poisoned
}).join();
assert_eq!(mutex.is_poisoned(), true);
1.77.0 · Sourcepub fn clear_poison(&self)
pub fn clear_poison(&self)
Clear the poisoned state from a mutex.
If the mutex is poisoned, it will remain poisoned until this function is called. This allows recovering from a poisoned state and marking that it has recovered. For example, if the value is overwritten by a known-good value, then the mutex can be marked as un-poisoned. Or possibly, the value could be inspected to determine if it is in a consistent state, and if so the poison is removed.
§Examples
use std::sync::{Arc, Mutex};
use std::thread;
let mutex = Arc::new(Mutex::new(0));
let c_mutex = Arc::clone(&mutex);
let _ = thread::spawn(move || {
let _lock = c_mutex.lock().unwrap();
panic!(); // the mutex gets poisoned
}).join();
assert_eq!(mutex.is_poisoned(), true);
let x = mutex.lock().unwrap_or_else(|mut e| {
**e.get_mut() = 1;
mutex.clear_poison();
e.into_inner()
});
assert_eq!(mutex.is_poisoned(), false);
assert_eq!(*x, 1);
1.6.0 · Sourcepub fn into_inner(self) -> Result<T, PoisonError<T>>
pub fn into_inner(self) -> Result<T, PoisonError<T>>
Consumes this mutex, returning the underlying data.
§Errors
If another user of this mutex panicked while holding the mutex, then this call will return an error containing the the underlying data instead.
§Examples
use std::sync::Mutex;
let mutex = Mutex::new(0);
assert_eq!(mutex.into_inner().unwrap(), 0);
1.6.0 · Sourcepub fn get_mut(&mut self) -> Result<&mut T, PoisonError<&mut T>>
pub fn get_mut(&mut self) -> Result<&mut T, PoisonError<&mut T>>
Returns a mutable reference to the underlying data.
Since this call borrows the Mutex
mutably, no actual locking needs to
take place – the mutable borrow statically guarantees no locks exist.
§Errors
If another user of this mutex panicked while holding the mutex, then this call will return an error containing a mutable reference to the underlying data instead.
§Examples
use std::sync::Mutex;
let mut mutex = Mutex::new(0);
*mutex.get_mut().unwrap() = 10;
assert_eq!(*mutex.lock().unwrap(), 10);
Trait Implementations
Source§impl<C> ClockSequence for Mutex<C>where
C: ClockSequence + RefUnwindSafe,
impl<C> ClockSequence for Mutex<C>where
C: ClockSequence + RefUnwindSafe,
Source§type Output = <C as ClockSequence>::Output
type Output = <C as ClockSequence>::Output
Source§fn generate_sequence(
&self,
seconds: u64,
subsec_nanos: u32,
) -> <Mutex<C> as ClockSequence>::Output
fn generate_sequence( &self, seconds: u64, subsec_nanos: u32, ) -> <Mutex<C> as ClockSequence>::Output
Source§fn generate_timestamp_sequence(
&self,
seconds: u64,
subsec_nanos: u32,
) -> (<Mutex<C> as ClockSequence>::Output, u64, u32)
fn generate_timestamp_sequence( &self, seconds: u64, subsec_nanos: u32, ) -> (<Mutex<C> as ClockSequence>::Output, u64, u32)
Source§fn usable_bits(&self) -> usize
fn usable_bits(&self) -> usize
ClockSequence::generate_sequence
or ClockSequence::generate_timestamp_sequence
. Read moreSource§impl<'de, T> Deserialize<'de> for Mutex<T>where
T: Deserialize<'de>,
impl<'de, T> Deserialize<'de> for Mutex<T>where
T: Deserialize<'de>,
Source§fn deserialize<D>(
deserializer: D,
) -> Result<Mutex<T>, <D as Deserializer<'de>>::Error>where
D: Deserializer<'de>,
fn deserialize<D>(
deserializer: D,
) -> Result<Mutex<T>, <D as Deserializer<'de>>::Error>where
D: Deserializer<'de>,
1.24.0 · Source§impl<T> From<T> for Mutex<T>
impl<T> From<T> for Mutex<T>
Source§fn from(t: T) -> Mutex<T>
fn from(t: T) -> Mutex<T>
Creates a new mutex in an unlocked state ready for use.
This is equivalent to Mutex::new
.
Source§impl<T> MallocSizeOf for Mutex<T>where
T: MallocSizeOf,
If a mutex is stored directly as a member of a data type that is being measured,
it is the unique owner of its contents and deserves to be measured.
impl<T> MallocSizeOf for Mutex<T>where
T: MallocSizeOf,
If a mutex is stored directly as a member of a data type that is being measured, it is the unique owner of its contents and deserves to be measured.
If a mutex is stored inside of an Arc value as a member of a data type that is being measured, the Arc will not be automatically measured so there is no risk of overcounting the mutex’s contents.
Source§fn size_of(&self, ops: &mut MallocSizeOfOps) -> usize
fn size_of(&self, ops: &mut MallocSizeOfOps) -> usize
Source§impl<T> MallocSizeOf for Mutex<T>where
T: MallocSizeOf,
If a mutex is stored directly as a member of a data type that is being measured,
it is the unique owner of its contents and deserves to be measured.
impl<T> MallocSizeOf for Mutex<T>where
T: MallocSizeOf,
If a mutex is stored directly as a member of a data type that is being measured, it is the unique owner of its contents and deserves to be measured.
If a mutex is stored inside of an Arc value as a member of a data type that is being measured, the Arc will not be automatically measured so there is no risk of overcounting the mutex’s contents.