Assorted links for Monday, March 17:

1. Faster Go maps with Swiss Tables

   Like sorting algorithms, hash table data structures continue to see improvements. In 2017, Sam Benzaquen, Alkis Evlogimenos, Matt Kulukundis, and Roman Perepelitsa at Google presented a new C++ hash table design, dubbed “Swiss Tables”. In 2018, their implementation was open sourced in the Abseil C++ library.

   Go 1.24 includes a completely new implementation of the built-in map type, based on the Swiss Table design.

2. Harden-Runner detection: tj-actions/changed-files action is compromised

   We are investigating a critical security incident involving the popular tj-actions/changed-files GitHub Action. We want to alert you immediately so that you can take prompt action. This post will be updated as new information becomes available.

3. Highlights from Git 2.49

   1. Faster packing with name-hash v2
   2. Backfill historical blobs in partial clones

4. Life Altering Postgresql Patterns: Many of these apply to all SQL, not just PostgreSQL

   1. Use UUID primary keys
   2. Give everything created_at and updated_at
   3. On update restrict on delete restrict
   4. Use schemas
   5. Enum Tables
   6. Name your tables singularly
   7. Mechanically name join tables
   8. Almost always soft delete
   9. Represent statuses as a log
   10. Mark special rows with a system_id
   11. Use views sparingly
   12. JSON Queries

5. cppmatch

   A header-only C++ library that offers exceptionless error handling and type-safe enums, bringing Rust-inspired error propagation with the ? operator and the match operator to C++.