lockless 0.2.0

Composable, lock-free, allocation-light data structures
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

use std::marker::PhantomData;

use primitives::invariant::Invariant;
use primitives::index_allocator::IndexAllocator;

#[derive(Debug)]
pub struct Id<Tag>(usize, Invariant<Tag>);

impl<Tag> Copy for Id<Tag> {}
impl<Tag> Clone for Id<Tag> {
    fn clone(&self) -> Self {
        *self
    }
}

impl<Tag> From<Id<Tag>> for usize {
    fn from(id: Id<Tag>) -> usize {
        id.0
    }
}

impl<Tag> From<usize> for Id<Tag> {
    fn from(id: usize) -> Id<Tag> {
        Id(id, PhantomData)
    }
}

pub trait IdAllocator<Tag> {
    fn new(limit: usize) -> Self;
    fn try_allocate_id(&self) -> Option<Id<Tag>>;
    fn free_id(&self, id: Id<Tag>);
    fn id_limit(&self) -> usize;
    fn raise_id_limit(&mut self, new_limit: usize);
}

impl<Tag> IdAllocator<Tag> for IndexAllocator {
    fn new(limit: usize) -> Self {
        IndexAllocator::new(limit)
    }
    fn try_allocate_id(&self) -> Option<Id<Tag>> {
        self.try_allocate().map(Into::into)
    }
    fn free_id(&self, id: Id<Tag>) {
        self.free(id.0).into()
    }
    fn id_limit(&self) -> usize {
        self.len()
    }
    fn raise_id_limit(&mut self, new_limit: usize) {
        self.resize(new_limit)
    }
}