All

I’ve posted a solution to problem #11 which asks for the fastest hash routine to retrieve address of table entry given 8 character key for a table of known opcodes:

http://z390.sourceforge.net/z390_Mainframe_Assemble_Coding_Contest.htm

The solution was developed using another program P11FIND.MLC which I’ve also posted which searches for minimum hash table with no duplicate keys for the given primary table using the given hash routine which is a 64 bit divide and then using positive remainder as index.  The divisor it found was 48011 resulting in a 172k+ hash table which will return address of primary table entry using 6 instructions including the BR return.

Surely there are faster routines using less storage and I’d like to see a few.

Don Higgins

mailto:don@...

http://don.higgins.net