I'm just confused, why do you care about the speed to calculate a constant table with only 256 entries? And why do you use a hash if speed counts? ... arrays are much faster!
Cheers Rolf
In reply to Re^3: An array of boolean values in a bitfield
by LanX
in thread An array of boolean values in a bitfield
by kyle
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |