txmap 3.1.1

A concurrent transactional hash map for Rust with fine-grained locking, internal mutability and composable transactions
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

use crate::{
    new_types::{ShardCount, ShardIndex},
    shards::Shards,
};
use hashbrown::HashSet;

#[test]
fn shard_count_hash_distributes_across_shards() {
    for shards in [
        Shards::_8,
        Shards::_16,
        Shards::_32,
        Shards::_64,
        Shards::_128,
    ] {
        let shard_count = ShardCount::from(shards);
        let mut seen = HashSet::new();
        for i in 0u8..128 {
            let index = ShardIndex(i).bitmask();
            seen.insert(index);
        }
        assert!(
            seen.len() >= shard_count.0 as usize,
            "should hit all shards, got {}, expected at least {}",
            seen.len(),
            shard_count.0
        );
    }
}