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.
hello-algo/codes/rust/chapter_hashing/hash_map.rs

49 lines
1.3 KiB

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

/*
* File: hash_map.rs
* Created Time: 2023-02-05
* Author: codingonion (coderonion@gmail.com)
*/
include!("../include/include.rs");
use std::collections::HashMap;
/* Driver Code */
pub fn main() {
// 初始化哈希表
let mut map = HashMap::new();
// 添加操作
// 在哈希表中添加键值对 (key, value)
map.insert(12836, "小哈");
map.insert(15937, "小啰");
map.insert(16750, "小算");
map.insert(13276, "小法");
map.insert(10583, "小鸭");
println!("\n添加完成后哈希表为\nKey -> Value");
print_util::print_hash_map(&map);
// 查询操作
// 向哈希表中输入键 key ,得到值 value
let name = map.get(&15937).copied().unwrap();
println!("\n输入学号 15937 ,查询到姓名 {name}");
// 删除操作
// 在哈希表中删除键值对 (key, value)
_ = map.remove(&10583);
println!("\n删除 10583 后,哈希表为\nKey -> Value");
print_util::print_hash_map(&map);
// 遍历哈希表
println!("\n遍历键值对 Key->Value");
print_util::print_hash_map(&map);
println!("\n单独遍历键 Key");
for key in map.keys() {
println!("{key}");
}
println!("\n单独遍历值 value");
for value in map.values() {
println!("{value}");
}
}