[fpc-pascal] Sorted map vs hash map ?
serge at arbinada.com
Mon Jul 20 21:12:32 CEST 2015
I did a small test to compare performance of TFPGMap and TFPHashList in
sequential and random accessing values by keys.
The results are not the same than expected.
In theory, the hash map should give O(1) and O(log2 N) for the sorted map.
Any explanations and suggestions are welcome.
More information about the fpc-pascal