concurrent-hash-map 0.0.6

This is a simple concurrent hash map written in Rust. It uses a design where read operations never lock against reads or writes, but writes can sometimes lock against other writes. In order to maintain concurrency on insert/removal operations, the map is segmented into several sub-maps, each of which has its own write lock. This code is currently extremely pre-alpha. Most particularly, it leaks memory on table growth and drop, as well as when using keys or values that (even transitively) use custom Drop implementations. It should be possible to fix this, but a clean solution will require support for running destructors in crossbeam (see crossbeam issue #13). For now it may be useful for long lived hashmaps with a relatively steady size, but I don't recommend using it for anything important :-).
Documentation
Build #54190 2017-06-03 21:01:55 

# rustc version
rustc 1.19.0-dev (28a93c1f4 2017-05-31)


# docs.rs version
cratesfyi 0.4.0-dev (bedcc0c 2017-06-01)


# build log
Updating registry `https://github.com/rust-lang/crates.io-index`
Downloading concurrent-hash-map v0.0.6
Fresh libc v0.2.23
Fresh crossbeam v0.2.10
Fresh rand v0.3.15
Documenting concurrent-hash-map v0.0.6
Running `rustdoc --crate-name concurrent_hash_map .cargo/registry/src/github.com-1ecc6299db9ec823/concurrent-hash-map-0.0.6/src/lib.rs -o /home/cratesfyi/cratesfyi/doc -L dependency=/home/cratesfyi/cratesfyi/debug/deps --extern crossbeam=/home/cratesfyi/cratesfyi/debug/deps/libcrossbeam-da647fd7b3fee45f.rlib --extern-version crossbeam=crossbeam,0.2.10 --extern rand=/home/cratesfyi/cratesfyi/debug/deps/librand-76456d761c2cb637.rlib --extern-version rand=rand,0.3.15`
Finished dev [unoptimized + debuginfo] target(s) in 0.43 secs