The Aggregate Magic Algorithms
Some very interesting, and sometimes useful tricks to do things like swap two values without a temporary (which can be useful to trim memory usage to fit in memory cache for complex calculation loops on some platforms, or just to avoid the non-pairing 'exchange' instruction on x86) or how to calculate an average that can't overflow, or leading or trailing zero or ones counts, various semi-random stuff. :-)
And combining them can solve some interesting problems that can come up in lower-level systems hacking on highly pipelines platforms like modern-day Pentiums or to a much lesser extent modern Athlons.
But now... off to head out to pick up Talesin so I can get to Further Confusion. =^.^=
Some very interesting, and sometimes useful tricks to do things like swap two values without a temporary (which can be useful to trim memory usage to fit in memory cache for complex calculation loops on some platforms, or just to avoid the non-pairing 'exchange' instruction on x86) or how to calculate an average that can't overflow, or leading or trailing zero or ones counts, various semi-random stuff. :-)
And combining them can solve some interesting problems that can come up in lower-level systems hacking on highly pipelines platforms like modern-day Pentiums or to a much lesser extent modern Athlons.
But now... off to head out to pick up Talesin so I can get to Further Confusion. =^.^=