hashbrown
aoc2020
Our great sponsors
hashbrown | aoc2020 | |
---|---|---|
22 | 22 | |
2,261 | 29 | |
2.2% | - | |
8.2 | 0.0 | |
18 days ago | about 1 year ago | |
Rust | Rust | |
Apache License 2.0 | - |
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
aoc2020
-
All years, all days, everything in Haskell
I've done every year in Haskell (2015 2016 2017 2018 2019 2020 2021), and so have several other people such as /u/glguy. I don't see if /u/mstksg has anything published for 2015 but they've done 2016 2017 2018 2019 2020 2021 along with some pretty good writeups, I recommend checking those out.
-
[2020 Day 1] Performance comparison of solutions in 7 different languages
I benchmarked all 25 days in 4 languages (using GitHub Actions, which performs worse than my local dev setup, but feels more fair for reproducibility). Can't get any pretty animated output, though.
-
-🎄- 2020 Day 25 Solutions -🎄-
Rust
-
-🎄- 2020 Day 24 Solutions -🎄-
Kotlin
- [2020 Day 23 Part 2] [Haskell] Did anyone find a way to get decent performance without using a mutable data structure?
-
-🎄- 2020 Day 23 Solutions -🎄-
Rust
-
-🎄- 2020 Day 22 Solutions -🎄-
Rust
-
2020 Day 21 Solutions
Rust
-
2020 Day 20 Solutions
Rust
What are some alternatives?
dashmap - Blazing fast concurrent HashMap for Rust.
AoC - my personal repo for the advent of code yearly challenge
meow_hash - Official version of the Meow hash, an extremely fast level 1 hash
advent-of-code - My solutions for Advent of Code
flamegraph - Easy flamegraphs for Rust projects and everything else, without Perl or pipes <3
adventofcode - Solutions for Advent of Code over the years
bumpalo - A fast bump allocation arena for Rust
Advent_of_Code_in_Pascal - My solutions to the Advent of Code, in Free Pascal
moonfire-nvr - Moonfire NVR, a security camera network video recorder
aoc-2020 - My solutions for https://adventofcode.com
aoc - 🎄 My solutions and walkthroughs for Advent of Code and more related stuff.
hac - HAC Ada Compiler - a small, quick Ada compiler fully in Ada