The post discusses a performance trick for implementing a circular buffer in Go. It initially presents a basic implementation using append calls but highlights the unnecessary allocations it creates. It then introduces an optimized implementation that avoids extra allocations. The post concludes by mentioning a Rust

7m read timeFrom cybernetist.com
Post cover image

Sort: