| I believe speaking of monads, monoids, functors, and homomorphism when discussing an interview question for fairly fresh programmers is definitely overthinking it. I'm not sure what you think is so simple about your solution compared to: sub flatten {
map { ref ? flatten( @$_ ) : $_ } @_;
}
Goodness, and Perl gets a bad reputation for the amount of punctuation in the code.Of course if you want flatten in Haskell you have it for Tree and Forest. import Data.Tree
tree = Node "A" [Node "B" [], Node "C" [Node "D" [], Node "E" []], Node "F" []]
main = do
print $ flatten tree
If a Perl programmer wanted to pull in a CPAN module, there are many from which to choose. Of course, it was just done in a one-line subroutine...:http://search.cpan.org/~obradovic/List-Flatten-0.01/lib/List... (which does not handle arbitrary depths) http://search.cpan.org/~rthompson/List-Flatten-Recursive-0.1... (which seems overly complicated) http://search.cpan.org/~rsavage/Set-Array-0.30/lib/Set/Array... (which tries to flatten hashes as well as lists and seems, well, overly complicated... and pulls in a bunch more methods and functions) http://search.cpan.org/~satoh/List-Enumerator-0.10/ (which seems about right, including stopping the flattening at an arbitrary depth and comes with other useful array tools) Of course it's possible to apply the concept of flattening to hashes/dictionaries, too, so there goes the concept of keeping the original sort order. http://search.cpan.org/~bbc/Hash-Flatten-1.19/lib/Hash/Flatt... http://search.cpan.org/~chocolate/Hash-Fold-0.1.2/lib/Hash/F... |
I agree. I said as much. I just thought it was interesting.
> I'm not sure what you think is so simple about your solution compared to [...]
Which solution? I didn't present an implementation in this thread. I did elsewhere (https://news.ycombinator.com/item?id=13726564), but I don't think that's what you're talking about? I was discussing specification, and the code fragment in my comment was a property, not a definition.
> Of course if you want flatten in Haskell you have it for Tree and Forest.
Yes, though Tree is a slightly less natural choice for this than a rose tree (aka `Free []`). Of course, you still have it (in the form of toList).
> If a Perl programmer wanted to pull in a CPAN module, there are many from which to choose. Of course, it was just done in a one-line subroutine.
... yes?
You seem to be desperately trying to defend perl against an attack you imagine me to have made. I have nothing against perl (at least, nothing beyond a strong desire for static types on large projects, but that applies equally to a great many languages).