541
The Zen of Erlang
This is a loose transcript (or long paraphrasing?) of a presentation given at ConnectDev'16, a conference organized by Genetec in which I was invited to speak.
Most cited
Posts that commenters keep linking to, ranked by how many different people have cited them in Hacker News comments. 3,470 posts.
542
Go fonts
Announcing the Go font family, by Bigelow & Holmes.
543
544
How to write a Git commit message (2014)
Commit messages matter. Here's how to write them well.
545
546
JEP 295: Ahead-of-Time Compilation
Improve the start-up time of both small and large Java applications, with at most a limited impact on peak performance.
547
So what's wrong with 1975 programming? (2008)
Vinyl Cache (formerly known as “Varnish Cache”) is a web application accelerator also known as a caching HTTP reverse proxy. You install it in front of any server that speaks HTTP and configure it to cache the contents. Vinyl Cache is really, really fast. It typically speeds up delivery with a factor of 300-1000×…
548
Upstreaming Linux kernel support for the Snapdragon X Elite
Discover the power of Snapdragon X Elite with upstreamed Linux kernel support. Explore areas of focus and unlock new potential with Snapdragon Linux today.
549
Message threading (1997-2002)
In this document, I describe what is, in my humble but correct opinion, the best known algorithm for threading messages (that is, grouping messages together in parent/child relationships based on which messages are replies to which others.) This is the threading algorithm that was used in Netscape Mail and News 2.0…
550
Linkers and Loaders (1999)
The text in these files is the unedited original manuscript. M-K has fine copy editors, who have fixed all the minor typos, spelling, and grammar errors in the printed book, but if you come across factual errors I'd still appreciate help getting all the details of linking and loading as complete and correct as…
551
552
Notes on Programming in C – Rob Pike (1989)
What follows is a set of short essays that collectively encourage a philosophy of clarity in programming rather than giving hard rules. I don't expect you to agree with all of them, because they are opinion and opinions change with the times. But they've been accumulating in my head, if not on paper until now, for a…
553
How Beeper Mini Works
It’s a technical deep dive, so buckle up!
554
Fix Your Timestep
Introduction Hi, I’m Glenn Fiedler and welcome to Game Physics. In the previous article we discussed how to integrate the equations of motion using a numerical integrator. Integration sounds complicated, but it’s just a way to advance the your physics simulation forward by some small amount of time called “delta time”…
555
Code's Worst Enemy
If you could snap your fingers and bring Perl 6 on Parrot's implementation up to the level of Rhino's, would you still choose JavaScript?
556
Locking in WebKit
We recently replaced all spinlocks, OS-provided mutexes, and condition variables in WebKit with the new WTF::Lock and WTF::Condition — these new primitives have some cool properties.
557
Scott Aaronson explains his $200k bet (8 Signs A Claimed P≠NP Proof Is Wrong)
As of this writing, Vinay Deolalikar still hasn’t retracted his P≠NP claim, but a clear consensus has emerged that the proof, as it stands, is fatally flawed. The first reason is that weR…
558
Crit-bit Trees: the best way to store sets
A crit-bit tree can be used as a high-speed associative array. For example, an array mapping 54 to 1, 19 to 2, 99 to 3, 85 to 4, and 88 to 5 can be stored as a crit-bit tree containing 54=1, 19=2, 99=3, 85=4, and 88=5. The smallest string in the crit-bit tree larger than 85= is 85=4.
559
Version SAT
The package version selection problem is to find a set of dependencies that can be used to build a top-level package P that is complete (all dependencies satisfied) and compatible (no two incompatible packages are selected). There may be no such set, because of the diamond dependency problem: perhaps A needs B and C…
560
Making SetInterval Declarative with React Hooks
How I learned to stop worrying and love refs.
561
A guide to useEffect in React
Effects are a part of your data flow.
562
The Emacs Problem (2005)
The Emacs Problem Stevey's Drunken Blog Rants™ Charles G. pointed out in an email discussion recently: Lisp still doesn't seem like the right language for doing text manipulation, and nothing I've seen from the Emacs libraries is making me think any differently. It sure beats the hell out of Java
563
Big Ball of Mud (1999)
While much attention has been focused on high-level software architectural patterns, what is, in effect, the de-facto standard software architecture is seldom discussed. This paper examines the most frequently deployed architecture: the BIG BALL OF MUD
564
Mixing Swift and C++
Swift is a general-purpose programming language built using a modern approach to safety, performance, and software design patterns.
565
566
Peritext: A CRDT for Rich-Text Collaboration
Collaboration on rich text is hard to model with plain-text approaches. We review the challenges and how to construct a CRDT for rich text.
567
Performance Improvements in .NET 5
Explore many performance improvements, big and small, that have gone into the .NET 5 runtime and core libraries to make apps and services leaner and faster.
568
Parallelism is not concurrency
In an earlier post I mentioned that one goal of the new introductory curriculum at Carnegie Mellon is to teach parallelism as the general case of computing, rather than an esoteric, specialized sub…
569
Nearly All Binary Searches and Mergesorts Are Broken (2006)
Posted by Joshua Bloch, Software EngineerI remember vividly Jon Bentley's first Algorithms lecture at CMU, where he asked all of us incoming Ph.D. ...
570
"I Contribute to the Windows Kernel. We Are Slower" (2013)
I was explaining on Hacker News why Windows fell behind Linux in terms of operating system kernel performance and innovation. And out of nowhere an anonymous...