Thanks Rick! MOD(XXX, 2**31) did the trick! -----Original Message----- From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Richard Nuckolls Sent: Wednesday, February 13, 2008 2:45 PM To: [email protected] Subject: Re: [U2][UV] Type 18 File Hashing Algorithm
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 [email protected] To unsubscribe please visit http://listserver.u2ug.org/ CONFIDENTIALITY NOTICE: This e-mail message, including any attachments, is for the sole use of the intended recipient(s) and may contain confidential and privileged information. Any unauthorized review, use, disclosure or distribution is prohibited. ZirMed, Inc. has strict policies regarding the content of e-mail communications, specifically Protected Health Information, any communications containing such material will be returned to the originating party with such advisement noted. If you are not the intended recipient, please contact the sender by reply e-mail and destroy all copies of the original message. ------- u2-users mailing list [email protected] To unsubscribe please visit http://listserver.u2ug.org/
