I think List.get has been avoided since it seems imperative, and requires the use of Maybes. If you expect an item to be there, use a different data structure, or use an Array which has better time complexity.
I agree completely on Random.constant. Random.permutation is available in random-extra <http://package.elm-lang.org/packages/elm-community/random-extra/2.0.0/Random-List#shuffle> as shuffle. It takes O(n log n) time because it converts it to an array first. But it's certainly possible the author of the function -- me -- made a mistake. -- You received this message because you are subscribed to the Google Groups "Elm Discuss" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
