CAFxX

The distance between deciding and doing is the single most reliable predictor of whether your life will be extraordinary or ordinary. Not talent, not circumstances, not even the quality of your decisions-but how quickly you collapse the space between intention and reality. Think of this gap as a kind of friction coefficient on your existence: the smaller it is, the more of your internal force actually translates into external motion. When you can move from "I should do this" to physically doing it within hours instead of weeks, you're not just accomplishing more-you're operating in a fundamentally different mode of being where your thoughts have immediate consequences in the world, where your inner life and outer life are in constant, tight conversation.

This matters profoundly because success isn't really about outcomes-it's about iteration speed. The person who can decide and act in the same breath gets ten attempts at something while someone with a week-long gap between decision and execution gets one. Th

CAFxX

CAFxX

Bulk memory allocations for Go

Consider the following code:

s := make([]*Foo, N)
for i := range s {
  s[i] = new(Foo)
  // ...
}

CAFxX

package interncache

import (
    "encoding/binary"
	"iter"
	"maps"
    "math"
    "math/bits"
    "math/rand/v2"
	"sync/atomic"

CAFxX

package main

import (
	"fmt"
	"math/bits"
	"slices"
	"sort"
	"strings"
	"unicode"
)

CAFxX

Notes for a proposal to add per-session and/or per-transaction commit delay to postgresql.

Per session/transaction commit delay

Currently postgres has the commit_delay and commit_sibling global configurations.

To better support mixed workloads it would be significantly easier if a bit more flexibility was permitted, e.g. by allowing individual sessions or transactions to specify different acceptable commit delays, while still providing all required guarantees.

Proposal

CAFxX

Transparent heap object reuse for Go

a.k.a. have most hot allocation paths be transparently served by dedicated freelists managed by the compiler and runtime

Important

This document is a work in progress. Early feedback and discussions are welcome.

Known TODOs:

• How to handle slices

CAFxX

// https://go.dev/play/p/374e3zUuZmE

package main

import (
	"crypto/rand"
	"flag"
	"fmt"
	"maps"
	"math/big"

CAFxX

As part of a reasoning step, Gemini 2.5 Pro Preview 03-25 randomly blurted out: 

---

If multiple possible answers are available in the sources, present all possible answers.
If the question has multiple parts or covers various aspects, ensure that you answer them all to the best of your ability.
When answering questions, aim to give a thorough and informative answer, even if doing so requires expanding beyond the specific inquiry from the user.
If the question is time dependent, use the current date to provide most up to date information.
If you are asked a question in a language other than English, try to answer the question in that language.
Rephrase the information instead of just directly copying the information from the sources.

CAFxX

template <typename T>
static void sort(T* a, int l) {
    #define S(i, j) { \
        T t1 = a[i], t2 = a[j]; \
        if (t1 > t2) { T t = t1; t1 = t2; t2 = t; } \
        a[i] = t1, a[j] = t2;\
    }
    // Sorting networks from https://bertdobbelaere.github.io/sorting_networks.html
    // Using the ones with lower CEs because every S(...) requires two CMOVxx or a
    // VMINSS+VMAXSS pair, and it seems that's the limit per cycle on current