hashbrown
aoc
Our great sponsors
hashbrown | aoc | |
---|---|---|
22 | 24 | |
2,261 | 380 | |
2.2% | - | |
8.2 | 8.9 | |
17 days ago | 4 months ago | |
Rust | Python | |
Apache License 2.0 | GNU General Public License v3.0 or later |
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
aoc
-
-❄️- 2023 Day 10 Solutions -❄️-
1076/1738 — Raw solution (to refactor/possibly rewrite)
-
-❄️- 2023 Day 9 Solutions -❄️-
Solution
- Advent of Code day 08
-
-❄️- 2023 Day 8 Solutions -❄️-
Busy day today, going back to sleep zzZZZ. Clean solution and walkthrough here later today (hopefully).
- Advent of Code day 07
-
I am stuck!
If you're using Python, you can check this guy walkthroughs, he's good at explaining things and uses many Python's features to write clean code. I'd suggest to try tackle a problem on your own, and whether you manage to get a solution or not, read his walkthrough, and re-implement a solution using his ideas. This is what I did two years ago and it was a big help for me, I was more and more able to come up with solutions without looking at what he did. I still check what he does today, but I always solve the problem on my own first now.
-
Advent of code day 04
758/2614 — Soluzione Python 3 — Walkthrough (inglese)
-
Need help finding good python solutions
Solutions and walkthroughs for most of the years.
-
AdventOfCode 2022, giorno 25
Congrats /u/skifire13 per il rank #233 globale, nice!
- AdventOfCode 2022, giorno 15
What are some alternatives?
dashmap - Blazing fast concurrent HashMap for Rust.
advent-of-code-2020 - 🎅🌟❄️☃️🎄🎁
meow_hash - Official version of the Meow hash, an extremely fast level 1 hash
Advent-of-Code - C# solutions for Advent of Code puzzles
flamegraph - Easy flamegraphs for Rust projects and everything else, without Perl or pipes <3
AdventOfCode-rs - The https://adventofcode.com in idiomatic declarative Rust
bumpalo - A fast bump allocation arena for Rust
advent_of_code
moonfire-nvr - Moonfire NVR, a security camera network video recorder
advent-of-code - For sharing my adventofcode.com solutions
aoc-2020 - Advent of Code 2020
Advent_of_Code_in_Pascal - My solutions to the Advent of Code, in Free Pascal