65
What could go wrong trying to solve AoC in Rust?
(sh.itjust.works)
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
this post was submitted on 01 Feb 2024
65 points (91.1% liked)
Programmer Humor
19503 readers
328 users here now
Welcome to Programmer Humor!
This is a place where you can post jokes, memes, humor, etc. related to programming!
For sharing awful code theres also Programming Horror.
Rules
- Keep content in english
- No advertisements
- Posts must be related to programming or programmer topics
founded 1 year ago
MODERATORS
Java 2. World is full of wonders
Java 2 didn't have streams nor iterator combinatorics, not sure what you mean?
i didn't mean as a version. I meant as overuse of streams
How would you have preferred to solve it? Using for loops?
Python style iterator comprehension
(wonder if someone has made that into a macro. if no one has I will)
I don't think it would be readable. Too much going on. You'd need an outer iter over lines, an inner over words, a check for number and a conversion. And there would be zero error handling.
No less readable than half the Python comprehensions I've written.
Not necessarily. The macro could look for a ? at the end of the final expression (the bit that comes first in a comprehension) and return a Result.
Right, of course, I meant no error handling in the Python impl