Event JSON
{
"id": "df87696c38912b53202f05de03f1b39017a4ebcd6bc4f1358150a3115526661c",
"pubkey": "3780bcc13e64f029539c8c15d98b47bb011fafd3d614ba971b53caf954946e52",
"created_at": 1749292027,
"kind": 1,
"tags": [
[
"imeta",
"url https://static.piaille.fr/media_attachments/files/114/641/599/592/522/915/original/6c4232b98cc77b12.mp4",
"m video/mp4"
],
[
"proxy",
"https://piaille.fr/@colin_mcmillen/114641602312880438",
"web"
],
[
"proxy",
"https://piaille.fr/users/colin_mcmillen/statuses/114641602312880438",
"activitypub"
],
[
"L",
"pink.momostr"
],
[
"l",
"pink.momostr.activitypub:https://piaille.fr/users/colin_mcmillen/statuses/114641602312880438",
"pink.momostr"
],
[
"-"
]
],
"content": "My adventures in 6502-land: I discovered that drawing lines is a pain in the ass. The reference algorithm is Bresenham's (https://en.wikipedia.org/wiki/Bresenham%27s_line_algorithm), which is really smart and good, but requires to check which point is at the right/the top of the other one to know where to start from, then which kind of slope the line has (to know whether to iterate on X or Y), and even if it involves no division, it involves a lot of additions/substractions/absolutes and branches. \nAnother, albeit much slower, possibility is to find the middle point (which just requires two additions and two right shifts, no 16-bit arithmetic involved), plot it, then recurse on both sides.\nhttps://static.piaille.fr/media_attachments/files/114/641/599/592/522/915/original/6c4232b98cc77b12.mp4\n",
"sig": "b4e5ff3e49b030a702c8d08820c8ff2dfa3c8fb9d129ffe80e1ea3ff0622b433ec3908168a88b0a9d61c955d4ed8c08cbd2386f1a0c5ec49483d93964705eaab"
}