dashmap 2.1.0

Blazing fast concurrent HashMap for Rust.
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131

use crate::interface::{tt_rl_exclusive, tt_rl_shared, BorrowStatus};
use std::cell::RefCell;
use std::collections::HashMap;
use std::hash::Hash;
use std::ops::{Deref, DerefMut};

pub struct RefInterface<'a, K: Eq + Hash, V> {
    hash: u64,
    borrows: &'a RefCell<HashMap<u64, BorrowStatus>>,
    k: &'a K,
    v: &'a V,
}

impl<'a, K: Eq + Hash, V> Drop for RefInterface<'a, K, V> {
    #[inline]
    fn drop(&mut self) {
        tt_rl_shared(self.borrows, self.hash);
    }
}

impl<'a, K: Eq + Hash, V> RefInterface<'a, K, V> {
    #[inline(always)]
    pub(crate) fn new(
        hash: u64,
        borrows: &'a RefCell<HashMap<u64, BorrowStatus>>,
        k: &'a K,
        v: &'a V,
    ) -> Self {
        Self {
            hash,
            borrows,
            k,
            v,
        }
    }

    #[inline(always)]
    pub fn key(&self) -> &K {
        self.k
    }

    #[inline(always)]
    pub fn value(&self) -> &V {
        self.v
    }

    #[inline(always)]
    pub fn pair(&self) -> (&K, &V) {
        (self.k, self.v)
    }
}

impl<'a, K: Eq + Hash, V> Deref for RefInterface<'a, K, V> {
    type Target = V;

    #[inline(always)]
    fn deref(&self) -> &V {
        self.value()
    }
}

pub struct RefMutInterface<'a, K: Eq + Hash, V> {
    hash: u64,
    borrows: &'a RefCell<HashMap<u64, BorrowStatus>>,
    k: &'a K,
    v: &'a mut V,
}

impl<'a, K: Eq + Hash, V> Drop for RefMutInterface<'a, K, V> {
    #[inline]
    fn drop(&mut self) {
        tt_rl_exclusive(self.borrows, self.hash);
    }
}

impl<'a, K: Eq + Hash, V> RefMutInterface<'a, K, V> {
    #[inline(always)]
    pub(crate) fn new(
        hash: u64,
        borrows: &'a RefCell<HashMap<u64, BorrowStatus>>,
        k: &'a K,
        v: &'a mut V,
    ) -> Self {
        Self {
            hash,
            borrows,
            k,
            v,
        }
    }

    #[inline(always)]
    pub fn key(&self) -> &K {
        self.k
    }

    #[inline(always)]
    pub fn value(&self) -> &V {
        self.v
    }

    #[inline(always)]
    pub fn value_mut(&mut self) -> &mut V {
        self.v
    }

    #[inline(always)]
    pub fn pair(&self) -> (&K, &V) {
        (self.k, self.v)
    }

    #[inline(always)]
    pub fn pair_mut(&mut self) -> (&K, &mut V) {
        (self.k, self.v)
    }
}

impl<'a, K: Eq + Hash, V> Deref for RefMutInterface<'a, K, V> {
    type Target = V;

    #[inline(always)]
    fn deref(&self) -> &V {
        self.value()
    }
}

impl<'a, K: Eq + Hash, V> DerefMut for RefMutInterface<'a, K, V> {
    fn deref_mut(&mut self) -> &mut V {
        self.value_mut()
    }
}