Talk:Array length: Difference between revisions
Content added Content deleted
No edit summary |
No edit summary |
||
| Line 19: | Line 19: | ||
: Yep. And on a related note Haskell's fold optimizations (where non-used elements aren't fetched at runtime) do have a compile time cost. |
: Yep. And on a related note Haskell's fold optimizations (where non-used elements aren't fetched at runtime) do have a compile time cost. |
||
: And it's also possible that different JS implementations will optimize ternary expression handling. But mostly I don't care about optimizations which yield less than a factor-of-2 improvement - with exceptions to the rule, of course, being in the context of resource-critical bottlenecks. Reason being that quite often there's factor of 1000 (or better) optimizations available if you instead take some time to digest the relevant issues. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 17:21, 8 October 2015 (UTC) |
: And it's also possible that different JS implementations will optimize ternary expression handling. But mostly I don't care about optimizations which yield less than a factor-of-2 improvement - with exceptions to the rule, of course, being in the context of resource-critical bottlenecks. Reason being that quite often there's factor of 1000 (or better) optimizations available if you instead take some time to digest the relevant issues. (And the reason for that is that efficiency is not a universal good, but something which relates to a specific effort.) --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 17:21, 8 October 2015 (UTC) |
||