itertools
advent-of-code-2021
| itertools | advent-of-code-2021 | |
|---|---|---|
| 3 | 14 | |
| 2,547 | 240 | |
| 1.0% | - | |
| 9.5 | 2.6 | |
| about 21 hours ago | 5 months ago | |
| Rust | Rust | |
| Apache License 2.0 | GNU General Public License v3.0 only |
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.
itertools
-
Idiomatic way to filter empty/falsy elements
It might be a good fit for Itertools
-
zip-eq: a zip iterator that checks its inputs have equal lengths
Some relevant discussion: https://github.com/rust-itertools/itertools/pull/531
-
Better approach to repeatedly filtering an iterator till we reach a single item
It's un-deprecated because try_fold is considered to be not as ergonomic for now.
advent-of-code-2021
-
Demystifying bitwise operations, a gentle C tutorial
Some very interesting advent of code contributions written in Rust, available on github, use bitwise operations. Shout out to Tim Visee! https://github.com/timvisee/advent-of-code-2021/blob/master/...
-
Bugs that the Rust compiler catches for you
This may be the closest thing I've personally seen: https://github.com/timvisee/advent-of-code-2021
-
-ð- 2021 Day 16 Solutions -ð-
Part 2 0.022ms (22Ξs)
-
-ð- 2021 Day 15 Solutions -ð-
Part 1 1.05ms
- [2021 Day 12 Part 2] Has somebody found a sub 1s solution for part 2?
-
-ð- 2021 Day 12 Solutions -ð-
Part 1 0.861ms (861Ξs)
-
-ð- 2021 Day 11 Solutions -ð-
See https://github.com/timvisee/advent-of-code-2021/blob/master/runner/src/bin/bench.rs
- [2021 Day 9] Part 1 - 48 min to get it to work. I should go back to Python for these
-
-ð- 2021 Day 6 Solutions -ð-
Part 1 0.0027ms (2.7Ξs)
-
-ð- 2021 Day 5 Solutions -ð-
The orientation calculation could be done by matrix indexes operations https://github.com/FlakM/aoc2021/blob/main/day5/task1/src/main.rs and then its easier to create ranges. You can also use some clever crates and get some calculations for free https://github.com/timvisee/advent-of-code-2021/blob/master/day05b/src/main.rs
What are some alternatives?
staticvec - Implements a fixed-capacity stack-allocated Vec alternative backed by an array, using const generics.
Advent_of_Code - My Advent of Code solutions.
staticstep - Provides truly zero-cost alternatives to Iterator::step_by for both incrementing and decrementing any type that satisfies RangeBounds<T: Copy + Default + Step>.
aoc2020 - Advent of Code 2020
deno - A modern runtime for JavaScript and TypeScript.
adventlang - ð A programming language (+ code playground) for Advent of Code.
tauri - Build smaller, faster, and more secure desktop applications with a web frontend.
advents-of-code - ðð Solutions for the yearly advent of code challenges
public
advent-of-code-rust - My solutions to Advent Of Code
aoc - Advent of Code solutions in rust and go
adventofcode - Solutions for problems from AdventOfCode.com