D
Daniel Heiserer
Hello,
I used a unique associative container such as:
//---------------
map<vector<int>,double> X;
//---------------
In general I fill X with millions of entries.
Sorting plays no role for me. All I need is uniqueness
of the keys and speed when inserting them.
At the end I retrieve them using iterators from the beginning
to the end. Which should lead to constant complexity.
Memory requirement is important but less then speed.
Unfortunately the used "map" is too slow.
I need a faster implementation.
I found hash_map as an alterantive, but it does not work
by simply replacing "map" with "hash_map".
Can anybody help me out?
So is hash_map part of the STL?
When not where can I get a good implementation of it?
I use g++ 3.2.2 on linux.
-- thanks, daniel
I used a unique associative container such as:
//---------------
map<vector<int>,double> X;
//---------------
In general I fill X with millions of entries.
Sorting plays no role for me. All I need is uniqueness
of the keys and speed when inserting them.
At the end I retrieve them using iterators from the beginning
to the end. Which should lead to constant complexity.
Memory requirement is important but less then speed.
Unfortunately the used "map" is too slow.
I need a faster implementation.
I found hash_map as an alterantive, but it does not work
by simply replacing "map" with "hash_map".
Can anybody help me out?
So is hash_map part of the STL?
When not where can I get a good implementation of it?
I use g++ 3.2.2 on linux.
-- thanks, daniel