lex1

Lex1 implements a hash table for name-value stores. It generally duplicates the functions of lex so that it should be easy to move between the too.

We've added lex1-delta-distribution to display the number of items in each buchket of the hash table so that one may evaluater how well the hashing algorithm has worked with one's data.

The hashing algorithm itself is lex1-delta-hashPrime. It is based on prime numbers and lex1-delta-init requires one to supply a prime-number. It isn't picky and will take any number. You won't be pleased with the results of a non-prime.

If you have a better hashing alorithm please join the developers here an upload your function.