Is this the hash you are thinking of? If so, I have an implementation in perl which seems reasonably quick but I haven't managed to verify it as a correct implementation yet. Of course, an inline C or XS version would be much quicker if you have that option open to you.
..and remember there are a lot of things monks are supposed to be but lazy is not one of them
In reply to Re: Calling the 'newhash' ?
by BrowserUk
in thread Calling the 'newhash' ?
by John M. Dlugosz
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |