kasino 0.1.0

Framework for implementing sharded concurrent datastructures.
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

use rand::{RngExt, SeedableRng, rngs::SmallRng};

use crate::{
    Collection,
    storage::StorageBackend,
    strategy::{Hooked, InstrumentedState, NoPad, Strategy},
};

/// A random scheduler.
///
/// This scheduler does not promise a bound on rank error or delay.
#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash)]
pub struct RandomAccess<R = SmallRng> {
    rng: R,
}

impl<S> Default for RandomAccess<S>
where
    S: SeedableRng,
{
    #[inline]
    fn default() -> Self {
        Self {
            rng: S::seed_from_u64(Default::default()),
        }
    }
}

impl<Q: Collection, S: RngExt + SeedableRng> Strategy<Q> for RandomAccess<S> {
    type Gambler = Self;

    #[inline]
    fn choose_offer_arm(
        &self,
        state: &impl StorageBackend<<Self::Gambler as Hooked>::Stake>,
        gambler: &mut Self::Gambler,
    ) -> usize {
        gambler.rng.random_range(..state.len())
    }

    #[inline]
    fn choose_poll_arm(
        &self,
        state: &impl StorageBackend<<Self::Gambler as Hooked>::Stake>,
        gambler: &mut Self::Gambler,
    ) -> usize {
        gambler.rng.random_range(..state.len())
    }

    #[inline]
    fn fork_gambler(&self, gambler: &mut Self::Gambler) -> Self::Gambler {
        Self {
            rng: gambler.rng.fork(),
        }
    }

    #[inline]
    fn create_gambler(&self) -> Self::Gambler {
        Self {
            rng: S::seed_from_u64(Default::default()),
        }
    }
}

impl<S> Hooked for RandomAccess<S> {
    type Stake = NoPad<InstrumentedState<()>>;
}