txmap 1.1.0

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

#[cfg(test)]
mod tests {
    use crate::{new_types::HashCode, shard_count::ShardCount};

    #[test]
    fn shard_count_hash_distributes_across_shards() {
        for sc in vec![
            ShardCount::_8,
            ShardCount::_16,
            ShardCount::_32,
            ShardCount::_64,
            ShardCount::_128,
        ] {
            let shard_count = u8::from(sc);
            let mut seen = std::collections::HashSet::new();
            for i in 0..10_000 {
                seen.insert(ShardCount::shard_index(shard_count, HashCode(i)));
            }
            // With 10_000 keys, we should hit all shards
            assert!(
                seen.len() == shard_count as usize,
                "should hit all shards, got {}",
                seen.len()
            );
        }
    }
}