You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
53 lines
1.3 KiB
53 lines
1.3 KiB
/**
|
|
* File: array_hash_map_test.cpp
|
|
* Created Time: 2022-12-14
|
|
* Author: msk397 (machangxinq@gmail.com)
|
|
*/
|
|
|
|
#include "./array_hash_map.cpp"
|
|
|
|
/* Driver Code */
|
|
int main() {
|
|
/* 初始化哈希表 */
|
|
ArrayHashMap map = ArrayHashMap();
|
|
|
|
/* 添加操作 */
|
|
// 在哈希表中添加键值对 (key, value)
|
|
map.put(12836, "小哈");
|
|
map.put(15937, "小啰");
|
|
map.put(16750, "小算");
|
|
map.put(13276, "小法");
|
|
map.put(10583, "小鸭");
|
|
cout << "\n添加完成后，哈希表为\nKey -> Value" << endl;
|
|
map.print();
|
|
|
|
/* 查询操作 */
|
|
// 向哈希表中输入键 key ，得到值 value
|
|
string name = map.get(15937);
|
|
cout << "\n输入学号 15937 ，查询到姓名 " << name << endl;
|
|
|
|
/* 删除操作 */
|
|
// 在哈希表中删除键值对 (key, value)
|
|
map.remove(10583);
|
|
cout << "\n删除 10583 后，哈希表为\nKey -> Value" << endl;
|
|
map.print();
|
|
|
|
/* 遍历哈希表 */
|
|
cout << "\n遍历键值对 Key->Value" << endl;
|
|
for (auto kv : map.pairSet()) {
|
|
cout << kv->key << " -> " << kv->val << endl;
|
|
}
|
|
|
|
cout << "\n单独遍历键 Key" << endl;
|
|
for (auto key : map.keySet()) {
|
|
cout << key << endl;
|
|
}
|
|
|
|
cout << "\n单独遍历值 Value" << endl;
|
|
for (auto val : map.valueSet()) {
|
|
cout << val << endl;
|
|
}
|
|
|
|
return 0;
|
|
}
|