What about a hashmap in irr::core?

[Massengrab]

Hi!

I always missed something like a hash in the irrlicht library. So i propose to add the following:

An interface with the method

Code: Select all

u32 getHash()

which has to be overwritten by eash class which should be able to be put in the hash.


As Hash itself i'd suggest to use a avl-tree with the hash as key.


Moreover i would add this method to some of the other standard classes like string.

What do you think about it? If you support the idea i could post a reference implementation in about one day

[elander]

It's easier if you just study these that are already made in a pro way and add whatever you want:

http://www.cs.fiu.edu/~weiss/dsaa_c++3/code/
http://www.cs.fiu.edu/~weiss/#dsaac++3

No need to reinvent what is already invented.

[vitek]

http://www.open-std.org/jtc1/sc22/wg21/ ... n1456.html

Several C++ standard library implementations provide std::hash_map and std::hash_set. There is also std::tr1::unordered_set and std::tr1::unordered_map that are offered by the more up-to-date environments. The interfaces are very similar. I believe that the boost library has unordered_set and unordered_map implementations.

[Massengrab]

i know that there are tons of implementations but irrlicht also uses irr::core::array instead of std::vector, irr::core::string instead of std::string, etc. so i thought it would be useful to have a libpng-licensed hash class in the irrlicht core lib, too