starshard 0.2.0

A blazing-fast sharded concurrent HashMap using hashbrown and RwLock, with lazy shards, atomic length cache, and async support.
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

# Starshard

English | [简体中文](README_CN.md)

[![Build](https://github.com/houseme/starshard/workflows/Build/badge.svg)](https://github.com/houseme/starshard/actions?query=workflow%3ABuild)
[![crates.io](https://img.shields.io/crates/v/starshard.svg)](https://crates.io/crates/starshard)
[![docs.rs](https://docs.rs/starshard/badge.svg)](https://docs.rs/starshard/)
[![License](https://img.shields.io/crates/l/starshard)](./LICENSE-APACHE)
[![Downloads](https://img.shields.io/crates/d/starshard)](https://crates.io/crates/starshard)

A high\-performance sharded concurrent HashMap for Rust, built on `hashbrown` and `RwLock`/`tokio::sync::RwLock`.

## Features

- Lazy shard initialization
- O\(1\) atomic `len`
- Optional parallel iteration with `rayon`
- Async API with Tokio \(feature `async`\)
- Pluggable hashers \(default: `fxhash`\)

## Install

Add to `Cargo.toml`:

```toml
[dependencies]
starshard = { version = "0.1.0", features = ["rayon", "async"] }
```

## Quick Start

```rust
use starshard::ShardedHashMap;
let map: ShardedHashMap<String, i32> = ShardedHashMap::new(64);
map.insert("k".into(), 1);
assert_eq!(map.get(&"k".into()), Some(1));
```

## License

Dual\-licensed under MIT or Apache\-2\.0.

- See `LICENSE-MIT` and `LICENSE-APACHE`.
- © 2025 [houseme](https://github.com/houseme).