txmap 3.1.2

A concurrent transactional hash map for Rust with fine-grained locking, internal mutability and composable transactions
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44

use crate::lock_policies::lock_policy::LockPolicy;
use parking_lot::Mutex;

/// Lock policy using [`parking_lot::Mutex`] for each shard.
///
/// This is the default policy. Both reads and writes acquire an
/// exclusive mutex lock, so there is no read concurrency within a
/// single shard. Use [`RwLockPolicy`](crate::lock_policies::rwlock_policy::RwLockPolicy)
/// when you expect many readers on the same shard.
pub struct MutexPolicy;

impl Default for MutexPolicy {
    fn default() -> Self {
        Self
    }
}

impl LockPolicy for MutexPolicy {
    type Lock<T> = Mutex<T>;

    type ReadGuard<'guard, T>
        = parking_lot::MutexGuard<'guard, T>
    where
        Self: 'guard,
        T: 'guard;

    type WriteGuard<'guard, T>
        = parking_lot::MutexGuard<'guard, T>
    where
        Self: 'guard,
        T: 'guard;

    fn new<T>(value: T) -> Self::Lock<T> {
        Mutex::new(value)
    }

    fn read<'lock, T>(lock: &'lock Self::Lock<T>) -> Self::ReadGuard<'lock, T> {
        lock.lock()
    }

    fn write<'lock, T>(lock: &'lock Self::Lock<T>) -> Self::WriteGuard<'lock, T> {
        lock.lock()
    }
}