package main
import (
"github.com/jinzhu/gorm"
_ "github.com/jinzhu/gorm/dialects/sqlite"
"log"
)
type User struct {
ID uint `gorm:"primary_key"`
Name string `gorm:"size:255"`
Age uint
}
func main() {
db, err := gorm.Open("sqlite3", "test.db")
if err != nil {
log.Fatal(err)
}
defer db.Close()
// Migrate the schema
db.AutoMigrate(&User{})
// Prepare statement
stmt, err := db.DB().Prepare("INSERT INTO users (name, age) VALUES (?, ?)")
if err != nil {
log.Fatal(err)
}
defer stmt.Close()
// Execute prepared statement
_, err = stmt.Exec("Alice", 30)
if err != nil {
log.Fatal(err)
}
log.Println("User added successfully")
}
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?