Timeline for Large Power Mod - Extreme Efficiency
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 27, 2016 at 16:58 | comment | added | Gurkenglas |
Ah, I expected any documentation to be above the relevant sourcecode, not below. ^2 is fine then, I'd even say more idiomatic.
|
|
| Sep 27, 2016 at 12:43 | comment | added | Zeta |
Concerning your k^2 remark, you want to look at the documentation, too, right? There is an optimization rule for ^2 ;)
|
|
| Sep 26, 2016 at 10:47 | comment | added | Myridium |
I still don't understand foldl', but the source you provide says it has a special case for small exponents anyway, so I think a^2 would be perfectly equivalent to a*a.
|
|
| Sep 26, 2016 at 0:34 | comment | added | Myridium |
Unfortunately, neither k*k or foldl' make a discernible difference to the computation time. Nonetheless, I'll take them on board.
|
|
| Sep 25, 2016 at 12:42 | history | edited | Gurkenglas | CC BY-SA 3.0 |
added 216 characters in body
|
| Sep 25, 2016 at 12:34 | history | answered | Gurkenglas | CC BY-SA 3.0 |