Re: [U2][UV] Type 18 File Hashing Algorithm

[Richard Nuckolls]

Try taking the mod of the calculation against 2**31 or 2**32.  I have  
not tested this, but most of the other algorithms just toss any  
overflow of a 32 bit accumulator.

Rick Nuckolls
Lynden Inc.
ie:
EQU TWO32 TO 4294967296
...

GROUP = MOD(GROUP*10 + SEQ(ID[NC, 1]), TWO32)


On Feb 13, 2008, at 5:59 AM, Perry Taylor wrote:

FOR NC = 1 TO LEN.ID

        GROUP = GROUP * 10 + SEQ(ID[NC, 1])

NEXT NC
-------
u2-users mailing list
u2-users@listserver.u2ug.org
To unsubscribe please visit http://listserver.u2ug.org/