Python dictionary inspired hash table implementation

[Manfred_Nowak]

Moritz Warning wrote:

> The tests for the build-in AA had to be started ten times since
> the test loop causes out of memory problems. The effect on the
> test result should be negligible.

No. You should reduce the number of operations to 7_500_000.

Sorrily the PyDict seems to be bad suited for adresses out of the 2G-
range. My tests show, that the builtin AA only needs 45% of the time of 
PyDict.

To verify this on your machine set

  ttotal= 512*1024*1024; // 512 MB

and replace "rand()" by "rand() << 2",

which effectively gives 4 byte alligned adresses out of the 2G range.

-manfred