rustExample of Box Rust HashMap

A HashMap in Rust is a data structure that stores key-value pairs. It is similar to a Dictionary in other languages. The HashMap is implemented using a hash table, which allows for efficient lookups.

Example code

use std::collections::HashMap;

let mut scores = HashMap::new();

scores.insert(String::from("Blue"), 10);
scores.insert(String::from("Yellow"), 50);

let team_name = String::from("Blue");
let score = scores.get(&team_name);

println!("{:?}", score);

Output example

Some(10)

Code explanation

1. use std::collections::HashMap; - This imports the HashMap type from the std::collections module.

2. let mut scores = HashMap::new(); - This creates a new HashMap called scores.

3. scores.insert(String::from("Blue"), 10); - This inserts a key-value pair into the HashMap, with the key being a String containing the value "Blue", and the value being an i32 containing the value 10.

4. let team_name = String::from("Blue"); - This creates a String containing the value "Blue".

5. let score = scores.get(&team_name); - This looks up the value associated with the key team_name in the HashMap.

6. println!("{:?}", score); - This prints the value associated with the key team_name in the HashMap.

Helpful links

• Rust HashMap Documentation

Edit this code on GitHub