A Go proposal (#79179) provisionally accepted to add a memory_space sample type to heap/alloc profiles, providing a full memory hierarchy from RSS down to live/dead heap, stacks, runtime, and non-Go memory, solving the long-standing gap where heap profiles show only about 50% of actual RSS.
Go proposal #75047 aims to automatically attach goroutine labels (test name and iteration) during test execution, enabling developers to quickly identify which test owns a stuck goroutine in timeout dumps, leveraging the existing pprof label mechanism and runtime traceback enhancements.
An analysis of the 171 open Go proposals that have been marked Accepted but remain unimplemented, revealing that over half have been pending for more than five years, the categories most affected, the reasons behind the backlog, and recent signs that the Go team is accelerating their resolution.
The Go core team’s experimental HTTP/3 proposal, first introduced in 2024, has been postponed despite years of community demand, highlighting challenges in API design, backward compatibility, resource allocation, and the practical dominance of HTTP/2 over the newer protocol.
This article explains a Go proposal to add unique Goroutine identifiers and start program counters to the runtime profiling API, detailing the background problem, example code, the suggested API changes, community discussion, and the practical impact on performance analysis.
This article examines the recent Go proposal to add a GOOS=none target, enabling Go programs to run on bare‑metal hardware without an operating system, outlines the TamaGo project's achievements, discusses compatibility challenges, and evaluates the potential impact on Go’s future development and use cases.
This article reviews the Go memory model first written in 2009, highlights missing documentation for sync and sync/atomic APIs, proposes concrete textual and typed‑atomic extensions, and explains why certain compiler optimizations must remain prohibited to preserve clear, race‑free semantics.
The Meituan Robotics Research Institute (MARS) is calling full‑time university scholars and researchers to submit independent research proposals for 2024 projects—selected from a predefined topic list, evaluated by Meituan and external experts on novelty, business value and feasibility, and eligible for up‑to ¥200,000 funding, on‑site interns, fast‑track graduate hiring and de‑identified data, with applications due 10 Nov 2024 and projects starting Dec 2024 or Jan 2025.
This article explains the behavior of NaN values in Go maps, demonstrates a related IEEE‑754 quiz, and discusses the ongoing proposal to introduce a delete(m) function that can reliably clear maps even when they contain NaN keys.
This article reviews recent TC39 proposal progress—including decorators reaching Stage 3, type annotations advancing to Stage 1, new immutable array methods, RegExp set notation, decorator metadata, and function.once—detailing their syntax, semantics, migration considerations, and example implementations for modern JavaScript development.
JavaScript’s upcoming “Change Array by copy” proposal introduces four non‑destructive array methods—.toReversed(), .toSorted(), .toSpliced(), and .with()—which provide immutable alternatives to existing destructive methods, and the article explains their behavior, usage examples, and polyfills while the proposal is in stage 3.
The article explains the recent TC39 progress of the reversible‑string‑split proposal, outlines the criteria for advancing to Stage 1, compares JavaScript’s split behavior with other languages, and describes the new splitN method that restores reversibility while preserving existing split semantics.
