Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Add links to leapfrog and flurry as concurrent hash tables examples #764

Merged
merged 2 commits into from
Jun 11, 2024
Merged

Add links to leapfrog and flurry as concurrent hash tables examples #764

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
d901468
Add links to leapfrog and flurry as concur hashmap examples
rustworthy May 6, 2024
2534f02
Rm redundant newline
rustworthy May 6, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 5 additions & 1 deletion content/tokio/tutorial/shared-state.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -212,10 +212,14 @@ shard.insert(key, value);
The simple implementation outlined above requires using a fixed number of
shards, and the number of shards cannot be changed once the sharded map is
created. The [dashmap] crate provides an implementation of a more sophisticated
sharded hash map.
sharded hash map. You may also want to have a look at such concurrent hash table
implementations as [leapfrog] and [flurry], the latter being a port of Java's
`ConcurrentHashMap` data structure.

[current_thread]: https://docs.rs/tokio/1/tokio/runtime/index.html#current-thread-scheduler
[dashmap]: https://docs.rs/dashmap
[leapfrog]: https://docs.rs/leapfrog
[flurry]: https://docs.rs/flurry

# Holding a `MutexGuard` across an `.await`

Expand Down