rkletr

@merkletr.ee

cryptography liker. ctf player. array languager? music enjoyer. en/frCA. SPDX-License-Identifier: 0BSD

Album cover of Yard Act - You're Gonna Need A Little Music

tauon accounts settings. has lfm, "airsonic"

$const idArgs = () => { args._.filter(it => typeof it !== "number").forEach(it => console.error(`warn: ${it} is not a valid item id`)); return args._.filter(it => typeof it === "number"); }; const requireDef = <T>(t: T, msg: string): NonNullable<T> => { if (t === undefined) throw new Error(msg); return t!; } const requireArg = <T extends keyof typeof args>(arg: T) => requireDef(args[arg], `argument ${arg} is required`); const J = (x: unknown) => console.log(JSON.stringify(x)); // TODO: --human const cmds = { "prime": async () => { const parts: Record<string, string> = { itemTypes: itemTypes.join("|"), statuses: statuses.join("|"), linkArgs: linkTypes.map(([a,b]) => `--${a} <id> --${b} <id>`).join(" "), wqSrc: resolve(src, "wq"), }; console.log(await Deno.readTextFile(resolve(src, "PRIMER.md")) .then(it => it.replaceAll(/\{([^\}]+)\}/g, (_,k) => parts[k]))); }, "show": () => J(idArgs().map(id => show(id) || console.error(`warn: item ${id} does not exist`)).filter(it => it)), "create": () => J(show(db.cItem(requireArg("type"), args.status || "open", requireArg("name"), requireArg("description"))!)), "update": () => pipe(pipe(issueFields.filter(k => args[k]), fields => pipe(E(`UPDATE item SET ${binds(fields)} WHERE id = ?`), stmt => pipe(fields.map(k => args[k]), vals => pose<[number], RestBindParameters, void>(stmt, id => [...vals, id])))), doUpdate => J(idArgs().map(id => { doUpdate(id); return show(id); }))),$

$The field keyword The token field enables you to write a property accessor body without declaring an explicit backing field. The token field is replaced with a compiler synthesized backing field. For example, previously, if you wanted to ensure that a string property couldn't be set to null, you had to declare a backing field and implement both accessors: private string _msg; public string Message { get => _msg; set => _msg = value ?? throw new ArgumentNullException(nameof(value)); } You can now simplify your code to: public string Message { get; set => field = value ?? throw new ArgumentNullException(nameof(value)); }$

An overhead digital display inside a VIA Rail train showing the train to Ottawa is stopped at 0 km/h.

Code snippet showing a private method #min(), followed by an empty private method #add(). VSCode interpreted #add as a color code and added a colored square.

laptopsrv under a chair on top of the fridge

$daul v4(?); k-ish but readable for normal people? 1+2*3-4 // 3 var a = 1 // mut val b = a // const [1, 2, 3] // array ["a": 1, 2: 3] // table [3,2,1][1] // 2 [3,2,1][:-1] // [3,2] [3,2,1]@[1,2] // [2,1] // scalar extension & implicit each [0, 1] + 1 // [1, 2] [0, 1] + [2, 3] // [2, 4] [[1,2],[3,4]] + [1,5] // [[2,3],[8,9]] // functions \{ 1; 2 } // f() // 2 \a{a+1} // f(1) // 2 1+ // f(1) // 2 /2 @ 1+ // f(3) // 2 \a,b{b} // f(1,2) // 2 \a\b{b} // f(1)(2) // 2 \a[a] // f(2) // [2] \[1, 2] // f()[1] // 2 \["recursive": self] \["v":2,"m":\{self.v}] // val o = f(); o.m() // 2 // for loops work the same but val of a for loop is val of its last iter // list/table comprehensions give values of all iters [for(x:X) x+1] [for(k,v:tbl) k: v+1] // each [for(x,y:X,Y) x*y] [for(x,y,z:X,tbl) ...] // zip [for(x:X) for(y:Y) x*y] [for(x:X; y:Y) x*y] // cartesian product \f,X[for(x:X) if(f(x)) x] // filter \f,X,a{for(x:X) a = f(a,x)} // foldl k: a f/X \f,X,a[for(x:X) a = f(a,x)] // scanl k: a f\X \f,X[for(a,b:X,X[1:]) f(a,b)] // eachprior k: f':X \A,B[for(a:A) fold(+)(a*B)] // matmul k: (+/*)\:$

