Brion Vibber @brion@mastodon.technology

I saw that Qantas is restoring their Sydney to Santiago flight, their only connection to South America.

This takes 13 and a half hours to cross the South Pacific, landing 90 minutes before it takes off thanks to the international date line. :D

No in-flight wifi service though... bring a book or something to watch!

https://simpleflying.com/qantas-restores-sydney-santiago-flights/

when ur timeslice expires and the kernel interrupts your process

"What you're referring to as Star Trek is, in fact, Strange GNU Worlds..."

Fashion made from fermented grains, call that oat couture

taking a look through the atari memory map, a 48 KiB machine should allow for 8 KiB of code (either cartridge ROM or loaded from disk) and at least 24 KiB of data pages, to be divided between stack (fixed pointers) and heap (LISP-style nodes).

The stack serves as the garbage collection roots and storage for locals & return records.

Ubuntu "Jammy" is short for "Jamaharon".

https://memory-alpha.fandom.com/wiki/Jamaharon

well, the election's tuesday. we gotta finish that up soon...

there's a ballot drop box convenient to us so i don't usually mail them in early ;)

Took a flight sim break and did one of my comfort routes: VFR from KSNA (Orange County) to KPSP (Palm Springs). Takes about 45 minutes in a little Cessna or similar.

Sometimes I do this by going up to higher altitudes to go over KRIV (March air base), but I stayed around 3000-3500 MSL and went around it instead this time for funsies.

Palm Springs has mountains to the west, so when landing on a northbound runway it's a non-standard right pattern, which is always fun to "mix it up" :D

Also I can optimize the GC passes by putting a marker byte in the one free byte per page (51 5-byte nodes in 256 bytes). When flipping a node's GC state, set the bit corresponding to which of 4 states it is (3 GC colors or free).

Then the time-sensitive mark/sweep passes can skip pages with no nodes to process.