hashbrown
dashmap
Our great sponsors
hashbrown | dashmap | |
---|---|---|
22 | 12 | |
2,256 | 2,717 | |
2.0% | - | |
8.2 | 5.5 | |
12 days ago | 23 days ago | |
Rust | Rust | |
Apache License 2.0 | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
hashbrown
-
OpenD, a D language fork that is open to your contributions
That's because you're looking at a wrapper around the actual implementation (which lives in an external package). Notice "use hashbrown::hash_map as base;" at the top.
There's far more unsafe there: https://github.com/rust-lang/hashbrown/blob/f2e62124cd947b5e...
-
I just published my first crate: `identified_vec` - I would love some input! PR's are most welcome.
You might want to check out how popular ecosystem crates do some of these things. Particularly relevant to you are probably crates providing collections, such as smallvec, hashbrown, or indexmap.
-
GDlog: A GPU-Accelerated Deductive Engine
https://github.com/topics/swisstable
rust-lang/hashbrown: https://github.com/rust-lang/hashbrown
CuPy has array but not yet hashmaps, or (GPU) SIMD FWICS?
NumPy does SIMD:
-
When Zig Outshines Rust – Memory Efficient Enum Arrays
Thanks, great point indeed. I am looking into this https://github.com/rust-lang/hashbrown
The way I think about it -- rather naively, I suppose -- is that I care more about the references cells make to each other than the actual grid of cells displayed on a table. The latter feels more like a "view" of the data than an actual data structure?
This also seems to align with the relative priority of (sorted from highest to lowest): figuring out the order of evaluation, calculating those evaluations, and finally displaying the results of the evaluation
-
This Week in Rust # 500!!
updated std's hashbrown dependency to 0.14 which contains some optimizations
-
Crust of Rust: std::collections [video]
The std hashmap is actually very fast and uses state of the art hashmap design, namely because it's implemented by hashbrown
-
Deduplicating a Slice in Go
I believe Rust uses hashbrown as the underlying implementation now. This just calculates the number of buckets based on the number of items requested:
https://github.com/rust-lang/hashbrown/blob/009969a860290849...
Is it really the case that rehashing can guarantee that the number of buckets allocated will be sufficient for any given set of keys? In principle you could fail to rehash in a way that reduces collisions after k attempted rehashings.
-
Blog Post: Rust Is a Scalable Language
For example, since the hashbrown crate is marked with #![no_std], it can be used as a dependency for the standard library.
-
Hey Rustaceans! Got a question? Ask here (6/2023)!
To implement something that cannot be expressed in safe Rust, or at least cannot be expressed succinctly in safe Rust, like fundamental datastructures. The hashbrown crate contains a lot of unsafe code, but it's such high quality that it's now the backing implementation for std::collections::HashMap.
- Data-driven performance optimization with Rust and Miri
dashmap
- StupidAlloc: what if memory allocation was bad actually
-
dashmap VS scalable-concurrent-containers - a user suggested alternative
2 projects | 13 Apr 2023
-
Samsara, a safe Rust concurrent cycle collector
The problem is, every single one of these half-dozen crates has at least one known major issue (including UAF), exactly like C++ implementations (which isn't surprising since it's the kind of things where the ownership isn't clear and then the borrow checker can't help us).
-
Rust vs Go
Deadlocks and leaks are easy as other languages.
-
Shared mutable state is bad... so how do I create a global cache in a multi-threaded app?
Have you considered https://github.com/xacrimon/dashmap ?
-
Announcing Leapfrog, a faster concurrent HashMap
Dashmap made some api changes compared to the stdlibs hashmap, which leads to some oddities, as highlighted here: https://github.com/xacrimon/dashmap/issues/175
-
Writing a concurrent LRU cache
Some additional notes are in this slide deck and the implementation javadoc. You'd probably want to use something like DashMap for the hash table.
-
HashMap-based cache for async programs
You can look at existing concurrent maps like Dashmap https://github.com/xacrimon/dashmap or Cashmap https://gitlab.redox-os.org/redox-os/chashmap
-
How does one avoid lock of locks? or use the technique of latch crabbing of databases
Also dashmap
-
Noteworthy concurrent data structures?
The only one I've used is Dashmap, it's a concurrent interior-mutability hashmap. Very convenient crate in the case you need that.
What are some alternatives?
meow_hash - Official version of the Meow hash, an extremely fast level 1 hash
moka - A high performance concurrent caching library for Rust
flamegraph - Easy flamegraphs for Rust projects and everything else, without Perl or pipes <3
HashMap - An open addressing linear probing hash table, tuned for delete heavy workloads
bumpalo - A fast bump allocation arena for Rust
crossbeam - Tools for concurrent programming in Rust
moonfire-nvr - Moonfire NVR, a security camera network video recorder
leapfrog - Lock-free concurrent and single-threaded hash map implementations using Leapfrog probing. Currently the highest performance concurrent HashMap in Rust for certain use cases.
aoc - 🎄 My solutions and walkthroughs for Advent of Code and more related stuff.
megahash - A super-fast C++ hash table with Node.js wrapper, tested up to 1 billion keys.
aoc-2020 - Advent of Code 2020
stretto - Stretto is a Rust implementation for Dgraph's ristretto (https://github.com/dgraph-io/ristretto). A high performance memory-bound Rust cache.