package main
import (
"fmt"
)
func main() {
// Original map of string to int
originalMap := map[string]int{
"one": 1,
"two": 2,
"three": 3,
}
// Inverted map of int to string
invertedMap := make(map[int]string)
for key, value := range originalMap {
invertedMap[value] = key
}
fmt.Println("Original Map:", originalMap)
fmt.Println("Inverted Map:", invertedMap)
}
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?