XerahS: A cross-platform port of the popular ShareX

https://github.com/ShareX/XerahS

empty room after puzzle from The Beginner's Guide

the scrobbly main interface with a little bit of example data. in order:
buttons for "inject EEn (4mg)" and "pay rent ($1000)", the latter colored blue
a list of active reminders, with one item: "you should pay rent (2 weeks ago)"
number input and buttons for 4 tasks: inject EEn, go outside, pay rent (again blue), buy stupid shit (this one colored red)
a table of two recent events
management links for buttons, reminders, quotas, tasks, units

current stats for @priv.merkletr.ee: 825 posts, 312 follows, 67 users

tables of files, lines, blank lines, comment lines, and code lines per programming language:

On the line for TypeScript, the amount of code line, 231, is highlighted

Top albums of 2025

1. clipping. — Dead Channel Sky
2. KAYTRANADA — Timeless
3. P.O.S. — Never Better
4. The Prodigy — Invaders Must Die
5. KAYTRANADA — 99.9%
6. Black Eyed Peas — The E.N.D. (The Energy Never Dies)
7. Mr. Oizo — Lambs Anger
8. LCD Soundsystem — Sound of Silver
9. Fox Stevenson — Killjoy
10. The Dare — What's Wrong With New York?
11. LCD Soundsystem — LCD Soundsystem
12. Yard Act — Where’s My Utopia?
13. The Dare — The Sex EP
14. Sammy Virji — Same Day Cleaning
15. The Prodigy — The Day Is My Enemy
16. Streetlight Manifesto — Everything Goes Numb
17. Nitepunk — HUMAN
18. Fatboy Slim — Halfway Between the Gutter and the Stars
19. Infinitefreefall — Belief Systems
20. Black Eyed Peas — Monkey Business
21. Black Eyed Peas — The Beginning
22. Death Grips — The Powers That B
23. Justice — Hyperdrama
24. Viagra Boys — Cave World
25. Franz Ferdinand — Franz Ferdinand

