Personal sharing
This article explains how Go 1.24 rewrote its built‑in map with a SwissTable‑based hash table, compares it to Dolt’s SwissMap implementation, and details the underlying data structures, algorithms, and performance benefits.
This article examines typical Go memory‑leak scenarios—including unclosed files, forgotten HTTP response bodies, slice sharing, goroutine and channel misuse, improper finalizers, and outdated ticker handling—provides concrete code examples, and offers practical techniques such as using strings.Clone, buffered channels, and proper defer usage to avoid leaks.
This article explains how Go's testing/synctest experiment speeds up cache expiration tests by using a virtual clock and bubble isolation, providing code examples that reduce a five‑second wait to milliseconds while ensuring reliable concurrent test execution.
This article explains the limitations of Go's runtime.SetFinalizer, introduces the new runtime.AddCleanup function in Go 1.24, demonstrates proper usage with code examples, and highlights important pitfalls and best‑practice tips for reliable resource management.
The article critiques hollow security‑first slogans, explores the endless nature of security, the tension between security and user experience, and offers practical risk‑scoring frameworks and phrasing advice for organizations seeking a realistic balance between protection and usability.
This article explains Go 1.24's new std‑lib weak package, compares it with weak reference implementations in other languages, demonstrates its API with practical code examples, and shows how to build canonicalization maps and fixed‑size caches using weak pointers.
This article explains the newly added os.Root type and os.OpenRoot function in Go 1.24, demonstrates how they restrict file operations to a specific directory, and shows how they prevent classic directory‑traversal exploits such as CVE‑2024‑3400.
This article debunks the common myth that a server can only handle 65,536 TCP connections by exploring the theoretical four‑tuple limits, practical constraints like file descriptors, port ranges, and memory/CPU usage, and explains how the true upper bound is far larger.
This article explains how the Go library BigCache uses sharding, efficient hash functions, and memory‑optimised data structures to deliver high‑concurrency, low‑latency caching, while avoiding GC bottlenecks and providing practical code examples and performance benchmarks.
This guide walks through installing GitLab CE on an M1 MacBook using an ARM Docker image, configuring ports, setting up SSH access, creating a sample project, and registering a GitLab Runner for CI/CD pipelines, all with step‑by‑step commands and code snippets.
