@[email protected] to Programmer HumorEnglish • edit-28 months agoWhat could go wrong trying to solve AoC in Rust?sh.itjust.worksimagemessage-square17fedilinkarrow-up172arrow-down17file-text
arrow-up165arrow-down1imageWhat could go wrong trying to solve AoC in Rust?sh.itjust.works@[email protected] to Programmer HumorEnglish • edit-28 months agomessage-square17fedilinkfile-text
minus-square@[email protected]linkfedilink3•8 months agoHow would you have preferred to solve it? Using for loops?
minus-square@[email protected]linkfedilinkEnglish1•edit-28 months agoPython style iterator comprehension (wonder if someone has made that into a macro. if no one has I will)
minus-square@[email protected]linkfedilink1•8 months agoI 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.
minus-square@[email protected]linkfedilinkEnglish2•8 months agoNo less readable than half the Python comprehensions I’ve written. zero error handling. 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.
minus-square@[email protected]linkfedilink2•8 months agoRight, of course, I meant no error handling in the Python impl
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