c++ STL库里有自定义的hash_map 方法,但是使用起来并不是那么方便
hash_map主要的方法有
find(),insert()
我结合官方API说明一下他们的用法
一、需要特别注意的地方,
1.头文件的引用
2.如何插入一个<key,value>键值对(参考一下代码)
3.find()的返回值
4.如何获取某一个key值相应的value值
hm1_RcIter -> second分别用。first,和,second,指代key和value的值
// hash_map_find.cpp // compile with: /EHsc #define _DEFINE_DEPRECATED_HASH_CLASSES 0 #include <hash_map> #include <iostream> int main( ) { using namespace std; using namespace stdext; hash_map <int, int> hm1; hash_map <int, int> :: const_iterator hm1_AcIter, hm1_RcIter; typedef pair <int, int> Int_Pair; hm1.insert ( Int_Pair ( 1, 10 ) ); hm1.insert ( Int_Pair ( 2, 20 ) ); hm1.insert ( Int_Pair ( 3, 30 ) ); hm1_RcIter = hm1.find( 2 ); cout << "The element of hash_map hm1 with a key of 2 is: " << hm1_RcIter -> second << "." << endl; // If no match is found for the key, end( ) is returned hm1_RcIter = hm1.find( 4 ); if ( hm1_RcIter == hm1.end( ) ) cout << "The hash_map hm1 doesn't have an element " << "with a key of 4." << endl; else cout << "The element of hash_map hm1 with a key of 4 is: " << hm1_RcIter -> second << "." << endl; // The element at a specific location in the hash_map can be found // using a dereferenced iterator addressing the