On 6 Sep 2005, at 00:09, Glenn Maynard wrote:
Just because the specific examples exist as predefined algorithms does not mean every possible algorithm using boolean algebra does. The potential speed ups available through the use of Karnaugh maps alone makes raw bit operations incredibly valuable, let alone the host of other boolean algebra tricks.
Whereas I use it on systems where Lua's configured so that lua_Number *is* a 32-bit integer.
Surely more generic is favourable to specific, especially when the new constructs both simplify and improve the expressiveness of the language?