nested-data-structure-traversal

Amusingly, I think I will lose this if I don't link it here. https://github.com/josevalim/nested-data-structure-traversal... is my attempt at getting a LOOP solution in. As noted in the message, I originally did this in elisp, which felt a bit more natural, for some reason.

The Clojure reduce solution is pretty low quality. Here's my 15 line proposal: https://github.com/josevalim/nested-data-structure-traversal...

That seems to be a choice of the author, a new approach has been uploaded that uses the exact same logic as the python approach and is similarly as succinct. https://github.com/josevalim/nested-data-structure-traversal...

IMHO, the Haskell version using mapAccumL[1] is actually quite a nice demonstration of the power of having lots of computational patterns available immediately from the standard library. The biggest problem in Haskell that a language like JS doesn’t have is the types: you’re converting both the outer type for sections and the inner type for lessons into something else, so in any language with explicit static types you’re going to have the overhead of specifying those, or you have to hack around it a bit as we see here. However, if you ignore the type boilerplate and the definition of the input data, the substance of the algorithm here would be around the same length as the imperative JS for-of version, particularly with less verbose names for the local variables as idiomatic Haskell tends to use. With all four types explicitly defined and

Just wanting to say that all JS solutions are quite 'bad', except the simple for-of, because they're combining pure array methods (.map, .reduce) and side-effects (external variable to that method), not even talking about modifying Array protoype https://github.com/josevalim/nested-data-structure-traversal..., never do this, don't touch to objects you don't own, and that others would access and not expect to be modified! I'll make a PR to try to contribute, instead of just complaining like that, hehe Btw I'm surprised the structure isn't deeply nested (requiring recursion to process it), it'd be more interesting