Stream: ideas

Topic: faster walking


view this post on Zulip Richard Feldman (Jul 26 2023 at 02:24):

I just had an idea for very slightly faster walk implementations: avoid the integer overflow check on each index + 1 operation by doing Num.addWrap instead

view this post on Zulip Richard Feldman (Jul 26 2023 at 02:25):

we know those can never possibly overflow because they're unsigned, start from 0, and never exceed the list's length - which in turn can of course never exceed the max int


Last updated: Jun 16 2026 at 16:19 UTC