× The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.



That may work. What do you really need? 
If you use Modulus 10, you can get a little better check-digit result.
If you only intend on keeping the "hash" and not the original data, then the
check-digit is a good idea.

If you want a ciphered hash, then I would just calculate the 16-byte MD5
hash using the cipher MI instruction.

-Bob



-----Original Message-----
From: rpg400-l-bounces@xxxxxxxxxxxx [mailto:rpg400-l-bounces@xxxxxxxxxxxx]
On Behalf Of Chris_Bougher@xxxxxxxxxxxxx
Sent: Wednesday, December 08, 2004 11:56 AM
To: rpg400-l@xxxxxxxxxxxx
Subject: Compute Hash Code

I need to compute a hash type code for an array of 3 character strings. The
strings are always 3 digit numeric values and do not repeat within a
sequence. I was thinking that I could add the numbers together multiplying
by their position in the list. i.e.

array = '100', '200', '300', '400', '500'
hash = (100 * 1) + (200 * 2) + (300 * 3) + (400 * 4) + (500 * 5) = 5500

Does anyone see any issues with this method? Does anyone have a better
method?


Thanks
Chris Bougher


--
This is the RPG programming on the AS400 / iSeries (RPG400-L) mailing list
To post a message email: RPG400-L@xxxxxxxxxxxx
To subscribe, unsubscribe, or change list options,
visit: http://lists.midrange.com/mailman/listinfo/rpg400-l
or email: RPG400-L-request@xxxxxxxxxxxx
Before posting, please take a moment to review the archives
at http://archive.midrange.com/rpg400-l.





As an Amazon Associate we earn from qualifying purchases.

This thread ...

Replies:

Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.