Re:The Value in Go’s Simplicity
by fluffything on Tuesday November 19, 2019 @08:19AM
(#21572566)
Can you solve the exact same problem using Python list comprehensions or Rust iterators?
I'd like to see how solving this same problem in those languages is less of a nightmare.
I personally find that C loop quite readable compared with the same iteration being done in Rust.
This is a sum of absolute differences, so in Rust:
let satd = d.iter().cloned().map(abs).sum();
As an added bonus, there's no undefined behavior!Loops in go are much less flexible than loops in C, you'd never see code like that in go.
In Go that loop could be:
for k, dd = 0, d[0]; k < 16; k, dd = k + 1, d[k + 1] {
...
}
I don't find that significantly more readable than the C version.
And this excessive flexibility doesn't even make simple things simple. Try counting down from N to 0 inclusive using unsigned ints.