Polynomial interpolation is a method of finding a polynomial function that fits a given set of data perfectly. More concretely, suppose we have a set of n+1 distinct points [1]: \[(x_0,y_0), (x_1, y_1), (x_2, y_2)\cdots(x_n, y_n)\] And we want to find the polynomial coefficients...
This page is auto-generated from Github Actions workflow that runs every day at night and fetches the 5 latest articles from each of my favorite blogs.
A description of some of the recent changes to do allocations on the stack instead of the heap.
#591 — February 27, 2026 Read the Web Version Go Weekly Bubble Tea, Lip Gloss, and Bubbles v2 — The Charm ecosystem of TUI tooling has taken a synchronized leap up to version 2. Bubble Tea v2 includes the ‘Cursed Renderer’, an a...
We’ll be working with the set P_n(\mathbb{R}), real polynomials of degree \leq n. Such polynomials can be expressed using n+1 scalar coefficients a_i as follows: \[p(x)=a_0+a_1 x + a_2 x^2 + \cdots + a_n x^n\] Vector space The set P_n(\mathbb{R}), along with …
How Go 1.20's WithCancelCause and Go 1.21's WithTimeoutCause let you attach a reason to context cancellation, plus a gotcha with manual cancel and the stdlib pattern that covers every path.
In the previous article we explored how the Go runtime bootstraps itself — how a Go binary goes from the operating system handing it control to your func main() running. During that bootstrap, one of the first things the runtime sets up is the memory allocator. And that’...
Happy 2026! The first release of the year is here, and it is packed with goodies!
How Python and Kotlin provide structured concurrency out of the box while Go achieves the same patterns explicitly using errgroup, WaitGroup, and context.