hashbrown
meow_hash
Our great sponsors
hashbrown | meow_hash | |
---|---|---|
22 | 13 | |
2,261 | 1,666 | |
2.2% | - | |
8.2 | 0.0 | |
17 days ago | over 1 year ago | |
Rust | C++ | |
Apache License 2.0 | zlib 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
meow_hash
-
Use fast data algorithms (2021)
I'm late on the reply but I was using xxhash for something similar, but found that Meow hash was faster for me. Feel free to benchmark, since I'm sure it could vary depending on CPU architecture.
- Meow Hash (2018)
- Meow Hash
-
Cryptanalysis of Meow Hash
for everyone who doesn't think highly of Casey Muratori (or at least the way he conducts himself online), the author of Meow Hash, took the criticism quite graciously:
https://twitter.com/cmuratori/status/1417546500083568641
https://github.com/cmuratori/meow_hash/issues/80
- Full 128-bit collision between two files in Meow Hash
-
Reading a file in parallel
Is a standardized hashing algorithm required? SHA256 takes several CPU cycle per byte, but there are several hashing algorithm utilizing AES-NI that gives them 15-16 bytes per cycles, which translates to tens of gigabytes per second on modern CPU. At least one of them has been ported to .NET Core, and from what I see properly calls AES primitives.
-
76% Faster CPython
MeowHash is the fastest non-cryptographic hash available online, and if it were used in CPython, which performs a hash for every fundamental operation in the language, then Python would be much faster.
-
New Bare Hash Map: 2X-3X Speedup over SOTA
Meow hash claims 3-4x faster hashing over this, still passes smhasher, and is a few years old. https://mollyrocket.com/meowhash
-
A Hashmap for the C Programming Language
Have you seen the meow hash implementation? Would that be suitable for this ?
What are some alternatives?
dashmap - Blazing fast concurrent HashMap for Rust.
xxHash - Extremely fast non-cryptographic hash algorithm
flamegraph - Easy flamegraphs for Rust projects and everything else, without Perl or pipes <3
BLAKE3 - the official Rust and C implementations of the BLAKE3 cryptographic hash function
bumpalo - A fast bump allocation arena for Rust
wyhash - The FASTEST QUALITY hash function, random number generators (PRNG) and hash map.
moonfire-nvr - Moonfire NVR, a security camera network video recorder
meow_hash.NET - Port of https://github.com/cmuratori/meow_hash to .NET Core
aoc - 🎄 My solutions and walkthroughs for Advent of Code and more related stuff.
pHash - pHash - the open source perceptual hash library
aoc-2020 - Advent of Code 2020
aHash - aHash is a non-cryptographic hashing algorithm that uses the AES hardware instruction