Russ Cox

@swtch.com

4676 Followers 54 Following

New Yorker cartoon with a dog at a desktop PC telling a dog on the floor, “On the internet, nobody knows you’re a dog.”

Google search for “mermaid dfa” replies: It looks like you are searching for either a Deterministic Finite Automaton (DFA) syntax or the visual/audio artist Mermaid Chunky (who is signed to DFA Records).

The three stages in gradual code repair. First, add the new API, but leave forwarding definitions to keep existing clients working. Second, update the existing clients, which can happen in many small independent changes. Third, remove the forwarding definitions. (Sometimes, for compatibility, the forwarding definitions are never removed, and that can be okay too.)

Diff showing the addition of

// Value is the old name for Val.
// Run “go fix” to update client code to use Val instead of Value.
//
//go:fix inline
type Value = Val

and then renaming Value to Val in its original definition and doc comment.

“This means we’ll need 140 trillion quantum circuits of 724 logical qubits each operating in parallel for 10 years to break AES-128 with Grover’s.”

Screen shot of the "Frustration detection via regex" section of the linked article, showing in particular the regexp used.

Graph of servers involved in serving Go releases, to understand attack surfaces where nefarious code could be introduced.

op d shift3 m = (-1 0 1 @* d) @shift m
op d MAS m = T and/ 'MAS' == T d shift3 m
op d xMAS m = (d MAS m) or (-d) MAS m
op xMAS m = (1 1 xMAS m) and 1 -1 xMAS m
op solve2 x = +/+/ xMAS pad x

solve2 sample
solve2 input

sample = read "sample.txt"
input = read "input.txt"

dirs = d, -d=4 2 rho 1 0, 0 1, 1 1, -1 1

op T x = transp x
op pad x = T (T x, '.'), '.'
op d shift m = T d[2] rot T d[1] rot m
op d shift4 m = (0 1 2 3 @* d) @shift m
op d XMAS m = T and/ 'XMAS' == T d shift4 m
op solve x = +/+/+/ dirs @XMAS pad x

solve sample
solve input

$op c step2 s = (rho s) == 0: c step2 s step2 (0 0 0 0 +1) c == 'd': -1, 0, 0, s[4], s[5] # do() ... (s[1] == -1) and c == 'o': -2, 0, 0, s[4], s[5] (s[1] == -2) and c == '(': -3, 0, 0, s[4], s[5] (s[1] == -3) and c == ')': 0, 0, 0, s[4], +1 (s[1] == -2) and c == 'n': -4, 0, 0, s[4], s[5] # or don't()... (s[1] == -4) and c == '\'': -5, 0, 0, s[4], s[5] (s[1] == -5) and c == 't': -6, 0, 0, s[4], s[5] (s[1] == -6) and c == '(': -7, 0, 0, s[4], s[5] (s[1] == -7) and c == ')': 0, 0, 0, s[4], -1 s[5] == +1: (c step -1 drop s), s[5] 0, 0, 0, s[4], s[5] op solve2 x = (step2/ flip x)[4] solve2 sample solve2 input$