package main
import (
"log"
"time"
"github.com/nats-io/nats.go"
)
func main() {
// Set options for NATS connection
options := []nats.Option{nats.Name("NATS Example")}
// Connect to NATS server
nc, err := nats.Connect(nats.DefaultURL, options...)
if err != nil {
log.Fatal(err)
}
defer nc.Close()
// Set up a reconnect handler with exponential backoff
nc.SetDisconnectHandler(func(nc *nats.Conn) {
log.Printf("Disconnected from NATS: %v", nc.LastError())
})
nc.SetReconnectedHandler(func(nc *nats.Conn) {
log.Printf("Reconnected to NATS server: %v", nc.ConnectedUrl())
})
nc.SetClosedHandler(func(nc *nats.Conn) {
log.Printf("Connection closed: %v", nc.LastError())
})
// Simulate work with a delay to mimic application workload
for {
log.Println("Doing some work...")
time.Sleep(2 * time.Second)
}
}
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?