flashmap 0.0.4-alpha

A lock-free eventually consistent concurrent hash map.
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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153

#[cfg(loom)]
pub use loom::{hint, thread};

#[cfg(not(loom))]
pub use std::{hint, sync, thread};

#[cfg(loom)]
pub mod sync {
    pub use loom::sync::*;
    pub use std::sync::PoisonError;
}

#[cfg(loom)]
pub mod cell {
    pub use loom::cell::Cell;
    use std::{
        marker::PhantomData,
        ops::{Deref, DerefMut},
    };

    #[allow(dead_code)]
    pub struct MutPtr<'a, T: ?Sized> {
        mut_ptr: loom::cell::MutPtr<T>,
        _lifetime: PhantomData<&'a ()>,
    }

    impl<'a, T> Deref for MutPtr<'a, T> {
        type Target = T;

        #[inline(always)]
        fn deref(&self) -> &Self::Target {
            unsafe { self.mut_ptr.deref() }
        }
    }

    impl<'a, T> DerefMut for MutPtr<'a, T> {
        #[inline(always)]
        fn deref_mut(&mut self) -> &mut Self::Target {
            unsafe { self.mut_ptr.deref() }
        }
    }

    #[repr(transparent)]
    pub struct UnsafeCell<T: ?Sized> {
        inner: loom::cell::UnsafeCell<T>,
    }

    impl<T> UnsafeCell<T> {
        #[inline(always)]
        pub fn new(value: T) -> Self {
            Self {
                inner: loom::cell::UnsafeCell::new(value),
            }
        }
    }

    impl<T: ?Sized> UnsafeCell<T> {
        #[inline(always)]
        #[allow(dead_code)]
        pub fn get_mut(&mut self) -> MutPtr<'_, T> {
            MutPtr {
                mut_ptr: self.inner.get_mut(),
                _lifetime: PhantomData,
            }
        }

        #[inline(always)]
        pub fn with<F, R>(&self, f: F) -> R
        where
            F: FnOnce(*const T) -> R,
        {
            self.inner.with(f)
        }

        #[inline(always)]
        pub fn with_mut<F, R>(&self, f: F) -> R
        where
            F: FnOnce(*mut T) -> R,
        {
            self.inner.with_mut(f)
        }
    }
}

#[cfg(not(loom))]
pub mod cell {
    pub use std::cell::Cell;
    use std::{
        cell::UnsafeCell as StdUnsafeCell,
        ops::{Deref, DerefMut},
    };

    #[allow(dead_code)]
    pub struct MutPtr<'a, T: ?Sized> {
        mut_ptr: &'a mut T,
    }

    impl<'a, T> Deref for MutPtr<'a, T> {
        type Target = T;

        #[inline(always)]
        fn deref(&self) -> &Self::Target {
            self.mut_ptr
        }
    }

    impl<'a, T> DerefMut for MutPtr<'a, T> {
        #[inline(always)]
        fn deref_mut(&mut self) -> &mut Self::Target {
            self.mut_ptr
        }
    }

    #[repr(transparent)]
    pub struct UnsafeCell<T: ?Sized> {
        inner: StdUnsafeCell<T>,
    }

    impl<T> UnsafeCell<T> {
        #[inline(always)]
        pub fn new(value: T) -> Self {
            Self {
                inner: StdUnsafeCell::new(value),
            }
        }
    }

    impl<T: ?Sized> UnsafeCell<T> {
        #[inline(always)]
        #[allow(dead_code)]
        pub fn get_mut(&mut self) -> MutPtr<'_, T> {
            MutPtr {
                mut_ptr: self.inner.get_mut(),
            }
        }

        #[inline(always)]
        pub fn with<F, R>(&self, f: F) -> R
        where
            F: FnOnce(*const T) -> R,
        {
            f(self.inner.get())
        }

        #[inline(always)]
        pub fn with_mut<F, R>(&self, f: F) -> R
        where
            F: FnOnce(*mut T) -> R,
        {
            f(self.inner.get())
        }
    }
}