Billion-query-per-second lookup tables in C++
C++ lookup tables can process up to a billion queries per second. Their performance depends on careful design and optimization. (lemire.me)
Assembly Nights describes a self-directed effort to learn x86 assembly by working late at night on a 14-year-old Asus eeePC running Alpine Linux. The writer’s interest in systems programming, sparked by Zig, led to a long-standing goal: understand Richard Jones’s JonesForth and port it from GNU assembler syntax to NASM. After completing a beginner NASM tutorial, the writer found the port far more challenging than expected, especially translating essential macros. Progress is slow, but solving individual problems has made the work rewarding.
The project’s setup is part of the learning method: the small, distraction-light laptop is configured to open the code, Vim, and GDB quickly, making it easy to begin even when tired. When a self-imposed deadline led to rushed translation, the writer chose instead to verify each instruction, learn GNU Screen, and record debugging sessions as project logs. The central argument is that finishing the port is less important than learning the tools and enjoying sustained progress. The writer contrasts this with projects that often lose momentum, noting that this one offers dependable forward movement whenever time is spent on it. Resources include the NASM tutorial, GDB documentation and book, x86 instruction references, and an assembly programming book. After the port, the writer plans to continue with Forth.
Summary generated by AI from the linked article. hn.today is not affiliated with Hacker News or Y Combinator.
C++ lookup tables can process up to a billion queries per second. Their performance depends on careful design and optimization. (lemire.me)
Emacs debuted at MIT in 1976, bringing programmers a full-screen text editor that remains widely used today. Its roots in TECO and a culture of sharing helped shape the free software movement and GNU/Linux. (technologyreview.com)
C++ lookup tables can be optimized for extremely high query throughput, with the title claiming a billion queries per second. The topic is techniques for building fast lookup tables. (lemire.me)
Moxnox 1.0 is an NT-like, POSIX-compatible operating system that runs atop Btrfs. Its source code is available on GitHub. (github.com)
china-policy-data provides a free daily JSON feed of Shanghai government grant and subsidy notices. The feed is designed for researchers and AI agents. (github.com)
Slughorn is a C++20 library for rendering vector graphics on the GPU, with a canvas API for creating shapes, gradients, and composites. It imports SVG and other graphics formats and supports OpenGL, Vulkan, WebGPU, DirectX, and Python bindings. (slughorn.io)
Today's best Hacker News stories, summarized and screenshotted, one email a day.