• ###### MRosenstresolved an issue on "Evaluate mathematical expression" kata

I took another look at it today and appears that indeed my negation parsing was not binding tightly enough! Thanks for the help.

• ###### Unnamedcommented on "Evaluate mathematical expression" kata

`-7891910.6360572055` seems to be the correct result. Have you changed the order of operations anywhere (even addition isn't associative for floating point numbers) or used `Float` instead of `Double`? If not, post your code here flagged as a spoiler.

• ###### MRosenstcreated an issue for "Evaluate mathematical expression" kata

This comment is hidden because it contains spoiler information about the solution

• ###### risingBirdSongcommented on "Sum of array singles" haskell solution

Nice! So clean

• ###### FArekkusucommented on "V A P O R C O D E" python solution

but it can be faster

It can't. It's a pure C solution, requiring the minimal possible operations to get the expected result, and is optimized to do the mapping after the filtering but before the expansion step. Your solution, on the other hand (idk whether you were referring to it as faster but still), is 10 times slower in the worst case (no spaces), and hundreds of times slower in the best case (only spaces).

• ###### BinaryEclipsecommented on "V A P O R C O D E" python solution

It's hard to judge actual speed of python based on theoretical time complexity, it varies a lot depending on user implementation and the internal C implementation of that code. For example, a, b = min(list), max(list) is usually a bit faster than iterating once with a for loop. Your solution is about 4-5x slower, from my tests at least.

• ###### JohanWiltinkcommented on ""V A P O R C O D E" Haskell Translation"

Or just look at the source of `ListOf1` and write `ListOf5`. I've done that for `ListOf2` once, I think.

But `1` to `50` will do nicely.

( Shouldn't you be implementing `concat` somewhere? I just realised that if you have `foldr`, you can have `concat`. Just Hoogle it. :)

• ###### user8436785commented on ""V A P O R C O D E" Haskell Translation"

This is almost the same as Python, except the list size is from 1 to 50 instead of 5 to 50 - I hope that's okay.
If not, I can fix it with some nitty gritty `<\$>` and `<*>` stuff. (I learned that from some of your translations. Clever, but useful. Took me a while to get the hang of it tho.)

• ###### JohanWiltinkcommented on ""V A P O R C O D E" Haskell Translation"

You're using the default random generator, which is a bit simplistic for this kata. Could you try to generate something more approaching normal text, like the random generators in JS ( the original ) and Python ( which you solved ) do?

• ###### MRosenstcommented on "Number toString" haskell solution

(.) = flip (\$)

• ###### JohanWiltinkcommented on "Circularly Sorted Array" haskell solution

Fusion probably saves you. But if you want to know if a list has length `0` or `1`, walking the whole list with `length` is not the Best Practice way.

• ###### Unnamedcommented on ""Difference of Volumes of Cuboids" Haskell Translation"

OK, IDK who approved the previous fork, but IMO the arguments should be tuples.