Hash table

[milipili]

"The Google SparseHash project contains several hash-map implementations in use at Google, with different performance characteristics, including an implementation that optimizes for space and one that optimizes for speed. The memory-optimized one is extremely memory-efficient with only 2 bits/entry of overhead."

http://code.google.com/p/google-sparsehash/

[zuzuf]

That's really interesting , I am going to have a look at it

[milipili]

In the same time :
http://sourceforge.net/projects/gperf/

[zuzuf]

the later looks really interesting since it's already used in popular software (compared to google's hash-map implementations which seems unfinished yet).

For example unit categories are mostly known but we use a hash map so we can add new ones without even changing a single line of code, and it could benefit from this . But I think we should keep that for final optimizations ... there are lots of things to optimize first like loading time which is already much shorter than before

[milipili]

The google's hash-map is used every day at Google's.

In fact, the standard hash_map is enough and easy to use, when you know the good namespace

[Balthazar]