RE: Generate hash code for a source member?

Ya know, I've used CMPPFM enough to realize that there was some special
stuff going on for it to be able to identify statements that are not the
same, but still able to "match" them when the new file's statement was
changed from the old.

Also, I've found that most people don't realize that there is a companion to
CMPPFM called MRGSRC (Merge Source Physical File).  I've only used it a few
times, a long long time ago; could never get comfortable to trust it, always
had to verify what it did and that took more time than if I just did the
"merge" myself.  But still, pretty neat stuff.

Tom, I understand that 20 bytes of hash is never going to absolutely
guarantee that two generations of the same hash value mean that the two
source members are identical.  Still, 20 bytes = 16**20 =
1,208,925,819,614,629,174,706,176 --- I think those are pretty good odds.

Also, I had to re-read Bob Crother's original suggestion after Tom clarified
something for me.  I  misinterpreted the "Read the source record in as an
array of 32 bit integers."  Now I'm not sure what that really means.  How do
I turn a source record into an array of 32 bit integers?  Would this be
"better"/more unique than the CIPHER hash that Leif's MIFHASH app will
generate?

- Dan Bale
(I am *NOT* "Dale"
http://archive.midrange.com/midrange-l/200105/msg00281.html )
SAMSA, Inc.
989-790-0507
DBale@SAMSA.com <mailto:DBale@SAMSA.com>
  Quiquid latine dictum sit altum viditur.
  (Whatever is said in Latin seems profound.)