In Go, enumerations can be created using the `iota` identifier, which simplifies the definition of a series of related constants. The `iota` keyword is reset to 0 whenever the keyword `const` appears, and increments by one for each subsequent line within the constant block.
package main
import (
"fmt"
)
// Define enumeration using iota
type Day int
const (
Sunday Day = iota // 0
Monday // 1
Tuesday // 2
Wednesday // 3
Thursday // 4
Friday // 5
Saturday // 6
)
func main() {
fmt.Println(Sunday) // Output: 0
fmt.Println(Monday) // Output: 1
fmt.Println(Friday) // Output: 5
fmt.Println(Saturday) // Output: 6
}
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?