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

use crate::linear_page::LinearPage;
use crate::linear_reusable::LinearReusable;

/// ObjectPool use a lockfree vector to secure multithread access to pull.
///
/// The lockfree vector is implemented as linked list.
///
/// # Example
/// ```rust
///  use lockfree_object_pool::LinearObjectPool;
///
///  let pool = LinearObjectPool::<u32>::new(
///    ||  Default::default(),
///    |v| {
///      *v = 0;
///    }
///  );
///  let mut item = pool.pull();
///
///  *item = 5;
///  let work = *item * 5;
/// ```
pub struct LinearObjectPool<T> {
    reset: Box<dyn Fn(&mut T) + Send + Sync>,
    init: Box<dyn Fn() -> T + Send + Sync>,
    head: LinearPage<T>,
}

impl<T> LinearObjectPool<T> {
    ///
    /// Create an new [`LinearObjectPool`]
    ///
    /// # Arguments
    /// * `init`  closure to create new item
    /// * `reset` closure to reset item before reusage
    ///
    /// # Example
    /// ```rust
    ///  use lockfree_object_pool::LinearObjectPool;
    ///
    ///  let pool = LinearObjectPool::<u32>::new(
    ///    ||  Default::default(),
    ///    |v| {
    ///      *v = 0;
    ///    }
    ///  );
    /// ```
    #[inline]
    pub fn new<R, I>(init: I, reset: R) -> Self
    where
        R: Fn(&mut T) + 'static + Send + Sync,
        I: Fn() -> T + 'static + Clone + Send + Sync,
    {
        Self {
            reset: Box::new(reset),
            init: Box::new(init.clone()),
            head: LinearPage::new(init),
        }
    }

    ///
    /// Create a new element. When the element is dropped, it returns in the pull.
    ///
    /// # Example
    /// ```rust
    ///  use lockfree_object_pool::LinearObjectPool;
    ///
    ///  let pool = LinearObjectPool::<u32>::new(
    ///    ||  Default::default(),
    ///    |v| {
    ///      *v = 0;
    ///    }
    ///  );
    ///  let mut item = pool.pull();
    /// ```
    #[inline]
    pub fn pull(&self) -> LinearReusable<T> {
        let (page, page_id) = self.head.alloc(&self.init);
        unsafe { LinearReusable::new(self, page_id, page) }
    }

    #[inline]
    pub(crate) fn get_reset_callback(&self) -> &dyn Fn(&mut T) {
        &self.reset
    }
}