package main
import (
"fmt"
)
// Define a struct
type Person struct {
Name string
Age int
}
func main() {
// Create a map with Person struct as keys
people := make(map[Person]string)
// Create some Person instances
john := Person{Name: "John", Age: 30}
jane := Person{Name: "Jane", Age: 25}
// Add entries to the map
people[john] = "Engineer"
people[jane] = "Designer"
// Access and print the values
for person, occupation := range people {
fmt.Printf("%s is a %s\n", person.Name, occupation)
}
}
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?