$(+//<':;+/*|:)@\:(83=*i){(x*~y)+(1_b,0)+0 :':b:x*y}\94=i:0:"i/7"$

$o:(+/;*/)@"*"=rx/ +/\*|i:=-read"i/6" \+/o@'+"v"$-1_i \+/o@'"v"$1_'rx/^ *$/_"","c"$+"c"$-1_i$

$(r;s):"\n"\'"\n\n"\1:"i/5"; s:.'s r:@[+@/1<:\.''"-"\'r;1;1+] r:r@\:&~<':*|r r:r@'&'~1(,[;0]1_)\~>/@[r;1;0 :':] +/~2!(,/+r)'s /p1 +/-/|r /p2$

$i:"@"=0:"i/4" f:&/1(5>2(+3+/':,[;0]0,)/)\ +//f i /p1 +//i-{x-f x}/i /p2$

$+/'(.*|)'',\:[,'0:"i/3";""]{(1_v_*x;x[1],(*x)v:*>y_*x)}/\:/:-|'!'2 12$

$i:.''0:"i/3" f:{v:*>(-y)_*x;(1_v_*x;x[1],x[0;v])} +/{10/*|(x;!0)f/1 0}'i /p1 +/{10/*|(x;!0)f/|!12}'i /p2$

$+/~100!i:50+\.'@[;0;"--"5!]'0:"i/1" /p1 +/50(-/-100!@/1>:\-/1>/\,)':i /p2$

root@redacted:~# docker compose up -d --build
[+] Building 1037.0s (14/14) FINISHED

data Did = DidPlc Text | DidWeb Text

parseDid :: Text -> Maybe Did
parseDid (stripPrefix "did:plc:" -> Just v) = Just $ DidPlc v
parseDid (stripPrefix "did:web:" -> Just v) = Just $ DidWeb v
parseDid _ = Nothing

$some jetstream record creation and deletion messages, shown in the haskell's usual Show format: Just (JetstreamMsg {did = "did:plc:qzozzub46fuyaosodwdgdjii", time_us = 1762102112711625, commit = Commit {operation = "create", collection = "app.bsky.feed.post", rkey = "3m4nxjb2g722k", record = Just (PostRecord (Just (ReplyRef {parent = Ref "at://did:plc:3uxrjyskvgpjaotpkbahemfv/app.bsky.feed.post/3m4nei2qkd22i", root = Ref "at://did:plc:3uxrjyskvgpjaotpkbahemfv/app.bsky.feed.post/3m4nei2qkd22i"})))}})$

Album cover of Ochre - Lemodie

https://ochre.bandcamp.com/album/lemodie

Extract from https://www.sqlite.org/flextypegood.html

4.2. Rigid type enforcement helps prevent application bugs

It has become a point of doctrine among many programmers that the best way to prevent application bugs is strict type enforcement. But I find no evidence in support of this.

To be sure, strict type enforcement does help prevent some kinds of bugs in lower-level languages like C and C++ that present a model that is close to machine hardware. But this does not seem to be the case for higher-abstraction languages in which all data is passed around in a "Value" superclass of some kind which is subclassed for the various lower-level data types. When everything is a Value object, specific datatypes cease to be important.

This technical note is authored by the original author of SQLite. I have been writing TCL programs for 27 years. TCL has no type enforcement whatsoever. The "Value" class in TCL (called Tcl_Obj) can hold many different datatypes, but it presents the content to the program and to the application user as a string. And I've had a lot of bugs in those TCL programs over the years. But I do not recall a single instance where the bugs might have been caught by a rigid type system. I have also written a lot of C code over a span of 35 years, not the least of which is SQLite itself. I have found the type system in C to be very helpful at finding and preventing problems. For the Fossil Version Control System, which is written in C, I have even implemented supplemental static analysis programs that scan the Fossil source code prior to compilation, looking for problems that compilers miss. This works well for compiled programs.

[...alt text character limit too short...]

Album (well, single) cover of XEDRA - FAKE ID

except from https://go.dev/blog/generic-interfaces

// OrderedSet[E] does not satisfy Set[E] (method All has pointer receiver)
Unique[E, OrderedSet[E]](slices.Values(s))
// panic: invalid memory address or nil pointer dereference
Unique[E, *OrderedSet[E]](slices.Values(s))

The first problem is clear from the error message: Our type constraint says that the type argument for S needs to implement the Set[E] interface. And as the methods on OrderedSet use a pointer receiver, the type argument also has to be the pointer type.

When trying to do that, we run into the second problem. This stems from the fact that we declare a variable in the implementation:

var seen S

If S is *OrderedSet[E], the variable is initialized with nil, as before. Calling seen.Insert panics.

If we only have the pointer type, we cannot get a valid variable of the value type. And if we only have the value type, we cannot call pointer-methods on it. The consequence is that we need both the value and the pointer type. So we have to introduce an additional type parameter PS with a new constraint PtrToSet:

// PtrToSet is implemented by a pointer type implementing the Set[E] interface.
type PtrToSet[S, E any] interface {
*S
Set[E]
}

// Unique removes duplicate elements from the input sequence, yielding only
// the first instance of any element.
func Unique[E, S any, PS PtrToSet[S, E]](input iter.Seq[E]) iter.Seq[E] {
return func(yield func(E) bool) {
// We convert to PS, as only that is constrained to have the methods.
// The conversion is allowed, because the type set of PS only contains *S.
seen := PS(new(S))
for v := range input {
if seen.Has(v) {
continue
}
if !yield(v) {
return
}
seen.Insert(v)
}
}
}

"It is a regrettable historic error"

https://pkg.go.dev/time#Layout

$screenshot of a terminal showing that this daul source code: setmetatable([], ["__index":\s,k->s[k]=[]]) compiles to the following lua source code: return setmetatable({},{["__index"]=(function(s,k)local _0={};(s)[k]=_0;return _0;end)});$