package main
import (
"fmt"
)
func main() {
items := []struct {
Key string
Value string
}{
{"fruit", "apple"},
{"fruit", "banana"},
{"vegetable", "carrot"},
{"fruit", "date"},
{"vegetable", "eggplant"},
}
grouped := make(map[string][]string)
for _, item := range items {
grouped[item.Key] = append(grouped[item.Key], item.Value)
}
fmt.Println(grouped)
}
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?