Infrastructure
No. On a small flat object structuredClone runs at 1.28M ops/sec against JSON's 2.07M, and a five-line hand-written deep copy beats both at 8.71M — 6.8x faster than the native call. Use structuredClone anyway, because the fast one silently turns a Date into an empty object and stack-overflows on a c
Games
A failed A* search on a 256x256 grid expands 52,286 nodes — 99.7% of every walkable cell on the map — against 10,920 when a path exists. It costs 7.57 ms instead of 1.66 ms. The heuristic that makes A* fast contributes nothing when the goal is unreachable, because there is no goal to be guided towar
Games
At 100,000 sprites, sorting a shuffled list costs 27.0 ms per frame — 162% of a 60fps budget, before you draw anything. Sorting the same list when it is already in order costs 1.35 ms, and 3.36 ms when 1% of sprites have moved. The sort is not the problem. Rebuilding the list every frame is.
AI & Data
Measured in SQLite FTS5 on Apple M3. A full rebuild of a 100,000-document index costs 1.36s; updating one document costs 0.10ms. Incremental wins until about 9% of the corpus changes in a day at 100k documents, and only 5% at 1M. Plus what heavy churn does to index size and query latency, and what a
Games
Not below about 2,000 spawned objects per frame, and the free-list pool everyone writes made the median frame 2.5x slower at 3,000 spawns and 4.8x slower at 10,000. Allocating a bullet costs 3.55 ns more than reusing one; the pool's own push and pop cost 7.86 ns. What pooling can buy is the tail — b
Integration
We applied 12 realistic breaking changes to a live API and measured which detection method caught each. Runtime validation caught 7 of 12, a recorded golden response 9, property checks 9, TypeScript 0. Validating every response costs about 20 microseconds.
Integration
You send it all again. A 256 MiB single POST killed at 90% wasted 242,221,056 bytes and needed 510,656,512 bytes in total to succeed; the chunked version re-sent 419,430 bytes — 577x less. Measured on Node 23: chunk size against failure rate, resume discovery, per-chunk checksums, parallel chunks, t
AI & Data
A PDF page has no paragraphs, no sentences and often no spaces — it has draw-glyph-here instructions. Sorting those by position, the obvious extraction algorithm, put 0 of 23 consecutive sentence pairs next to each other on our two-column test page. macOS PDFKit got 23 of 23, then broke a letter-spa
Games
The naive version — full state as JSON, every tick — costs 1,101,710 bytes per second per client at 128 entities and 60 Hz, and 141 Mbit/s of server upload for 16 players. Binary packing, 16-bit quantisation, delta encoding and interest management together brought that to 70 payload bytes per tick,
Infrastructure
About 2 microseconds of CPU and 238 bytes of disk per line — and five log lines per request cut a Node 23 server from 68,722 to 46,059 requests per second. Measured: cost per call by log style, the argument-evaluation trap that costs 1,859 ns per disabled debug call, whether stdout blocks the event
AI & Data
A ZIP of XML parts — 17 of them in the document measured here. The trap is the paragraph model. The sentence "Send the invoice before Friday." is stored as 5 separate w:r runs because one letter is bold, and a naive strip-the-tags extractor reads "The unit price is 100200 USD" from a document that s
Games
There is no crossover. A struct-of-arrays layout beat an array of plain objects at every entity count measured, including 1,000 — but at 1,000 it saved 0.005 ms per frame. The saving first reaches a whole millisecond at 184,000 entities. And the cache-locality argument everyone repeats reverses on i