Large-array index-based intrusive linked lists are underrated for fully dynamic gameplay.
Every operation is O(1), no memory allocation anywhere, serialization of the whole tree-like data structure is a single memcpy.
For performance, simply work on the large array in bulk.
Stefan Reinalter
npub1hn…zkukn
2026-04-08 07:07:18 UTC
Author Public Key
npub1hnjfkpfu8a8kfcl6rx4s23xxguxekqrn4hrkt0p87mzauqjwky7suzkuknSeen on
wss://relay.ditto.pubPublished at
2026-04-08 07:07:18 UTCEvent JSON
{
"id": "cc62468335702eabfad9d7a555bbc29d16c686d3892d1f5b2fe26569d6437cad",
"pubkey": "bce49b053c3f4f64e3fa19ab0544c6470d9b0073adc765bc27f6c5de024eb13d",
"created_at": 1775632038,
"kind": 1,
"tags": [
[
"proxy",
"https://mastodon.gamedev.place/users/molecularmusing/statuses/116367821289583708",
"activitypub"
],
[
"client",
"Mostr",
"31990:6be38f8c63df7dbf84db7ec4a6e6fbbd8d19dca3b980efad18585c46f04b26f9:mostr",
"wss://relay.ditto.pub"
]
],
"content": "Large-array index-based intrusive linked lists are underrated for fully dynamic gameplay.\n\nEvery operation is O(1), no memory allocation anywhere, serialization of the whole tree-like data structure is a single memcpy.\n\nFor performance, simply work on the large array in bulk.",
"sig": "e0f4479c516086334850fafee6d795957bbfc760d524d3c5db843428761fa7338686b43295b255818f99379fbdb773078c849e820f3c435a1a9ee1f5276ec61d"
}