// Import GORM and the driver for your database
import (
"gorm.io/driver/sqlite"
"gorm.io/gorm"
)
// Define a struct that maps to your database table
type User struct {
ID uint
Name string
Email string
}
func main() {
// Initialize the GORM database connection
db, err := gorm.Open(sqlite.Open("test.db"), &gorm.Config{})
if err != nil {
panic("failed to connect to the database")
}
// Migrate the schema
db.AutoMigrate(&User{})
// Create
db.Create(&User{Name: "John Doe", Email: "john@example.com"})
// Execute a query and scan rows
var users []User
db.Find(&users) // Equivalent to SELECT * FROM users
for _, user := range users {
fmt.Println(user.ID, user.Name, user.Email)
}
}
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?