Anyway an extra ord() should be faster than any internal hashfunction. I'm not sure about the usecase, but if you want to tie the functionality, the additional ord() wouldn't bother the user of your module.
In reply to Re^5: An array of boolean values in a bitfield
by LanX
in thread An array of boolean values in a bitfield
by kyle
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |